/xonstatdb/
/xonotic.org
/wiki
+/.tmp/
+
.idea/
/result*
-DPSRC = source/darkplaces
-D0SRC = source/d0_blind_id
-CLIENT = xonotic-local-sdl
-SERVER = xonotic-local-dedicated
-
-# CC and MAKEFLAGS are always set so ?= has no effect, therefore
-# we use CFLAGS to set default optimisations which users may override
-CFLAGS ?= -pipe -march=native -mtune=native -flto=auto
-# user can override this with make -j
-MAKEFLAGS := -j$(shell nproc)
-# DP makefile overrides CFLAGS (exporting CFLAGS does work for d0_blind_id but so does this)
-export CC += $(CFLAGS)
-
-# d0_blind_id header location
-export CC += -I$(PWD)/source/
-# d0_blind_id static libs location
-export CC += -L$(PWD)/$(D0SRC)/.libs/
-# Player IDs: DP_LINK_CRYPTO needs to be set (else it defaults to "dlopen"),
-# it should be set to "shared" but then LIB_CRYPTO gets overridden in DP makefile,
-# and we need to set LIB_CRYPTO such that libgmp gets linked
-export DP_LINK_CRYPTO=foo
-export CFLAGS_CRYPTO=-DLINK_TO_CRYPTO
-export LIB_CRYPTO=-ld0_blind_id -lgmp
-# AES
-export DP_LINK_CRYPTO_RIJNDAEL=shared
-
-
-.PHONY: help
+# CMAKE generated file: DO NOT EDIT!
+# Generated by "Unix Makefiles" Generator, CMake Version 3.27
+
+# Default target executed when no arguments are given to make.
+default_target: all
+.PHONY : default_target
+
+# Allow only one "make -f Makefile2" at a time, but pass parallelism.
+.NOTPARALLEL:
+
+#=============================================================================
+# Special targets provided by cmake.
+
+# Disable implicit rules so canonical targets will work.
+.SUFFIXES:
+
+# Disable VCS-based implicit rules.
+% : %,v
+
+# Disable VCS-based implicit rules.
+% : RCS/%
+
+# Disable VCS-based implicit rules.
+% : RCS/%,v
+
+# Disable VCS-based implicit rules.
+% : SCCS/s.%
+
+# Disable VCS-based implicit rules.
+% : s.%
+
+.SUFFIXES: .hpux_make_needs_suffix_list
+
+# Command-line flag to silence nested $(MAKE).
+$(VERBOSE)MAKESILENT = -s
+
+#Suppress display of executed commands.
+$(VERBOSE).SILENT:
+
+# A target that is always out of date.
+cmake_force:
+.PHONY : cmake_force
+
+#=============================================================================
+# Set environment variables for the build.
+
+# The shell in which to execute make rules.
+SHELL = /bin/sh
+
+# The CMake executable.
+CMAKE_COMMAND = /home/linuxbrew/.linuxbrew/Cellar/cmake/3.27.5/bin/cmake
+
+# The command to remove a file.
+RM = /home/linuxbrew/.linuxbrew/Cellar/cmake/3.27.5/bin/cmake -E rm -f
+
+# Escaping for special characters.
+EQUALS = =
+
+# The top-level source directory on which CMake was run.
+CMAKE_SOURCE_DIR = /workspace/xonotic
+
+# The top-level build directory on which CMake was run.
+CMAKE_BINARY_DIR = /workspace/xonotic
+
+#=============================================================================
+# Targets provided globally by CMake.
+
+# Special rule for the target edit_cache
+edit_cache:
+ @$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --cyan "Running CMake cache editor..."
+ /home/linuxbrew/.linuxbrew/Cellar/cmake/3.27.5/bin/ccmake -S$(CMAKE_SOURCE_DIR) -B$(CMAKE_BINARY_DIR)
+.PHONY : edit_cache
+
+# Special rule for the target edit_cache
+edit_cache/fast: edit_cache
+.PHONY : edit_cache/fast
+
+# Special rule for the target rebuild_cache
+rebuild_cache:
+ @$(CMAKE_COMMAND) -E cmake_echo_color "--switch=$(COLOR)" --cyan "Running CMake to regenerate build system..."
+ /home/linuxbrew/.linuxbrew/Cellar/cmake/3.27.5/bin/cmake --regenerate-during-build -S$(CMAKE_SOURCE_DIR) -B$(CMAKE_BINARY_DIR)
+.PHONY : rebuild_cache
+
+# Special rule for the target rebuild_cache
+rebuild_cache/fast: rebuild_cache
+.PHONY : rebuild_cache/fast
+
+# The main all target
+all: cmake_check_build_system
+ $(CMAKE_COMMAND) -E cmake_progress_start /workspace/xonotic/CMakeFiles /workspace/xonotic//CMakeFiles/progress.marks
+ $(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 all
+ $(CMAKE_COMMAND) -E cmake_progress_start /workspace/xonotic/CMakeFiles 0
+.PHONY : all
+
+# The main clean target
+clean:
+ $(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 clean
+.PHONY : clean
+
+# The main clean target
+clean/fast: clean
+.PHONY : clean/fast
+
+# Prepare targets for installation.
+preinstall: all
+ $(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 preinstall
+.PHONY : preinstall
+
+# Prepare targets for installation.
+preinstall/fast:
+ $(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 preinstall
+.PHONY : preinstall/fast
+
+# clear depends
+depend:
+ $(CMAKE_COMMAND) -S$(CMAKE_SOURCE_DIR) -B$(CMAKE_BINARY_DIR) --check-build-system CMakeFiles/Makefile.cmake 1
+.PHONY : depend
+
+#=============================================================================
+# Target rules for targets named update-maps
+
+# Build rule for target.
+update-maps: cmake_check_build_system
+ $(MAKE) $(MAKESILENT) -f CMakeFiles/Makefile2 update-maps
+.PHONY : update-maps
+
+# fast build rule for target.
+update-maps/fast:
+ $(MAKE) $(MAKESILENT) -f CMakeFiles/update-maps.dir/build.make CMakeFiles/update-maps.dir/build
+.PHONY : update-maps/fast
+
+# Help Target
help:
- @echo
- @printf " \e[1;33m===== Xonotic Makefile for stable and beta releases =====\e[m\n"
- @echo
- @printf "The DarkPlaces Engine builds will be named \e[1m$(CLIENT) \e[mand \e[1m$(SERVER)\e[m\n"
- @printf "and will be preferred by \e[1mxonotic-linux-sdl.sh \e[mand \e[1mxonotic-linux-dedicated.sh \e[mscripts.\n"
- @echo
- @printf "More info is available at \e[1;36mhttps://gitlab.com/xonotic/xonotic/-/wikis/Compiling\e[m\n"
- @echo
- @echo "-O3 is already enabled for DarkPlaces Engine. Do not add any math flags!"
- @echo
- @echo "MAKEFLAGS=$(MAKEFLAGS)"
- @echo "CFLAGS= $(CFLAGS)"
- @echo
- @echo " make clean-sources Delete build objects"
- @echo " make clean Delete engine builds and build objects"
- @echo
- @echo " make update-stable Update to the latest stable release via rsync"
- @echo " make update-beta Update to the latest daily autobuild via rsync"
- @echo
- @printf " make server Compile \e[1m$(SERVER)\e[m\n"
- @printf " make client Compile \e[1m$(CLIENT)\e[m\n"
- @echo " make both"
- @echo
-
-GIT := $(shell [ -d .git ] && printf "\e[1;31mThis Makefile only supports stable releases and autobuilds, whereas you are using a git repository. To compile from git, please read https://gitlab.com/xonotic/xonotic/-/wikis/Repository_Access\e[m")
-ifdef GIT
- $(error $(GIT))
-endif
-
-.EXTRA_PREREQS := $(findstring update-stable,$(MAKECMDGOALS)) $(findstring update-beta,$(MAKECMDGOALS))
-
-.PHONY: clean-sources
-clean-sources:
- $(MAKE) -C $(DPSRC) clean
- $(MAKE) -C $(D0SRC) clean
-
-.PHONY: clean
-clean: clean-sources
- $(RM) $(CLIENT) $(SERVER)
-
-.PHONY: update-stable
-update-stable:
- misc/tools/rsync-updater/update-to-release.sh
-
-.PHONY: update-beta
-update-beta:
- misc/tools/rsync-updater/update-to-autobuild.sh
-
-$(D0SRC)/Makefile:
- ( cd $(D0SRC) && ./autogen.sh && ./configure --enable-static --disable-shared )
-
-.PHONY: d0_blind_id
-d0_blind_id: $(D0SRC)/Makefile
- $(MAKE) -C $(D0SRC)
-
-.PHONY: server
-server: d0_blind_id
- $(MAKE) -C $(DPSRC) sv-release
- cp -v $(DPSRC)/darkplaces-dedicated $(SERVER)
-
-.PHONY: client
-client: d0_blind_id
- $(MAKE) -C $(DPSRC) sdl-release
- cp -v $(DPSRC)/darkplaces-sdl $(CLIENT)
-
-.PHONY: both
-both: client server
+ @echo "The following are some of the valid targets for this Makefile:"
+ @echo "... all (the default if no target is provided)"
+ @echo "... clean"
+ @echo "... depend"
+ @echo "... edit_cache"
+ @echo "... rebuild_cache"
+ @echo "... update-maps"
+.PHONY : help
+
+
+
+#=============================================================================
+# Special targets to cleanup operation of make.
+
+# Special rule to run CMake to check the build system integrity.
+# No rule that depends on this can have commands that come from listfiles
+# because they might be regenerated.
+cmake_check_build_system:
+ $(CMAKE_COMMAND) -S$(CMAKE_SOURCE_DIR) -B$(CMAKE_BINARY_DIR) --check-build-system CMakeFiles/Makefile.cmake 0
+.PHONY : cmake_check_build_system
--- /dev/null
+/*
+ * FILE: d0.h
+ * AUTHOR: Rudolf Polzer - divVerent@xonotic.org
+ *
+ * Copyright (c) 2010, Rudolf Polzer
+ * 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 copyright holder nor the names of contributors
+ * may be used to endorse or promote products derived from this software
+ * without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTOR(S) ``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 OR CONTRIBUTOR(S) 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.
+ *
+ * $Format:commit %H$
+ * $Id: 6c55afeb50f24bd316079ae46582e65f8020b19b $
+ */
+
+#ifndef __D0_H__
+#define __D0_H__
+
+#include <unistd.h> // size_t
+
+#define D0_EXPORT __attribute__((__visibility__("default")))
+#define D0_USED __attribute__((used))
+#define D0_WARN_UNUSED_RESULT __attribute__((warn_unused_result))
+#define D0_BOOL int
+
+typedef void *(d0_malloc_t)(size_t len);
+typedef void (d0_free_t)(void *p);
+typedef void *(d0_createmutex_t)(void);
+typedef void (d0_destroymutex_t)(void *);
+typedef int (d0_lockmutex_t)(void *); // zero on success
+typedef int (d0_unlockmutex_t)(void *); // zero on success
+
+extern d0_malloc_t *d0_malloc;
+extern d0_free_t *d0_free;
+extern d0_createmutex_t *d0_createmutex;
+extern d0_destroymutex_t *d0_destroymutex;
+extern d0_lockmutex_t *d0_lockmutex;
+extern d0_unlockmutex_t *d0_unlockmutex;
+
+void d0_setmallocfuncs(d0_malloc_t *m, d0_free_t *f);
+void d0_setmutexfuncs(d0_createmutex_t *c, d0_destroymutex_t *d, d0_lockmutex_t *l, d0_unlockmutex_t *u);
+void d0_initfuncs(void); // initializes them, this needs to be only called internally once
+
+extern const char *d0_bsd_license_notice;
+
+#endif
--- /dev/null
+/*
+ * FILE: d0_blind_id.h
+ * AUTHOR: Rudolf Polzer - divVerent@xonotic.org
+ *
+ * Copyright (c) 2010, Rudolf Polzer
+ * 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 copyright holder nor the names of contributors
+ * may be used to endorse or promote products derived from this software
+ * without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTOR(S) ``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 OR CONTRIBUTOR(S) 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.
+ *
+ * $Format:commit %H$
+ * $Id: bf838f43093aceadcd2d20071684f1e7148a4332 $
+ */
+
+#ifndef __D0_BLIND_ID_H__
+#define __D0_BLIND_ID_H__
+
+#include "d0.h"
+
+typedef struct d0_blind_id_s d0_blind_id_t;
+typedef D0_BOOL (*d0_fastreject_function) (const d0_blind_id_t *ctx, void *pass);
+
+D0_EXPORT D0_WARN_UNUSED_RESULT d0_blind_id_t *d0_blind_id_new(void);
+D0_EXPORT void d0_blind_id_free(d0_blind_id_t *a);
+D0_EXPORT void d0_blind_id_clear(d0_blind_id_t *ctx);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_copy(d0_blind_id_t *ctx, const d0_blind_id_t *src);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_generate_private_key(d0_blind_id_t *ctx, int k);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_generate_private_key_fastreject(d0_blind_id_t *ctx, int k, d0_fastreject_function reject, void *pass);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_read_private_key(d0_blind_id_t *ctx, const char *inbuf, size_t inbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_read_public_key(d0_blind_id_t *ctx, const char *inbuf, size_t inbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_write_private_key(const d0_blind_id_t *ctx, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_write_public_key(const d0_blind_id_t *ctx, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_fingerprint64_public_key(const d0_blind_id_t *ctx, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_generate_private_id_modulus(d0_blind_id_t *ctx);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_read_private_id_modulus(d0_blind_id_t *ctx, const char *inbuf, size_t inbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_write_private_id_modulus(const d0_blind_id_t *ctx, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_generate_private_id_start(d0_blind_id_t *ctx);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_generate_private_id_request(d0_blind_id_t *ctx, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_answer_private_id_request(const d0_blind_id_t *ctx, const char *inbuf, size_t inbuflen, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_finish_private_id_request(d0_blind_id_t *ctx, const char *inbuf, size_t inbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_read_private_id_request_camouflage(d0_blind_id_t *ctx, const char *inbuf, size_t inbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_write_private_id_request_camouflage(const d0_blind_id_t *ctx, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_read_private_id(d0_blind_id_t *ctx, const char *inbuf, size_t inbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_read_public_id(d0_blind_id_t *ctx, const char *inbuf, size_t inbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_write_private_id(const d0_blind_id_t *ctx, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_write_public_id(const d0_blind_id_t *ctx, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_authenticate_with_private_id_start(d0_blind_id_t *ctx, D0_BOOL is_first, D0_BOOL send_modulus, const char *message, size_t msglen, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_authenticate_with_private_id_challenge(d0_blind_id_t *ctx, D0_BOOL is_first, D0_BOOL recv_modulus, const char *inbuf, size_t inbuflen, char *outbuf, size_t *outbuflen, D0_BOOL *status);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_authenticate_with_private_id_response(d0_blind_id_t *ctx, const char *inbuf, size_t inbuflen, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_authenticate_with_private_id_verify(d0_blind_id_t *ctx, const char *inbuf, size_t inbuflen, char *msg, size_t *msglen, D0_BOOL *status);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_authenticate_with_private_id_generate_missing_signature(d0_blind_id_t *ctx);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_sign_with_private_id_sign(d0_blind_id_t *ctx, D0_BOOL is_first, D0_BOOL send_modulus, const char *message, size_t msglen, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_sign_with_private_id_sign_detached(d0_blind_id_t *ctx, D0_BOOL is_first, D0_BOOL send_modulus, const char *message, size_t msglen, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_sign_with_private_id_verify(d0_blind_id_t *ctx, D0_BOOL is_first, D0_BOOL recv_modulus, const char *inbuf, size_t inbuflen, char *msg, size_t *msglen, D0_BOOL *status);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_sign_with_private_id_verify_detached(d0_blind_id_t *ctx, D0_BOOL is_first, D0_BOOL recv_modulus, const char *inbuf, size_t inbuflen, const char *msg, size_t msglen, D0_BOOL *status);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_fingerprint64_public_id(const d0_blind_id_t *ctx, char *outbuf, size_t *outbuflen);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_verify_public_id(const d0_blind_id_t *ctx, D0_BOOL *status);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_verify_private_id(const d0_blind_id_t *ctx);
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_sessionkey_public_id(const d0_blind_id_t *ctx, char *outbuf, size_t *outbuflen); // can only be done after successful key exchange, this performs a modpow; key length is limited by SHA_DIGESTSIZE for now; also ONLY valid after successful d0_blind_id_authenticate_with_private_id_verify/d0_blind_id_fingerprint64_public_id
+
+D0_EXPORT D0_WARN_UNUSED_RESULT D0_BOOL d0_blind_id_INITIALIZE(void);
+D0_EXPORT void d0_blind_id_SHUTDOWN(void);
+
+D0_EXPORT void d0_blind_id_util_sha256(char *out, const char *in, size_t n);
+
+// for exporting
+D0_EXPORT void d0_blind_id_setmallocfuncs(d0_malloc_t *m, d0_free_t *f);
+D0_EXPORT void d0_blind_id_setmutexfuncs(d0_createmutex_t *c, d0_destroymutex_t *d, d0_lockmutex_t *l, d0_unlockmutex_t *u);
+
+#endif
--- /dev/null
+// from http://www.efgh.com/software/rijndael.htm (public domain)
+
+#ifndef H__RIJNDAEL
+#define H__RIJNDAEL
+
+#include "d0.h"
+
+D0_EXPORT int d0_rijndael_setup_encrypt(unsigned long *rk, const unsigned char *key,
+ int keybits);
+D0_EXPORT int d0_rijndael_setup_decrypt(unsigned long *rk, const unsigned char *key,
+ int keybits);
+D0_EXPORT void d0_rijndael_encrypt(const unsigned long *rk, int nrounds,
+ const unsigned char plaintext[16], unsigned char ciphertext[16]);
+D0_EXPORT void d0_rijndael_decrypt(const unsigned long *rk, int nrounds,
+ const unsigned char ciphertext[16], unsigned char plaintext[16]);
+
+#define D0_RIJNDAEL_KEYLENGTH(keybits) ((keybits)/8)
+#define D0_RIJNDAEL_RKLENGTH(keybits) ((keybits)/8+28)
+#define D0_RIJNDAEL_NROUNDS(keybits) ((keybits)/32+6)
+
+#endif
--- /dev/null
+# libd0_blind_id.la - a libtool library file
+# Generated by libtool (GNU libtool) 2.4.6 Debian-2.4.6-15build2
+#
+# Please DO NOT delete this file!
+# It is necessary for linking the library.
+
+# The name that we can dlopen(3).
+dlname='libd0_blind_id.so.0'
+
+# Names of this library.
+library_names='libd0_blind_id.so.0.7.1 libd0_blind_id.so.0 libd0_blind_id.so'
+
+# The name of the static archive.
+old_library='libd0_blind_id.a'
+
+# Linker flags that cannot go in dependency_libs.
+inherited_linker_flags=''
+
+# Libraries that this one depends upon.
+dependency_libs=''
+
+# Names of additional weak libraries provided by this library
+weak_library_names=''
+
+# Version information for libd0_blind_id.
+current=7
+age=7
+revision=1
+
+# Is this an already installed library?
+installed=yes
+
+# Should we warn about portability when linking against -modules?
+shouldnotlink=no
+
+# Files to dlopen/dlpreopen
+dlopen=''
+dlpreopen=''
+
+# Directory that this library needs to be installed in:
+libdir='/usr/local/lib'
--- /dev/null
+libd0_blind_id.so.0.7.1
\ No newline at end of file
--- /dev/null
+libd0_blind_id.so.0.7.1
\ No newline at end of file
--- /dev/null
+# libd0_rijndael.la - a libtool library file
+# Generated by libtool (GNU libtool) 2.4.6 Debian-2.4.6-15build2
+#
+# Please DO NOT delete this file!
+# It is necessary for linking the library.
+
+# The name that we can dlopen(3).
+dlname='libd0_rijndael.so.0'
+
+# Names of this library.
+library_names='libd0_rijndael.so.0.0.0 libd0_rijndael.so.0 libd0_rijndael.so'
+
+# The name of the static archive.
+old_library='libd0_rijndael.a'
+
+# Linker flags that cannot go in dependency_libs.
+inherited_linker_flags=''
+
+# Libraries that this one depends upon.
+dependency_libs=''
+
+# Names of additional weak libraries provided by this library
+weak_library_names=''
+
+# Version information for libd0_rijndael.
+current=0
+age=0
+revision=0
+
+# Is this an already installed library?
+installed=yes
+
+# Should we warn about portability when linking against -modules?
+shouldnotlink=no
+
+# Files to dlopen/dlpreopen
+dlopen=''
+dlpreopen=''
+
+# Directory that this library needs to be installed in:
+libdir='/usr/local/lib'
--- /dev/null
+libd0_rijndael.so.0.0.0
\ No newline at end of file
--- /dev/null
+libd0_rijndael.so.0.0.0
\ No newline at end of file
--- /dev/null
+prefix=/usr/local
+exec_prefix=${prefix}
+libdir=${exec_prefix}/lib
+includedir=${prefix}/include
+
+Name: Blind-ID
+Description: Library for user identification using RSA blind signatures
+Requires:
+Version: 0.5
+Libs: -L${libdir} -ld0_blind_id
+Cflags: -I${includedir}/d0_blind_id
--- /dev/null
+prefix=/usr/local
+exec_prefix=${prefix}
+libdir=${exec_prefix}/lib
+includedir=${prefix}/include
+
+Name: Rijndael
+Description: Library for Rijndael encryption
+Requires:
+Version: 0.5
+Libs: -L${libdir} -ld0_rijndael
+Cflags: -I${includedir}/d0_blind_id
--- /dev/null
+/* Definitions for GNU multiple precision functions. -*- mode: c -*-
+
+Copyright 1991, 1993-1997, 1999-2016, 2020, 2021 Free Software
+Foundation, Inc.
+
+This file is part of the GNU MP Library.
+
+The GNU MP Library is free software; you can redistribute it and/or modify
+it under the terms of either:
+
+ * the GNU Lesser General Public License as published by the Free
+ Software Foundation; either version 3 of the License, or (at your
+ option) any later version.
+
+or
+
+ * the GNU General Public License as published by the Free Software
+ Foundation; either version 2 of the License, or (at your option) any
+ later version.
+
+or both in parallel, as here.
+
+The GNU MP Library is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+for more details.
+
+You should have received copies of the GNU General Public License and the
+GNU Lesser General Public License along with the GNU MP Library. If not,
+see https://www.gnu.org/licenses/. */
+
+#ifndef __GMP_H__
+
+#if defined (__cplusplus)
+#include <iosfwd> /* for std::istream, std::ostream, std::string */
+#include <cstdio>
+#endif
+
+
+/* Instantiated by configure. */
+#if ! defined (__GMP_WITHIN_CONFIGURE)
+#define __GMP_HAVE_HOST_CPU_FAMILY_power 0
+#define __GMP_HAVE_HOST_CPU_FAMILY_powerpc 0
+#define GMP_LIMB_BITS 32
+#define GMP_NAIL_BITS 0
+#endif
+#define GMP_NUMB_BITS (GMP_LIMB_BITS - GMP_NAIL_BITS)
+#define GMP_NUMB_MASK ((~ __GMP_CAST (mp_limb_t, 0)) >> GMP_NAIL_BITS)
+#define GMP_NUMB_MAX GMP_NUMB_MASK
+#define GMP_NAIL_MASK (~ GMP_NUMB_MASK)
+
+
+#ifndef __GNU_MP__
+#define __GNU_MP__ 6
+
+#include <stddef.h> /* for size_t */
+#include <limits.h>
+
+/* Instantiated by configure. */
+#if ! defined (__GMP_WITHIN_CONFIGURE)
+/* #undef _LONG_LONG_LIMB */
+#define __GMP_LIBGMP_DLL 0
+#endif
+
+
+/* __GMP_DECLSPEC supports Windows DLL versions of libgmp, and is empty in
+ all other circumstances.
+
+ When compiling objects for libgmp, __GMP_DECLSPEC is an export directive,
+ or when compiling for an application it's an import directive. The two
+ cases are differentiated by __GMP_WITHIN_GMP defined by the GMP Makefiles
+ (and not defined from an application).
+
+ __GMP_DECLSPEC_XX is similarly used for libgmpxx. __GMP_WITHIN_GMPXX
+ indicates when building libgmpxx, and in that case libgmpxx functions are
+ exports, but libgmp functions which might get called are imports.
+
+ Libtool DLL_EXPORT define is not used.
+
+ There's no attempt to support GMP built both static and DLL. Doing so
+ would mean applications would have to tell us which of the two is going
+ to be used when linking, and that seems very tedious and error prone if
+ using GMP by hand, and equally tedious from a package since autoconf and
+ automake don't give much help.
+
+ __GMP_DECLSPEC is required on all documented global functions and
+ variables, the various internals in gmp-impl.h etc can be left unadorned.
+ But internals used by the test programs or speed measuring programs
+ should have __GMP_DECLSPEC, and certainly constants or variables must
+ have it or the wrong address will be resolved.
+
+ In gcc __declspec can go at either the start or end of a prototype.
+
+ In Microsoft C __declspec must go at the start, or after the type like
+ void __declspec(...) *foo()". There's no __dllexport or anything to
+ guard against someone foolish #defining dllexport. _export used to be
+ available, but no longer.
+
+ In Borland C _export still exists, but needs to go after the type, like
+ "void _export foo();". Would have to change the __GMP_DECLSPEC syntax to
+ make use of that. Probably more trouble than it's worth. */
+
+#if defined (__GNUC__)
+#define __GMP_DECLSPEC_EXPORT __declspec(__dllexport__)
+#define __GMP_DECLSPEC_IMPORT __declspec(__dllimport__)
+#endif
+#if defined (_MSC_VER) || defined (__BORLANDC__)
+#define __GMP_DECLSPEC_EXPORT __declspec(dllexport)
+#define __GMP_DECLSPEC_IMPORT __declspec(dllimport)
+#endif
+#ifdef __WATCOMC__
+#define __GMP_DECLSPEC_EXPORT __export
+#define __GMP_DECLSPEC_IMPORT __import
+#endif
+#ifdef __IBMC__
+#define __GMP_DECLSPEC_EXPORT _Export
+#define __GMP_DECLSPEC_IMPORT _Import
+#endif
+
+#if __GMP_LIBGMP_DLL
+#ifdef __GMP_WITHIN_GMP
+/* compiling to go into a DLL libgmp */
+#define __GMP_DECLSPEC __GMP_DECLSPEC_EXPORT
+#else
+/* compiling to go into an application which will link to a DLL libgmp */
+#define __GMP_DECLSPEC __GMP_DECLSPEC_IMPORT
+#endif
+#else
+/* all other cases */
+#define __GMP_DECLSPEC
+#endif
+
+
+#ifdef __GMP_SHORT_LIMB
+typedef unsigned int mp_limb_t;
+typedef int mp_limb_signed_t;
+#else
+#ifdef _LONG_LONG_LIMB
+typedef unsigned long long int mp_limb_t;
+typedef long long int mp_limb_signed_t;
+#else
+typedef unsigned long int mp_limb_t;
+typedef long int mp_limb_signed_t;
+#endif
+#endif
+typedef unsigned long int mp_bitcnt_t;
+
+/* For reference, note that the name __mpz_struct gets into C++ mangled
+ function names, which means although the "__" suggests an internal, we
+ must leave this name for binary compatibility. */
+typedef struct
+{
+ int _mp_alloc; /* Number of *limbs* allocated and pointed
+ to by the _mp_d field. */
+ int _mp_size; /* abs(_mp_size) is the number of limbs the
+ last field points to. If _mp_size is
+ negative this is a negative number. */
+ mp_limb_t *_mp_d; /* Pointer to the limbs. */
+} __mpz_struct;
+
+#endif /* __GNU_MP__ */
+
+
+typedef __mpz_struct MP_INT; /* gmp 1 source compatibility */
+typedef __mpz_struct mpz_t[1];
+
+typedef mp_limb_t * mp_ptr;
+typedef const mp_limb_t * mp_srcptr;
+#if defined (_CRAY) && ! defined (_CRAYMPP)
+/* plain `int' is much faster (48 bits) */
+#define __GMP_MP_SIZE_T_INT 1
+typedef int mp_size_t;
+typedef int mp_exp_t;
+#else
+#define __GMP_MP_SIZE_T_INT 0
+typedef long int mp_size_t;
+typedef long int mp_exp_t;
+#endif
+
+typedef struct
+{
+ __mpz_struct _mp_num;
+ __mpz_struct _mp_den;
+} __mpq_struct;
+
+typedef __mpq_struct MP_RAT; /* gmp 1 source compatibility */
+typedef __mpq_struct mpq_t[1];
+
+typedef struct
+{
+ int _mp_prec; /* Max precision, in number of `mp_limb_t's.
+ Set by mpf_init and modified by
+ mpf_set_prec. The area pointed to by the
+ _mp_d field contains `prec' + 1 limbs. */
+ int _mp_size; /* abs(_mp_size) is the number of limbs the
+ last field points to. If _mp_size is
+ negative this is a negative number. */
+ mp_exp_t _mp_exp; /* Exponent, in the base of `mp_limb_t'. */
+ mp_limb_t *_mp_d; /* Pointer to the limbs. */
+} __mpf_struct;
+
+/* typedef __mpf_struct MP_FLOAT; */
+typedef __mpf_struct mpf_t[1];
+
+/* Available random number generation algorithms. */
+typedef enum
+{
+ GMP_RAND_ALG_DEFAULT = 0,
+ GMP_RAND_ALG_LC = GMP_RAND_ALG_DEFAULT /* Linear congruential. */
+} gmp_randalg_t;
+
+/* Random state struct. */
+typedef struct
+{
+ mpz_t _mp_seed; /* _mp_d member points to state of the generator. */
+ gmp_randalg_t _mp_alg; /* Currently unused. */
+ union {
+ void *_mp_lc; /* Pointer to function pointers structure. */
+ } _mp_algdata;
+} __gmp_randstate_struct;
+typedef __gmp_randstate_struct gmp_randstate_t[1];
+
+/* Types for function declarations in gmp files. */
+/* ??? Should not pollute user name space with these ??? */
+typedef const __mpz_struct *mpz_srcptr;
+typedef __mpz_struct *mpz_ptr;
+typedef const __mpf_struct *mpf_srcptr;
+typedef __mpf_struct *mpf_ptr;
+typedef const __mpq_struct *mpq_srcptr;
+typedef __mpq_struct *mpq_ptr;
+typedef __gmp_randstate_struct *gmp_randstate_ptr;
+typedef const __gmp_randstate_struct *gmp_randstate_srcptr;
+
+
+#if __GMP_LIBGMP_DLL
+#ifdef __GMP_WITHIN_GMPXX
+/* compiling to go into a DLL libgmpxx */
+#define __GMP_DECLSPEC_XX __GMP_DECLSPEC_EXPORT
+#else
+/* compiling to go into a application which will link to a DLL libgmpxx */
+#define __GMP_DECLSPEC_XX __GMP_DECLSPEC_IMPORT
+#endif
+#else
+/* all other cases */
+#define __GMP_DECLSPEC_XX
+#endif
+
+
+#ifndef __MPN
+#define __MPN(x) __gmpn_##x
+#endif
+
+/* For reference, "defined(EOF)" cannot be used here. In g++ 2.95.4,
+ <iostream> defines EOF but not FILE. */
+#if defined (FILE) \
+ || defined (H_STDIO) \
+ || defined (_H_STDIO) /* AIX */ \
+ || defined (_STDIO_H) /* glibc, Sun, SCO */ \
+ || defined (_STDIO_H_) /* BSD, OSF */ \
+ || defined (__STDIO_H) /* Borland */ \
+ || defined (__STDIO_H__) /* IRIX */ \
+ || defined (_STDIO_INCLUDED) /* HPUX */ \
+ || defined (__dj_include_stdio_h_) /* DJGPP */ \
+ || defined (_FILE_DEFINED) /* Microsoft */ \
+ || defined (__STDIO__) /* Apple MPW MrC */ \
+ || defined (_MSL_STDIO_H) /* Metrowerks */ \
+ || defined (_STDIO_H_INCLUDED) /* QNX4 */ \
+ || defined (_ISO_STDIO_ISO_H) /* Sun C++ */ \
+ || defined (__STDIO_LOADED) /* VMS */ \
+ || defined (_STDIO) /* HPE NonStop */ \
+ || defined (__DEFINED_FILE) /* musl */
+#define _GMP_H_HAVE_FILE 1
+#endif
+
+/* In ISO C, if a prototype involving "struct obstack *" is given without
+ that structure defined, then the struct is scoped down to just the
+ prototype, causing a conflict if it's subsequently defined for real. So
+ only give prototypes if we've got obstack.h. */
+#if defined (_OBSTACK_H) /* glibc <obstack.h> */
+#define _GMP_H_HAVE_OBSTACK 1
+#endif
+
+/* The prototypes for gmp_vprintf etc are provided only if va_list is defined,
+ via an application having included <stdarg.h>. Usually va_list is a typedef
+ so can't be tested directly, but C99 specifies that va_start is a macro.
+
+ <stdio.h> will define some sort of va_list for vprintf and vfprintf, but
+ let's not bother trying to use that since it's not standard and since
+ application uses for gmp_vprintf etc will almost certainly require the
+ whole <stdarg.h> anyway. */
+
+#ifdef va_start
+#define _GMP_H_HAVE_VA_LIST 1
+#endif
+
+/* Test for gcc >= maj.min, as per __GNUC_PREREQ in glibc */
+#if defined (__GNUC__) && defined (__GNUC_MINOR__)
+#define __GMP_GNUC_PREREQ(maj, min) \
+ ((__GNUC__ << 16) + __GNUC_MINOR__ >= ((maj) << 16) + (min))
+#else
+#define __GMP_GNUC_PREREQ(maj, min) 0
+#endif
+
+/* "pure" is in gcc 2.96 and up, see "(gcc)Function Attributes". Basically
+ it means a function does nothing but examine its arguments and memory
+ (global or via arguments) to generate a return value, but changes nothing
+ and has no side-effects. __GMP_NO_ATTRIBUTE_CONST_PURE lets
+ tune/common.c etc turn this off when trying to write timing loops. */
+#if __GMP_GNUC_PREREQ (2,96) && ! defined (__GMP_NO_ATTRIBUTE_CONST_PURE)
+#define __GMP_ATTRIBUTE_PURE __attribute__ ((__pure__))
+#else
+#define __GMP_ATTRIBUTE_PURE
+#endif
+
+
+/* __GMP_CAST allows us to use static_cast in C++, so our macros are clean
+ to "g++ -Wold-style-cast".
+
+ Casts in "extern inline" code within an extern "C" block don't induce
+ these warnings, so __GMP_CAST only needs to be used on documented
+ macros. */
+
+#ifdef __cplusplus
+#define __GMP_CAST(type, expr) (static_cast<type> (expr))
+#else
+#define __GMP_CAST(type, expr) ((type) (expr))
+#endif
+
+
+/* An empty "throw ()" means the function doesn't throw any C++ exceptions,
+ this can save some stack frame info in applications.
+
+ Currently it's given only on functions which never divide-by-zero etc,
+ don't allocate memory, and are expected to never need to allocate memory.
+ This leaves open the possibility of a C++ throw from a future GMP
+ exceptions scheme.
+
+ mpz_set_ui etc are omitted to leave open the lazy allocation scheme
+ described in doc/tasks.html. mpz_get_d etc are omitted to leave open
+ exceptions for float overflows.
+
+ Note that __GMP_NOTHROW must be given on any inlines the same as on their
+ prototypes (for g++ at least, where they're used together). Note also
+ that g++ 3.0 demands that __GMP_NOTHROW is before other attributes like
+ __GMP_ATTRIBUTE_PURE. */
+
+#if defined (__cplusplus)
+#if __cplusplus >= 201103L
+#define __GMP_NOTHROW noexcept
+#else
+#define __GMP_NOTHROW throw ()
+#endif
+#else
+#define __GMP_NOTHROW
+#endif
+
+
+/* PORTME: What other compilers have a useful "extern inline"? "static
+ inline" would be an acceptable substitute if the compiler (or linker)
+ discards unused statics. */
+
+ /* gcc has __inline__ in all modes, including strict ansi. Give a prototype
+ for an inline too, so as to correctly specify "dllimport" on windows, in
+ case the function is called rather than inlined.
+ GCC 4.3 and above with -std=c99 or -std=gnu99 implements ISO C99
+ inline semantics, unless -fgnu89-inline is used. */
+#ifdef __GNUC__
+#if (defined __GNUC_STDC_INLINE__) || (__GNUC__ == 4 && __GNUC_MINOR__ == 2) \
+ || (defined __GNUC_GNU_INLINE__ && defined __cplusplus)
+#define __GMP_EXTERN_INLINE extern __inline__ __attribute__ ((__gnu_inline__))
+#else
+#define __GMP_EXTERN_INLINE extern __inline__
+#endif
+#define __GMP_INLINE_PROTOTYPES 1
+#endif
+
+/* DEC C (eg. version 5.9) supports "static __inline foo()", even in -std1
+ strict ANSI mode. Inlining is done even when not optimizing (ie. -O0
+ mode, which is the default), but an unnecessary local copy of foo is
+ emitted unless -O is used. "extern __inline" is accepted, but the
+ "extern" appears to be ignored, ie. it becomes a plain global function
+ but which is inlined within its file. Don't know if all old versions of
+ DEC C supported __inline, but as a start let's do the right thing for
+ current versions. */
+#ifdef __DECC
+#define __GMP_EXTERN_INLINE static __inline
+#endif
+
+/* SCO OpenUNIX 8 cc supports "static inline foo()" but not in -Xc strict
+ ANSI mode (__STDC__ is 1 in that mode). Inlining only actually takes
+ place under -O. Without -O "foo" seems to be emitted whether it's used
+ or not, which is wasteful. "extern inline foo()" isn't useful, the
+ "extern" is apparently ignored, so foo is inlined if possible but also
+ emitted as a global, which causes multiple definition errors when
+ building a shared libgmp. */
+#ifdef __SCO_VERSION__
+#if __SCO_VERSION__ > 400000000 && __STDC__ != 1 \
+ && ! defined (__GMP_EXTERN_INLINE)
+#define __GMP_EXTERN_INLINE static inline
+#endif
+#endif
+
+/* Microsoft's C compiler accepts __inline */
+#ifdef _MSC_VER
+#define __GMP_EXTERN_INLINE __inline
+#endif
+
+/* Recent enough Sun C compilers want "inline" */
+#if defined (__SUNPRO_C) && __SUNPRO_C >= 0x560 \
+ && ! defined (__GMP_EXTERN_INLINE)
+#define __GMP_EXTERN_INLINE inline
+#endif
+
+/* Somewhat older Sun C compilers want "static inline" */
+#if defined (__SUNPRO_C) && __SUNPRO_C >= 0x540 \
+ && ! defined (__GMP_EXTERN_INLINE)
+#define __GMP_EXTERN_INLINE static inline
+#endif
+
+
+/* C++ always has "inline" and since it's a normal feature the linker should
+ discard duplicate non-inlined copies, or if it doesn't then that's a
+ problem for everyone, not just GMP. */
+#if defined (__cplusplus) && ! defined (__GMP_EXTERN_INLINE)
+#define __GMP_EXTERN_INLINE inline
+#endif
+
+/* Don't do any inlining within a configure run, since if the compiler ends
+ up emitting copies of the code into the object file it can end up
+ demanding the various support routines (like mpn_popcount) for linking,
+ making the "alloca" test and perhaps others fail. And on hppa ia64 a
+ pre-release gcc 3.2 was seen not respecting the "extern" in "extern
+ __inline__", triggering this problem too. */
+#if defined (__GMP_WITHIN_CONFIGURE) && ! __GMP_WITHIN_CONFIGURE_INLINE
+#undef __GMP_EXTERN_INLINE
+#endif
+
+/* By default, don't give a prototype when there's going to be an inline
+ version. Note in particular that Cray C++ objects to the combination of
+ prototype and inline. */
+#ifdef __GMP_EXTERN_INLINE
+#ifndef __GMP_INLINE_PROTOTYPES
+#define __GMP_INLINE_PROTOTYPES 0
+#endif
+#else
+#define __GMP_INLINE_PROTOTYPES 1
+#endif
+
+
+#define __GMP_ABS(x) ((x) >= 0 ? (x) : -(x))
+#define __GMP_MAX(h,i) ((h) > (i) ? (h) : (i))
+
+
+/* __builtin_expect is in gcc 3.0, and not in 2.95. */
+#if __GMP_GNUC_PREREQ (3,0)
+#define __GMP_LIKELY(cond) __builtin_expect ((cond) != 0, 1)
+#define __GMP_UNLIKELY(cond) __builtin_expect ((cond) != 0, 0)
+#else
+#define __GMP_LIKELY(cond) (cond)
+#define __GMP_UNLIKELY(cond) (cond)
+#endif
+
+#ifdef _CRAY
+#define __GMP_CRAY_Pragma(str) _Pragma (str)
+#else
+#define __GMP_CRAY_Pragma(str)
+#endif
+
+
+/* Allow direct user access to numerator and denominator of an mpq_t object. */
+#define mpq_numref(Q) (&((Q)->_mp_num))
+#define mpq_denref(Q) (&((Q)->_mp_den))
+
+
+#if defined (__cplusplus)
+extern "C" {
+using std::FILE;
+#endif
+
+#define mp_set_memory_functions __gmp_set_memory_functions
+__GMP_DECLSPEC void mp_set_memory_functions (void *(*) (size_t),
+ void *(*) (void *, size_t, size_t),
+ void (*) (void *, size_t)) __GMP_NOTHROW;
+
+#define mp_get_memory_functions __gmp_get_memory_functions
+__GMP_DECLSPEC void mp_get_memory_functions (void *(**) (size_t),
+ void *(**) (void *, size_t, size_t),
+ void (**) (void *, size_t)) __GMP_NOTHROW;
+
+#define mp_bits_per_limb __gmp_bits_per_limb
+__GMP_DECLSPEC extern const int mp_bits_per_limb;
+
+#define gmp_errno __gmp_errno
+__GMP_DECLSPEC extern int gmp_errno;
+
+#define gmp_version __gmp_version
+__GMP_DECLSPEC extern const char * const gmp_version;
+
+
+/**************** Random number routines. ****************/
+
+/* obsolete */
+#define gmp_randinit __gmp_randinit
+__GMP_DECLSPEC void gmp_randinit (gmp_randstate_ptr, gmp_randalg_t, ...);
+
+#define gmp_randinit_default __gmp_randinit_default
+__GMP_DECLSPEC void gmp_randinit_default (gmp_randstate_ptr);
+
+#define gmp_randinit_lc_2exp __gmp_randinit_lc_2exp
+__GMP_DECLSPEC void gmp_randinit_lc_2exp (gmp_randstate_ptr, mpz_srcptr, unsigned long int, mp_bitcnt_t);
+
+#define gmp_randinit_lc_2exp_size __gmp_randinit_lc_2exp_size
+__GMP_DECLSPEC int gmp_randinit_lc_2exp_size (gmp_randstate_ptr, mp_bitcnt_t);
+
+#define gmp_randinit_mt __gmp_randinit_mt
+__GMP_DECLSPEC void gmp_randinit_mt (gmp_randstate_ptr);
+
+#define gmp_randinit_set __gmp_randinit_set
+__GMP_DECLSPEC void gmp_randinit_set (gmp_randstate_ptr, gmp_randstate_srcptr);
+
+#define gmp_randseed __gmp_randseed
+__GMP_DECLSPEC void gmp_randseed (gmp_randstate_ptr, mpz_srcptr);
+
+#define gmp_randseed_ui __gmp_randseed_ui
+__GMP_DECLSPEC void gmp_randseed_ui (gmp_randstate_ptr, unsigned long int);
+
+#define gmp_randclear __gmp_randclear
+__GMP_DECLSPEC void gmp_randclear (gmp_randstate_ptr);
+
+#define gmp_urandomb_ui __gmp_urandomb_ui
+__GMP_DECLSPEC unsigned long gmp_urandomb_ui (gmp_randstate_ptr, unsigned long);
+
+#define gmp_urandomm_ui __gmp_urandomm_ui
+__GMP_DECLSPEC unsigned long gmp_urandomm_ui (gmp_randstate_ptr, unsigned long);
+
+
+/**************** Formatted output routines. ****************/
+
+#define gmp_asprintf __gmp_asprintf
+__GMP_DECLSPEC int gmp_asprintf (char **, const char *, ...);
+
+#define gmp_fprintf __gmp_fprintf
+#ifdef _GMP_H_HAVE_FILE
+__GMP_DECLSPEC int gmp_fprintf (FILE *, const char *, ...);
+#endif
+
+#define gmp_obstack_printf __gmp_obstack_printf
+#if defined (_GMP_H_HAVE_OBSTACK)
+__GMP_DECLSPEC int gmp_obstack_printf (struct obstack *, const char *, ...);
+#endif
+
+#define gmp_obstack_vprintf __gmp_obstack_vprintf
+#if defined (_GMP_H_HAVE_OBSTACK) && defined (_GMP_H_HAVE_VA_LIST)
+__GMP_DECLSPEC int gmp_obstack_vprintf (struct obstack *, const char *, va_list);
+#endif
+
+#define gmp_printf __gmp_printf
+__GMP_DECLSPEC int gmp_printf (const char *, ...);
+
+#define gmp_snprintf __gmp_snprintf
+__GMP_DECLSPEC int gmp_snprintf (char *, size_t, const char *, ...);
+
+#define gmp_sprintf __gmp_sprintf
+__GMP_DECLSPEC int gmp_sprintf (char *, const char *, ...);
+
+#define gmp_vasprintf __gmp_vasprintf
+#if defined (_GMP_H_HAVE_VA_LIST)
+__GMP_DECLSPEC int gmp_vasprintf (char **, const char *, va_list);
+#endif
+
+#define gmp_vfprintf __gmp_vfprintf
+#if defined (_GMP_H_HAVE_FILE) && defined (_GMP_H_HAVE_VA_LIST)
+__GMP_DECLSPEC int gmp_vfprintf (FILE *, const char *, va_list);
+#endif
+
+#define gmp_vprintf __gmp_vprintf
+#if defined (_GMP_H_HAVE_VA_LIST)
+__GMP_DECLSPEC int gmp_vprintf (const char *, va_list);
+#endif
+
+#define gmp_vsnprintf __gmp_vsnprintf
+#if defined (_GMP_H_HAVE_VA_LIST)
+__GMP_DECLSPEC int gmp_vsnprintf (char *, size_t, const char *, va_list);
+#endif
+
+#define gmp_vsprintf __gmp_vsprintf
+#if defined (_GMP_H_HAVE_VA_LIST)
+__GMP_DECLSPEC int gmp_vsprintf (char *, const char *, va_list);
+#endif
+
+
+/**************** Formatted input routines. ****************/
+
+#define gmp_fscanf __gmp_fscanf
+#ifdef _GMP_H_HAVE_FILE
+__GMP_DECLSPEC int gmp_fscanf (FILE *, const char *, ...);
+#endif
+
+#define gmp_scanf __gmp_scanf
+__GMP_DECLSPEC int gmp_scanf (const char *, ...);
+
+#define gmp_sscanf __gmp_sscanf
+__GMP_DECLSPEC int gmp_sscanf (const char *, const char *, ...);
+
+#define gmp_vfscanf __gmp_vfscanf
+#if defined (_GMP_H_HAVE_FILE) && defined (_GMP_H_HAVE_VA_LIST)
+__GMP_DECLSPEC int gmp_vfscanf (FILE *, const char *, va_list);
+#endif
+
+#define gmp_vscanf __gmp_vscanf
+#if defined (_GMP_H_HAVE_VA_LIST)
+__GMP_DECLSPEC int gmp_vscanf (const char *, va_list);
+#endif
+
+#define gmp_vsscanf __gmp_vsscanf
+#if defined (_GMP_H_HAVE_VA_LIST)
+__GMP_DECLSPEC int gmp_vsscanf (const char *, const char *, va_list);
+#endif
+
+
+/**************** Integer (i.e. Z) routines. ****************/
+
+#define _mpz_realloc __gmpz_realloc
+#define mpz_realloc __gmpz_realloc
+__GMP_DECLSPEC void *_mpz_realloc (mpz_ptr, mp_size_t);
+
+#define mpz_abs __gmpz_abs
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpz_abs)
+__GMP_DECLSPEC void mpz_abs (mpz_ptr, mpz_srcptr);
+#endif
+
+#define mpz_add __gmpz_add
+__GMP_DECLSPEC void mpz_add (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_add_ui __gmpz_add_ui
+__GMP_DECLSPEC void mpz_add_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_addmul __gmpz_addmul
+__GMP_DECLSPEC void mpz_addmul (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_addmul_ui __gmpz_addmul_ui
+__GMP_DECLSPEC void mpz_addmul_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_and __gmpz_and
+__GMP_DECLSPEC void mpz_and (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_array_init __gmpz_array_init
+__GMP_DECLSPEC void mpz_array_init (mpz_ptr, mp_size_t, mp_size_t);
+
+#define mpz_bin_ui __gmpz_bin_ui
+__GMP_DECLSPEC void mpz_bin_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_bin_uiui __gmpz_bin_uiui
+__GMP_DECLSPEC void mpz_bin_uiui (mpz_ptr, unsigned long int, unsigned long int);
+
+#define mpz_cdiv_q __gmpz_cdiv_q
+__GMP_DECLSPEC void mpz_cdiv_q (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_cdiv_q_2exp __gmpz_cdiv_q_2exp
+__GMP_DECLSPEC void mpz_cdiv_q_2exp (mpz_ptr, mpz_srcptr, mp_bitcnt_t);
+
+#define mpz_cdiv_q_ui __gmpz_cdiv_q_ui
+__GMP_DECLSPEC unsigned long int mpz_cdiv_q_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_cdiv_qr __gmpz_cdiv_qr
+__GMP_DECLSPEC void mpz_cdiv_qr (mpz_ptr, mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_cdiv_qr_ui __gmpz_cdiv_qr_ui
+__GMP_DECLSPEC unsigned long int mpz_cdiv_qr_ui (mpz_ptr, mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_cdiv_r __gmpz_cdiv_r
+__GMP_DECLSPEC void mpz_cdiv_r (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_cdiv_r_2exp __gmpz_cdiv_r_2exp
+__GMP_DECLSPEC void mpz_cdiv_r_2exp (mpz_ptr, mpz_srcptr, mp_bitcnt_t);
+
+#define mpz_cdiv_r_ui __gmpz_cdiv_r_ui
+__GMP_DECLSPEC unsigned long int mpz_cdiv_r_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_cdiv_ui __gmpz_cdiv_ui
+__GMP_DECLSPEC unsigned long int mpz_cdiv_ui (mpz_srcptr, unsigned long int) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_clear __gmpz_clear
+__GMP_DECLSPEC void mpz_clear (mpz_ptr);
+
+#define mpz_clears __gmpz_clears
+__GMP_DECLSPEC void mpz_clears (mpz_ptr, ...);
+
+#define mpz_clrbit __gmpz_clrbit
+__GMP_DECLSPEC void mpz_clrbit (mpz_ptr, mp_bitcnt_t);
+
+#define mpz_cmp __gmpz_cmp
+__GMP_DECLSPEC int mpz_cmp (mpz_srcptr, mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_cmp_d __gmpz_cmp_d
+__GMP_DECLSPEC int mpz_cmp_d (mpz_srcptr, double) __GMP_ATTRIBUTE_PURE;
+
+#define _mpz_cmp_si __gmpz_cmp_si
+__GMP_DECLSPEC int _mpz_cmp_si (mpz_srcptr, signed long int) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define _mpz_cmp_ui __gmpz_cmp_ui
+__GMP_DECLSPEC int _mpz_cmp_ui (mpz_srcptr, unsigned long int) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_cmpabs __gmpz_cmpabs
+__GMP_DECLSPEC int mpz_cmpabs (mpz_srcptr, mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_cmpabs_d __gmpz_cmpabs_d
+__GMP_DECLSPEC int mpz_cmpabs_d (mpz_srcptr, double) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_cmpabs_ui __gmpz_cmpabs_ui
+__GMP_DECLSPEC int mpz_cmpabs_ui (mpz_srcptr, unsigned long int) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_com __gmpz_com
+__GMP_DECLSPEC void mpz_com (mpz_ptr, mpz_srcptr);
+
+#define mpz_combit __gmpz_combit
+__GMP_DECLSPEC void mpz_combit (mpz_ptr, mp_bitcnt_t);
+
+#define mpz_congruent_p __gmpz_congruent_p
+__GMP_DECLSPEC int mpz_congruent_p (mpz_srcptr, mpz_srcptr, mpz_srcptr) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_congruent_2exp_p __gmpz_congruent_2exp_p
+__GMP_DECLSPEC int mpz_congruent_2exp_p (mpz_srcptr, mpz_srcptr, mp_bitcnt_t) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_congruent_ui_p __gmpz_congruent_ui_p
+__GMP_DECLSPEC int mpz_congruent_ui_p (mpz_srcptr, unsigned long, unsigned long) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_divexact __gmpz_divexact
+__GMP_DECLSPEC void mpz_divexact (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_divexact_ui __gmpz_divexact_ui
+__GMP_DECLSPEC void mpz_divexact_ui (mpz_ptr, mpz_srcptr, unsigned long);
+
+#define mpz_divisible_p __gmpz_divisible_p
+__GMP_DECLSPEC int mpz_divisible_p (mpz_srcptr, mpz_srcptr) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_divisible_ui_p __gmpz_divisible_ui_p
+__GMP_DECLSPEC int mpz_divisible_ui_p (mpz_srcptr, unsigned long) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_divisible_2exp_p __gmpz_divisible_2exp_p
+__GMP_DECLSPEC int mpz_divisible_2exp_p (mpz_srcptr, mp_bitcnt_t) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_dump __gmpz_dump
+__GMP_DECLSPEC void mpz_dump (mpz_srcptr);
+
+#define mpz_export __gmpz_export
+__GMP_DECLSPEC void *mpz_export (void *, size_t *, int, size_t, int, size_t, mpz_srcptr);
+
+#define mpz_fac_ui __gmpz_fac_ui
+__GMP_DECLSPEC void mpz_fac_ui (mpz_ptr, unsigned long int);
+
+#define mpz_2fac_ui __gmpz_2fac_ui
+__GMP_DECLSPEC void mpz_2fac_ui (mpz_ptr, unsigned long int);
+
+#define mpz_mfac_uiui __gmpz_mfac_uiui
+__GMP_DECLSPEC void mpz_mfac_uiui (mpz_ptr, unsigned long int, unsigned long int);
+
+#define mpz_primorial_ui __gmpz_primorial_ui
+__GMP_DECLSPEC void mpz_primorial_ui (mpz_ptr, unsigned long int);
+
+#define mpz_fdiv_q __gmpz_fdiv_q
+__GMP_DECLSPEC void mpz_fdiv_q (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_fdiv_q_2exp __gmpz_fdiv_q_2exp
+__GMP_DECLSPEC void mpz_fdiv_q_2exp (mpz_ptr, mpz_srcptr, mp_bitcnt_t);
+
+#define mpz_fdiv_q_ui __gmpz_fdiv_q_ui
+__GMP_DECLSPEC unsigned long int mpz_fdiv_q_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_fdiv_qr __gmpz_fdiv_qr
+__GMP_DECLSPEC void mpz_fdiv_qr (mpz_ptr, mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_fdiv_qr_ui __gmpz_fdiv_qr_ui
+__GMP_DECLSPEC unsigned long int mpz_fdiv_qr_ui (mpz_ptr, mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_fdiv_r __gmpz_fdiv_r
+__GMP_DECLSPEC void mpz_fdiv_r (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_fdiv_r_2exp __gmpz_fdiv_r_2exp
+__GMP_DECLSPEC void mpz_fdiv_r_2exp (mpz_ptr, mpz_srcptr, mp_bitcnt_t);
+
+#define mpz_fdiv_r_ui __gmpz_fdiv_r_ui
+__GMP_DECLSPEC unsigned long int mpz_fdiv_r_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_fdiv_ui __gmpz_fdiv_ui
+__GMP_DECLSPEC unsigned long int mpz_fdiv_ui (mpz_srcptr, unsigned long int) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_fib_ui __gmpz_fib_ui
+__GMP_DECLSPEC void mpz_fib_ui (mpz_ptr, unsigned long int);
+
+#define mpz_fib2_ui __gmpz_fib2_ui
+__GMP_DECLSPEC void mpz_fib2_ui (mpz_ptr, mpz_ptr, unsigned long int);
+
+#define mpz_fits_sint_p __gmpz_fits_sint_p
+__GMP_DECLSPEC int mpz_fits_sint_p (mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_fits_slong_p __gmpz_fits_slong_p
+__GMP_DECLSPEC int mpz_fits_slong_p (mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_fits_sshort_p __gmpz_fits_sshort_p
+__GMP_DECLSPEC int mpz_fits_sshort_p (mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_fits_uint_p __gmpz_fits_uint_p
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpz_fits_uint_p)
+__GMP_DECLSPEC int mpz_fits_uint_p (mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+#endif
+
+#define mpz_fits_ulong_p __gmpz_fits_ulong_p
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpz_fits_ulong_p)
+__GMP_DECLSPEC int mpz_fits_ulong_p (mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+#endif
+
+#define mpz_fits_ushort_p __gmpz_fits_ushort_p
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpz_fits_ushort_p)
+__GMP_DECLSPEC int mpz_fits_ushort_p (mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+#endif
+
+#define mpz_gcd __gmpz_gcd
+__GMP_DECLSPEC void mpz_gcd (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_gcd_ui __gmpz_gcd_ui
+__GMP_DECLSPEC unsigned long int mpz_gcd_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_gcdext __gmpz_gcdext
+__GMP_DECLSPEC void mpz_gcdext (mpz_ptr, mpz_ptr, mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_get_d __gmpz_get_d
+__GMP_DECLSPEC double mpz_get_d (mpz_srcptr) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_get_d_2exp __gmpz_get_d_2exp
+__GMP_DECLSPEC double mpz_get_d_2exp (signed long int *, mpz_srcptr);
+
+#define mpz_get_si __gmpz_get_si
+__GMP_DECLSPEC /* signed */ long int mpz_get_si (mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_get_str __gmpz_get_str
+__GMP_DECLSPEC char *mpz_get_str (char *, int, mpz_srcptr);
+
+#define mpz_get_ui __gmpz_get_ui
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpz_get_ui)
+__GMP_DECLSPEC unsigned long int mpz_get_ui (mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+#endif
+
+#define mpz_getlimbn __gmpz_getlimbn
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpz_getlimbn)
+__GMP_DECLSPEC mp_limb_t mpz_getlimbn (mpz_srcptr, mp_size_t) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+#endif
+
+#define mpz_hamdist __gmpz_hamdist
+__GMP_DECLSPEC mp_bitcnt_t mpz_hamdist (mpz_srcptr, mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_import __gmpz_import
+__GMP_DECLSPEC void mpz_import (mpz_ptr, size_t, int, size_t, int, size_t, const void *);
+
+#define mpz_init __gmpz_init
+__GMP_DECLSPEC void mpz_init (mpz_ptr) __GMP_NOTHROW;
+
+#define mpz_init2 __gmpz_init2
+__GMP_DECLSPEC void mpz_init2 (mpz_ptr, mp_bitcnt_t);
+
+#define mpz_inits __gmpz_inits
+__GMP_DECLSPEC void mpz_inits (mpz_ptr, ...) __GMP_NOTHROW;
+
+#define mpz_init_set __gmpz_init_set
+__GMP_DECLSPEC void mpz_init_set (mpz_ptr, mpz_srcptr);
+
+#define mpz_init_set_d __gmpz_init_set_d
+__GMP_DECLSPEC void mpz_init_set_d (mpz_ptr, double);
+
+#define mpz_init_set_si __gmpz_init_set_si
+__GMP_DECLSPEC void mpz_init_set_si (mpz_ptr, signed long int);
+
+#define mpz_init_set_str __gmpz_init_set_str
+__GMP_DECLSPEC int mpz_init_set_str (mpz_ptr, const char *, int);
+
+#define mpz_init_set_ui __gmpz_init_set_ui
+__GMP_DECLSPEC void mpz_init_set_ui (mpz_ptr, unsigned long int);
+
+#define mpz_inp_raw __gmpz_inp_raw
+#ifdef _GMP_H_HAVE_FILE
+__GMP_DECLSPEC size_t mpz_inp_raw (mpz_ptr, FILE *);
+#endif
+
+#define mpz_inp_str __gmpz_inp_str
+#ifdef _GMP_H_HAVE_FILE
+__GMP_DECLSPEC size_t mpz_inp_str (mpz_ptr, FILE *, int);
+#endif
+
+#define mpz_invert __gmpz_invert
+__GMP_DECLSPEC int mpz_invert (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_ior __gmpz_ior
+__GMP_DECLSPEC void mpz_ior (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_jacobi __gmpz_jacobi
+__GMP_DECLSPEC int mpz_jacobi (mpz_srcptr, mpz_srcptr) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_kronecker mpz_jacobi /* alias */
+
+#define mpz_kronecker_si __gmpz_kronecker_si
+__GMP_DECLSPEC int mpz_kronecker_si (mpz_srcptr, long) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_kronecker_ui __gmpz_kronecker_ui
+__GMP_DECLSPEC int mpz_kronecker_ui (mpz_srcptr, unsigned long) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_si_kronecker __gmpz_si_kronecker
+__GMP_DECLSPEC int mpz_si_kronecker (long, mpz_srcptr) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_ui_kronecker __gmpz_ui_kronecker
+__GMP_DECLSPEC int mpz_ui_kronecker (unsigned long, mpz_srcptr) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_lcm __gmpz_lcm
+__GMP_DECLSPEC void mpz_lcm (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_lcm_ui __gmpz_lcm_ui
+__GMP_DECLSPEC void mpz_lcm_ui (mpz_ptr, mpz_srcptr, unsigned long);
+
+#define mpz_legendre mpz_jacobi /* alias */
+
+#define mpz_lucnum_ui __gmpz_lucnum_ui
+__GMP_DECLSPEC void mpz_lucnum_ui (mpz_ptr, unsigned long int);
+
+#define mpz_lucnum2_ui __gmpz_lucnum2_ui
+__GMP_DECLSPEC void mpz_lucnum2_ui (mpz_ptr, mpz_ptr, unsigned long int);
+
+#define mpz_millerrabin __gmpz_millerrabin
+__GMP_DECLSPEC int mpz_millerrabin (mpz_srcptr, int) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_mod __gmpz_mod
+__GMP_DECLSPEC void mpz_mod (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_mod_ui mpz_fdiv_r_ui /* same as fdiv_r because divisor unsigned */
+
+#define mpz_mul __gmpz_mul
+__GMP_DECLSPEC void mpz_mul (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_mul_2exp __gmpz_mul_2exp
+__GMP_DECLSPEC void mpz_mul_2exp (mpz_ptr, mpz_srcptr, mp_bitcnt_t);
+
+#define mpz_mul_si __gmpz_mul_si
+__GMP_DECLSPEC void mpz_mul_si (mpz_ptr, mpz_srcptr, long int);
+
+#define mpz_mul_ui __gmpz_mul_ui
+__GMP_DECLSPEC void mpz_mul_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_neg __gmpz_neg
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpz_neg)
+__GMP_DECLSPEC void mpz_neg (mpz_ptr, mpz_srcptr);
+#endif
+
+#define mpz_nextprime __gmpz_nextprime
+__GMP_DECLSPEC void mpz_nextprime (mpz_ptr, mpz_srcptr);
+
+#define mpz_prevprime __gmpz_prevprime
+__GMP_DECLSPEC int mpz_prevprime (mpz_ptr, mpz_srcptr);
+
+#define mpz_out_raw __gmpz_out_raw
+#ifdef _GMP_H_HAVE_FILE
+__GMP_DECLSPEC size_t mpz_out_raw (FILE *, mpz_srcptr);
+#endif
+
+#define mpz_out_str __gmpz_out_str
+#ifdef _GMP_H_HAVE_FILE
+__GMP_DECLSPEC size_t mpz_out_str (FILE *, int, mpz_srcptr);
+#endif
+
+#define mpz_perfect_power_p __gmpz_perfect_power_p
+__GMP_DECLSPEC int mpz_perfect_power_p (mpz_srcptr) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_perfect_square_p __gmpz_perfect_square_p
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpz_perfect_square_p)
+__GMP_DECLSPEC int mpz_perfect_square_p (mpz_srcptr) __GMP_ATTRIBUTE_PURE;
+#endif
+
+#define mpz_popcount __gmpz_popcount
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpz_popcount)
+__GMP_DECLSPEC mp_bitcnt_t mpz_popcount (mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+#endif
+
+#define mpz_pow_ui __gmpz_pow_ui
+__GMP_DECLSPEC void mpz_pow_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_powm __gmpz_powm
+__GMP_DECLSPEC void mpz_powm (mpz_ptr, mpz_srcptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_powm_sec __gmpz_powm_sec
+__GMP_DECLSPEC void mpz_powm_sec (mpz_ptr, mpz_srcptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_powm_ui __gmpz_powm_ui
+__GMP_DECLSPEC void mpz_powm_ui (mpz_ptr, mpz_srcptr, unsigned long int, mpz_srcptr);
+
+#define mpz_probab_prime_p __gmpz_probab_prime_p
+__GMP_DECLSPEC int mpz_probab_prime_p (mpz_srcptr, int) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_random __gmpz_random
+__GMP_DECLSPEC void mpz_random (mpz_ptr, mp_size_t);
+
+#define mpz_random2 __gmpz_random2
+__GMP_DECLSPEC void mpz_random2 (mpz_ptr, mp_size_t);
+
+#define mpz_realloc2 __gmpz_realloc2
+__GMP_DECLSPEC void mpz_realloc2 (mpz_ptr, mp_bitcnt_t);
+
+#define mpz_remove __gmpz_remove
+__GMP_DECLSPEC mp_bitcnt_t mpz_remove (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_root __gmpz_root
+__GMP_DECLSPEC int mpz_root (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_rootrem __gmpz_rootrem
+__GMP_DECLSPEC void mpz_rootrem (mpz_ptr, mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_rrandomb __gmpz_rrandomb
+__GMP_DECLSPEC void mpz_rrandomb (mpz_ptr, gmp_randstate_ptr, mp_bitcnt_t);
+
+#define mpz_scan0 __gmpz_scan0
+__GMP_DECLSPEC mp_bitcnt_t mpz_scan0 (mpz_srcptr, mp_bitcnt_t) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_scan1 __gmpz_scan1
+__GMP_DECLSPEC mp_bitcnt_t mpz_scan1 (mpz_srcptr, mp_bitcnt_t) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_set __gmpz_set
+__GMP_DECLSPEC void mpz_set (mpz_ptr, mpz_srcptr);
+
+#define mpz_set_d __gmpz_set_d
+__GMP_DECLSPEC void mpz_set_d (mpz_ptr, double);
+
+#define mpz_set_f __gmpz_set_f
+__GMP_DECLSPEC void mpz_set_f (mpz_ptr, mpf_srcptr);
+
+#define mpz_set_q __gmpz_set_q
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpz_set_q)
+__GMP_DECLSPEC void mpz_set_q (mpz_ptr, mpq_srcptr);
+#endif
+
+#define mpz_set_si __gmpz_set_si
+__GMP_DECLSPEC void mpz_set_si (mpz_ptr, signed long int);
+
+#define mpz_set_str __gmpz_set_str
+__GMP_DECLSPEC int mpz_set_str (mpz_ptr, const char *, int);
+
+#define mpz_set_ui __gmpz_set_ui
+__GMP_DECLSPEC void mpz_set_ui (mpz_ptr, unsigned long int);
+
+#define mpz_setbit __gmpz_setbit
+__GMP_DECLSPEC void mpz_setbit (mpz_ptr, mp_bitcnt_t);
+
+#define mpz_size __gmpz_size
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpz_size)
+__GMP_DECLSPEC size_t mpz_size (mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+#endif
+
+#define mpz_sizeinbase __gmpz_sizeinbase
+__GMP_DECLSPEC size_t mpz_sizeinbase (mpz_srcptr, int) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_sqrt __gmpz_sqrt
+__GMP_DECLSPEC void mpz_sqrt (mpz_ptr, mpz_srcptr);
+
+#define mpz_sqrtrem __gmpz_sqrtrem
+__GMP_DECLSPEC void mpz_sqrtrem (mpz_ptr, mpz_ptr, mpz_srcptr);
+
+#define mpz_sub __gmpz_sub
+__GMP_DECLSPEC void mpz_sub (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_sub_ui __gmpz_sub_ui
+__GMP_DECLSPEC void mpz_sub_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_ui_sub __gmpz_ui_sub
+__GMP_DECLSPEC void mpz_ui_sub (mpz_ptr, unsigned long int, mpz_srcptr);
+
+#define mpz_submul __gmpz_submul
+__GMP_DECLSPEC void mpz_submul (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_submul_ui __gmpz_submul_ui
+__GMP_DECLSPEC void mpz_submul_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_swap __gmpz_swap
+__GMP_DECLSPEC void mpz_swap (mpz_ptr, mpz_ptr) __GMP_NOTHROW;
+
+#define mpz_tdiv_ui __gmpz_tdiv_ui
+__GMP_DECLSPEC unsigned long int mpz_tdiv_ui (mpz_srcptr, unsigned long int) __GMP_ATTRIBUTE_PURE;
+
+#define mpz_tdiv_q __gmpz_tdiv_q
+__GMP_DECLSPEC void mpz_tdiv_q (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_tdiv_q_2exp __gmpz_tdiv_q_2exp
+__GMP_DECLSPEC void mpz_tdiv_q_2exp (mpz_ptr, mpz_srcptr, mp_bitcnt_t);
+
+#define mpz_tdiv_q_ui __gmpz_tdiv_q_ui
+__GMP_DECLSPEC unsigned long int mpz_tdiv_q_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_tdiv_qr __gmpz_tdiv_qr
+__GMP_DECLSPEC void mpz_tdiv_qr (mpz_ptr, mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_tdiv_qr_ui __gmpz_tdiv_qr_ui
+__GMP_DECLSPEC unsigned long int mpz_tdiv_qr_ui (mpz_ptr, mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_tdiv_r __gmpz_tdiv_r
+__GMP_DECLSPEC void mpz_tdiv_r (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_tdiv_r_2exp __gmpz_tdiv_r_2exp
+__GMP_DECLSPEC void mpz_tdiv_r_2exp (mpz_ptr, mpz_srcptr, mp_bitcnt_t);
+
+#define mpz_tdiv_r_ui __gmpz_tdiv_r_ui
+__GMP_DECLSPEC unsigned long int mpz_tdiv_r_ui (mpz_ptr, mpz_srcptr, unsigned long int);
+
+#define mpz_tstbit __gmpz_tstbit
+__GMP_DECLSPEC int mpz_tstbit (mpz_srcptr, mp_bitcnt_t) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpz_ui_pow_ui __gmpz_ui_pow_ui
+__GMP_DECLSPEC void mpz_ui_pow_ui (mpz_ptr, unsigned long int, unsigned long int);
+
+#define mpz_urandomb __gmpz_urandomb
+__GMP_DECLSPEC void mpz_urandomb (mpz_ptr, gmp_randstate_ptr, mp_bitcnt_t);
+
+#define mpz_urandomm __gmpz_urandomm
+__GMP_DECLSPEC void mpz_urandomm (mpz_ptr, gmp_randstate_ptr, mpz_srcptr);
+
+#define mpz_xor __gmpz_xor
+#define mpz_eor __gmpz_xor
+__GMP_DECLSPEC void mpz_xor (mpz_ptr, mpz_srcptr, mpz_srcptr);
+
+#define mpz_limbs_read __gmpz_limbs_read
+__GMP_DECLSPEC mp_srcptr mpz_limbs_read (mpz_srcptr);
+
+#define mpz_limbs_write __gmpz_limbs_write
+__GMP_DECLSPEC mp_ptr mpz_limbs_write (mpz_ptr, mp_size_t);
+
+#define mpz_limbs_modify __gmpz_limbs_modify
+__GMP_DECLSPEC mp_ptr mpz_limbs_modify (mpz_ptr, mp_size_t);
+
+#define mpz_limbs_finish __gmpz_limbs_finish
+__GMP_DECLSPEC void mpz_limbs_finish (mpz_ptr, mp_size_t);
+
+#define mpz_roinit_n __gmpz_roinit_n
+__GMP_DECLSPEC mpz_srcptr mpz_roinit_n (mpz_ptr, mp_srcptr, mp_size_t);
+
+#define MPZ_ROINIT_N(xp, xs) {{0, (xs),(xp) }}
+
+/**************** Rational (i.e. Q) routines. ****************/
+
+#define mpq_abs __gmpq_abs
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpq_abs)
+__GMP_DECLSPEC void mpq_abs (mpq_ptr, mpq_srcptr);
+#endif
+
+#define mpq_add __gmpq_add
+__GMP_DECLSPEC void mpq_add (mpq_ptr, mpq_srcptr, mpq_srcptr);
+
+#define mpq_canonicalize __gmpq_canonicalize
+__GMP_DECLSPEC void mpq_canonicalize (mpq_ptr);
+
+#define mpq_clear __gmpq_clear
+__GMP_DECLSPEC void mpq_clear (mpq_ptr);
+
+#define mpq_clears __gmpq_clears
+__GMP_DECLSPEC void mpq_clears (mpq_ptr, ...);
+
+#define mpq_cmp __gmpq_cmp
+__GMP_DECLSPEC int mpq_cmp (mpq_srcptr, mpq_srcptr) __GMP_ATTRIBUTE_PURE;
+
+#define _mpq_cmp_si __gmpq_cmp_si
+__GMP_DECLSPEC int _mpq_cmp_si (mpq_srcptr, long, unsigned long) __GMP_ATTRIBUTE_PURE;
+
+#define _mpq_cmp_ui __gmpq_cmp_ui
+__GMP_DECLSPEC int _mpq_cmp_ui (mpq_srcptr, unsigned long int, unsigned long int) __GMP_ATTRIBUTE_PURE;
+
+#define mpq_cmp_z __gmpq_cmp_z
+__GMP_DECLSPEC int mpq_cmp_z (mpq_srcptr, mpz_srcptr) __GMP_ATTRIBUTE_PURE;
+
+#define mpq_div __gmpq_div
+__GMP_DECLSPEC void mpq_div (mpq_ptr, mpq_srcptr, mpq_srcptr);
+
+#define mpq_div_2exp __gmpq_div_2exp
+__GMP_DECLSPEC void mpq_div_2exp (mpq_ptr, mpq_srcptr, mp_bitcnt_t);
+
+#define mpq_equal __gmpq_equal
+__GMP_DECLSPEC int mpq_equal (mpq_srcptr, mpq_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpq_get_num __gmpq_get_num
+__GMP_DECLSPEC void mpq_get_num (mpz_ptr, mpq_srcptr);
+
+#define mpq_get_den __gmpq_get_den
+__GMP_DECLSPEC void mpq_get_den (mpz_ptr, mpq_srcptr);
+
+#define mpq_get_d __gmpq_get_d
+__GMP_DECLSPEC double mpq_get_d (mpq_srcptr) __GMP_ATTRIBUTE_PURE;
+
+#define mpq_get_str __gmpq_get_str
+__GMP_DECLSPEC char *mpq_get_str (char *, int, mpq_srcptr);
+
+#define mpq_init __gmpq_init
+__GMP_DECLSPEC void mpq_init (mpq_ptr);
+
+#define mpq_inits __gmpq_inits
+__GMP_DECLSPEC void mpq_inits (mpq_ptr, ...);
+
+#define mpq_inp_str __gmpq_inp_str
+#ifdef _GMP_H_HAVE_FILE
+__GMP_DECLSPEC size_t mpq_inp_str (mpq_ptr, FILE *, int);
+#endif
+
+#define mpq_inv __gmpq_inv
+__GMP_DECLSPEC void mpq_inv (mpq_ptr, mpq_srcptr);
+
+#define mpq_mul __gmpq_mul
+__GMP_DECLSPEC void mpq_mul (mpq_ptr, mpq_srcptr, mpq_srcptr);
+
+#define mpq_mul_2exp __gmpq_mul_2exp
+__GMP_DECLSPEC void mpq_mul_2exp (mpq_ptr, mpq_srcptr, mp_bitcnt_t);
+
+#define mpq_neg __gmpq_neg
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpq_neg)
+__GMP_DECLSPEC void mpq_neg (mpq_ptr, mpq_srcptr);
+#endif
+
+#define mpq_out_str __gmpq_out_str
+#ifdef _GMP_H_HAVE_FILE
+__GMP_DECLSPEC size_t mpq_out_str (FILE *, int, mpq_srcptr);
+#endif
+
+#define mpq_set __gmpq_set
+__GMP_DECLSPEC void mpq_set (mpq_ptr, mpq_srcptr);
+
+#define mpq_set_d __gmpq_set_d
+__GMP_DECLSPEC void mpq_set_d (mpq_ptr, double);
+
+#define mpq_set_den __gmpq_set_den
+__GMP_DECLSPEC void mpq_set_den (mpq_ptr, mpz_srcptr);
+
+#define mpq_set_f __gmpq_set_f
+__GMP_DECLSPEC void mpq_set_f (mpq_ptr, mpf_srcptr);
+
+#define mpq_set_num __gmpq_set_num
+__GMP_DECLSPEC void mpq_set_num (mpq_ptr, mpz_srcptr);
+
+#define mpq_set_si __gmpq_set_si
+__GMP_DECLSPEC void mpq_set_si (mpq_ptr, signed long int, unsigned long int);
+
+#define mpq_set_str __gmpq_set_str
+__GMP_DECLSPEC int mpq_set_str (mpq_ptr, const char *, int);
+
+#define mpq_set_ui __gmpq_set_ui
+__GMP_DECLSPEC void mpq_set_ui (mpq_ptr, unsigned long int, unsigned long int);
+
+#define mpq_set_z __gmpq_set_z
+__GMP_DECLSPEC void mpq_set_z (mpq_ptr, mpz_srcptr);
+
+#define mpq_sub __gmpq_sub
+__GMP_DECLSPEC void mpq_sub (mpq_ptr, mpq_srcptr, mpq_srcptr);
+
+#define mpq_swap __gmpq_swap
+__GMP_DECLSPEC void mpq_swap (mpq_ptr, mpq_ptr) __GMP_NOTHROW;
+
+
+/**************** Float (i.e. F) routines. ****************/
+
+#define mpf_abs __gmpf_abs
+__GMP_DECLSPEC void mpf_abs (mpf_ptr, mpf_srcptr);
+
+#define mpf_add __gmpf_add
+__GMP_DECLSPEC void mpf_add (mpf_ptr, mpf_srcptr, mpf_srcptr);
+
+#define mpf_add_ui __gmpf_add_ui
+__GMP_DECLSPEC void mpf_add_ui (mpf_ptr, mpf_srcptr, unsigned long int);
+#define mpf_ceil __gmpf_ceil
+__GMP_DECLSPEC void mpf_ceil (mpf_ptr, mpf_srcptr);
+
+#define mpf_clear __gmpf_clear
+__GMP_DECLSPEC void mpf_clear (mpf_ptr);
+
+#define mpf_clears __gmpf_clears
+__GMP_DECLSPEC void mpf_clears (mpf_ptr, ...);
+
+#define mpf_cmp __gmpf_cmp
+__GMP_DECLSPEC int mpf_cmp (mpf_srcptr, mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_cmp_z __gmpf_cmp_z
+__GMP_DECLSPEC int mpf_cmp_z (mpf_srcptr, mpz_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_cmp_d __gmpf_cmp_d
+__GMP_DECLSPEC int mpf_cmp_d (mpf_srcptr, double) __GMP_ATTRIBUTE_PURE;
+
+#define mpf_cmp_si __gmpf_cmp_si
+__GMP_DECLSPEC int mpf_cmp_si (mpf_srcptr, signed long int) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_cmp_ui __gmpf_cmp_ui
+__GMP_DECLSPEC int mpf_cmp_ui (mpf_srcptr, unsigned long int) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_div __gmpf_div
+__GMP_DECLSPEC void mpf_div (mpf_ptr, mpf_srcptr, mpf_srcptr);
+
+#define mpf_div_2exp __gmpf_div_2exp
+__GMP_DECLSPEC void mpf_div_2exp (mpf_ptr, mpf_srcptr, mp_bitcnt_t);
+
+#define mpf_div_ui __gmpf_div_ui
+__GMP_DECLSPEC void mpf_div_ui (mpf_ptr, mpf_srcptr, unsigned long int);
+
+#define mpf_dump __gmpf_dump
+__GMP_DECLSPEC void mpf_dump (mpf_srcptr);
+
+#define mpf_eq __gmpf_eq
+__GMP_DECLSPEC int mpf_eq (mpf_srcptr, mpf_srcptr, mp_bitcnt_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpf_fits_sint_p __gmpf_fits_sint_p
+__GMP_DECLSPEC int mpf_fits_sint_p (mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_fits_slong_p __gmpf_fits_slong_p
+__GMP_DECLSPEC int mpf_fits_slong_p (mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_fits_sshort_p __gmpf_fits_sshort_p
+__GMP_DECLSPEC int mpf_fits_sshort_p (mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_fits_uint_p __gmpf_fits_uint_p
+__GMP_DECLSPEC int mpf_fits_uint_p (mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_fits_ulong_p __gmpf_fits_ulong_p
+__GMP_DECLSPEC int mpf_fits_ulong_p (mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_fits_ushort_p __gmpf_fits_ushort_p
+__GMP_DECLSPEC int mpf_fits_ushort_p (mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_floor __gmpf_floor
+__GMP_DECLSPEC void mpf_floor (mpf_ptr, mpf_srcptr);
+
+#define mpf_get_d __gmpf_get_d
+__GMP_DECLSPEC double mpf_get_d (mpf_srcptr) __GMP_ATTRIBUTE_PURE;
+
+#define mpf_get_d_2exp __gmpf_get_d_2exp
+__GMP_DECLSPEC double mpf_get_d_2exp (signed long int *, mpf_srcptr);
+
+#define mpf_get_default_prec __gmpf_get_default_prec
+__GMP_DECLSPEC mp_bitcnt_t mpf_get_default_prec (void) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_get_prec __gmpf_get_prec
+__GMP_DECLSPEC mp_bitcnt_t mpf_get_prec (mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_get_si __gmpf_get_si
+__GMP_DECLSPEC long mpf_get_si (mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_get_str __gmpf_get_str
+__GMP_DECLSPEC char *mpf_get_str (char *, mp_exp_t *, int, size_t, mpf_srcptr);
+
+#define mpf_get_ui __gmpf_get_ui
+__GMP_DECLSPEC unsigned long mpf_get_ui (mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_init __gmpf_init
+__GMP_DECLSPEC void mpf_init (mpf_ptr);
+
+#define mpf_init2 __gmpf_init2
+__GMP_DECLSPEC void mpf_init2 (mpf_ptr, mp_bitcnt_t);
+
+#define mpf_inits __gmpf_inits
+__GMP_DECLSPEC void mpf_inits (mpf_ptr, ...);
+
+#define mpf_init_set __gmpf_init_set
+__GMP_DECLSPEC void mpf_init_set (mpf_ptr, mpf_srcptr);
+
+#define mpf_init_set_d __gmpf_init_set_d
+__GMP_DECLSPEC void mpf_init_set_d (mpf_ptr, double);
+
+#define mpf_init_set_si __gmpf_init_set_si
+__GMP_DECLSPEC void mpf_init_set_si (mpf_ptr, signed long int);
+
+#define mpf_init_set_str __gmpf_init_set_str
+__GMP_DECLSPEC int mpf_init_set_str (mpf_ptr, const char *, int);
+
+#define mpf_init_set_ui __gmpf_init_set_ui
+__GMP_DECLSPEC void mpf_init_set_ui (mpf_ptr, unsigned long int);
+
+#define mpf_inp_str __gmpf_inp_str
+#ifdef _GMP_H_HAVE_FILE
+__GMP_DECLSPEC size_t mpf_inp_str (mpf_ptr, FILE *, int);
+#endif
+
+#define mpf_integer_p __gmpf_integer_p
+__GMP_DECLSPEC int mpf_integer_p (mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_mul __gmpf_mul
+__GMP_DECLSPEC void mpf_mul (mpf_ptr, mpf_srcptr, mpf_srcptr);
+
+#define mpf_mul_2exp __gmpf_mul_2exp
+__GMP_DECLSPEC void mpf_mul_2exp (mpf_ptr, mpf_srcptr, mp_bitcnt_t);
+
+#define mpf_mul_ui __gmpf_mul_ui
+__GMP_DECLSPEC void mpf_mul_ui (mpf_ptr, mpf_srcptr, unsigned long int);
+
+#define mpf_neg __gmpf_neg
+__GMP_DECLSPEC void mpf_neg (mpf_ptr, mpf_srcptr);
+
+#define mpf_out_str __gmpf_out_str
+#ifdef _GMP_H_HAVE_FILE
+__GMP_DECLSPEC size_t mpf_out_str (FILE *, int, size_t, mpf_srcptr);
+#endif
+
+#define mpf_pow_ui __gmpf_pow_ui
+__GMP_DECLSPEC void mpf_pow_ui (mpf_ptr, mpf_srcptr, unsigned long int);
+
+#define mpf_random2 __gmpf_random2
+__GMP_DECLSPEC void mpf_random2 (mpf_ptr, mp_size_t, mp_exp_t);
+
+#define mpf_reldiff __gmpf_reldiff
+__GMP_DECLSPEC void mpf_reldiff (mpf_ptr, mpf_srcptr, mpf_srcptr);
+
+#define mpf_set __gmpf_set
+__GMP_DECLSPEC void mpf_set (mpf_ptr, mpf_srcptr);
+
+#define mpf_set_d __gmpf_set_d
+__GMP_DECLSPEC void mpf_set_d (mpf_ptr, double);
+
+#define mpf_set_default_prec __gmpf_set_default_prec
+__GMP_DECLSPEC void mpf_set_default_prec (mp_bitcnt_t) __GMP_NOTHROW;
+
+#define mpf_set_prec __gmpf_set_prec
+__GMP_DECLSPEC void mpf_set_prec (mpf_ptr, mp_bitcnt_t);
+
+#define mpf_set_prec_raw __gmpf_set_prec_raw
+__GMP_DECLSPEC void mpf_set_prec_raw (mpf_ptr, mp_bitcnt_t) __GMP_NOTHROW;
+
+#define mpf_set_q __gmpf_set_q
+__GMP_DECLSPEC void mpf_set_q (mpf_ptr, mpq_srcptr);
+
+#define mpf_set_si __gmpf_set_si
+__GMP_DECLSPEC void mpf_set_si (mpf_ptr, signed long int);
+
+#define mpf_set_str __gmpf_set_str
+__GMP_DECLSPEC int mpf_set_str (mpf_ptr, const char *, int);
+
+#define mpf_set_ui __gmpf_set_ui
+__GMP_DECLSPEC void mpf_set_ui (mpf_ptr, unsigned long int);
+
+#define mpf_set_z __gmpf_set_z
+__GMP_DECLSPEC void mpf_set_z (mpf_ptr, mpz_srcptr);
+
+#define mpf_size __gmpf_size
+__GMP_DECLSPEC size_t mpf_size (mpf_srcptr) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpf_sqrt __gmpf_sqrt
+__GMP_DECLSPEC void mpf_sqrt (mpf_ptr, mpf_srcptr);
+
+#define mpf_sqrt_ui __gmpf_sqrt_ui
+__GMP_DECLSPEC void mpf_sqrt_ui (mpf_ptr, unsigned long int);
+
+#define mpf_sub __gmpf_sub
+__GMP_DECLSPEC void mpf_sub (mpf_ptr, mpf_srcptr, mpf_srcptr);
+
+#define mpf_sub_ui __gmpf_sub_ui
+__GMP_DECLSPEC void mpf_sub_ui (mpf_ptr, mpf_srcptr, unsigned long int);
+
+#define mpf_swap __gmpf_swap
+__GMP_DECLSPEC void mpf_swap (mpf_ptr, mpf_ptr) __GMP_NOTHROW;
+
+#define mpf_trunc __gmpf_trunc
+__GMP_DECLSPEC void mpf_trunc (mpf_ptr, mpf_srcptr);
+
+#define mpf_ui_div __gmpf_ui_div
+__GMP_DECLSPEC void mpf_ui_div (mpf_ptr, unsigned long int, mpf_srcptr);
+
+#define mpf_ui_sub __gmpf_ui_sub
+__GMP_DECLSPEC void mpf_ui_sub (mpf_ptr, unsigned long int, mpf_srcptr);
+
+#define mpf_urandomb __gmpf_urandomb
+__GMP_DECLSPEC void mpf_urandomb (mpf_ptr, gmp_randstate_ptr, mp_bitcnt_t);
+
+
+/************ Low level positive-integer (i.e. N) routines. ************/
+
+/* This is ugly, but we need to make user calls reach the prefixed function. */
+
+#define mpn_add __MPN(add)
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpn_add)
+__GMP_DECLSPEC mp_limb_t mpn_add (mp_ptr, mp_srcptr, mp_size_t, mp_srcptr, mp_size_t);
+#endif
+
+#define mpn_add_1 __MPN(add_1)
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpn_add_1)
+__GMP_DECLSPEC mp_limb_t mpn_add_1 (mp_ptr, mp_srcptr, mp_size_t, mp_limb_t) __GMP_NOTHROW;
+#endif
+
+#define mpn_add_n __MPN(add_n)
+__GMP_DECLSPEC mp_limb_t mpn_add_n (mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+
+#define mpn_addmul_1 __MPN(addmul_1)
+__GMP_DECLSPEC mp_limb_t mpn_addmul_1 (mp_ptr, mp_srcptr, mp_size_t, mp_limb_t);
+
+#define mpn_cmp __MPN(cmp)
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpn_cmp)
+__GMP_DECLSPEC int mpn_cmp (mp_srcptr, mp_srcptr, mp_size_t) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+#endif
+
+#define mpn_zero_p __MPN(zero_p)
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpn_zero_p)
+__GMP_DECLSPEC int mpn_zero_p (mp_srcptr, mp_size_t) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+#endif
+
+#define mpn_divexact_1 __MPN(divexact_1)
+__GMP_DECLSPEC void mpn_divexact_1 (mp_ptr, mp_srcptr, mp_size_t, mp_limb_t);
+
+#define mpn_divexact_by3(dst,src,size) \
+ mpn_divexact_by3c (dst, src, size, __GMP_CAST (mp_limb_t, 0))
+
+#define mpn_divexact_by3c __MPN(divexact_by3c)
+__GMP_DECLSPEC mp_limb_t mpn_divexact_by3c (mp_ptr, mp_srcptr, mp_size_t, mp_limb_t);
+
+#define mpn_divmod_1(qp,np,nsize,dlimb) \
+ mpn_divrem_1 (qp, __GMP_CAST (mp_size_t, 0), np, nsize, dlimb)
+
+#define mpn_divrem __MPN(divrem)
+__GMP_DECLSPEC mp_limb_t mpn_divrem (mp_ptr, mp_size_t, mp_ptr, mp_size_t, mp_srcptr, mp_size_t);
+
+#define mpn_divrem_1 __MPN(divrem_1)
+__GMP_DECLSPEC mp_limb_t mpn_divrem_1 (mp_ptr, mp_size_t, mp_srcptr, mp_size_t, mp_limb_t);
+
+#define mpn_divrem_2 __MPN(divrem_2)
+__GMP_DECLSPEC mp_limb_t mpn_divrem_2 (mp_ptr, mp_size_t, mp_ptr, mp_size_t, mp_srcptr);
+
+#define mpn_div_qr_1 __MPN(div_qr_1)
+__GMP_DECLSPEC mp_limb_t mpn_div_qr_1 (mp_ptr, mp_limb_t *, mp_srcptr, mp_size_t, mp_limb_t);
+
+#define mpn_div_qr_2 __MPN(div_qr_2)
+__GMP_DECLSPEC mp_limb_t mpn_div_qr_2 (mp_ptr, mp_ptr, mp_srcptr, mp_size_t, mp_srcptr);
+
+#define mpn_gcd __MPN(gcd)
+__GMP_DECLSPEC mp_size_t mpn_gcd (mp_ptr, mp_ptr, mp_size_t, mp_ptr, mp_size_t);
+
+#define mpn_gcd_11 __MPN(gcd_11)
+__GMP_DECLSPEC mp_limb_t mpn_gcd_11 (mp_limb_t, mp_limb_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_gcd_1 __MPN(gcd_1)
+__GMP_DECLSPEC mp_limb_t mpn_gcd_1 (mp_srcptr, mp_size_t, mp_limb_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_gcdext_1 __MPN(gcdext_1)
+__GMP_DECLSPEC mp_limb_t mpn_gcdext_1 (mp_limb_signed_t *, mp_limb_signed_t *, mp_limb_t, mp_limb_t);
+
+#define mpn_gcdext __MPN(gcdext)
+__GMP_DECLSPEC mp_size_t mpn_gcdext (mp_ptr, mp_ptr, mp_size_t *, mp_ptr, mp_size_t, mp_ptr, mp_size_t);
+
+#define mpn_get_str __MPN(get_str)
+__GMP_DECLSPEC size_t mpn_get_str (unsigned char *, int, mp_ptr, mp_size_t);
+
+#define mpn_hamdist __MPN(hamdist)
+__GMP_DECLSPEC mp_bitcnt_t mpn_hamdist (mp_srcptr, mp_srcptr, mp_size_t) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpn_lshift __MPN(lshift)
+__GMP_DECLSPEC mp_limb_t mpn_lshift (mp_ptr, mp_srcptr, mp_size_t, unsigned int);
+
+#define mpn_mod_1 __MPN(mod_1)
+__GMP_DECLSPEC mp_limb_t mpn_mod_1 (mp_srcptr, mp_size_t, mp_limb_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_mul __MPN(mul)
+__GMP_DECLSPEC mp_limb_t mpn_mul (mp_ptr, mp_srcptr, mp_size_t, mp_srcptr, mp_size_t);
+
+#define mpn_mul_1 __MPN(mul_1)
+__GMP_DECLSPEC mp_limb_t mpn_mul_1 (mp_ptr, mp_srcptr, mp_size_t, mp_limb_t);
+
+#define mpn_mul_n __MPN(mul_n)
+__GMP_DECLSPEC void mpn_mul_n (mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+
+#define mpn_sqr __MPN(sqr)
+__GMP_DECLSPEC void mpn_sqr (mp_ptr, mp_srcptr, mp_size_t);
+
+#define mpn_neg __MPN(neg)
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpn_neg)
+__GMP_DECLSPEC mp_limb_t mpn_neg (mp_ptr, mp_srcptr, mp_size_t);
+#endif
+
+#define mpn_com __MPN(com)
+__GMP_DECLSPEC void mpn_com (mp_ptr, mp_srcptr, mp_size_t);
+
+#define mpn_perfect_square_p __MPN(perfect_square_p)
+__GMP_DECLSPEC int mpn_perfect_square_p (mp_srcptr, mp_size_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_perfect_power_p __MPN(perfect_power_p)
+__GMP_DECLSPEC int mpn_perfect_power_p (mp_srcptr, mp_size_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_popcount __MPN(popcount)
+__GMP_DECLSPEC mp_bitcnt_t mpn_popcount (mp_srcptr, mp_size_t) __GMP_NOTHROW __GMP_ATTRIBUTE_PURE;
+
+#define mpn_pow_1 __MPN(pow_1)
+__GMP_DECLSPEC mp_size_t mpn_pow_1 (mp_ptr, mp_srcptr, mp_size_t, mp_limb_t, mp_ptr);
+
+/* undocumented now, but retained here for upward compatibility */
+#define mpn_preinv_mod_1 __MPN(preinv_mod_1)
+__GMP_DECLSPEC mp_limb_t mpn_preinv_mod_1 (mp_srcptr, mp_size_t, mp_limb_t, mp_limb_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_random __MPN(random)
+__GMP_DECLSPEC void mpn_random (mp_ptr, mp_size_t);
+
+#define mpn_random2 __MPN(random2)
+__GMP_DECLSPEC void mpn_random2 (mp_ptr, mp_size_t);
+
+#define mpn_rshift __MPN(rshift)
+__GMP_DECLSPEC mp_limb_t mpn_rshift (mp_ptr, mp_srcptr, mp_size_t, unsigned int);
+
+#define mpn_scan0 __MPN(scan0)
+__GMP_DECLSPEC mp_bitcnt_t mpn_scan0 (mp_srcptr, mp_bitcnt_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_scan1 __MPN(scan1)
+__GMP_DECLSPEC mp_bitcnt_t mpn_scan1 (mp_srcptr, mp_bitcnt_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_set_str __MPN(set_str)
+__GMP_DECLSPEC mp_size_t mpn_set_str (mp_ptr, const unsigned char *, size_t, int);
+
+#define mpn_sizeinbase __MPN(sizeinbase)
+__GMP_DECLSPEC size_t mpn_sizeinbase (mp_srcptr, mp_size_t, int);
+
+#define mpn_sqrtrem __MPN(sqrtrem)
+__GMP_DECLSPEC mp_size_t mpn_sqrtrem (mp_ptr, mp_ptr, mp_srcptr, mp_size_t);
+
+#define mpn_sub __MPN(sub)
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpn_sub)
+__GMP_DECLSPEC mp_limb_t mpn_sub (mp_ptr, mp_srcptr, mp_size_t, mp_srcptr, mp_size_t);
+#endif
+
+#define mpn_sub_1 __MPN(sub_1)
+#if __GMP_INLINE_PROTOTYPES || defined (__GMP_FORCE_mpn_sub_1)
+__GMP_DECLSPEC mp_limb_t mpn_sub_1 (mp_ptr, mp_srcptr, mp_size_t, mp_limb_t) __GMP_NOTHROW;
+#endif
+
+#define mpn_sub_n __MPN(sub_n)
+__GMP_DECLSPEC mp_limb_t mpn_sub_n (mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+
+#define mpn_submul_1 __MPN(submul_1)
+__GMP_DECLSPEC mp_limb_t mpn_submul_1 (mp_ptr, mp_srcptr, mp_size_t, mp_limb_t);
+
+#define mpn_tdiv_qr __MPN(tdiv_qr)
+__GMP_DECLSPEC void mpn_tdiv_qr (mp_ptr, mp_ptr, mp_size_t, mp_srcptr, mp_size_t, mp_srcptr, mp_size_t);
+
+#define mpn_and_n __MPN(and_n)
+__GMP_DECLSPEC void mpn_and_n (mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+#define mpn_andn_n __MPN(andn_n)
+__GMP_DECLSPEC void mpn_andn_n (mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+#define mpn_nand_n __MPN(nand_n)
+__GMP_DECLSPEC void mpn_nand_n (mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+#define mpn_ior_n __MPN(ior_n)
+__GMP_DECLSPEC void mpn_ior_n (mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+#define mpn_iorn_n __MPN(iorn_n)
+__GMP_DECLSPEC void mpn_iorn_n (mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+#define mpn_nior_n __MPN(nior_n)
+__GMP_DECLSPEC void mpn_nior_n (mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+#define mpn_xor_n __MPN(xor_n)
+__GMP_DECLSPEC void mpn_xor_n (mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+#define mpn_xnor_n __MPN(xnor_n)
+__GMP_DECLSPEC void mpn_xnor_n (mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+
+#define mpn_copyi __MPN(copyi)
+__GMP_DECLSPEC void mpn_copyi (mp_ptr, mp_srcptr, mp_size_t);
+#define mpn_copyd __MPN(copyd)
+__GMP_DECLSPEC void mpn_copyd (mp_ptr, mp_srcptr, mp_size_t);
+#define mpn_zero __MPN(zero)
+__GMP_DECLSPEC void mpn_zero (mp_ptr, mp_size_t);
+
+#define mpn_cnd_add_n __MPN(cnd_add_n)
+__GMP_DECLSPEC mp_limb_t mpn_cnd_add_n (mp_limb_t, mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+#define mpn_cnd_sub_n __MPN(cnd_sub_n)
+__GMP_DECLSPEC mp_limb_t mpn_cnd_sub_n (mp_limb_t, mp_ptr, mp_srcptr, mp_srcptr, mp_size_t);
+
+#define mpn_sec_add_1 __MPN(sec_add_1)
+__GMP_DECLSPEC mp_limb_t mpn_sec_add_1 (mp_ptr, mp_srcptr, mp_size_t, mp_limb_t, mp_ptr);
+#define mpn_sec_add_1_itch __MPN(sec_add_1_itch)
+__GMP_DECLSPEC mp_size_t mpn_sec_add_1_itch (mp_size_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_sec_sub_1 __MPN(sec_sub_1)
+__GMP_DECLSPEC mp_limb_t mpn_sec_sub_1 (mp_ptr, mp_srcptr, mp_size_t, mp_limb_t, mp_ptr);
+#define mpn_sec_sub_1_itch __MPN(sec_sub_1_itch)
+__GMP_DECLSPEC mp_size_t mpn_sec_sub_1_itch (mp_size_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_cnd_swap __MPN(cnd_swap)
+__GMP_DECLSPEC void mpn_cnd_swap (mp_limb_t, volatile mp_limb_t *, volatile mp_limb_t *, mp_size_t);
+
+#define mpn_sec_mul __MPN(sec_mul)
+__GMP_DECLSPEC void mpn_sec_mul (mp_ptr, mp_srcptr, mp_size_t, mp_srcptr, mp_size_t, mp_ptr);
+#define mpn_sec_mul_itch __MPN(sec_mul_itch)
+__GMP_DECLSPEC mp_size_t mpn_sec_mul_itch (mp_size_t, mp_size_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_sec_sqr __MPN(sec_sqr)
+__GMP_DECLSPEC void mpn_sec_sqr (mp_ptr, mp_srcptr, mp_size_t, mp_ptr);
+#define mpn_sec_sqr_itch __MPN(sec_sqr_itch)
+__GMP_DECLSPEC mp_size_t mpn_sec_sqr_itch (mp_size_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_sec_powm __MPN(sec_powm)
+__GMP_DECLSPEC void mpn_sec_powm (mp_ptr, mp_srcptr, mp_size_t, mp_srcptr, mp_bitcnt_t, mp_srcptr, mp_size_t, mp_ptr);
+#define mpn_sec_powm_itch __MPN(sec_powm_itch)
+__GMP_DECLSPEC mp_size_t mpn_sec_powm_itch (mp_size_t, mp_bitcnt_t, mp_size_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_sec_tabselect __MPN(sec_tabselect)
+__GMP_DECLSPEC void mpn_sec_tabselect (volatile mp_limb_t *, volatile const mp_limb_t *, mp_size_t, mp_size_t, mp_size_t);
+
+#define mpn_sec_div_qr __MPN(sec_div_qr)
+__GMP_DECLSPEC mp_limb_t mpn_sec_div_qr (mp_ptr, mp_ptr, mp_size_t, mp_srcptr, mp_size_t, mp_ptr);
+#define mpn_sec_div_qr_itch __MPN(sec_div_qr_itch)
+__GMP_DECLSPEC mp_size_t mpn_sec_div_qr_itch (mp_size_t, mp_size_t) __GMP_ATTRIBUTE_PURE;
+#define mpn_sec_div_r __MPN(sec_div_r)
+__GMP_DECLSPEC void mpn_sec_div_r (mp_ptr, mp_size_t, mp_srcptr, mp_size_t, mp_ptr);
+#define mpn_sec_div_r_itch __MPN(sec_div_r_itch)
+__GMP_DECLSPEC mp_size_t mpn_sec_div_r_itch (mp_size_t, mp_size_t) __GMP_ATTRIBUTE_PURE;
+
+#define mpn_sec_invert __MPN(sec_invert)
+__GMP_DECLSPEC int mpn_sec_invert (mp_ptr, mp_ptr, mp_srcptr, mp_size_t, mp_bitcnt_t, mp_ptr);
+#define mpn_sec_invert_itch __MPN(sec_invert_itch)
+__GMP_DECLSPEC mp_size_t mpn_sec_invert_itch (mp_size_t) __GMP_ATTRIBUTE_PURE;
+
+
+/**************** mpz inlines ****************/
+
+/* The following are provided as inlines where possible, but always exist as
+ library functions too, for binary compatibility.
+
+ Within gmp itself this inlining generally isn't relied on, since it
+ doesn't get done for all compilers, whereas if something is worth
+ inlining then it's worth arranging always.
+
+ There are two styles of inlining here. When the same bit of code is
+ wanted for the inline as for the library version, then __GMP_FORCE_foo
+ arranges for that code to be emitted and the __GMP_EXTERN_INLINE
+ directive suppressed, eg. mpz_fits_uint_p. When a different bit of code
+ is wanted for the inline than for the library version, then
+ __GMP_FORCE_foo arranges the inline to be suppressed, eg. mpz_abs. */
+
+#if defined (__GMP_EXTERN_INLINE) && ! defined (__GMP_FORCE_mpz_abs)
+__GMP_EXTERN_INLINE void
+mpz_abs (mpz_ptr __gmp_w, mpz_srcptr __gmp_u)
+{
+ if (__gmp_w != __gmp_u)
+ mpz_set (__gmp_w, __gmp_u);
+ __gmp_w->_mp_size = __GMP_ABS (__gmp_w->_mp_size);
+}
+#endif
+
+#if GMP_NAIL_BITS == 0
+#define __GMPZ_FITS_UTYPE_P(z,maxval) \
+ mp_size_t __gmp_n = z->_mp_size; \
+ mp_ptr __gmp_p = z->_mp_d; \
+ return (__gmp_n == 0 || (__gmp_n == 1 && __gmp_p[0] <= maxval));
+#else
+#define __GMPZ_FITS_UTYPE_P(z,maxval) \
+ mp_size_t __gmp_n = z->_mp_size; \
+ mp_ptr __gmp_p = z->_mp_d; \
+ return (__gmp_n == 0 || (__gmp_n == 1 && __gmp_p[0] <= maxval) \
+ || (__gmp_n == 2 && __gmp_p[1] <= ((mp_limb_t) maxval >> GMP_NUMB_BITS)));
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpz_fits_uint_p)
+#if ! defined (__GMP_FORCE_mpz_fits_uint_p)
+__GMP_EXTERN_INLINE
+#endif
+int
+mpz_fits_uint_p (mpz_srcptr __gmp_z) __GMP_NOTHROW
+{
+ __GMPZ_FITS_UTYPE_P (__gmp_z, UINT_MAX);
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpz_fits_ulong_p)
+#if ! defined (__GMP_FORCE_mpz_fits_ulong_p)
+__GMP_EXTERN_INLINE
+#endif
+int
+mpz_fits_ulong_p (mpz_srcptr __gmp_z) __GMP_NOTHROW
+{
+ __GMPZ_FITS_UTYPE_P (__gmp_z, ULONG_MAX);
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpz_fits_ushort_p)
+#if ! defined (__GMP_FORCE_mpz_fits_ushort_p)
+__GMP_EXTERN_INLINE
+#endif
+int
+mpz_fits_ushort_p (mpz_srcptr __gmp_z) __GMP_NOTHROW
+{
+ __GMPZ_FITS_UTYPE_P (__gmp_z, USHRT_MAX);
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpz_get_ui)
+#if ! defined (__GMP_FORCE_mpz_get_ui)
+__GMP_EXTERN_INLINE
+#endif
+unsigned long
+mpz_get_ui (mpz_srcptr __gmp_z) __GMP_NOTHROW
+{
+ mp_ptr __gmp_p = __gmp_z->_mp_d;
+ mp_size_t __gmp_n = __gmp_z->_mp_size;
+ mp_limb_t __gmp_l = __gmp_p[0];
+ /* This is a "#if" rather than a plain "if" so as to avoid gcc warnings
+ about "<< GMP_NUMB_BITS" exceeding the type size, and to avoid Borland
+ C++ 6.0 warnings about condition always true for something like
+ "ULONG_MAX < GMP_NUMB_MASK". */
+#if GMP_NAIL_BITS == 0 || defined (_LONG_LONG_LIMB)
+ /* limb==long and no nails, or limb==longlong, one limb is enough */
+ return (__gmp_n != 0 ? __gmp_l : 0);
+#else
+ /* limb==long and nails, need two limbs when available */
+ __gmp_n = __GMP_ABS (__gmp_n);
+ if (__gmp_n <= 1)
+ return (__gmp_n != 0 ? __gmp_l : 0);
+ else
+ return __gmp_l + (__gmp_p[1] << GMP_NUMB_BITS);
+#endif
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpz_getlimbn)
+#if ! defined (__GMP_FORCE_mpz_getlimbn)
+__GMP_EXTERN_INLINE
+#endif
+mp_limb_t
+mpz_getlimbn (mpz_srcptr __gmp_z, mp_size_t __gmp_n) __GMP_NOTHROW
+{
+ mp_limb_t __gmp_result = 0;
+ if (__GMP_LIKELY (__gmp_n >= 0 && __gmp_n < __GMP_ABS (__gmp_z->_mp_size)))
+ __gmp_result = __gmp_z->_mp_d[__gmp_n];
+ return __gmp_result;
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) && ! defined (__GMP_FORCE_mpz_neg)
+__GMP_EXTERN_INLINE void
+mpz_neg (mpz_ptr __gmp_w, mpz_srcptr __gmp_u)
+{
+ if (__gmp_w != __gmp_u)
+ mpz_set (__gmp_w, __gmp_u);
+ __gmp_w->_mp_size = - __gmp_w->_mp_size;
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpz_perfect_square_p)
+#if ! defined (__GMP_FORCE_mpz_perfect_square_p)
+__GMP_EXTERN_INLINE
+#endif
+int
+mpz_perfect_square_p (mpz_srcptr __gmp_a)
+{
+ mp_size_t __gmp_asize;
+ int __gmp_result;
+
+ __gmp_asize = __gmp_a->_mp_size;
+ __gmp_result = (__gmp_asize >= 0); /* zero is a square, negatives are not */
+ if (__GMP_LIKELY (__gmp_asize > 0))
+ __gmp_result = mpn_perfect_square_p (__gmp_a->_mp_d, __gmp_asize);
+ return __gmp_result;
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpz_popcount)
+#if ! defined (__GMP_FORCE_mpz_popcount)
+__GMP_EXTERN_INLINE
+#endif
+mp_bitcnt_t
+mpz_popcount (mpz_srcptr __gmp_u) __GMP_NOTHROW
+{
+ mp_size_t __gmp_usize;
+ mp_bitcnt_t __gmp_result;
+
+ __gmp_usize = __gmp_u->_mp_size;
+ __gmp_result = (__gmp_usize < 0 ? ~ __GMP_CAST (mp_bitcnt_t, 0) : __GMP_CAST (mp_bitcnt_t, 0));
+ if (__GMP_LIKELY (__gmp_usize > 0))
+ __gmp_result = mpn_popcount (__gmp_u->_mp_d, __gmp_usize);
+ return __gmp_result;
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpz_set_q)
+#if ! defined (__GMP_FORCE_mpz_set_q)
+__GMP_EXTERN_INLINE
+#endif
+void
+mpz_set_q (mpz_ptr __gmp_w, mpq_srcptr __gmp_u)
+{
+ mpz_tdiv_q (__gmp_w, mpq_numref (__gmp_u), mpq_denref (__gmp_u));
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpz_size)
+#if ! defined (__GMP_FORCE_mpz_size)
+__GMP_EXTERN_INLINE
+#endif
+size_t
+mpz_size (mpz_srcptr __gmp_z) __GMP_NOTHROW
+{
+ return __GMP_ABS (__gmp_z->_mp_size);
+}
+#endif
+
+
+/**************** mpq inlines ****************/
+
+#if defined (__GMP_EXTERN_INLINE) && ! defined (__GMP_FORCE_mpq_abs)
+__GMP_EXTERN_INLINE void
+mpq_abs (mpq_ptr __gmp_w, mpq_srcptr __gmp_u)
+{
+ if (__gmp_w != __gmp_u)
+ mpq_set (__gmp_w, __gmp_u);
+ __gmp_w->_mp_num._mp_size = __GMP_ABS (__gmp_w->_mp_num._mp_size);
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) && ! defined (__GMP_FORCE_mpq_neg)
+__GMP_EXTERN_INLINE void
+mpq_neg (mpq_ptr __gmp_w, mpq_srcptr __gmp_u)
+{
+ if (__gmp_w != __gmp_u)
+ mpq_set (__gmp_w, __gmp_u);
+ __gmp_w->_mp_num._mp_size = - __gmp_w->_mp_num._mp_size;
+}
+#endif
+
+
+/**************** mpn inlines ****************/
+
+/* The comments with __GMPN_ADD_1 below apply here too.
+
+ The test for FUNCTION returning 0 should predict well. If it's assumed
+ {yp,ysize} will usually have a random number of bits then the high limb
+ won't be full and a carry out will occur a good deal less than 50% of the
+ time.
+
+ ysize==0 isn't a documented feature, but is used internally in a few
+ places.
+
+ Producing cout last stops it using up a register during the main part of
+ the calculation, though gcc (as of 3.0) on an "if (mpn_add (...))"
+ doesn't seem able to move the true and false legs of the conditional up
+ to the two places cout is generated. */
+
+#define __GMPN_AORS(cout, wp, xp, xsize, yp, ysize, FUNCTION, TEST) \
+ do { \
+ mp_size_t __gmp_i; \
+ mp_limb_t __gmp_x; \
+ \
+ /* ASSERT ((ysize) >= 0); */ \
+ /* ASSERT ((xsize) >= (ysize)); */ \
+ /* ASSERT (MPN_SAME_OR_SEPARATE2_P (wp, xsize, xp, xsize)); */ \
+ /* ASSERT (MPN_SAME_OR_SEPARATE2_P (wp, xsize, yp, ysize)); */ \
+ \
+ __gmp_i = (ysize); \
+ if (__gmp_i != 0) \
+ { \
+ if (FUNCTION (wp, xp, yp, __gmp_i)) \
+ { \
+ do \
+ { \
+ if (__gmp_i >= (xsize)) \
+ { \
+ (cout) = 1; \
+ goto __gmp_done; \
+ } \
+ __gmp_x = (xp)[__gmp_i]; \
+ } \
+ while (TEST); \
+ } \
+ } \
+ if ((wp) != (xp)) \
+ __GMPN_COPY_REST (wp, xp, xsize, __gmp_i); \
+ (cout) = 0; \
+ __gmp_done: \
+ ; \
+ } while (0)
+
+#define __GMPN_ADD(cout, wp, xp, xsize, yp, ysize) \
+ __GMPN_AORS (cout, wp, xp, xsize, yp, ysize, mpn_add_n, \
+ (((wp)[__gmp_i++] = (__gmp_x + 1) & GMP_NUMB_MASK) == 0))
+#define __GMPN_SUB(cout, wp, xp, xsize, yp, ysize) \
+ __GMPN_AORS (cout, wp, xp, xsize, yp, ysize, mpn_sub_n, \
+ (((wp)[__gmp_i++] = (__gmp_x - 1) & GMP_NUMB_MASK), __gmp_x == 0))
+
+
+/* The use of __gmp_i indexing is designed to ensure a compile time src==dst
+ remains nice and clear to the compiler, so that __GMPN_COPY_REST can
+ disappear, and the load/add/store gets a chance to become a
+ read-modify-write on CISC CPUs.
+
+ Alternatives:
+
+ Using a pair of pointers instead of indexing would be possible, but gcc
+ isn't able to recognise compile-time src==dst in that case, even when the
+ pointers are incremented more or less together. Other compilers would
+ very likely have similar difficulty.
+
+ gcc could use "if (__builtin_constant_p(src==dst) && src==dst)" or
+ similar to detect a compile-time src==dst. This works nicely on gcc
+ 2.95.x, it's not good on gcc 3.0 where __builtin_constant_p(p==p) seems
+ to be always false, for a pointer p. But the current code form seems
+ good enough for src==dst anyway.
+
+ gcc on x86 as usual doesn't give particularly good flags handling for the
+ carry/borrow detection. It's tempting to want some multi instruction asm
+ blocks to help it, and this was tried, but in truth there's only a few
+ instructions to save and any gain is all too easily lost by register
+ juggling setting up for the asm. */
+
+#if GMP_NAIL_BITS == 0
+#define __GMPN_AORS_1(cout, dst, src, n, v, OP, CB) \
+ do { \
+ mp_size_t __gmp_i; \
+ mp_limb_t __gmp_x, __gmp_r; \
+ \
+ /* ASSERT ((n) >= 1); */ \
+ /* ASSERT (MPN_SAME_OR_SEPARATE_P (dst, src, n)); */ \
+ \
+ __gmp_x = (src)[0]; \
+ __gmp_r = __gmp_x OP (v); \
+ (dst)[0] = __gmp_r; \
+ if (CB (__gmp_r, __gmp_x, (v))) \
+ { \
+ (cout) = 1; \
+ for (__gmp_i = 1; __gmp_i < (n);) \
+ { \
+ __gmp_x = (src)[__gmp_i]; \
+ __gmp_r = __gmp_x OP 1; \
+ (dst)[__gmp_i] = __gmp_r; \
+ ++__gmp_i; \
+ if (!CB (__gmp_r, __gmp_x, 1)) \
+ { \
+ if ((src) != (dst)) \
+ __GMPN_COPY_REST (dst, src, n, __gmp_i); \
+ (cout) = 0; \
+ break; \
+ } \
+ } \
+ } \
+ else \
+ { \
+ if ((src) != (dst)) \
+ __GMPN_COPY_REST (dst, src, n, 1); \
+ (cout) = 0; \
+ } \
+ } while (0)
+#endif
+
+#if GMP_NAIL_BITS >= 1
+#define __GMPN_AORS_1(cout, dst, src, n, v, OP, CB) \
+ do { \
+ mp_size_t __gmp_i; \
+ mp_limb_t __gmp_x, __gmp_r; \
+ \
+ /* ASSERT ((n) >= 1); */ \
+ /* ASSERT (MPN_SAME_OR_SEPARATE_P (dst, src, n)); */ \
+ \
+ __gmp_x = (src)[0]; \
+ __gmp_r = __gmp_x OP (v); \
+ (dst)[0] = __gmp_r & GMP_NUMB_MASK; \
+ if (__gmp_r >> GMP_NUMB_BITS != 0) \
+ { \
+ (cout) = 1; \
+ for (__gmp_i = 1; __gmp_i < (n);) \
+ { \
+ __gmp_x = (src)[__gmp_i]; \
+ __gmp_r = __gmp_x OP 1; \
+ (dst)[__gmp_i] = __gmp_r & GMP_NUMB_MASK; \
+ ++__gmp_i; \
+ if (__gmp_r >> GMP_NUMB_BITS == 0) \
+ { \
+ if ((src) != (dst)) \
+ __GMPN_COPY_REST (dst, src, n, __gmp_i); \
+ (cout) = 0; \
+ break; \
+ } \
+ } \
+ } \
+ else \
+ { \
+ if ((src) != (dst)) \
+ __GMPN_COPY_REST (dst, src, n, 1); \
+ (cout) = 0; \
+ } \
+ } while (0)
+#endif
+
+#define __GMPN_ADDCB(r,x,y) ((r) < (y))
+#define __GMPN_SUBCB(r,x,y) ((x) < (y))
+
+#define __GMPN_ADD_1(cout, dst, src, n, v) \
+ __GMPN_AORS_1(cout, dst, src, n, v, +, __GMPN_ADDCB)
+#define __GMPN_SUB_1(cout, dst, src, n, v) \
+ __GMPN_AORS_1(cout, dst, src, n, v, -, __GMPN_SUBCB)
+
+
+/* Compare {xp,size} and {yp,size}, setting "result" to positive, zero or
+ negative. size==0 is allowed. On random data usually only one limb will
+ need to be examined to get a result, so it's worth having it inline. */
+#define __GMPN_CMP(result, xp, yp, size) \
+ do { \
+ mp_size_t __gmp_i; \
+ mp_limb_t __gmp_x, __gmp_y; \
+ \
+ /* ASSERT ((size) >= 0); */ \
+ \
+ (result) = 0; \
+ __gmp_i = (size); \
+ while (--__gmp_i >= 0) \
+ { \
+ __gmp_x = (xp)[__gmp_i]; \
+ __gmp_y = (yp)[__gmp_i]; \
+ if (__gmp_x != __gmp_y) \
+ { \
+ /* Cannot use __gmp_x - __gmp_y, may overflow an "int" */ \
+ (result) = (__gmp_x > __gmp_y ? 1 : -1); \
+ break; \
+ } \
+ } \
+ } while (0)
+
+
+#if defined (__GMPN_COPY) && ! defined (__GMPN_COPY_REST)
+#define __GMPN_COPY_REST(dst, src, size, start) \
+ do { \
+ /* ASSERT ((start) >= 0); */ \
+ /* ASSERT ((start) <= (size)); */ \
+ __GMPN_COPY ((dst)+(start), (src)+(start), (size)-(start)); \
+ } while (0)
+#endif
+
+/* Copy {src,size} to {dst,size}, starting at "start". This is designed to
+ keep the indexing dst[j] and src[j] nice and simple for __GMPN_ADD_1,
+ __GMPN_ADD, etc. */
+#if ! defined (__GMPN_COPY_REST)
+#define __GMPN_COPY_REST(dst, src, size, start) \
+ do { \
+ mp_size_t __gmp_j; \
+ /* ASSERT ((size) >= 0); */ \
+ /* ASSERT ((start) >= 0); */ \
+ /* ASSERT ((start) <= (size)); */ \
+ /* ASSERT (MPN_SAME_OR_SEPARATE_P (dst, src, size)); */ \
+ __GMP_CRAY_Pragma ("_CRI ivdep"); \
+ for (__gmp_j = (start); __gmp_j < (size); __gmp_j++) \
+ (dst)[__gmp_j] = (src)[__gmp_j]; \
+ } while (0)
+#endif
+
+/* Enhancement: Use some of the smarter code from gmp-impl.h. Maybe use
+ mpn_copyi if there's a native version, and if we don't mind demanding
+ binary compatibility for it (on targets which use it). */
+
+#if ! defined (__GMPN_COPY)
+#define __GMPN_COPY(dst, src, size) __GMPN_COPY_REST (dst, src, size, 0)
+#endif
+
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpn_add)
+#if ! defined (__GMP_FORCE_mpn_add)
+__GMP_EXTERN_INLINE
+#endif
+mp_limb_t
+mpn_add (mp_ptr __gmp_wp, mp_srcptr __gmp_xp, mp_size_t __gmp_xsize, mp_srcptr __gmp_yp, mp_size_t __gmp_ysize)
+{
+ mp_limb_t __gmp_c;
+ __GMPN_ADD (__gmp_c, __gmp_wp, __gmp_xp, __gmp_xsize, __gmp_yp, __gmp_ysize);
+ return __gmp_c;
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpn_add_1)
+#if ! defined (__GMP_FORCE_mpn_add_1)
+__GMP_EXTERN_INLINE
+#endif
+mp_limb_t
+mpn_add_1 (mp_ptr __gmp_dst, mp_srcptr __gmp_src, mp_size_t __gmp_size, mp_limb_t __gmp_n) __GMP_NOTHROW
+{
+ mp_limb_t __gmp_c;
+ __GMPN_ADD_1 (__gmp_c, __gmp_dst, __gmp_src, __gmp_size, __gmp_n);
+ return __gmp_c;
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpn_cmp)
+#if ! defined (__GMP_FORCE_mpn_cmp)
+__GMP_EXTERN_INLINE
+#endif
+int
+mpn_cmp (mp_srcptr __gmp_xp, mp_srcptr __gmp_yp, mp_size_t __gmp_size) __GMP_NOTHROW
+{
+ int __gmp_result;
+ __GMPN_CMP (__gmp_result, __gmp_xp, __gmp_yp, __gmp_size);
+ return __gmp_result;
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpn_zero_p)
+#if ! defined (__GMP_FORCE_mpn_zero_p)
+__GMP_EXTERN_INLINE
+#endif
+int
+mpn_zero_p (mp_srcptr __gmp_p, mp_size_t __gmp_n) __GMP_NOTHROW
+{
+ /* if (__GMP_LIKELY (__gmp_n > 0)) */
+ do {
+ if (__gmp_p[--__gmp_n] != 0)
+ return 0;
+ } while (__gmp_n != 0);
+ return 1;
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpn_sub)
+#if ! defined (__GMP_FORCE_mpn_sub)
+__GMP_EXTERN_INLINE
+#endif
+mp_limb_t
+mpn_sub (mp_ptr __gmp_wp, mp_srcptr __gmp_xp, mp_size_t __gmp_xsize, mp_srcptr __gmp_yp, mp_size_t __gmp_ysize)
+{
+ mp_limb_t __gmp_c;
+ __GMPN_SUB (__gmp_c, __gmp_wp, __gmp_xp, __gmp_xsize, __gmp_yp, __gmp_ysize);
+ return __gmp_c;
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpn_sub_1)
+#if ! defined (__GMP_FORCE_mpn_sub_1)
+__GMP_EXTERN_INLINE
+#endif
+mp_limb_t
+mpn_sub_1 (mp_ptr __gmp_dst, mp_srcptr __gmp_src, mp_size_t __gmp_size, mp_limb_t __gmp_n) __GMP_NOTHROW
+{
+ mp_limb_t __gmp_c;
+ __GMPN_SUB_1 (__gmp_c, __gmp_dst, __gmp_src, __gmp_size, __gmp_n);
+ return __gmp_c;
+}
+#endif
+
+#if defined (__GMP_EXTERN_INLINE) || defined (__GMP_FORCE_mpn_neg)
+#if ! defined (__GMP_FORCE_mpn_neg)
+__GMP_EXTERN_INLINE
+#endif
+mp_limb_t
+mpn_neg (mp_ptr __gmp_rp, mp_srcptr __gmp_up, mp_size_t __gmp_n)
+{
+ while (*__gmp_up == 0) /* Low zero limbs are unchanged by negation. */
+ {
+ *__gmp_rp = 0;
+ if (!--__gmp_n) /* All zero */
+ return 0;
+ ++__gmp_up; ++__gmp_rp;
+ }
+
+ *__gmp_rp = (- *__gmp_up) & GMP_NUMB_MASK;
+
+ if (--__gmp_n) /* Higher limbs get complemented. */
+ mpn_com (++__gmp_rp, ++__gmp_up, __gmp_n);
+
+ return 1;
+}
+#endif
+
+#if defined (__cplusplus)
+}
+#endif
+
+
+/* Allow faster testing for negative, zero, and positive. */
+#define mpz_sgn(Z) ((Z)->_mp_size < 0 ? -1 : (Z)->_mp_size > 0)
+#define mpf_sgn(F) ((F)->_mp_size < 0 ? -1 : (F)->_mp_size > 0)
+#define mpq_sgn(Q) ((Q)->_mp_num._mp_size < 0 ? -1 : (Q)->_mp_num._mp_size > 0)
+
+/* When using GCC, optimize certain common comparisons. */
+#if defined (__GNUC__) && __GNUC__ >= 2
+#define mpz_cmp_ui(Z,UI) \
+ (__builtin_constant_p (UI) && (UI) == 0 \
+ ? mpz_sgn (Z) : _mpz_cmp_ui (Z,UI))
+#define mpz_cmp_si(Z,SI) \
+ (__builtin_constant_p ((SI) >= 0) && (SI) >= 0 \
+ ? mpz_cmp_ui (Z, __GMP_CAST (unsigned long, SI)) \
+ : _mpz_cmp_si (Z,SI))
+#define mpq_cmp_ui(Q,NUI,DUI) \
+ (__builtin_constant_p (NUI) && (NUI) == 0 ? mpq_sgn (Q) \
+ : __builtin_constant_p ((NUI) == (DUI)) && (NUI) == (DUI) \
+ ? mpz_cmp (mpq_numref (Q), mpq_denref (Q)) \
+ : _mpq_cmp_ui (Q,NUI,DUI))
+#define mpq_cmp_si(q,n,d) \
+ (__builtin_constant_p ((n) >= 0) && (n) >= 0 \
+ ? mpq_cmp_ui (q, __GMP_CAST (unsigned long, n), d) \
+ : _mpq_cmp_si (q, n, d))
+#else
+#define mpz_cmp_ui(Z,UI) _mpz_cmp_ui (Z,UI)
+#define mpz_cmp_si(Z,UI) _mpz_cmp_si (Z,UI)
+#define mpq_cmp_ui(Q,NUI,DUI) _mpq_cmp_ui (Q,NUI,DUI)
+#define mpq_cmp_si(q,n,d) _mpq_cmp_si(q,n,d)
+#endif
+
+
+/* Using "&" rather than "&&" means these can come out branch-free. Every
+ mpz_t has at least one limb allocated, so fetching the low limb is always
+ allowed. */
+#define mpz_odd_p(z) (((z)->_mp_size != 0) & __GMP_CAST (int, (z)->_mp_d[0]))
+#define mpz_even_p(z) (! mpz_odd_p (z))
+
+
+/**************** C++ routines ****************/
+
+#ifdef __cplusplus
+__GMP_DECLSPEC_XX std::ostream& operator<< (std::ostream &, mpz_srcptr);
+__GMP_DECLSPEC_XX std::ostream& operator<< (std::ostream &, mpq_srcptr);
+__GMP_DECLSPEC_XX std::ostream& operator<< (std::ostream &, mpf_srcptr);
+__GMP_DECLSPEC_XX std::istream& operator>> (std::istream &, mpz_ptr);
+__GMP_DECLSPEC_XX std::istream& operator>> (std::istream &, mpq_ptr);
+__GMP_DECLSPEC_XX std::istream& operator>> (std::istream &, mpf_ptr);
+#endif
+
+
+/* Source-level compatibility with GMP 2 and earlier. */
+#define mpn_divmod(qp,np,nsize,dp,dsize) \
+ mpn_divrem (qp, __GMP_CAST (mp_size_t, 0), np, nsize, dp, dsize)
+
+/* Source-level compatibility with GMP 1. */
+#define mpz_mdiv mpz_fdiv_q
+#define mpz_mdivmod mpz_fdiv_qr
+#define mpz_mmod mpz_fdiv_r
+#define mpz_mdiv_ui mpz_fdiv_q_ui
+#define mpz_mdivmod_ui(q,r,n,d) \
+ (((r) == 0) ? mpz_fdiv_q_ui (q,n,d) : mpz_fdiv_qr_ui (q,r,n,d))
+#define mpz_mmod_ui(r,n,d) \
+ (((r) == 0) ? mpz_fdiv_ui (n,d) : mpz_fdiv_r_ui (r,n,d))
+
+/* Useful synonyms, but not quite compatible with GMP 1. */
+#define mpz_div mpz_fdiv_q
+#define mpz_divmod mpz_fdiv_qr
+#define mpz_div_ui mpz_fdiv_q_ui
+#define mpz_divmod_ui mpz_fdiv_qr_ui
+#define mpz_div_2exp mpz_fdiv_q_2exp
+#define mpz_mod_2exp mpz_fdiv_r_2exp
+
+enum
+{
+ GMP_ERROR_NONE = 0,
+ GMP_ERROR_UNSUPPORTED_ARGUMENT = 1,
+ GMP_ERROR_DIVISION_BY_ZERO = 2,
+ GMP_ERROR_SQRT_OF_NEGATIVE = 4,
+ GMP_ERROR_INVALID_ARGUMENT = 8,
+ GMP_ERROR_MPZ_OVERFLOW = 16
+};
+
+/* Define CC and CFLAGS which were used to build this version of GMP */
+#define __GMP_CC "/workspace/xonotic/.tmp/misc/builddeps/emsdk/upstream/emscripten/emcc"
+#define __GMP_CFLAGS "-O2 -pedantic"
+
+/* Major version number is the value of __GNU_MP__ too, above. */
+#define __GNU_MP_VERSION 6
+#define __GNU_MP_VERSION_MINOR 3
+#define __GNU_MP_VERSION_PATCHLEVEL 0
+#define __GNU_MP_RELEASE (__GNU_MP_VERSION * 10000 + __GNU_MP_VERSION_MINOR * 100 + __GNU_MP_VERSION_PATCHLEVEL)
+
+#define __GMP_H__
+#endif /* __GMP_H__ */
--- /dev/null
+/* gmpxx.h -- C++ class wrapper for GMP types. -*- C++ -*-
+
+Copyright 2001-2003, 2006, 2008, 2011-2015, 2018 Free Software
+Foundation, Inc.
+
+This file is part of the GNU MP Library.
+
+The GNU MP Library is free software; you can redistribute it and/or modify
+it under the terms of either:
+
+ * the GNU Lesser General Public License as published by the Free
+ Software Foundation; either version 3 of the License, or (at your
+ option) any later version.
+
+or
+
+ * the GNU General Public License as published by the Free Software
+ Foundation; either version 2 of the License, or (at your option) any
+ later version.
+
+or both in parallel, as here.
+
+The GNU MP Library is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
+for more details.
+
+You should have received copies of the GNU General Public License and the
+GNU Lesser General Public License along with the GNU MP Library. If not,
+see https://www.gnu.org/licenses/. */
+
+#ifndef __GMP_PLUSPLUS__
+#define __GMP_PLUSPLUS__
+
+#include <iosfwd>
+
+#include <cstring> /* for strlen */
+#include <limits> /* numeric_limits */
+#include <utility>
+#include <algorithm> /* swap */
+#include <string>
+#include <stdexcept>
+#include <cfloat>
+#include <gmp.h>
+
+// wrapper for gcc's __builtin_constant_p
+// __builtin_constant_p has been in gcc since forever,
+// but g++-3.4 miscompiles it.
+#if __GMP_GNUC_PREREQ(4, 2)
+#define __GMPXX_CONSTANT(X) __builtin_constant_p(X)
+#else
+#define __GMPXX_CONSTANT(X) false
+#endif
+#define __GMPXX_CONSTANT_TRUE(X) (__GMPXX_CONSTANT(X) && (X))
+
+// Use C++11 features
+#ifndef __GMPXX_USE_CXX11
+#if __cplusplus >= 201103L
+#define __GMPXX_USE_CXX11 1
+#else
+#define __GMPXX_USE_CXX11 0
+#endif
+#endif
+
+#if __GMPXX_USE_CXX11
+#define __GMPXX_NOEXCEPT noexcept
+#include <type_traits> // for common_type
+#else
+#define __GMPXX_NOEXCEPT
+#endif
+
+// Max allocations for plain types when converted to GMP types
+#if GMP_NAIL_BITS != 0 && ! defined _LONG_LONG_LIMB
+#define __GMPZ_ULI_LIMBS 2
+#else
+#define __GMPZ_ULI_LIMBS 1
+#endif
+
+#define __GMPXX_BITS_TO_LIMBS(n) (((n) + (GMP_NUMB_BITS - 1)) / GMP_NUMB_BITS)
+#define __GMPZ_DBL_LIMBS __GMPXX_BITS_TO_LIMBS(DBL_MAX_EXP)+1
+#define __GMPQ_NUM_DBL_LIMBS __GMPZ_DBL_LIMBS
+#define __GMPQ_DEN_DBL_LIMBS __GMPXX_BITS_TO_LIMBS(DBL_MANT_DIG+1-DBL_MIN_EXP)+1
+// The final +1s are a security margin. The current implementation of
+// mpq_set_d seems to need it for the denominator.
+
+inline void __mpz_set_ui_safe(mpz_ptr p, unsigned long l)
+{
+ p->_mp_size = (l != 0);
+ p->_mp_d[0] = l & GMP_NUMB_MASK;
+#if __GMPZ_ULI_LIMBS > 1
+ l >>= GMP_NUMB_BITS;
+ p->_mp_d[1] = l;
+ p->_mp_size += (l != 0);
+#endif
+}
+
+inline void __mpz_set_si_safe(mpz_ptr p, long l)
+{
+ if(l < 0)
+ {
+ __mpz_set_ui_safe(p, -static_cast<unsigned long>(l));
+ mpz_neg(p, p);
+ }
+ else
+ __mpz_set_ui_safe(p, l);
+ // Note: we know the high bit of l is 0 so we could do slightly better
+}
+
+// Fake temporary variables
+#define __GMPXX_TMPZ_UI \
+ mpz_t temp; \
+ mp_limb_t limbs[__GMPZ_ULI_LIMBS]; \
+ temp->_mp_d = limbs; \
+ __mpz_set_ui_safe (temp, l)
+#define __GMPXX_TMPZ_SI \
+ mpz_t temp; \
+ mp_limb_t limbs[__GMPZ_ULI_LIMBS]; \
+ temp->_mp_d = limbs; \
+ __mpz_set_si_safe (temp, l)
+#define __GMPXX_TMPZ_D \
+ mpz_t temp; \
+ mp_limb_t limbs[__GMPZ_DBL_LIMBS]; \
+ temp->_mp_d = limbs; \
+ temp->_mp_alloc = __GMPZ_DBL_LIMBS; \
+ mpz_set_d (temp, d)
+
+#define __GMPXX_TMPQ_UI \
+ mpq_t temp; \
+ mp_limb_t limbs[__GMPZ_ULI_LIMBS+1]; \
+ mpq_numref(temp)->_mp_d = limbs; \
+ __mpz_set_ui_safe (mpq_numref(temp), l); \
+ mpq_denref(temp)->_mp_d = limbs + __GMPZ_ULI_LIMBS; \
+ mpq_denref(temp)->_mp_size = 1; \
+ mpq_denref(temp)->_mp_d[0] = 1
+#define __GMPXX_TMPQ_SI \
+ mpq_t temp; \
+ mp_limb_t limbs[__GMPZ_ULI_LIMBS+1]; \
+ mpq_numref(temp)->_mp_d = limbs; \
+ __mpz_set_si_safe (mpq_numref(temp), l); \
+ mpq_denref(temp)->_mp_d = limbs + __GMPZ_ULI_LIMBS; \
+ mpq_denref(temp)->_mp_size = 1; \
+ mpq_denref(temp)->_mp_d[0] = 1
+#define __GMPXX_TMPQ_D \
+ mpq_t temp; \
+ mp_limb_t limbs[__GMPQ_NUM_DBL_LIMBS + __GMPQ_DEN_DBL_LIMBS]; \
+ mpq_numref(temp)->_mp_d = limbs; \
+ mpq_numref(temp)->_mp_alloc = __GMPQ_NUM_DBL_LIMBS; \
+ mpq_denref(temp)->_mp_d = limbs + __GMPQ_NUM_DBL_LIMBS; \
+ mpq_denref(temp)->_mp_alloc = __GMPQ_DEN_DBL_LIMBS; \
+ mpq_set_d (temp, d)
+
+inline unsigned long __gmpxx_abs_ui (signed long l)
+{
+ return l >= 0 ? static_cast<unsigned long>(l)
+ : -static_cast<unsigned long>(l);
+}
+
+/**************** Function objects ****************/
+/* Any evaluation of a __gmp_expr ends up calling one of these functions
+ all intermediate functions being inline, the evaluation should optimize
+ to a direct call to the relevant function, thus yielding no overhead
+ over the C interface. */
+
+struct __gmp_unary_plus
+{
+ static void eval(mpz_ptr z, mpz_srcptr w) { mpz_set(z, w); }
+ static void eval(mpq_ptr q, mpq_srcptr r) { mpq_set(q, r); }
+ static void eval(mpf_ptr f, mpf_srcptr g) { mpf_set(f, g); }
+};
+
+struct __gmp_unary_minus
+{
+ static void eval(mpz_ptr z, mpz_srcptr w) { mpz_neg(z, w); }
+ static void eval(mpq_ptr q, mpq_srcptr r) { mpq_neg(q, r); }
+ static void eval(mpf_ptr f, mpf_srcptr g) { mpf_neg(f, g); }
+};
+
+struct __gmp_unary_com
+{
+ static void eval(mpz_ptr z, mpz_srcptr w) { mpz_com(z, w); }
+};
+
+struct __gmp_binary_plus
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mpz_srcptr v)
+ { mpz_add(z, w, v); }
+
+ static void eval(mpz_ptr z, mpz_srcptr w, unsigned long int l)
+ {
+ // Ideally, those checks should happen earlier so that the tree
+ // generated for a+0+b would just be sum(a,b).
+ if (__GMPXX_CONSTANT(l) && l == 0)
+ {
+ if (z != w) mpz_set(z, w);
+ }
+ else
+ mpz_add_ui(z, w, l);
+ }
+ static void eval(mpz_ptr z, unsigned long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, signed long int l)
+ {
+ if (l >= 0)
+ eval(z, w, static_cast<unsigned long>(l));
+ else
+ mpz_sub_ui(z, w, -static_cast<unsigned long>(l));
+ }
+ static void eval(mpz_ptr z, signed long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, double d)
+ { __GMPXX_TMPZ_D; mpz_add (z, w, temp); }
+ static void eval(mpz_ptr z, double d, mpz_srcptr w)
+ { eval(z, w, d); }
+
+ static void eval(mpq_ptr q, mpq_srcptr r, mpq_srcptr s)
+ { mpq_add(q, r, s); }
+
+ static void eval(mpq_ptr q, mpq_srcptr r, unsigned long int l)
+ {
+ if (__GMPXX_CONSTANT(l) && l == 0)
+ {
+ if (q != r) mpq_set(q, r);
+ }
+ else if (__GMPXX_CONSTANT(l) && l == 1)
+ {
+ mpz_add (mpq_numref(q), mpq_numref(r), mpq_denref(r));
+ if (q != r) mpz_set(mpq_denref(q), mpq_denref(r));
+ }
+ else
+ {
+ if (q == r)
+ mpz_addmul_ui(mpq_numref(q), mpq_denref(q), l);
+ else
+ {
+ mpz_mul_ui(mpq_numref(q), mpq_denref(r), l);
+ mpz_add(mpq_numref(q), mpq_numref(q), mpq_numref(r));
+ mpz_set(mpq_denref(q), mpq_denref(r));
+ }
+ }
+ }
+ static void eval(mpq_ptr q, unsigned long int l, mpq_srcptr r)
+ { eval(q, r, l); }
+ static inline void eval(mpq_ptr q, mpq_srcptr r, signed long int l);
+ // defined after __gmp_binary_minus
+ static void eval(mpq_ptr q, signed long int l, mpq_srcptr r)
+ { eval(q, r, l); }
+ static void eval(mpq_ptr q, mpq_srcptr r, double d)
+ { __GMPXX_TMPQ_D; mpq_add (q, r, temp); }
+ static void eval(mpq_ptr q, double d, mpq_srcptr r)
+ { eval(q, r, d); }
+
+ static void eval(mpq_ptr q, mpq_srcptr r, mpz_srcptr z)
+ {
+ if (q == r)
+ mpz_addmul(mpq_numref(q), mpq_denref(q), z);
+ else
+ {
+ mpz_mul(mpq_numref(q), mpq_denref(r), z);
+ mpz_add(mpq_numref(q), mpq_numref(q), mpq_numref(r));
+ mpz_set(mpq_denref(q), mpq_denref(r));
+ }
+ }
+ static void eval(mpq_ptr q, mpz_srcptr z, mpq_srcptr r)
+ { eval(q, r, z); }
+
+ static void eval(mpf_ptr f, mpf_srcptr g, mpf_srcptr h)
+ { mpf_add(f, g, h); }
+
+ static void eval(mpf_ptr f, mpf_srcptr g, unsigned long int l)
+ { mpf_add_ui(f, g, l); }
+ static void eval(mpf_ptr f, unsigned long int l, mpf_srcptr g)
+ { mpf_add_ui(f, g, l); }
+ static void eval(mpf_ptr f, mpf_srcptr g, signed long int l)
+ {
+ if (l >= 0)
+ mpf_add_ui(f, g, l);
+ else
+ mpf_sub_ui(f, g, -static_cast<unsigned long>(l));
+ }
+ static void eval(mpf_ptr f, signed long int l, mpf_srcptr g)
+ { eval(f, g, l); }
+ static void eval(mpf_ptr f, mpf_srcptr g, double d)
+ {
+ mpf_t temp;
+ mpf_init2(temp, 8*sizeof(double));
+ mpf_set_d(temp, d);
+ mpf_add(f, g, temp);
+ mpf_clear(temp);
+ }
+ static void eval(mpf_ptr f, double d, mpf_srcptr g)
+ { eval(f, g, d); }
+};
+
+struct __gmp_binary_minus
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mpz_srcptr v)
+ { mpz_sub(z, w, v); }
+
+ static void eval(mpz_ptr z, mpz_srcptr w, unsigned long int l)
+ {
+ if (__GMPXX_CONSTANT(l) && l == 0)
+ {
+ if (z != w) mpz_set(z, w);
+ }
+ else
+ mpz_sub_ui(z, w, l);
+ }
+ static void eval(mpz_ptr z, unsigned long int l, mpz_srcptr w)
+ {
+ if (__GMPXX_CONSTANT(l) && l == 0)
+ {
+ mpz_neg(z, w);
+ }
+ else
+ mpz_ui_sub(z, l, w);
+ }
+ static void eval(mpz_ptr z, mpz_srcptr w, signed long int l)
+ {
+ if (l >= 0)
+ eval(z, w, static_cast<unsigned long>(l));
+ else
+ mpz_add_ui(z, w, -static_cast<unsigned long>(l));
+ }
+ static void eval(mpz_ptr z, signed long int l, mpz_srcptr w)
+ {
+ if (l >= 0)
+ eval(z, static_cast<unsigned long>(l), w);
+ else
+ {
+ mpz_add_ui(z, w, -static_cast<unsigned long>(l));
+ mpz_neg(z, z);
+ }
+ }
+ static void eval(mpz_ptr z, mpz_srcptr w, double d)
+ { __GMPXX_TMPZ_D; mpz_sub (z, w, temp); }
+ static void eval(mpz_ptr z, double d, mpz_srcptr w)
+ { __GMPXX_TMPZ_D; mpz_sub (z, temp, w); }
+
+ static void eval(mpq_ptr q, mpq_srcptr r, mpq_srcptr s)
+ { mpq_sub(q, r, s); }
+
+ static void eval(mpq_ptr q, mpq_srcptr r, unsigned long int l)
+ {
+ if (__GMPXX_CONSTANT(l) && l == 0)
+ {
+ if (q != r) mpq_set(q, r);
+ }
+ else if (__GMPXX_CONSTANT(l) && l == 1)
+ {
+ mpz_sub (mpq_numref(q), mpq_numref(r), mpq_denref(r));
+ if (q != r) mpz_set(mpq_denref(q), mpq_denref(r));
+ }
+ else
+ {
+ if (q == r)
+ mpz_submul_ui(mpq_numref(q), mpq_denref(q), l);
+ else
+ {
+ mpz_mul_ui(mpq_numref(q), mpq_denref(r), l);
+ mpz_sub(mpq_numref(q), mpq_numref(r), mpq_numref(q));
+ mpz_set(mpq_denref(q), mpq_denref(r));
+ }
+ }
+ }
+ static void eval(mpq_ptr q, unsigned long int l, mpq_srcptr r)
+ { eval(q, r, l); mpq_neg(q, q); }
+ static void eval(mpq_ptr q, mpq_srcptr r, signed long int l)
+ {
+ if (l >= 0)
+ eval(q, r, static_cast<unsigned long>(l));
+ else
+ __gmp_binary_plus::eval(q, r, -static_cast<unsigned long>(l));
+ }
+ static void eval(mpq_ptr q, signed long int l, mpq_srcptr r)
+ { eval(q, r, l); mpq_neg(q, q); }
+ static void eval(mpq_ptr q, mpq_srcptr r, double d)
+ { __GMPXX_TMPQ_D; mpq_sub (q, r, temp); }
+ static void eval(mpq_ptr q, double d, mpq_srcptr r)
+ { __GMPXX_TMPQ_D; mpq_sub (q, temp, r); }
+
+ static void eval(mpq_ptr q, mpq_srcptr r, mpz_srcptr z)
+ {
+ if (q == r)
+ mpz_submul(mpq_numref(q), mpq_denref(q), z);
+ else
+ {
+ mpz_mul(mpq_numref(q), mpq_denref(r), z);
+ mpz_sub(mpq_numref(q), mpq_numref(r), mpq_numref(q));
+ mpz_set(mpq_denref(q), mpq_denref(r));
+ }
+ }
+ static void eval(mpq_ptr q, mpz_srcptr z, mpq_srcptr r)
+ { eval(q, r, z); mpq_neg(q, q); }
+
+ static void eval(mpf_ptr f, mpf_srcptr g, mpf_srcptr h)
+ { mpf_sub(f, g, h); }
+
+ static void eval(mpf_ptr f, mpf_srcptr g, unsigned long int l)
+ { mpf_sub_ui(f, g, l); }
+ static void eval(mpf_ptr f, unsigned long int l, mpf_srcptr g)
+ { mpf_ui_sub(f, l, g); }
+ static void eval(mpf_ptr f, mpf_srcptr g, signed long int l)
+ {
+ if (l >= 0)
+ mpf_sub_ui(f, g, l);
+ else
+ mpf_add_ui(f, g, -static_cast<unsigned long>(l));
+ }
+ static void eval(mpf_ptr f, signed long int l, mpf_srcptr g)
+ {
+ if (l >= 0)
+ mpf_sub_ui(f, g, l);
+ else
+ mpf_add_ui(f, g, -static_cast<unsigned long>(l));
+ mpf_neg(f, f);
+ }
+ static void eval(mpf_ptr f, mpf_srcptr g, double d)
+ {
+ mpf_t temp;
+ mpf_init2(temp, 8*sizeof(double));
+ mpf_set_d(temp, d);
+ mpf_sub(f, g, temp);
+ mpf_clear(temp);
+ }
+ static void eval(mpf_ptr f, double d, mpf_srcptr g)
+ {
+ mpf_t temp;
+ mpf_init2(temp, 8*sizeof(double));
+ mpf_set_d(temp, d);
+ mpf_sub(f, temp, g);
+ mpf_clear(temp);
+ }
+};
+
+// defined here so it can reference __gmp_binary_minus
+inline void
+__gmp_binary_plus::eval(mpq_ptr q, mpq_srcptr r, signed long int l)
+{
+ if (l >= 0)
+ eval(q, r, static_cast<unsigned long>(l));
+ else
+ __gmp_binary_minus::eval(q, r, -static_cast<unsigned long>(l));
+}
+
+struct __gmp_binary_lshift
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mp_bitcnt_t l)
+ {
+ if (__GMPXX_CONSTANT(l) && (l == 0))
+ {
+ if (z != w) mpz_set(z, w);
+ }
+ else
+ mpz_mul_2exp(z, w, l);
+ }
+ static void eval(mpq_ptr q, mpq_srcptr r, mp_bitcnt_t l)
+ {
+ if (__GMPXX_CONSTANT(l) && (l == 0))
+ {
+ if (q != r) mpq_set(q, r);
+ }
+ else
+ mpq_mul_2exp(q, r, l);
+ }
+ static void eval(mpf_ptr f, mpf_srcptr g, mp_bitcnt_t l)
+ { mpf_mul_2exp(f, g, l); }
+};
+
+struct __gmp_binary_rshift
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mp_bitcnt_t l)
+ {
+ if (__GMPXX_CONSTANT(l) && (l == 0))
+ {
+ if (z != w) mpz_set(z, w);
+ }
+ else
+ mpz_fdiv_q_2exp(z, w, l);
+ }
+ static void eval(mpq_ptr q, mpq_srcptr r, mp_bitcnt_t l)
+ {
+ if (__GMPXX_CONSTANT(l) && (l == 0))
+ {
+ if (q != r) mpq_set(q, r);
+ }
+ else
+ mpq_div_2exp(q, r, l);
+ }
+ static void eval(mpf_ptr f, mpf_srcptr g, mp_bitcnt_t l)
+ { mpf_div_2exp(f, g, l); }
+};
+
+struct __gmp_binary_multiplies
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mpz_srcptr v)
+ { mpz_mul(z, w, v); }
+
+ static void eval(mpz_ptr z, mpz_srcptr w, unsigned long int l)
+ {
+// gcc-3.3 doesn't have __builtin_ctzl. Don't bother optimizing for old gcc.
+#if __GMP_GNUC_PREREQ(3, 4)
+ if (__GMPXX_CONSTANT(l) && (l & (l-1)) == 0)
+ {
+ if (l == 0)
+ {
+ z->_mp_size = 0;
+ }
+ else
+ {
+ __gmp_binary_lshift::eval(z, w, __builtin_ctzl(l));
+ }
+ }
+ else
+#endif
+ mpz_mul_ui(z, w, l);
+ }
+ static void eval(mpz_ptr z, unsigned long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, signed long int l)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l >= 0))
+ eval(z, w, static_cast<unsigned long>(l));
+ else if (__GMPXX_CONSTANT_TRUE(l <= 0))
+ {
+ eval(z, w, -static_cast<unsigned long>(l));
+ mpz_neg(z, z);
+ }
+ else
+ mpz_mul_si (z, w, l);
+ }
+ static void eval(mpz_ptr z, signed long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, double d)
+ { __GMPXX_TMPZ_D; mpz_mul (z, w, temp); }
+ static void eval(mpz_ptr z, double d, mpz_srcptr w)
+ { eval(z, w, d); }
+
+ static void eval(mpq_ptr q, mpq_srcptr r, mpq_srcptr s)
+ { mpq_mul(q, r, s); }
+
+ static void eval(mpq_ptr q, mpq_srcptr r, unsigned long int l)
+ {
+#if __GMP_GNUC_PREREQ(3, 4)
+ if (__GMPXX_CONSTANT(l) && (l & (l-1)) == 0)
+ {
+ if (l == 0)
+ {
+ mpq_set_ui(q, 0, 1);
+ }
+ else
+ {
+ __gmp_binary_lshift::eval(q, r, __builtin_ctzl(l));
+ }
+ }
+ else
+#endif
+ {
+ __GMPXX_TMPQ_UI;
+ mpq_mul (q, r, temp);
+ }
+ }
+ static void eval(mpq_ptr q, unsigned long int l, mpq_srcptr r)
+ { eval(q, r, l); }
+ static void eval(mpq_ptr q, mpq_srcptr r, signed long int l)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l >= 0))
+ eval(q, r, static_cast<unsigned long>(l));
+ else if (__GMPXX_CONSTANT_TRUE(l <= 0))
+ {
+ eval(q, r, -static_cast<unsigned long>(l));
+ mpq_neg(q, q);
+ }
+ else
+ {
+ __GMPXX_TMPQ_SI;
+ mpq_mul (q, r, temp);
+ }
+ }
+ static void eval(mpq_ptr q, signed long int l, mpq_srcptr r)
+ { eval(q, r, l); }
+ static void eval(mpq_ptr q, mpq_srcptr r, double d)
+ { __GMPXX_TMPQ_D; mpq_mul (q, r, temp); }
+ static void eval(mpq_ptr q, double d, mpq_srcptr r)
+ { eval(q, r, d); }
+
+ static void eval(mpf_ptr f, mpf_srcptr g, mpf_srcptr h)
+ { mpf_mul(f, g, h); }
+
+ static void eval(mpf_ptr f, mpf_srcptr g, unsigned long int l)
+ { mpf_mul_ui(f, g, l); }
+ static void eval(mpf_ptr f, unsigned long int l, mpf_srcptr g)
+ { mpf_mul_ui(f, g, l); }
+ static void eval(mpf_ptr f, mpf_srcptr g, signed long int l)
+ {
+ if (l >= 0)
+ mpf_mul_ui(f, g, l);
+ else
+ {
+ mpf_mul_ui(f, g, -static_cast<unsigned long>(l));
+ mpf_neg(f, f);
+ }
+ }
+ static void eval(mpf_ptr f, signed long int l, mpf_srcptr g)
+ { eval(f, g, l); }
+ static void eval(mpf_ptr f, mpf_srcptr g, double d)
+ {
+ mpf_t temp;
+ mpf_init2(temp, 8*sizeof(double));
+ mpf_set_d(temp, d);
+ mpf_mul(f, g, temp);
+ mpf_clear(temp);
+ }
+ static void eval(mpf_ptr f, double d, mpf_srcptr g)
+ { eval(f, g, d); }
+};
+
+struct __gmp_binary_divides
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mpz_srcptr v)
+ { mpz_tdiv_q(z, w, v); }
+
+ static void eval(mpz_ptr z, mpz_srcptr w, unsigned long int l)
+ {
+#if __GMP_GNUC_PREREQ(3, 4)
+ // Don't optimize division by 0...
+ if (__GMPXX_CONSTANT(l) && (l & (l-1)) == 0 && l != 0)
+ {
+ if (l == 1)
+ {
+ if (z != w) mpz_set(z, w);
+ }
+ else
+ mpz_tdiv_q_2exp(z, w, __builtin_ctzl(l));
+ // warning: do not use rshift (fdiv)
+ }
+ else
+#endif
+ mpz_tdiv_q_ui(z, w, l);
+ }
+ static void eval(mpz_ptr z, unsigned long int l, mpz_srcptr w)
+ {
+ if (mpz_sgn(w) >= 0)
+ {
+ if (mpz_fits_ulong_p(w))
+ mpz_set_ui(z, l / mpz_get_ui(w));
+ else
+ mpz_set_ui(z, 0);
+ }
+ else
+ {
+ mpz_neg(z, w);
+ if (mpz_fits_ulong_p(z))
+ {
+ mpz_set_ui(z, l / mpz_get_ui(z));
+ mpz_neg(z, z);
+ }
+ else
+ mpz_set_ui(z, 0);
+ }
+ }
+ static void eval(mpz_ptr z, mpz_srcptr w, signed long int l)
+ {
+ if (l >= 0)
+ eval(z, w, static_cast<unsigned long>(l));
+ else
+ {
+ eval(z, w, -static_cast<unsigned long>(l));
+ mpz_neg(z, z);
+ }
+ }
+ static void eval(mpz_ptr z, signed long int l, mpz_srcptr w)
+ {
+ if (mpz_fits_slong_p(w))
+ mpz_set_si(z, l / mpz_get_si(w));
+ else
+ {
+ /* if w is bigger than a long then the quotient must be zero, unless
+ l==LONG_MIN and w==-LONG_MIN in which case the quotient is -1 */
+ mpz_set_si (z, (mpz_cmpabs_ui (w, __gmpxx_abs_ui(l)) == 0 ? -1 : 0));
+ }
+ }
+ static void eval(mpz_ptr z, mpz_srcptr w, double d)
+ { __GMPXX_TMPZ_D; mpz_tdiv_q (z, w, temp); }
+ static void eval(mpz_ptr z, double d, mpz_srcptr w)
+ { __GMPXX_TMPZ_D; mpz_tdiv_q (z, temp, w); }
+
+ static void eval(mpq_ptr q, mpq_srcptr r, mpq_srcptr s)
+ { mpq_div(q, r, s); }
+
+ static void eval(mpq_ptr q, mpq_srcptr r, unsigned long int l)
+ {
+#if __GMP_GNUC_PREREQ(3, 4)
+ if (__GMPXX_CONSTANT(l) && (l & (l-1)) == 0 && l != 0)
+ __gmp_binary_rshift::eval(q, r, __builtin_ctzl(l));
+ else
+#endif
+ {
+ __GMPXX_TMPQ_UI;
+ mpq_div (q, r, temp);
+ }
+ }
+ static void eval(mpq_ptr q, unsigned long int l, mpq_srcptr r)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l == 0))
+ mpq_set_ui(q, 0, 1);
+ else if (__GMPXX_CONSTANT_TRUE(l == 1))
+ mpq_inv(q, r);
+ else
+ {
+ __GMPXX_TMPQ_UI;
+ mpq_div (q, temp, r);
+ }
+ }
+ static void eval(mpq_ptr q, mpq_srcptr r, signed long int l)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l >= 0))
+ eval(q, r, static_cast<unsigned long>(l));
+ else if (__GMPXX_CONSTANT_TRUE(l <= 0))
+ {
+ eval(q, r, -static_cast<unsigned long>(l));
+ mpq_neg(q, q);
+ }
+ else
+ {
+ __GMPXX_TMPQ_SI;
+ mpq_div (q, r, temp);
+ }
+ }
+ static void eval(mpq_ptr q, signed long int l, mpq_srcptr r)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l == 0))
+ mpq_set_ui(q, 0, 1);
+ else if (__GMPXX_CONSTANT_TRUE(l == 1))
+ mpq_inv(q, r);
+ else if (__GMPXX_CONSTANT_TRUE(l == -1))
+ {
+ mpq_inv(q, r);
+ mpq_neg(q, q);
+ }
+ else
+ {
+ __GMPXX_TMPQ_SI;
+ mpq_div (q, temp, r);
+ }
+ }
+ static void eval(mpq_ptr q, mpq_srcptr r, double d)
+ { __GMPXX_TMPQ_D; mpq_div (q, r, temp); }
+ static void eval(mpq_ptr q, double d, mpq_srcptr r)
+ { __GMPXX_TMPQ_D; mpq_div (q, temp, r); }
+
+ static void eval(mpf_ptr f, mpf_srcptr g, mpf_srcptr h)
+ { mpf_div(f, g, h); }
+
+ static void eval(mpf_ptr f, mpf_srcptr g, unsigned long int l)
+ { mpf_div_ui(f, g, l); }
+ static void eval(mpf_ptr f, unsigned long int l, mpf_srcptr g)
+ { mpf_ui_div(f, l, g); }
+ static void eval(mpf_ptr f, mpf_srcptr g, signed long int l)
+ {
+ if (l >= 0)
+ mpf_div_ui(f, g, l);
+ else
+ {
+ mpf_div_ui(f, g, -static_cast<unsigned long>(l));
+ mpf_neg(f, f);
+ }
+ }
+ static void eval(mpf_ptr f, signed long int l, mpf_srcptr g)
+ {
+ if (l >= 0)
+ mpf_ui_div(f, l, g);
+ else
+ {
+ mpf_ui_div(f, -static_cast<unsigned long>(l), g);
+ mpf_neg(f, f);
+ }
+ }
+ static void eval(mpf_ptr f, mpf_srcptr g, double d)
+ {
+ mpf_t temp;
+ mpf_init2(temp, 8*sizeof(double));
+ mpf_set_d(temp, d);
+ mpf_div(f, g, temp);
+ mpf_clear(temp);
+ }
+ static void eval(mpf_ptr f, double d, mpf_srcptr g)
+ {
+ mpf_t temp;
+ mpf_init2(temp, 8*sizeof(double));
+ mpf_set_d(temp, d);
+ mpf_div(f, temp, g);
+ mpf_clear(temp);
+ }
+};
+
+struct __gmp_binary_modulus
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mpz_srcptr v)
+ { mpz_tdiv_r(z, w, v); }
+
+ static void eval(mpz_ptr z, mpz_srcptr w, unsigned long int l)
+ { mpz_tdiv_r_ui(z, w, l); }
+ static void eval(mpz_ptr z, unsigned long int l, mpz_srcptr w)
+ {
+ if (mpz_sgn(w) >= 0)
+ {
+ if (mpz_fits_ulong_p(w))
+ mpz_set_ui(z, l % mpz_get_ui(w));
+ else
+ mpz_set_ui(z, l);
+ }
+ else
+ {
+ mpz_neg(z, w);
+ if (mpz_fits_ulong_p(z))
+ mpz_set_ui(z, l % mpz_get_ui(z));
+ else
+ mpz_set_ui(z, l);
+ }
+ }
+ static void eval(mpz_ptr z, mpz_srcptr w, signed long int l)
+ {
+ mpz_tdiv_r_ui (z, w, __gmpxx_abs_ui(l));
+ }
+ static void eval(mpz_ptr z, signed long int l, mpz_srcptr w)
+ {
+ if (mpz_fits_slong_p(w))
+ mpz_set_si(z, l % mpz_get_si(w));
+ else
+ {
+ /* if w is bigger than a long then the remainder is l unchanged,
+ unless l==LONG_MIN and w==-LONG_MIN in which case it's 0 */
+ mpz_set_si (z, mpz_cmpabs_ui (w, __gmpxx_abs_ui(l)) == 0 ? 0 : l);
+ }
+ }
+ static void eval(mpz_ptr z, mpz_srcptr w, double d)
+ { __GMPXX_TMPZ_D; mpz_tdiv_r (z, w, temp); }
+ static void eval(mpz_ptr z, double d, mpz_srcptr w)
+ { __GMPXX_TMPZ_D; mpz_tdiv_r (z, temp, w); }
+};
+
+struct __gmp_binary_and
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mpz_srcptr v)
+ { mpz_and(z, w, v); }
+
+ static void eval(mpz_ptr z, mpz_srcptr w, unsigned long int l)
+ { __GMPXX_TMPZ_UI; mpz_and (z, w, temp); }
+ static void eval(mpz_ptr z, unsigned long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, signed long int l)
+ { __GMPXX_TMPZ_SI; mpz_and (z, w, temp); }
+ static void eval(mpz_ptr z, signed long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, double d)
+ { __GMPXX_TMPZ_D; mpz_and (z, w, temp); }
+ static void eval(mpz_ptr z, double d, mpz_srcptr w)
+ { eval(z, w, d); }
+};
+
+struct __gmp_binary_ior
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mpz_srcptr v)
+ { mpz_ior(z, w, v); }
+ static void eval(mpz_ptr z, mpz_srcptr w, unsigned long int l)
+ { __GMPXX_TMPZ_UI; mpz_ior (z, w, temp); }
+ static void eval(mpz_ptr z, unsigned long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, signed long int l)
+ { __GMPXX_TMPZ_SI; mpz_ior (z, w, temp); }
+ static void eval(mpz_ptr z, signed long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, double d)
+ { __GMPXX_TMPZ_D; mpz_ior (z, w, temp); }
+ static void eval(mpz_ptr z, double d, mpz_srcptr w)
+ { eval(z, w, d); }
+};
+
+struct __gmp_binary_xor
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mpz_srcptr v)
+ { mpz_xor(z, w, v); }
+ static void eval(mpz_ptr z, mpz_srcptr w, unsigned long int l)
+ { __GMPXX_TMPZ_UI; mpz_xor (z, w, temp); }
+ static void eval(mpz_ptr z, unsigned long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, signed long int l)
+ { __GMPXX_TMPZ_SI; mpz_xor (z, w, temp); }
+ static void eval(mpz_ptr z, signed long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, double d)
+ { __GMPXX_TMPZ_D; mpz_xor (z, w, temp); }
+ static void eval(mpz_ptr z, double d, mpz_srcptr w)
+ { eval(z, w, d); }
+};
+
+struct __gmp_cmp_function
+{
+ static int eval(mpz_srcptr z, mpz_srcptr w) { return mpz_cmp(z, w); }
+
+ static int eval(mpz_srcptr z, unsigned long int l)
+ { return mpz_cmp_ui(z, l); }
+ static int eval(unsigned long int l, mpz_srcptr z)
+ { return -mpz_cmp_ui(z, l); }
+ static int eval(mpz_srcptr z, signed long int l)
+ { return mpz_cmp_si(z, l); }
+ static int eval(signed long int l, mpz_srcptr z)
+ { return -mpz_cmp_si(z, l); }
+ static int eval(mpz_srcptr z, double d)
+ { return mpz_cmp_d(z, d); }
+ static int eval(double d, mpz_srcptr z)
+ { return -mpz_cmp_d(z, d); }
+
+ static int eval(mpq_srcptr q, mpq_srcptr r) { return mpq_cmp(q, r); }
+
+ static int eval(mpq_srcptr q, unsigned long int l)
+ { return mpq_cmp_ui(q, l, 1); }
+ static int eval(unsigned long int l, mpq_srcptr q)
+ { return -mpq_cmp_ui(q, l, 1); }
+ static int eval(mpq_srcptr q, signed long int l)
+ { return mpq_cmp_si(q, l, 1); }
+ static int eval(signed long int l, mpq_srcptr q)
+ { return -mpq_cmp_si(q, l, 1); }
+ static int eval(mpq_srcptr q, double d)
+ { __GMPXX_TMPQ_D; return mpq_cmp (q, temp); }
+ static int eval(double d, mpq_srcptr q)
+ { __GMPXX_TMPQ_D; return mpq_cmp (temp, q); }
+ static int eval(mpq_srcptr q, mpz_srcptr z)
+ { return mpq_cmp_z(q, z); }
+ static int eval(mpz_srcptr z, mpq_srcptr q)
+ { return -mpq_cmp_z(q, z); }
+
+ static int eval(mpf_srcptr f, mpf_srcptr g) { return mpf_cmp(f, g); }
+
+ static int eval(mpf_srcptr f, unsigned long int l)
+ { return mpf_cmp_ui(f, l); }
+ static int eval(unsigned long int l, mpf_srcptr f)
+ { return -mpf_cmp_ui(f, l); }
+ static int eval(mpf_srcptr f, signed long int l)
+ { return mpf_cmp_si(f, l); }
+ static int eval(signed long int l, mpf_srcptr f)
+ { return -mpf_cmp_si(f, l); }
+ static int eval(mpf_srcptr f, double d)
+ { return mpf_cmp_d(f, d); }
+ static int eval(double d, mpf_srcptr f)
+ { return -mpf_cmp_d(f, d); }
+ static int eval(mpf_srcptr f, mpz_srcptr z)
+ { return mpf_cmp_z(f, z); }
+ static int eval(mpz_srcptr z, mpf_srcptr f)
+ { return -mpf_cmp_z(f, z); }
+ static int eval(mpf_srcptr f, mpq_srcptr q)
+ {
+ mpf_t qf;
+ mpf_init(qf); /* Should we use the precision of f? */
+ mpf_set_q(qf, q);
+ int ret = eval(f, qf);
+ mpf_clear(qf);
+ return ret;
+ }
+ static int eval(mpq_srcptr q, mpf_srcptr f)
+ { return -eval(f, q); }
+};
+
+struct __gmp_binary_equal
+{
+ static bool eval(mpz_srcptr z, mpz_srcptr w) { return mpz_cmp(z, w) == 0; }
+
+ static bool eval(mpz_srcptr z, unsigned long int l)
+ { return mpz_cmp_ui(z, l) == 0; }
+ static bool eval(unsigned long int l, mpz_srcptr z)
+ { return eval(z, l); }
+ static bool eval(mpz_srcptr z, signed long int l)
+ { return mpz_cmp_si(z, l) == 0; }
+ static bool eval(signed long int l, mpz_srcptr z)
+ { return eval(z, l); }
+ static bool eval(mpz_srcptr z, double d)
+ { return mpz_cmp_d(z, d) == 0; }
+ static bool eval(double d, mpz_srcptr z)
+ { return eval(z, d); }
+
+ static bool eval(mpq_srcptr q, mpq_srcptr r)
+ { return mpq_equal(q, r) != 0; }
+
+ static bool eval(mpq_srcptr q, unsigned long int l)
+ { return ((__GMPXX_CONSTANT(l) && l == 0) ||
+ mpz_cmp_ui(mpq_denref(q), 1) == 0) &&
+ mpz_cmp_ui(mpq_numref(q), l) == 0; }
+ static bool eval(unsigned long int l, mpq_srcptr q)
+ { return eval(q, l); }
+ static bool eval(mpq_srcptr q, signed long int l)
+ { return ((__GMPXX_CONSTANT(l) && l == 0) ||
+ mpz_cmp_ui(mpq_denref(q), 1) == 0) &&
+ mpz_cmp_si(mpq_numref(q), l) == 0; }
+ static bool eval(signed long int l, mpq_srcptr q)
+ { return eval(q, l); }
+ static bool eval(mpq_srcptr q, double d)
+ { __GMPXX_TMPQ_D; return mpq_equal (q, temp) != 0; }
+ static bool eval(double d, mpq_srcptr q)
+ { return eval(q, d); }
+ static bool eval(mpq_srcptr q, mpz_srcptr z)
+ { return mpz_cmp_ui(mpq_denref(q), 1) == 0 && mpz_cmp(mpq_numref(q), z) == 0; }
+ static bool eval(mpz_srcptr z, mpq_srcptr q)
+ { return eval(q, z); }
+
+ static bool eval(mpf_srcptr f, mpf_srcptr g) { return mpf_cmp(f, g) == 0; }
+
+ static bool eval(mpf_srcptr f, unsigned long int l)
+ { return mpf_cmp_ui(f, l) == 0; }
+ static bool eval(unsigned long int l, mpf_srcptr f)
+ { return eval(f, l); }
+ static bool eval(mpf_srcptr f, signed long int l)
+ { return mpf_cmp_si(f, l) == 0; }
+ static bool eval(signed long int l, mpf_srcptr f)
+ { return eval(f, l); }
+ static bool eval(mpf_srcptr f, double d)
+ { return mpf_cmp_d(f, d) == 0; }
+ static bool eval(double d, mpf_srcptr f)
+ { return eval(f, d); }
+ static bool eval(mpf_srcptr f, mpz_srcptr z)
+ { return mpf_cmp_z(f, z) == 0; }
+ static bool eval(mpz_srcptr z, mpf_srcptr f)
+ { return eval(f, z); }
+ static bool eval(mpf_srcptr f, mpq_srcptr q)
+ { return __gmp_cmp_function::eval(f, q) == 0; }
+ static bool eval(mpq_srcptr q, mpf_srcptr f)
+ { return eval(f, q); }
+};
+
+struct __gmp_binary_less
+{
+ static bool eval(mpz_srcptr z, mpz_srcptr w) { return mpz_cmp(z, w) < 0; }
+
+ static bool eval(mpz_srcptr z, unsigned long int l)
+ { return mpz_cmp_ui(z, l) < 0; }
+ static bool eval(unsigned long int l, mpz_srcptr z)
+ { return mpz_cmp_ui(z, l) > 0; }
+ static bool eval(mpz_srcptr z, signed long int l)
+ { return mpz_cmp_si(z, l) < 0; }
+ static bool eval(signed long int l, mpz_srcptr z)
+ { return mpz_cmp_si(z, l) > 0; }
+ static bool eval(mpz_srcptr z, double d)
+ { return mpz_cmp_d(z, d) < 0; }
+ static bool eval(double d, mpz_srcptr z)
+ { return mpz_cmp_d(z, d) > 0; }
+
+ static bool eval(mpq_srcptr q, mpq_srcptr r) { return mpq_cmp(q, r) < 0; }
+
+ static bool eval(mpq_srcptr q, unsigned long int l)
+ { return mpq_cmp_ui(q, l, 1) < 0; }
+ static bool eval(unsigned long int l, mpq_srcptr q)
+ { return mpq_cmp_ui(q, l, 1) > 0; }
+ static bool eval(mpq_srcptr q, signed long int l)
+ { return mpq_cmp_si(q, l, 1) < 0; }
+ static bool eval(signed long int l, mpq_srcptr q)
+ { return mpq_cmp_si(q, l, 1) > 0; }
+ static bool eval(mpq_srcptr q, double d)
+ { __GMPXX_TMPQ_D; return mpq_cmp (q, temp) < 0; }
+ static bool eval(double d, mpq_srcptr q)
+ { __GMPXX_TMPQ_D; return mpq_cmp (temp, q) < 0; }
+ static bool eval(mpq_srcptr q, mpz_srcptr z)
+ { return mpq_cmp_z(q, z) < 0; }
+ static bool eval(mpz_srcptr z, mpq_srcptr q)
+ { return mpq_cmp_z(q, z) > 0; }
+
+ static bool eval(mpf_srcptr f, mpf_srcptr g) { return mpf_cmp(f, g) < 0; }
+
+ static bool eval(mpf_srcptr f, unsigned long int l)
+ { return mpf_cmp_ui(f, l) < 0; }
+ static bool eval(unsigned long int l, mpf_srcptr f)
+ { return mpf_cmp_ui(f, l) > 0; }
+ static bool eval(mpf_srcptr f, signed long int l)
+ { return mpf_cmp_si(f, l) < 0; }
+ static bool eval(signed long int l, mpf_srcptr f)
+ { return mpf_cmp_si(f, l) > 0; }
+ static bool eval(mpf_srcptr f, double d)
+ { return mpf_cmp_d(f, d) < 0; }
+ static bool eval(double d, mpf_srcptr f)
+ { return mpf_cmp_d(f, d) > 0; }
+ static bool eval(mpf_srcptr f, mpz_srcptr z)
+ { return mpf_cmp_z(f, z) < 0; }
+ static bool eval(mpz_srcptr z, mpf_srcptr f)
+ { return mpf_cmp_z(f, z) > 0; }
+ static bool eval(mpf_srcptr f, mpq_srcptr q)
+ { return __gmp_cmp_function::eval(f, q) < 0; }
+ static bool eval(mpq_srcptr q, mpf_srcptr f)
+ { return __gmp_cmp_function::eval(q, f) < 0; }
+};
+
+struct __gmp_binary_greater
+{
+ template <class T, class U>
+ static inline bool eval(T t, U u) { return __gmp_binary_less::eval(u, t); }
+};
+
+struct __gmp_unary_increment
+{
+ static void eval(mpz_ptr z) { mpz_add_ui(z, z, 1); }
+ static void eval(mpq_ptr q)
+ { mpz_add(mpq_numref(q), mpq_numref(q), mpq_denref(q)); }
+ static void eval(mpf_ptr f) { mpf_add_ui(f, f, 1); }
+};
+
+struct __gmp_unary_decrement
+{
+ static void eval(mpz_ptr z) { mpz_sub_ui(z, z, 1); }
+ static void eval(mpq_ptr q)
+ { mpz_sub(mpq_numref(q), mpq_numref(q), mpq_denref(q)); }
+ static void eval(mpf_ptr f) { mpf_sub_ui(f, f, 1); }
+};
+
+struct __gmp_abs_function
+{
+ static void eval(mpz_ptr z, mpz_srcptr w) { mpz_abs(z, w); }
+ static void eval(mpq_ptr q, mpq_srcptr r) { mpq_abs(q, r); }
+ static void eval(mpf_ptr f, mpf_srcptr g) { mpf_abs(f, g); }
+};
+
+struct __gmp_trunc_function
+{
+ static void eval(mpf_ptr f, mpf_srcptr g) { mpf_trunc(f, g); }
+};
+
+struct __gmp_floor_function
+{
+ static void eval(mpf_ptr f, mpf_srcptr g) { mpf_floor(f, g); }
+};
+
+struct __gmp_ceil_function
+{
+ static void eval(mpf_ptr f, mpf_srcptr g) { mpf_ceil(f, g); }
+};
+
+struct __gmp_sqrt_function
+{
+ static void eval(mpz_ptr z, mpz_srcptr w) { mpz_sqrt(z, w); }
+ static void eval(mpf_ptr f, mpf_srcptr g) { mpf_sqrt(f, g); }
+};
+
+struct __gmp_hypot_function
+{
+ static void eval(mpf_ptr f, mpf_srcptr g, mpf_srcptr h)
+ {
+ mpf_t temp;
+ mpf_init2(temp, mpf_get_prec(f));
+ mpf_mul(temp, g, g);
+ mpf_mul(f, h, h);
+ mpf_add(f, f, temp);
+ mpf_sqrt(f, f);
+ mpf_clear(temp);
+ }
+
+ static void eval(mpf_ptr f, mpf_srcptr g, unsigned long int l)
+ {
+ mpf_t temp;
+ mpf_init2(temp, mpf_get_prec(f));
+ mpf_mul(temp, g, g);
+ mpf_set_ui(f, l);
+ mpf_mul_ui(f, f, l);
+ mpf_add(f, f, temp);
+ mpf_clear(temp);
+ mpf_sqrt(f, f);
+ }
+ static void eval(mpf_ptr f, unsigned long int l, mpf_srcptr g)
+ { eval(f, g, l); }
+ static void eval(mpf_ptr f, mpf_srcptr g, signed long int l)
+ { eval(f, g, __gmpxx_abs_ui(l)); }
+ static void eval(mpf_ptr f, signed long int l, mpf_srcptr g)
+ { eval(f, g, l); }
+ static void eval(mpf_ptr f, mpf_srcptr g, double d)
+ {
+ mpf_t temp;
+ mpf_init2(temp, mpf_get_prec(f));
+ mpf_mul(temp, g, g);
+ mpf_set_d(f, d);
+ mpf_mul(f, f, f);
+ mpf_add(f, f, temp);
+ mpf_sqrt(f, f);
+ mpf_clear(temp);
+ }
+ static void eval(mpf_ptr f, double d, mpf_srcptr g)
+ { eval(f, g, d); }
+};
+
+struct __gmp_sgn_function
+{
+ static int eval(mpz_srcptr z) { return mpz_sgn(z); }
+ static int eval(mpq_srcptr q) { return mpq_sgn(q); }
+ static int eval(mpf_srcptr f) { return mpf_sgn(f); }
+};
+
+struct __gmp_gcd_function
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mpz_srcptr v)
+ { mpz_gcd(z, w, v); }
+ static void eval(mpz_ptr z, mpz_srcptr w, unsigned long int l)
+ { mpz_gcd_ui(z, w, l); }
+ static void eval(mpz_ptr z, unsigned long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, signed long int l)
+ { eval(z, w, __gmpxx_abs_ui(l)); }
+ static void eval(mpz_ptr z, signed long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, double d)
+ { __GMPXX_TMPZ_D; mpz_gcd (z, w, temp); }
+ static void eval(mpz_ptr z, double d, mpz_srcptr w)
+ { eval(z, w, d); }
+};
+
+struct __gmp_lcm_function
+{
+ static void eval(mpz_ptr z, mpz_srcptr w, mpz_srcptr v)
+ { mpz_lcm(z, w, v); }
+ static void eval(mpz_ptr z, mpz_srcptr w, unsigned long int l)
+ { mpz_lcm_ui(z, w, l); }
+ static void eval(mpz_ptr z, unsigned long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, signed long int l)
+ { eval(z, w, __gmpxx_abs_ui(l)); }
+ static void eval(mpz_ptr z, signed long int l, mpz_srcptr w)
+ { eval(z, w, l); }
+ static void eval(mpz_ptr z, mpz_srcptr w, double d)
+ { __GMPXX_TMPZ_D; mpz_lcm (z, w, temp); }
+ static void eval(mpz_ptr z, double d, mpz_srcptr w)
+ { eval(z, w, d); }
+};
+
+struct __gmp_rand_function
+{
+ static void eval(mpz_ptr z, gmp_randstate_t s, mp_bitcnt_t l)
+ { mpz_urandomb(z, s, l); }
+ static void eval(mpz_ptr z, gmp_randstate_t s, mpz_srcptr w)
+ { mpz_urandomm(z, s, w); }
+ static void eval(mpf_ptr f, gmp_randstate_t s, mp_bitcnt_t prec)
+ { mpf_urandomb(f, s, prec); }
+};
+
+struct __gmp_fac_function
+{
+ static void eval(mpz_ptr z, unsigned long l) { mpz_fac_ui(z, l); }
+ static void eval(mpz_ptr z, signed long l)
+ {
+ if (l < 0)
+ throw std::domain_error ("factorial(negative)");
+ eval(z, static_cast<unsigned long>(l));
+ }
+ static void eval(mpz_ptr z, mpz_srcptr w)
+ {
+ if (!mpz_fits_ulong_p(w))
+ {
+ if (mpz_sgn(w) < 0)
+ throw std::domain_error ("factorial(negative)");
+ else
+ throw std::bad_alloc(); // or std::overflow_error ("factorial")?
+ }
+ eval(z, mpz_get_ui(w));
+ }
+ static void eval(mpz_ptr z, double d)
+ { __GMPXX_TMPZ_D; eval (z, temp); }
+};
+
+struct __gmp_primorial_function
+{
+ static void eval(mpz_ptr z, unsigned long l) { mpz_primorial_ui(z, l); }
+ static void eval(mpz_ptr z, signed long l)
+ {
+ if (l < 0)
+ throw std::domain_error ("primorial(negative)");
+ eval(z, static_cast<unsigned long>(l));
+ }
+ static void eval(mpz_ptr z, mpz_srcptr w)
+ {
+ if (!mpz_fits_ulong_p(w))
+ {
+ if (mpz_sgn(w) < 0)
+ throw std::domain_error ("primorial(negative)");
+ else
+ throw std::bad_alloc(); // or std::overflow_error ("primorial")?
+ }
+ eval(z, mpz_get_ui(w));
+ }
+ static void eval(mpz_ptr z, double d)
+ { __GMPXX_TMPZ_D; eval (z, temp); }
+};
+
+struct __gmp_fib_function
+{
+ static void eval(mpz_ptr z, unsigned long l) { mpz_fib_ui(z, l); }
+ static void eval(mpz_ptr z, signed long l)
+ {
+ if (l < 0)
+ {
+ eval(z, -static_cast<unsigned long>(l));
+ if ((l & 1) == 0)
+ mpz_neg(z, z);
+ }
+ else
+ eval(z, static_cast<unsigned long>(l));
+ }
+ static void eval(mpz_ptr z, mpz_srcptr w)
+ {
+ if (!mpz_fits_slong_p(w))
+ throw std::bad_alloc(); // or std::overflow_error ("fibonacci")?
+ eval(z, mpz_get_si(w));
+ }
+ static void eval(mpz_ptr z, double d)
+ { __GMPXX_TMPZ_D; eval (z, temp); }
+};
+
+
+/**************** Auxiliary classes ****************/
+
+/* this is much the same as gmp_allocated_string in gmp-impl.h
+ since gmp-impl.h is not publicly available, I redefine it here
+ I use a different name to avoid possible clashes */
+
+extern "C" {
+ typedef void (*__gmp_freefunc_t) (void *, size_t);
+}
+struct __gmp_alloc_cstring
+{
+ char *str;
+ __gmp_alloc_cstring(char *s) { str = s; }
+ ~__gmp_alloc_cstring()
+ {
+ __gmp_freefunc_t freefunc;
+ mp_get_memory_functions (NULL, NULL, &freefunc);
+ (*freefunc) (str, std::strlen(str)+1);
+ }
+};
+
+
+// general expression template class
+template <class T, class U>
+class __gmp_expr;
+
+
+// templates for resolving expression types
+template <class T>
+struct __gmp_resolve_ref
+{
+ typedef T ref_type;
+};
+
+template <class T, class U>
+struct __gmp_resolve_ref<__gmp_expr<T, U> >
+{
+ typedef const __gmp_expr<T, U> & ref_type;
+};
+
+
+template <class T, class U = T>
+struct __gmp_resolve_expr;
+
+template <>
+struct __gmp_resolve_expr<mpz_t>
+{
+ typedef mpz_t value_type;
+ typedef mpz_ptr ptr_type;
+ typedef mpz_srcptr srcptr_type;
+};
+
+template <>
+struct __gmp_resolve_expr<mpq_t>
+{
+ typedef mpq_t value_type;
+ typedef mpq_ptr ptr_type;
+ typedef mpq_srcptr srcptr_type;
+};
+
+template <>
+struct __gmp_resolve_expr<mpf_t>
+{
+ typedef mpf_t value_type;
+ typedef mpf_ptr ptr_type;
+ typedef mpf_srcptr srcptr_type;
+};
+
+template <>
+struct __gmp_resolve_expr<mpz_t, mpq_t>
+{
+ typedef mpq_t value_type;
+};
+
+template <>
+struct __gmp_resolve_expr<mpq_t, mpz_t>
+{
+ typedef mpq_t value_type;
+};
+
+template <>
+struct __gmp_resolve_expr<mpz_t, mpf_t>
+{
+ typedef mpf_t value_type;
+};
+
+template <>
+struct __gmp_resolve_expr<mpf_t, mpz_t>
+{
+ typedef mpf_t value_type;
+};
+
+template <>
+struct __gmp_resolve_expr<mpq_t, mpf_t>
+{
+ typedef mpf_t value_type;
+};
+
+template <>
+struct __gmp_resolve_expr<mpf_t, mpq_t>
+{
+ typedef mpf_t value_type;
+};
+
+#if __GMPXX_USE_CXX11
+namespace std {
+ template <class T, class U, class V, class W>
+ struct common_type <__gmp_expr<T, U>, __gmp_expr<V, W> >
+ {
+ private:
+ typedef typename __gmp_resolve_expr<T, V>::value_type X;
+ public:
+ typedef __gmp_expr<X, X> type;
+ };
+
+ template <class T, class U>
+ struct common_type <__gmp_expr<T, U> >
+ {
+ typedef __gmp_expr<T, T> type;
+ };
+
+#define __GMPXX_DECLARE_COMMON_TYPE(typ) \
+ template <class T, class U> \
+ struct common_type <__gmp_expr<T, U>, typ > \
+ { \
+ typedef __gmp_expr<T, T> type; \
+ }; \
+ \
+ template <class T, class U> \
+ struct common_type <typ, __gmp_expr<T, U> > \
+ { \
+ typedef __gmp_expr<T, T> type; \
+ }
+
+ __GMPXX_DECLARE_COMMON_TYPE(signed char);
+ __GMPXX_DECLARE_COMMON_TYPE(unsigned char);
+ __GMPXX_DECLARE_COMMON_TYPE(signed int);
+ __GMPXX_DECLARE_COMMON_TYPE(unsigned int);
+ __GMPXX_DECLARE_COMMON_TYPE(signed short int);
+ __GMPXX_DECLARE_COMMON_TYPE(unsigned short int);
+ __GMPXX_DECLARE_COMMON_TYPE(signed long int);
+ __GMPXX_DECLARE_COMMON_TYPE(unsigned long int);
+ __GMPXX_DECLARE_COMMON_TYPE(float);
+ __GMPXX_DECLARE_COMMON_TYPE(double);
+#undef __GMPXX_DECLARE_COMMON_TYPE
+}
+#endif
+
+// classes for evaluating unary and binary expressions
+template <class T, class Op>
+struct __gmp_unary_expr
+{
+ typename __gmp_resolve_ref<T>::ref_type val;
+
+ __gmp_unary_expr(const T &v) : val(v) { }
+private:
+ __gmp_unary_expr();
+};
+
+template <class T, class U, class Op>
+struct __gmp_binary_expr
+{
+ typename __gmp_resolve_ref<T>::ref_type val1;
+ typename __gmp_resolve_ref<U>::ref_type val2;
+
+ __gmp_binary_expr(const T &v1, const U &v2) : val1(v1), val2(v2) { }
+private:
+ __gmp_binary_expr();
+};
+
+
+
+/**************** Macros for in-class declarations ****************/
+/* This is just repetitive code that is easier to maintain if it's written
+ only once */
+
+#define __GMPP_DECLARE_COMPOUND_OPERATOR(fun) \
+ template <class T, class U> \
+ __gmp_expr<value_type, value_type> & fun(const __gmp_expr<T, U> &);
+
+#define __GMPN_DECLARE_COMPOUND_OPERATOR(fun) \
+ __gmp_expr & fun(signed char); \
+ __gmp_expr & fun(unsigned char); \
+ __gmp_expr & fun(signed int); \
+ __gmp_expr & fun(unsigned int); \
+ __gmp_expr & fun(signed short int); \
+ __gmp_expr & fun(unsigned short int); \
+ __gmp_expr & fun(signed long int); \
+ __gmp_expr & fun(unsigned long int); \
+ __gmp_expr & fun(float); \
+ __gmp_expr & fun(double); \
+ /* __gmp_expr & fun(long double); */
+
+#define __GMP_DECLARE_COMPOUND_OPERATOR(fun) \
+__GMPP_DECLARE_COMPOUND_OPERATOR(fun) \
+__GMPN_DECLARE_COMPOUND_OPERATOR(fun)
+
+#define __GMP_DECLARE_COMPOUND_OPERATOR_UI(fun) \
+ __gmp_expr & fun(mp_bitcnt_t);
+
+#define __GMP_DECLARE_INCREMENT_OPERATOR(fun) \
+ inline __gmp_expr & fun(); \
+ inline __gmp_expr fun(int);
+
+#define __GMPXX_DEFINE_ARITHMETIC_CONSTRUCTORS \
+ __gmp_expr(signed char c) { init_si(c); } \
+ __gmp_expr(unsigned char c) { init_ui(c); } \
+ __gmp_expr(signed int i) { init_si(i); } \
+ __gmp_expr(unsigned int i) { init_ui(i); } \
+ __gmp_expr(signed short int s) { init_si(s); } \
+ __gmp_expr(unsigned short int s) { init_ui(s); } \
+ __gmp_expr(signed long int l) { init_si(l); } \
+ __gmp_expr(unsigned long int l) { init_ui(l); } \
+ __gmp_expr(float f) { init_d(f); } \
+ __gmp_expr(double d) { init_d(d); }
+
+#define __GMPXX_DEFINE_ARITHMETIC_ASSIGNMENTS \
+ __gmp_expr & operator=(signed char c) { assign_si(c); return *this; } \
+ __gmp_expr & operator=(unsigned char c) { assign_ui(c); return *this; } \
+ __gmp_expr & operator=(signed int i) { assign_si(i); return *this; } \
+ __gmp_expr & operator=(unsigned int i) { assign_ui(i); return *this; } \
+ __gmp_expr & operator=(signed short int s) { assign_si(s); return *this; } \
+ __gmp_expr & operator=(unsigned short int s) { assign_ui(s); return *this; } \
+ __gmp_expr & operator=(signed long int l) { assign_si(l); return *this; } \
+ __gmp_expr & operator=(unsigned long int l) { assign_ui(l); return *this; } \
+ __gmp_expr & operator=(float f) { assign_d(f); return *this; } \
+ __gmp_expr & operator=(double d) { assign_d(d); return *this; }
+
+#define __GMPP_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun) \
+template <class U> \
+static __gmp_expr<T, __gmp_unary_expr<__gmp_expr<T, U>, eval_fun> > \
+fun(const __gmp_expr<T, U> &expr);
+
+#define __GMPNN_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type, bigtype) \
+static inline __gmp_expr<T, __gmp_unary_expr<bigtype, eval_fun> > \
+fun(type expr);
+
+#define __GMPNS_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type) \
+__GMPNN_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type, signed long)
+#define __GMPNU_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type) \
+__GMPNN_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type, unsigned long)
+#define __GMPND_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type) \
+__GMPNN_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type, double)
+
+#define __GMPN_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun) \
+__GMPNS_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, signed char) \
+__GMPNU_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, unsigned char) \
+__GMPNS_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, signed int) \
+__GMPNU_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, unsigned int) \
+__GMPNS_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, signed short int) \
+__GMPNU_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, unsigned short int) \
+__GMPNS_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, signed long int) \
+__GMPNU_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, unsigned long int) \
+__GMPND_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, float) \
+__GMPND_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, double)
+
+#define __GMP_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun) \
+__GMPP_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun) \
+__GMPN_DECLARE_UNARY_STATIC_MEMFUN(T, fun, eval_fun)
+
+/**************** mpz_class -- wrapper for mpz_t ****************/
+
+template <>
+class __gmp_expr<mpz_t, mpz_t>
+{
+private:
+ typedef mpz_t value_type;
+ value_type mp;
+
+ // Helper functions used for all arithmetic types
+ void assign_ui(unsigned long l)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l == 0))
+ __get_mp()->_mp_size = 0;
+ else
+ mpz_set_ui(mp, l);
+ }
+ void assign_si(signed long l)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l >= 0))
+ assign_ui(l);
+ else if (__GMPXX_CONSTANT_TRUE(l <= 0))
+ {
+ assign_ui(-static_cast<unsigned long>(l));
+ mpz_neg(mp, mp);
+ }
+ else
+ mpz_set_si(mp, l);
+ }
+ void assign_d (double d)
+ {
+ mpz_set_d (mp, d);
+ }
+
+ void init_ui(unsigned long l)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l == 0))
+ mpz_init(mp);
+ else
+ mpz_init_set_ui(mp, l);
+ }
+ void init_si(signed long l)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l >= 0))
+ init_ui(l);
+ else if (__GMPXX_CONSTANT_TRUE(l <= 0))
+ {
+ init_ui(-static_cast<unsigned long>(l));
+ mpz_neg(mp, mp);
+ }
+ else
+ mpz_init_set_si(mp, l);
+ }
+ void init_d (double d)
+ {
+ mpz_init_set_d (mp, d);
+ }
+
+public:
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); }
+
+ // constructors and destructor
+ __gmp_expr() __GMPXX_NOEXCEPT { mpz_init(mp); }
+
+ __gmp_expr(const __gmp_expr &z) { mpz_init_set(mp, z.mp); }
+#if __GMPXX_USE_CXX11
+ __gmp_expr(__gmp_expr &&z) noexcept
+ { *__get_mp() = *z.__get_mp(); mpz_init(z.mp); }
+#endif
+ template <class T>
+ __gmp_expr(const __gmp_expr<mpz_t, T> &expr)
+ { mpz_init(mp); __gmp_set_expr(mp, expr); }
+ template <class T, class U>
+ explicit __gmp_expr(const __gmp_expr<T, U> &expr)
+ { mpz_init(mp); __gmp_set_expr(mp, expr); }
+
+ __GMPXX_DEFINE_ARITHMETIC_CONSTRUCTORS
+
+ explicit __gmp_expr(const char *s, int base = 0)
+ {
+ if (mpz_init_set_str (mp, s, base) != 0)
+ {
+ mpz_clear (mp);
+ throw std::invalid_argument ("mpz_set_str");
+ }
+ }
+ explicit __gmp_expr(const std::string &s, int base = 0)
+ {
+ if (mpz_init_set_str(mp, s.c_str(), base) != 0)
+ {
+ mpz_clear (mp);
+ throw std::invalid_argument ("mpz_set_str");
+ }
+ }
+
+ explicit __gmp_expr(mpz_srcptr z) { mpz_init_set(mp, z); }
+
+ ~__gmp_expr() { mpz_clear(mp); }
+
+ void swap(__gmp_expr& z) __GMPXX_NOEXCEPT
+ { std::swap(*__get_mp(), *z.__get_mp()); }
+
+ // assignment operators
+ __gmp_expr & operator=(const __gmp_expr &z)
+ { mpz_set(mp, z.mp); return *this; }
+#if __GMPXX_USE_CXX11
+ __gmp_expr & operator=(__gmp_expr &&z) noexcept
+ { swap(z); return *this; }
+#endif
+ template <class T, class U>
+ __gmp_expr<value_type, value_type> & operator=(const __gmp_expr<T, U> &expr)
+ { __gmp_set_expr(mp, expr); return *this; }
+
+ __GMPXX_DEFINE_ARITHMETIC_ASSIGNMENTS
+
+ __gmp_expr & operator=(const char *s)
+ {
+ if (mpz_set_str (mp, s, 0) != 0)
+ throw std::invalid_argument ("mpz_set_str");
+ return *this;
+ }
+ __gmp_expr & operator=(const std::string &s)
+ {
+ if (mpz_set_str(mp, s.c_str(), 0) != 0)
+ throw std::invalid_argument ("mpz_set_str");
+ return *this;
+ }
+
+ // string input/output functions
+ int set_str(const char *s, int base)
+ { return mpz_set_str(mp, s, base); }
+ int set_str(const std::string &s, int base)
+ { return mpz_set_str(mp, s.c_str(), base); }
+ std::string get_str(int base = 10) const
+ {
+ __gmp_alloc_cstring temp(mpz_get_str(0, base, mp));
+ return std::string(temp.str);
+ }
+
+ // conversion functions
+ mpz_srcptr __get_mp() const { return mp; }
+ mpz_ptr __get_mp() { return mp; }
+ mpz_srcptr get_mpz_t() const { return mp; }
+ mpz_ptr get_mpz_t() { return mp; }
+
+ signed long int get_si() const { return mpz_get_si(mp); }
+ unsigned long int get_ui() const { return mpz_get_ui(mp); }
+ double get_d() const { return mpz_get_d(mp); }
+
+ // bool fits_schar_p() const { return mpz_fits_schar_p(mp); }
+ // bool fits_uchar_p() const { return mpz_fits_uchar_p(mp); }
+ bool fits_sint_p() const { return mpz_fits_sint_p(mp); }
+ bool fits_uint_p() const { return mpz_fits_uint_p(mp); }
+ bool fits_sshort_p() const { return mpz_fits_sshort_p(mp); }
+ bool fits_ushort_p() const { return mpz_fits_ushort_p(mp); }
+ bool fits_slong_p() const { return mpz_fits_slong_p(mp); }
+ bool fits_ulong_p() const { return mpz_fits_ulong_p(mp); }
+ // bool fits_float_p() const { return mpz_fits_float_p(mp); }
+ // bool fits_double_p() const { return mpz_fits_double_p(mp); }
+ // bool fits_ldouble_p() const { return mpz_fits_ldouble_p(mp); }
+
+#if __GMPXX_USE_CXX11
+ explicit operator bool() const { return __get_mp()->_mp_size != 0; }
+#endif
+
+ // member operators
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator+=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator-=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator*=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator/=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator%=)
+
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator&=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator|=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator^=)
+
+ __GMP_DECLARE_COMPOUND_OPERATOR_UI(operator<<=)
+ __GMP_DECLARE_COMPOUND_OPERATOR_UI(operator>>=)
+
+ __GMP_DECLARE_INCREMENT_OPERATOR(operator++)
+ __GMP_DECLARE_INCREMENT_OPERATOR(operator--)
+
+ __GMP_DECLARE_UNARY_STATIC_MEMFUN(mpz_t, factorial, __gmp_fac_function)
+ __GMP_DECLARE_UNARY_STATIC_MEMFUN(mpz_t, primorial, __gmp_primorial_function)
+ __GMP_DECLARE_UNARY_STATIC_MEMFUN(mpz_t, fibonacci, __gmp_fib_function)
+};
+
+typedef __gmp_expr<mpz_t, mpz_t> mpz_class;
+
+
+/**************** mpq_class -- wrapper for mpq_t ****************/
+
+template <>
+class __gmp_expr<mpq_t, mpq_t>
+{
+private:
+ typedef mpq_t value_type;
+ value_type mp;
+
+ // Helper functions used for all arithmetic types
+ void assign_ui(unsigned long l) { mpq_set_ui(mp, l, 1); }
+ void assign_si(signed long l)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l >= 0))
+ assign_ui(l);
+ else
+ mpq_set_si(mp, l, 1);
+ }
+ void assign_d (double d) { mpq_set_d (mp, d); }
+
+ void init_ui(unsigned long l) { mpq_init(mp); get_num() = l; }
+ void init_si(signed long l) { mpq_init(mp); get_num() = l; }
+ void init_d (double d) { mpq_init(mp); assign_d (d); }
+
+public:
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); }
+ void canonicalize() { mpq_canonicalize(mp); }
+
+ // constructors and destructor
+ __gmp_expr() { mpq_init(mp); }
+
+ __gmp_expr(const __gmp_expr &q)
+ {
+ mpz_init_set(mpq_numref(mp), mpq_numref(q.mp));
+ mpz_init_set(mpq_denref(mp), mpq_denref(q.mp));
+ }
+#if __GMPXX_USE_CXX11
+ __gmp_expr(__gmp_expr &&q)
+ { *mp = *q.mp; mpq_init(q.mp); }
+ __gmp_expr(mpz_class &&z)
+ {
+ *mpq_numref(mp) = *z.get_mpz_t();
+ mpz_init_set_ui(mpq_denref(mp), 1);
+ mpz_init(z.get_mpz_t());
+ }
+#endif
+ template <class T>
+ __gmp_expr(const __gmp_expr<mpz_t, T> &expr)
+ { mpq_init(mp); __gmp_set_expr(mp, expr); }
+ template <class T>
+ __gmp_expr(const __gmp_expr<mpq_t, T> &expr)
+ { mpq_init(mp); __gmp_set_expr(mp, expr); }
+ template <class T, class U>
+ explicit __gmp_expr(const __gmp_expr<T, U> &expr)
+ { mpq_init(mp); __gmp_set_expr(mp, expr); }
+
+ __GMPXX_DEFINE_ARITHMETIC_CONSTRUCTORS
+
+ explicit __gmp_expr(const char *s, int base = 0)
+ {
+ mpq_init (mp);
+ // If s is the literal 0, we meant to call another constructor.
+ // If s just happens to evaluate to 0, we would crash, so whatever.
+ if (s == 0)
+ {
+ // Don't turn mpq_class(0,0) into 0
+ mpz_set_si(mpq_denref(mp), base);
+ }
+ else if (mpq_set_str(mp, s, base) != 0)
+ {
+ mpq_clear (mp);
+ throw std::invalid_argument ("mpq_set_str");
+ }
+ }
+ explicit __gmp_expr(const std::string &s, int base = 0)
+ {
+ mpq_init(mp);
+ if (mpq_set_str (mp, s.c_str(), base) != 0)
+ {
+ mpq_clear (mp);
+ throw std::invalid_argument ("mpq_set_str");
+ }
+ }
+ explicit __gmp_expr(mpq_srcptr q)
+ {
+ mpz_init_set(mpq_numref(mp), mpq_numref(q));
+ mpz_init_set(mpq_denref(mp), mpq_denref(q));
+ }
+
+ __gmp_expr(const mpz_class &num, const mpz_class &den)
+ {
+ mpz_init_set(mpq_numref(mp), num.get_mpz_t());
+ mpz_init_set(mpq_denref(mp), den.get_mpz_t());
+ }
+
+ ~__gmp_expr() { mpq_clear(mp); }
+
+ void swap(__gmp_expr& q) __GMPXX_NOEXCEPT { std::swap(*mp, *q.mp); }
+
+ // assignment operators
+ __gmp_expr & operator=(const __gmp_expr &q)
+ { mpq_set(mp, q.mp); return *this; }
+#if __GMPXX_USE_CXX11
+ __gmp_expr & operator=(__gmp_expr &&q) noexcept
+ { swap(q); return *this; }
+ __gmp_expr & operator=(mpz_class &&z) noexcept
+ { get_num() = std::move(z); get_den() = 1u; return *this; }
+#endif
+ template <class T, class U>
+ __gmp_expr<value_type, value_type> & operator=(const __gmp_expr<T, U> &expr)
+ { __gmp_set_expr(mp, expr); return *this; }
+
+ __GMPXX_DEFINE_ARITHMETIC_ASSIGNMENTS
+
+ __gmp_expr & operator=(const char *s)
+ {
+ if (mpq_set_str (mp, s, 0) != 0)
+ throw std::invalid_argument ("mpq_set_str");
+ return *this;
+ }
+ __gmp_expr & operator=(const std::string &s)
+ {
+ if (mpq_set_str(mp, s.c_str(), 0) != 0)
+ throw std::invalid_argument ("mpq_set_str");
+ return *this;
+ }
+
+ // string input/output functions
+ int set_str(const char *s, int base)
+ { return mpq_set_str(mp, s, base); }
+ int set_str(const std::string &s, int base)
+ { return mpq_set_str(mp, s.c_str(), base); }
+ std::string get_str(int base = 10) const
+ {
+ __gmp_alloc_cstring temp(mpq_get_str(0, base, mp));
+ return std::string(temp.str);
+ }
+
+ // conversion functions
+
+ // casting a reference to an mpz_t to mpz_class & is a dirty hack.
+ // It kind of works because the internal representation of mpz_class is
+ // exactly an mpz_t, but compilers are allowed to assume that mpq_class
+ // and mpz_class do not alias... In mpz_class, we avoid using mp directly,
+ // to reduce the risks of such problematic optimizations.
+ const mpz_class & get_num() const
+ { return reinterpret_cast<const mpz_class &>(*mpq_numref(mp)); }
+ mpz_class & get_num()
+ { return reinterpret_cast<mpz_class &>(*mpq_numref(mp)); }
+ const mpz_class & get_den() const
+ { return reinterpret_cast<const mpz_class &>(*mpq_denref(mp)); }
+ mpz_class & get_den()
+ { return reinterpret_cast<mpz_class &>(*mpq_denref(mp)); }
+
+ mpq_srcptr __get_mp() const { return mp; }
+ mpq_ptr __get_mp() { return mp; }
+ mpq_srcptr get_mpq_t() const { return mp; }
+ mpq_ptr get_mpq_t() { return mp; }
+
+ mpz_srcptr get_num_mpz_t() const { return mpq_numref(mp); }
+ mpz_ptr get_num_mpz_t() { return mpq_numref(mp); }
+ mpz_srcptr get_den_mpz_t() const { return mpq_denref(mp); }
+ mpz_ptr get_den_mpz_t() { return mpq_denref(mp); }
+
+ double get_d() const { return mpq_get_d(mp); }
+
+#if __GMPXX_USE_CXX11
+ explicit operator bool() const { return mpq_numref(mp)->_mp_size != 0; }
+#endif
+
+ // compound assignments
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator+=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator-=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator*=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator/=)
+
+ __GMP_DECLARE_COMPOUND_OPERATOR_UI(operator<<=)
+ __GMP_DECLARE_COMPOUND_OPERATOR_UI(operator>>=)
+
+ __GMP_DECLARE_INCREMENT_OPERATOR(operator++)
+ __GMP_DECLARE_INCREMENT_OPERATOR(operator--)
+};
+
+typedef __gmp_expr<mpq_t, mpq_t> mpq_class;
+
+
+/**************** mpf_class -- wrapper for mpf_t ****************/
+
+template <>
+class __gmp_expr<mpf_t, mpf_t>
+{
+private:
+ typedef mpf_t value_type;
+ value_type mp;
+
+ // Helper functions used for all arithmetic types
+ void assign_ui(unsigned long l) { mpf_set_ui(mp, l); }
+ void assign_si(signed long l)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l >= 0))
+ assign_ui(l);
+ else
+ mpf_set_si(mp, l);
+ }
+ void assign_d (double d) { mpf_set_d (mp, d); }
+
+ void init_ui(unsigned long l)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l == 0))
+ mpf_init(mp);
+ else
+ mpf_init_set_ui(mp, l);
+ }
+ void init_si(signed long l)
+ {
+ if (__GMPXX_CONSTANT_TRUE(l >= 0))
+ init_ui(l);
+ else
+ mpf_init_set_si(mp, l);
+ }
+ void init_d (double d) { mpf_init_set_d (mp, d); }
+
+public:
+ mp_bitcnt_t get_prec() const { return mpf_get_prec(mp); }
+
+ void set_prec(mp_bitcnt_t prec) { mpf_set_prec(mp, prec); }
+ void set_prec_raw(mp_bitcnt_t prec) { mpf_set_prec_raw(mp, prec); }
+
+ // constructors and destructor
+ __gmp_expr() { mpf_init(mp); }
+
+ __gmp_expr(const __gmp_expr &f)
+ { mpf_init2(mp, f.get_prec()); mpf_set(mp, f.mp); }
+#if __GMPXX_USE_CXX11
+ __gmp_expr(__gmp_expr &&f)
+ { *mp = *f.mp; mpf_init2(f.mp, get_prec()); }
+#endif
+ __gmp_expr(const __gmp_expr &f, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set(mp, f.mp); }
+ template <class T, class U>
+ __gmp_expr(const __gmp_expr<T, U> &expr)
+ { mpf_init2(mp, expr.get_prec()); __gmp_set_expr(mp, expr); }
+ template <class T, class U>
+ __gmp_expr(const __gmp_expr<T, U> &expr, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); __gmp_set_expr(mp, expr); }
+
+ __GMPXX_DEFINE_ARITHMETIC_CONSTRUCTORS
+
+ __gmp_expr(signed char c, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set_si(mp, c); }
+ __gmp_expr(unsigned char c, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set_ui(mp, c); }
+
+ __gmp_expr(signed int i, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set_si(mp, i); }
+ __gmp_expr(unsigned int i, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set_ui(mp, i); }
+
+ __gmp_expr(signed short int s, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set_si(mp, s); }
+ __gmp_expr(unsigned short int s, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set_ui(mp, s); }
+
+ __gmp_expr(signed long int l, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set_si(mp, l); }
+ __gmp_expr(unsigned long int l, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set_ui(mp, l); }
+
+ __gmp_expr(float f, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set_d(mp, f); }
+ __gmp_expr(double d, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set_d(mp, d); }
+ // __gmp_expr(long double ld) { mpf_init_set_d(mp, ld); }
+ // __gmp_expr(long double ld, mp_bitcnt_t prec)
+ // { mpf_init2(mp, prec); mpf_set_d(mp, ld); }
+
+ explicit __gmp_expr(const char *s)
+ {
+ if (mpf_init_set_str (mp, s, 0) != 0)
+ {
+ mpf_clear (mp);
+ throw std::invalid_argument ("mpf_set_str");
+ }
+ }
+ __gmp_expr(const char *s, mp_bitcnt_t prec, int base = 0)
+ {
+ mpf_init2(mp, prec);
+ if (mpf_set_str(mp, s, base) != 0)
+ {
+ mpf_clear (mp);
+ throw std::invalid_argument ("mpf_set_str");
+ }
+ }
+ explicit __gmp_expr(const std::string &s)
+ {
+ if (mpf_init_set_str(mp, s.c_str(), 0) != 0)
+ {
+ mpf_clear (mp);
+ throw std::invalid_argument ("mpf_set_str");
+ }
+ }
+ __gmp_expr(const std::string &s, mp_bitcnt_t prec, int base = 0)
+ {
+ mpf_init2(mp, prec);
+ if (mpf_set_str(mp, s.c_str(), base) != 0)
+ {
+ mpf_clear (mp);
+ throw std::invalid_argument ("mpf_set_str");
+ }
+ }
+
+ explicit __gmp_expr(mpf_srcptr f)
+ { mpf_init2(mp, mpf_get_prec(f)); mpf_set(mp, f); }
+ __gmp_expr(mpf_srcptr f, mp_bitcnt_t prec)
+ { mpf_init2(mp, prec); mpf_set(mp, f); }
+
+ ~__gmp_expr() { mpf_clear(mp); }
+
+ void swap(__gmp_expr& f) __GMPXX_NOEXCEPT { std::swap(*mp, *f.mp); }
+
+ // assignment operators
+ __gmp_expr & operator=(const __gmp_expr &f)
+ { mpf_set(mp, f.mp); return *this; }
+#if __GMPXX_USE_CXX11
+ __gmp_expr & operator=(__gmp_expr &&f) noexcept
+ { swap(f); return *this; }
+#endif
+ template <class T, class U>
+ __gmp_expr<value_type, value_type> & operator=(const __gmp_expr<T, U> &expr)
+ { __gmp_set_expr(mp, expr); return *this; }
+
+ __GMPXX_DEFINE_ARITHMETIC_ASSIGNMENTS
+
+ __gmp_expr & operator=(const char *s)
+ {
+ if (mpf_set_str (mp, s, 0) != 0)
+ throw std::invalid_argument ("mpf_set_str");
+ return *this;
+ }
+ __gmp_expr & operator=(const std::string &s)
+ {
+ if (mpf_set_str(mp, s.c_str(), 0) != 0)
+ throw std::invalid_argument ("mpf_set_str");
+ return *this;
+ }
+
+ // string input/output functions
+ int set_str(const char *s, int base)
+ { return mpf_set_str(mp, s, base); }
+ int set_str(const std::string &s, int base)
+ { return mpf_set_str(mp, s.c_str(), base); }
+ std::string get_str(mp_exp_t &expo, int base = 10, size_t size = 0) const
+ {
+ __gmp_alloc_cstring temp(mpf_get_str(0, &expo, base, size, mp));
+ return std::string(temp.str);
+ }
+
+ // conversion functions
+ mpf_srcptr __get_mp() const { return mp; }
+ mpf_ptr __get_mp() { return mp; }
+ mpf_srcptr get_mpf_t() const { return mp; }
+ mpf_ptr get_mpf_t() { return mp; }
+
+ signed long int get_si() const { return mpf_get_si(mp); }
+ unsigned long int get_ui() const { return mpf_get_ui(mp); }
+ double get_d() const { return mpf_get_d(mp); }
+
+ // bool fits_schar_p() const { return mpf_fits_schar_p(mp); }
+ // bool fits_uchar_p() const { return mpf_fits_uchar_p(mp); }
+ bool fits_sint_p() const { return mpf_fits_sint_p(mp); }
+ bool fits_uint_p() const { return mpf_fits_uint_p(mp); }
+ bool fits_sshort_p() const { return mpf_fits_sshort_p(mp); }
+ bool fits_ushort_p() const { return mpf_fits_ushort_p(mp); }
+ bool fits_slong_p() const { return mpf_fits_slong_p(mp); }
+ bool fits_ulong_p() const { return mpf_fits_ulong_p(mp); }
+ // bool fits_float_p() const { return mpf_fits_float_p(mp); }
+ // bool fits_double_p() const { return mpf_fits_double_p(mp); }
+ // bool fits_ldouble_p() const { return mpf_fits_ldouble_p(mp); }
+
+#if __GMPXX_USE_CXX11
+ explicit operator bool() const { return mpf_sgn(mp) != 0; }
+#endif
+
+ // compound assignments
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator+=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator-=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator*=)
+ __GMP_DECLARE_COMPOUND_OPERATOR(operator/=)
+
+ __GMP_DECLARE_COMPOUND_OPERATOR_UI(operator<<=)
+ __GMP_DECLARE_COMPOUND_OPERATOR_UI(operator>>=)
+
+ __GMP_DECLARE_INCREMENT_OPERATOR(operator++)
+ __GMP_DECLARE_INCREMENT_OPERATOR(operator--)
+};
+
+typedef __gmp_expr<mpf_t, mpf_t> mpf_class;
+
+
+
+/**************** User-defined literals ****************/
+
+#if __GMPXX_USE_CXX11
+inline mpz_class operator"" _mpz(const char* s)
+{
+ return mpz_class(s);
+}
+
+inline mpq_class operator"" _mpq(const char* s)
+{
+ mpq_class q;
+ q.get_num() = s;
+ return q;
+}
+
+inline mpf_class operator"" _mpf(const char* s)
+{
+ return mpf_class(s);
+}
+#endif
+
+/**************** I/O operators ****************/
+
+// these should (and will) be provided separately
+
+template <class T, class U>
+inline std::ostream & operator<<
+(std::ostream &o, const __gmp_expr<T, U> &expr)
+{
+ __gmp_expr<T, T> const& temp(expr);
+ return o << temp.__get_mp();
+}
+
+template <class T>
+inline std::istream & operator>>(std::istream &i, __gmp_expr<T, T> &expr)
+{
+ return i >> expr.__get_mp();
+}
+
+/*
+// you might want to uncomment this
+inline std::istream & operator>>(std::istream &i, mpq_class &q)
+{
+ i >> q.get_mpq_t();
+ q.canonicalize();
+ return i;
+}
+*/
+
+
+/**************** Functions for type conversion ****************/
+
+inline void __gmp_set_expr(mpz_ptr z, const mpz_class &w)
+{
+ mpz_set(z, w.get_mpz_t());
+}
+
+template <class T>
+inline void __gmp_set_expr(mpz_ptr z, const __gmp_expr<mpz_t, T> &expr)
+{
+ expr.eval(z);
+}
+
+template <class T>
+inline void __gmp_set_expr(mpz_ptr z, const __gmp_expr<mpq_t, T> &expr)
+{
+ mpq_class const& temp(expr);
+ mpz_set_q(z, temp.get_mpq_t());
+}
+
+template <class T>
+inline void __gmp_set_expr(mpz_ptr z, const __gmp_expr<mpf_t, T> &expr)
+{
+ mpf_class const& temp(expr);
+ mpz_set_f(z, temp.get_mpf_t());
+}
+
+inline void __gmp_set_expr(mpq_ptr q, const mpz_class &z)
+{
+ mpq_set_z(q, z.get_mpz_t());
+}
+
+template <class T>
+inline void __gmp_set_expr(mpq_ptr q, const __gmp_expr<mpz_t, T> &expr)
+{
+ __gmp_set_expr(mpq_numref(q), expr);
+ mpz_set_ui(mpq_denref(q), 1);
+}
+
+inline void __gmp_set_expr(mpq_ptr q, const mpq_class &r)
+{
+ mpq_set(q, r.get_mpq_t());
+}
+
+template <class T>
+inline void __gmp_set_expr(mpq_ptr q, const __gmp_expr<mpq_t, T> &expr)
+{
+ expr.eval(q);
+}
+
+template <class T>
+inline void __gmp_set_expr(mpq_ptr q, const __gmp_expr<mpf_t, T> &expr)
+{
+ mpf_class const& temp(expr);
+ mpq_set_f(q, temp.get_mpf_t());
+}
+
+template <class T>
+inline void __gmp_set_expr(mpf_ptr f, const __gmp_expr<mpz_t, T> &expr)
+{
+ mpz_class const& temp(expr);
+ mpf_set_z(f, temp.get_mpz_t());
+}
+
+template <class T>
+inline void __gmp_set_expr(mpf_ptr f, const __gmp_expr<mpq_t, T> &expr)
+{
+ mpq_class const& temp(expr);
+ mpf_set_q(f, temp.get_mpq_t());
+}
+
+inline void __gmp_set_expr(mpf_ptr f, const mpf_class &g)
+{
+ mpf_set(f, g.get_mpf_t());
+}
+
+template <class T>
+inline void __gmp_set_expr(mpf_ptr f, const __gmp_expr<mpf_t, T> &expr)
+{
+ expr.eval(f);
+}
+
+
+/* Temporary objects */
+
+template <class T>
+class __gmp_temp
+{
+ __gmp_expr<T, T> val;
+ public:
+ template<class U, class V>
+ __gmp_temp(U const& u, V) : val (u) {}
+ typename __gmp_resolve_expr<T>::srcptr_type
+ __get_mp() const { return val.__get_mp(); }
+};
+
+template <>
+class __gmp_temp <mpf_t>
+{
+ mpf_class val;
+ public:
+ template<class U>
+ __gmp_temp(U const& u, mpf_ptr res) : val (u, mpf_get_prec(res)) {}
+ mpf_srcptr __get_mp() const { return val.__get_mp(); }
+};
+
+/**************** Specializations of __gmp_expr ****************/
+/* The eval() method of __gmp_expr<T, U> evaluates the corresponding
+ expression and assigns the result to its argument, which is either an
+ mpz_t, mpq_t, or mpf_t as specified by the T argument.
+ Compound expressions are evaluated recursively (temporaries are created
+ to hold intermediate values), while for simple expressions the eval()
+ method of the appropriate function object (available as the Op argument
+ of either __gmp_unary_expr<T, Op> or __gmp_binary_expr<T, U, Op>) is
+ called. */
+
+
+/**************** Unary expressions ****************/
+/* cases:
+ - simple: argument is mp*_class, that is, __gmp_expr<T, T>
+ - compound: argument is __gmp_expr<T, U> (with U not equal to T) */
+
+
+// simple expressions
+
+template <class T, class Op>
+class __gmp_expr<T, __gmp_unary_expr<__gmp_expr<T, T>, Op> >
+{
+private:
+ typedef __gmp_expr<T, T> val_type;
+
+ __gmp_unary_expr<val_type, Op> expr;
+public:
+ explicit __gmp_expr(const val_type &val) : expr(val) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ { Op::eval(p, expr.val.__get_mp()); }
+ const val_type & get_val() const { return expr.val; }
+ mp_bitcnt_t get_prec() const { return expr.val.get_prec(); }
+};
+
+
+// simple expressions, U is a built-in numerical type
+
+template <class T, class U, class Op>
+class __gmp_expr<T, __gmp_unary_expr<U, Op> >
+{
+private:
+ typedef U val_type;
+
+ __gmp_unary_expr<val_type, Op> expr;
+public:
+ explicit __gmp_expr(const val_type &val) : expr(val) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ { Op::eval(p, expr.val); }
+ const val_type & get_val() const { return expr.val; }
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); }
+};
+
+
+// compound expressions
+
+template <class T, class U, class Op>
+class __gmp_expr<T, __gmp_unary_expr<__gmp_expr<T, U>, Op> >
+{
+private:
+ typedef __gmp_expr<T, U> val_type;
+
+ __gmp_unary_expr<val_type, Op> expr;
+public:
+ explicit __gmp_expr(const val_type &val) : expr(val) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ { expr.val.eval(p); Op::eval(p, p); }
+ const val_type & get_val() const { return expr.val; }
+ mp_bitcnt_t get_prec() const { return expr.val.get_prec(); }
+};
+
+
+/**************** Binary expressions ****************/
+/* simple:
+ - arguments are both mp*_class
+ - one argument is mp*_class, one is a built-in type
+ compound:
+ - one is mp*_class, one is __gmp_expr<T, U>
+ - one is __gmp_expr<T, U>, one is built-in
+ - both arguments are __gmp_expr<...> */
+
+
+// simple expressions
+
+template <class T, class Op>
+class __gmp_expr
+<T, __gmp_binary_expr<__gmp_expr<T, T>, __gmp_expr<T, T>, Op> >
+{
+private:
+ typedef __gmp_expr<T, T> val1_type;
+ typedef __gmp_expr<T, T> val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ { Op::eval(p, expr.val1.__get_mp(), expr.val2.__get_mp()); }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const
+ {
+ mp_bitcnt_t prec1 = expr.val1.get_prec(),
+ prec2 = expr.val2.get_prec();
+ return (prec1 > prec2) ? prec1 : prec2;
+ }
+};
+
+
+// simple expressions, U is a built-in numerical type
+
+template <class T, class U, class Op>
+class __gmp_expr<T, __gmp_binary_expr<__gmp_expr<T, T>, U, Op> >
+{
+private:
+ typedef __gmp_expr<T, T> val1_type;
+ typedef U val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ { Op::eval(p, expr.val1.__get_mp(), expr.val2); }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const { return expr.val1.get_prec(); }
+};
+
+template <class T, class U, class Op>
+class __gmp_expr<T, __gmp_binary_expr<U, __gmp_expr<T, T>, Op> >
+{
+private:
+ typedef U val1_type;
+ typedef __gmp_expr<T, T> val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ { Op::eval(p, expr.val1, expr.val2.__get_mp()); }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const { return expr.val2.get_prec(); }
+};
+
+
+// compound expressions, one argument is a subexpression
+
+template <class T, class U, class V, class Op>
+class __gmp_expr
+<T, __gmp_binary_expr<__gmp_expr<T, T>, __gmp_expr<U, V>, Op> >
+{
+private:
+ typedef __gmp_expr<T, T> val1_type;
+ typedef __gmp_expr<U, V> val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ {
+ if(p != expr.val1.__get_mp())
+ {
+ __gmp_set_expr(p, expr.val2);
+ Op::eval(p, expr.val1.__get_mp(), p);
+ }
+ else
+ {
+ __gmp_temp<T> temp(expr.val2, p);
+ Op::eval(p, expr.val1.__get_mp(), temp.__get_mp());
+ }
+ }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const
+ {
+ mp_bitcnt_t prec1 = expr.val1.get_prec(),
+ prec2 = expr.val2.get_prec();
+ return (prec1 > prec2) ? prec1 : prec2;
+ }
+};
+
+template <class T, class U, class V, class Op>
+class __gmp_expr
+<T, __gmp_binary_expr<__gmp_expr<U, V>, __gmp_expr<T, T>, Op> >
+{
+private:
+ typedef __gmp_expr<U, V> val1_type;
+ typedef __gmp_expr<T, T> val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ {
+ if(p != expr.val2.__get_mp())
+ {
+ __gmp_set_expr(p, expr.val1);
+ Op::eval(p, p, expr.val2.__get_mp());
+ }
+ else
+ {
+ __gmp_temp<T> temp(expr.val1, p);
+ Op::eval(p, temp.__get_mp(), expr.val2.__get_mp());
+ }
+ }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const
+ {
+ mp_bitcnt_t prec1 = expr.val1.get_prec(),
+ prec2 = expr.val2.get_prec();
+ return (prec1 > prec2) ? prec1 : prec2;
+ }
+};
+
+template <class T, class U, class Op>
+class __gmp_expr
+<T, __gmp_binary_expr<__gmp_expr<T, T>, __gmp_expr<T, U>, Op> >
+{
+private:
+ typedef __gmp_expr<T, T> val1_type;
+ typedef __gmp_expr<T, U> val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ {
+ if(p != expr.val1.__get_mp())
+ {
+ __gmp_set_expr(p, expr.val2);
+ Op::eval(p, expr.val1.__get_mp(), p);
+ }
+ else
+ {
+ __gmp_temp<T> temp(expr.val2, p);
+ Op::eval(p, expr.val1.__get_mp(), temp.__get_mp());
+ }
+ }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const
+ {
+ mp_bitcnt_t prec1 = expr.val1.get_prec(),
+ prec2 = expr.val2.get_prec();
+ return (prec1 > prec2) ? prec1 : prec2;
+ }
+};
+
+template <class T, class U, class Op>
+class __gmp_expr
+<T, __gmp_binary_expr<__gmp_expr<T, U>, __gmp_expr<T, T>, Op> >
+{
+private:
+ typedef __gmp_expr<T, U> val1_type;
+ typedef __gmp_expr<T, T> val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ {
+ if(p != expr.val2.__get_mp())
+ {
+ __gmp_set_expr(p, expr.val1);
+ Op::eval(p, p, expr.val2.__get_mp());
+ }
+ else
+ {
+ __gmp_temp<T> temp(expr.val1, p);
+ Op::eval(p, temp.__get_mp(), expr.val2.__get_mp());
+ }
+ }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const
+ {
+ mp_bitcnt_t prec1 = expr.val1.get_prec(),
+ prec2 = expr.val2.get_prec();
+ return (prec1 > prec2) ? prec1 : prec2;
+ }
+};
+
+
+// one argument is a subexpression, one is a built-in
+
+template <class T, class U, class V, class Op>
+class __gmp_expr<T, __gmp_binary_expr<__gmp_expr<T, U>, V, Op> >
+{
+private:
+ typedef __gmp_expr<T, U> val1_type;
+ typedef V val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ {
+ expr.val1.eval(p);
+ Op::eval(p, p, expr.val2);
+ }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const { return expr.val1.get_prec(); }
+};
+
+template <class T, class U, class V, class Op>
+class __gmp_expr<T, __gmp_binary_expr<U, __gmp_expr<T, V>, Op> >
+{
+private:
+ typedef U val1_type;
+ typedef __gmp_expr<T, V> val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ {
+ expr.val2.eval(p);
+ Op::eval(p, expr.val1, p);
+ }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const { return expr.val2.get_prec(); }
+};
+
+
+// both arguments are subexpressions
+
+template <class T, class U, class V, class W, class Op>
+class __gmp_expr
+<T, __gmp_binary_expr<__gmp_expr<T, U>, __gmp_expr<V, W>, Op> >
+{
+private:
+ typedef __gmp_expr<T, U> val1_type;
+ typedef __gmp_expr<V, W> val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ {
+ __gmp_temp<T> temp2(expr.val2, p);
+ expr.val1.eval(p);
+ Op::eval(p, p, temp2.__get_mp());
+ }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const
+ {
+ mp_bitcnt_t prec1 = expr.val1.get_prec(),
+ prec2 = expr.val2.get_prec();
+ return (prec1 > prec2) ? prec1 : prec2;
+ }
+};
+
+template <class T, class U, class V, class W, class Op>
+class __gmp_expr
+<T, __gmp_binary_expr<__gmp_expr<U, V>, __gmp_expr<T, W>, Op> >
+{
+private:
+ typedef __gmp_expr<U, V> val1_type;
+ typedef __gmp_expr<T, W> val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ {
+ __gmp_temp<T> temp1(expr.val1, p);
+ expr.val2.eval(p);
+ Op::eval(p, temp1.__get_mp(), p);
+ }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const
+ {
+ mp_bitcnt_t prec1 = expr.val1.get_prec(),
+ prec2 = expr.val2.get_prec();
+ return (prec1 > prec2) ? prec1 : prec2;
+ }
+};
+
+template <class T, class U, class V, class Op>
+class __gmp_expr
+<T, __gmp_binary_expr<__gmp_expr<T, U>, __gmp_expr<T, V>, Op> >
+{
+private:
+ typedef __gmp_expr<T, U> val1_type;
+ typedef __gmp_expr<T, V> val2_type;
+
+ __gmp_binary_expr<val1_type, val2_type, Op> expr;
+public:
+ __gmp_expr(const val1_type &val1, const val2_type &val2)
+ : expr(val1, val2) { }
+ void eval(typename __gmp_resolve_expr<T>::ptr_type p) const
+ {
+ __gmp_temp<T> temp2(expr.val2, p);
+ expr.val1.eval(p);
+ Op::eval(p, p, temp2.__get_mp());
+ }
+ const val1_type & get_val1() const { return expr.val1; }
+ const val2_type & get_val2() const { return expr.val2; }
+ mp_bitcnt_t get_prec() const
+ {
+ mp_bitcnt_t prec1 = expr.val1.get_prec(),
+ prec2 = expr.val2.get_prec();
+ return (prec1 > prec2) ? prec1 : prec2;
+ }
+};
+
+
+/**************** Special cases ****************/
+
+/* Some operations (i.e., add and subtract) with mixed mpz/mpq arguments
+ can be done directly without first converting the mpz to mpq.
+ Appropriate specializations of __gmp_expr are required. */
+
+
+#define __GMPZQ_DEFINE_EXPR(eval_fun) \
+ \
+template <> \
+class __gmp_expr<mpq_t, __gmp_binary_expr<mpz_class, mpq_class, eval_fun> > \
+{ \
+private: \
+ typedef mpz_class val1_type; \
+ typedef mpq_class val2_type; \
+ \
+ __gmp_binary_expr<val1_type, val2_type, eval_fun> expr; \
+public: \
+ __gmp_expr(const val1_type &val1, const val2_type &val2) \
+ : expr(val1, val2) { } \
+ void eval(mpq_ptr q) const \
+ { eval_fun::eval(q, expr.val1.get_mpz_t(), expr.val2.get_mpq_t()); } \
+ const val1_type & get_val1() const { return expr.val1; } \
+ const val2_type & get_val2() const { return expr.val2; } \
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); } \
+}; \
+ \
+template <> \
+class __gmp_expr<mpq_t, __gmp_binary_expr<mpq_class, mpz_class, eval_fun> > \
+{ \
+private: \
+ typedef mpq_class val1_type; \
+ typedef mpz_class val2_type; \
+ \
+ __gmp_binary_expr<val1_type, val2_type, eval_fun> expr; \
+public: \
+ __gmp_expr(const val1_type &val1, const val2_type &val2) \
+ : expr(val1, val2) { } \
+ void eval(mpq_ptr q) const \
+ { eval_fun::eval(q, expr.val1.get_mpq_t(), expr.val2.get_mpz_t()); } \
+ const val1_type & get_val1() const { return expr.val1; } \
+ const val2_type & get_val2() const { return expr.val2; } \
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); } \
+}; \
+ \
+template <class T> \
+class __gmp_expr \
+<mpq_t, __gmp_binary_expr<mpz_class, __gmp_expr<mpq_t, T>, eval_fun> > \
+{ \
+private: \
+ typedef mpz_class val1_type; \
+ typedef __gmp_expr<mpq_t, T> val2_type; \
+ \
+ __gmp_binary_expr<val1_type, val2_type, eval_fun> expr; \
+public: \
+ __gmp_expr(const val1_type &val1, const val2_type &val2) \
+ : expr(val1, val2) { } \
+ void eval(mpq_ptr q) const \
+ { \
+ mpq_class temp(expr.val2); \
+ eval_fun::eval(q, expr.val1.get_mpz_t(), temp.get_mpq_t()); \
+ } \
+ const val1_type & get_val1() const { return expr.val1; } \
+ const val2_type & get_val2() const { return expr.val2; } \
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); } \
+}; \
+ \
+template <class T> \
+class __gmp_expr \
+<mpq_t, __gmp_binary_expr<mpq_class, __gmp_expr<mpz_t, T>, eval_fun> > \
+{ \
+private: \
+ typedef mpq_class val1_type; \
+ typedef __gmp_expr<mpz_t, T> val2_type; \
+ \
+ __gmp_binary_expr<val1_type, val2_type, eval_fun> expr; \
+public: \
+ __gmp_expr(const val1_type &val1, const val2_type &val2) \
+ : expr(val1, val2) { } \
+ void eval(mpq_ptr q) const \
+ { \
+ mpz_class temp(expr.val2); \
+ eval_fun::eval(q, expr.val1.get_mpq_t(), temp.get_mpz_t()); \
+ } \
+ const val1_type & get_val1() const { return expr.val1; } \
+ const val2_type & get_val2() const { return expr.val2; } \
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); } \
+}; \
+ \
+template <class T> \
+class __gmp_expr \
+<mpq_t, __gmp_binary_expr<__gmp_expr<mpz_t, T>, mpq_class, eval_fun> > \
+{ \
+private: \
+ typedef __gmp_expr<mpz_t, T> val1_type; \
+ typedef mpq_class val2_type; \
+ \
+ __gmp_binary_expr<val1_type, val2_type, eval_fun> expr; \
+public: \
+ __gmp_expr(const val1_type &val1, const val2_type &val2) \
+ : expr(val1, val2) { } \
+ void eval(mpq_ptr q) const \
+ { \
+ mpz_class temp(expr.val1); \
+ eval_fun::eval(q, temp.get_mpz_t(), expr.val2.get_mpq_t()); \
+ } \
+ const val1_type & get_val1() const { return expr.val1; } \
+ const val2_type & get_val2() const { return expr.val2; } \
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); } \
+}; \
+ \
+template <class T> \
+class __gmp_expr \
+<mpq_t, __gmp_binary_expr<__gmp_expr<mpq_t, T>, mpz_class, eval_fun> > \
+{ \
+private: \
+ typedef __gmp_expr<mpq_t, T> val1_type; \
+ typedef mpz_class val2_type; \
+ \
+ __gmp_binary_expr<val1_type, val2_type, eval_fun> expr; \
+public: \
+ __gmp_expr(const val1_type &val1, const val2_type &val2) \
+ : expr(val1, val2) { } \
+ void eval(mpq_ptr q) const \
+ { \
+ mpq_class temp(expr.val1); \
+ eval_fun::eval(q, temp.get_mpq_t(), expr.val2.get_mpz_t()); \
+ } \
+ const val1_type & get_val1() const { return expr.val1; } \
+ const val2_type & get_val2() const { return expr.val2; } \
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); } \
+}; \
+ \
+template <class T, class U> \
+class __gmp_expr<mpq_t, __gmp_binary_expr \
+<__gmp_expr<mpz_t, T>, __gmp_expr<mpq_t, U>, eval_fun> > \
+{ \
+private: \
+ typedef __gmp_expr<mpz_t, T> val1_type; \
+ typedef __gmp_expr<mpq_t, U> val2_type; \
+ \
+ __gmp_binary_expr<val1_type, val2_type, eval_fun> expr; \
+public: \
+ __gmp_expr(const val1_type &val1, const val2_type &val2) \
+ : expr(val1, val2) { } \
+ void eval(mpq_ptr q) const \
+ { \
+ mpz_class temp1(expr.val1); \
+ expr.val2.eval(q); \
+ eval_fun::eval(q, temp1.get_mpz_t(), q); \
+ } \
+ const val1_type & get_val1() const { return expr.val1; } \
+ const val2_type & get_val2() const { return expr.val2; } \
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); } \
+}; \
+ \
+template <class T, class U> \
+class __gmp_expr<mpq_t, __gmp_binary_expr \
+<__gmp_expr<mpq_t, T>, __gmp_expr<mpz_t, U>, eval_fun> > \
+{ \
+private: \
+ typedef __gmp_expr<mpq_t, T> val1_type; \
+ typedef __gmp_expr<mpz_t, U> val2_type; \
+ \
+ __gmp_binary_expr<val1_type, val2_type, eval_fun> expr; \
+public: \
+ __gmp_expr(const val1_type &val1, const val2_type &val2) \
+ : expr(val1, val2) { } \
+ void eval(mpq_ptr q) const \
+ { \
+ mpz_class temp2(expr.val2); \
+ expr.val1.eval(q); \
+ eval_fun::eval(q, q, temp2.get_mpz_t()); \
+ } \
+ const val1_type & get_val1() const { return expr.val1; } \
+ const val2_type & get_val2() const { return expr.val2; } \
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); } \
+};
+
+
+__GMPZQ_DEFINE_EXPR(__gmp_binary_plus)
+__GMPZQ_DEFINE_EXPR(__gmp_binary_minus)
+
+
+
+/**************** Macros for defining functions ****************/
+/* Results of operators and functions are instances of __gmp_expr<T, U>.
+ T determines the numerical type of the expression: it can be either
+ mpz_t, mpq_t, or mpf_t. When the arguments of a binary
+ expression have different numerical types, __gmp_resolve_expr is used
+ to determine the "larger" type.
+ U is either __gmp_unary_expr<V, Op> or __gmp_binary_expr<V, W, Op>,
+ where V and W are the arguments' types -- they can in turn be
+ expressions, thus allowing to build compound expressions to any
+ degree of complexity.
+ Op is a function object that must have an eval() method accepting
+ appropriate arguments.
+ Actual evaluation of a __gmp_expr<T, U> object is done when it gets
+ assigned to an mp*_class ("lazy" evaluation): this is done by calling
+ its eval() method. */
+
+
+// non-member unary operators and functions
+
+#define __GMP_DEFINE_UNARY_FUNCTION(fun, eval_fun) \
+ \
+template <class T, class U> \
+inline __gmp_expr<T, __gmp_unary_expr<__gmp_expr<T, U>, eval_fun> > \
+fun(const __gmp_expr<T, U> &expr) \
+{ \
+ return __gmp_expr<T, __gmp_unary_expr<__gmp_expr<T, U>, eval_fun> >(expr); \
+}
+
+// variant that only works for one of { mpz, mpq, mpf }
+
+#define __GMP_DEFINE_UNARY_FUNCTION_1(T, fun, eval_fun) \
+ \
+template <class U> \
+inline __gmp_expr<T, __gmp_unary_expr<__gmp_expr<T, U>, eval_fun> > \
+fun(const __gmp_expr<T, U> &expr) \
+{ \
+ return __gmp_expr<T, __gmp_unary_expr<__gmp_expr<T, U>, eval_fun> >(expr); \
+}
+
+#define __GMP_DEFINE_UNARY_TYPE_FUNCTION(type, fun, eval_fun) \
+ \
+template <class T, class U> \
+inline type fun(const __gmp_expr<T, U> &expr) \
+{ \
+ __gmp_expr<T, T> const& temp(expr); \
+ return eval_fun::eval(temp.__get_mp()); \
+}
+
+
+// non-member binary operators and functions
+
+#define __GMPP_DEFINE_BINARY_FUNCTION(fun, eval_fun) \
+ \
+template <class T, class U, class V, class W> \
+inline __gmp_expr<typename __gmp_resolve_expr<T, V>::value_type, \
+__gmp_binary_expr<__gmp_expr<T, U>, __gmp_expr<V, W>, eval_fun> > \
+fun(const __gmp_expr<T, U> &expr1, const __gmp_expr<V, W> &expr2) \
+{ \
+ return __gmp_expr<typename __gmp_resolve_expr<T, V>::value_type, \
+ __gmp_binary_expr<__gmp_expr<T, U>, __gmp_expr<V, W>, eval_fun> > \
+ (expr1, expr2); \
+}
+
+#define __GMPNN_DEFINE_BINARY_FUNCTION(fun, eval_fun, type, bigtype) \
+ \
+template <class T, class U> \
+inline __gmp_expr \
+<T, __gmp_binary_expr<__gmp_expr<T, U>, bigtype, eval_fun> > \
+fun(const __gmp_expr<T, U> &expr, type t) \
+{ \
+ return __gmp_expr \
+ <T, __gmp_binary_expr<__gmp_expr<T, U>, bigtype, eval_fun> >(expr, t); \
+} \
+ \
+template <class T, class U> \
+inline __gmp_expr \
+<T, __gmp_binary_expr<bigtype, __gmp_expr<T, U>, eval_fun> > \
+fun(type t, const __gmp_expr<T, U> &expr) \
+{ \
+ return __gmp_expr \
+ <T, __gmp_binary_expr<bigtype, __gmp_expr<T, U>, eval_fun> >(t, expr); \
+}
+
+#define __GMPNS_DEFINE_BINARY_FUNCTION(fun, eval_fun, type) \
+__GMPNN_DEFINE_BINARY_FUNCTION(fun, eval_fun, type, signed long int)
+
+#define __GMPNU_DEFINE_BINARY_FUNCTION(fun, eval_fun, type) \
+__GMPNN_DEFINE_BINARY_FUNCTION(fun, eval_fun, type, unsigned long int)
+
+#define __GMPND_DEFINE_BINARY_FUNCTION(fun, eval_fun, type) \
+__GMPNN_DEFINE_BINARY_FUNCTION(fun, eval_fun, type, double)
+
+#define __GMPNLD_DEFINE_BINARY_FUNCTION(fun, eval_fun, type) \
+__GMPNN_DEFINE_BINARY_FUNCTION(fun, eval_fun, type, long double)
+
+#define __GMPN_DEFINE_BINARY_FUNCTION(fun, eval_fun) \
+__GMPNS_DEFINE_BINARY_FUNCTION(fun, eval_fun, signed char) \
+__GMPNU_DEFINE_BINARY_FUNCTION(fun, eval_fun, unsigned char) \
+__GMPNS_DEFINE_BINARY_FUNCTION(fun, eval_fun, signed int) \
+__GMPNU_DEFINE_BINARY_FUNCTION(fun, eval_fun, unsigned int) \
+__GMPNS_DEFINE_BINARY_FUNCTION(fun, eval_fun, signed short int) \
+__GMPNU_DEFINE_BINARY_FUNCTION(fun, eval_fun, unsigned short int) \
+__GMPNS_DEFINE_BINARY_FUNCTION(fun, eval_fun, signed long int) \
+__GMPNU_DEFINE_BINARY_FUNCTION(fun, eval_fun, unsigned long int) \
+__GMPND_DEFINE_BINARY_FUNCTION(fun, eval_fun, float) \
+__GMPND_DEFINE_BINARY_FUNCTION(fun, eval_fun, double) \
+/* __GMPNLD_DEFINE_BINARY_FUNCTION(fun, eval_fun, long double) */
+
+#define __GMP_DEFINE_BINARY_FUNCTION(fun, eval_fun) \
+__GMPP_DEFINE_BINARY_FUNCTION(fun, eval_fun) \
+__GMPN_DEFINE_BINARY_FUNCTION(fun, eval_fun)
+
+// variant that only works for one of { mpz, mpq, mpf }
+
+#define __GMPP_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun) \
+ \
+template <class U, class W> \
+inline __gmp_expr<T, \
+__gmp_binary_expr<__gmp_expr<T, U>, __gmp_expr<T, W>, eval_fun> > \
+fun(const __gmp_expr<T, U> &expr1, const __gmp_expr<T, W> &expr2) \
+{ \
+ return __gmp_expr<T, \
+ __gmp_binary_expr<__gmp_expr<T, U>, __gmp_expr<T, W>, eval_fun> > \
+ (expr1, expr2); \
+}
+
+#define __GMPNN_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, type, bigtype) \
+ \
+template <class U> \
+inline __gmp_expr \
+<T, __gmp_binary_expr<__gmp_expr<T, U>, bigtype, eval_fun> > \
+fun(const __gmp_expr<T, U> &expr, type t) \
+{ \
+ return __gmp_expr \
+ <T, __gmp_binary_expr<__gmp_expr<T, U>, bigtype, eval_fun> >(expr, t); \
+} \
+ \
+template <class U> \
+inline __gmp_expr \
+<T, __gmp_binary_expr<bigtype, __gmp_expr<T, U>, eval_fun> > \
+fun(type t, const __gmp_expr<T, U> &expr) \
+{ \
+ return __gmp_expr \
+ <T, __gmp_binary_expr<bigtype, __gmp_expr<T, U>, eval_fun> >(t, expr); \
+}
+
+#define __GMPNS_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, type) \
+__GMPNN_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, type, signed long int)
+
+#define __GMPNU_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, type) \
+__GMPNN_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, type, unsigned long int)
+
+#define __GMPND_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, type) \
+__GMPNN_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, type, double)
+
+#define __GMPNLD_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, type) \
+__GMPNN_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, type, long double)
+
+#define __GMPN_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun) \
+__GMPNS_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, signed char) \
+__GMPNU_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, unsigned char) \
+__GMPNS_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, signed int) \
+__GMPNU_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, unsigned int) \
+__GMPNS_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, signed short int) \
+__GMPNU_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, unsigned short int) \
+__GMPNS_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, signed long int) \
+__GMPNU_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, unsigned long int) \
+__GMPND_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, float) \
+__GMPND_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, double) \
+/* __GMPNLD_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun, long double) */
+
+#define __GMP_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun) \
+__GMPP_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun) \
+__GMPN_DEFINE_BINARY_FUNCTION_1(T, fun, eval_fun)
+
+
+#define __GMP_DEFINE_BINARY_FUNCTION_UI(fun, eval_fun) \
+ \
+template <class T, class U> \
+inline __gmp_expr \
+<T, __gmp_binary_expr<__gmp_expr<T, U>, mp_bitcnt_t, eval_fun> > \
+fun(const __gmp_expr<T, U> &expr, mp_bitcnt_t l) \
+{ \
+ return __gmp_expr<T, __gmp_binary_expr \
+ <__gmp_expr<T, U>, mp_bitcnt_t, eval_fun> >(expr, l); \
+}
+
+
+#define __GMPP_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun) \
+ \
+template <class T, class U, class V, class W> \
+inline type fun(const __gmp_expr<T, U> &expr1, \
+ const __gmp_expr<V, W> &expr2) \
+{ \
+ __gmp_expr<T, T> const& temp1(expr1); \
+ __gmp_expr<V, V> const& temp2(expr2); \
+ return eval_fun::eval(temp1.__get_mp(), temp2.__get_mp()); \
+}
+
+#define __GMPNN_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, \
+ type2, bigtype) \
+ \
+template <class T, class U> \
+inline type fun(const __gmp_expr<T, U> &expr, type2 t) \
+{ \
+ __gmp_expr<T, T> const& temp(expr); \
+ return eval_fun::eval(temp.__get_mp(), static_cast<bigtype>(t)); \
+} \
+ \
+template <class T, class U> \
+inline type fun(type2 t, const __gmp_expr<T, U> &expr) \
+{ \
+ __gmp_expr<T, T> const& temp(expr); \
+ return eval_fun::eval(static_cast<bigtype>(t), temp.__get_mp()); \
+}
+
+#define __GMPNS_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, type2) \
+__GMPNN_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, \
+ type2, signed long int)
+
+#define __GMPNU_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, type2) \
+__GMPNN_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, \
+ type2, unsigned long int)
+
+#define __GMPND_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, type2) \
+__GMPNN_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, type2, double)
+
+#define __GMPNLD_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, type2) \
+__GMPNN_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, type2, long double)
+
+#define __GMPN_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun) \
+__GMPNS_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, signed char) \
+__GMPNU_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, unsigned char) \
+__GMPNS_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, signed int) \
+__GMPNU_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, unsigned int) \
+__GMPNS_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, signed short int) \
+__GMPNU_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, unsigned short int) \
+__GMPNS_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, signed long int) \
+__GMPNU_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, unsigned long int) \
+__GMPND_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, float) \
+__GMPND_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, double) \
+/* __GMPNLD_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun, long double) */
+
+#define __GMP_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun) \
+__GMPP_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun) \
+__GMPN_DEFINE_BINARY_TYPE_FUNCTION(type, fun, eval_fun)
+
+
+// member operators
+
+#define __GMPP_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun) \
+ \
+template <class T, class U> \
+inline type##_class & type##_class::fun(const __gmp_expr<T, U> &expr) \
+{ \
+ __gmp_set_expr(mp, __gmp_expr<type##_t, __gmp_binary_expr \
+ <type##_class, __gmp_expr<T, U>, eval_fun> >(*this, expr)); \
+ return *this; \
+}
+
+#define __GMPNN_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, \
+ type2, bigtype) \
+ \
+inline type##_class & type##_class::fun(type2 t) \
+{ \
+ __gmp_set_expr(mp, __gmp_expr<type##_t, __gmp_binary_expr \
+ <type##_class, bigtype, eval_fun> >(*this, t)); \
+ return *this; \
+}
+
+#define __GMPNS_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, type2) \
+__GMPNN_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, \
+ type2, signed long int)
+
+#define __GMPNU_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, type2) \
+__GMPNN_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, \
+ type2, unsigned long int)
+
+#define __GMPND_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, type2) \
+__GMPNN_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, type2, double)
+
+#define __GMPNLD_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, type2) \
+__GMPNN_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, type2, long double)
+
+#define __GMPN_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun) \
+__GMPNS_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, signed char) \
+__GMPNU_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, unsigned char) \
+__GMPNS_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, signed int) \
+__GMPNU_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, unsigned int) \
+__GMPNS_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, signed short int) \
+__GMPNU_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, unsigned short int) \
+__GMPNS_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, signed long int) \
+__GMPNU_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, unsigned long int) \
+__GMPND_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, float) \
+__GMPND_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, double) \
+/* __GMPNLD_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun, long double) */
+
+#define __GMP_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun) \
+__GMPP_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun) \
+__GMPN_DEFINE_COMPOUND_OPERATOR(type, fun, eval_fun)
+
+#define __GMPZ_DEFINE_COMPOUND_OPERATOR(fun, eval_fun) \
+__GMP_DEFINE_COMPOUND_OPERATOR(mpz, fun, eval_fun)
+
+#define __GMPQ_DEFINE_COMPOUND_OPERATOR(fun, eval_fun) \
+__GMP_DEFINE_COMPOUND_OPERATOR(mpq, fun, eval_fun)
+
+#define __GMPF_DEFINE_COMPOUND_OPERATOR(fun, eval_fun) \
+__GMP_DEFINE_COMPOUND_OPERATOR(mpf, fun, eval_fun)
+
+
+
+#define __GMP_DEFINE_COMPOUND_OPERATOR_UI(type, fun, eval_fun) \
+ \
+inline type##_class & type##_class::fun(mp_bitcnt_t l) \
+{ \
+ __gmp_set_expr(mp, __gmp_expr<type##_t, __gmp_binary_expr \
+ <type##_class, mp_bitcnt_t, eval_fun> >(*this, l)); \
+ return *this; \
+}
+
+#define __GMPZ_DEFINE_COMPOUND_OPERATOR_UI(fun, eval_fun) \
+__GMP_DEFINE_COMPOUND_OPERATOR_UI(mpz, fun, eval_fun)
+
+#define __GMPQ_DEFINE_COMPOUND_OPERATOR_UI(fun, eval_fun) \
+__GMP_DEFINE_COMPOUND_OPERATOR_UI(mpq, fun, eval_fun)
+
+#define __GMPF_DEFINE_COMPOUND_OPERATOR_UI(fun, eval_fun) \
+__GMP_DEFINE_COMPOUND_OPERATOR_UI(mpf, fun, eval_fun)
+
+
+
+#define __GMP_DEFINE_INCREMENT_OPERATOR(type, fun, eval_fun) \
+ \
+inline type##_class & type##_class::fun() \
+{ \
+ eval_fun::eval(mp); \
+ return *this; \
+} \
+ \
+inline type##_class type##_class::fun(int) \
+{ \
+ type##_class temp(*this); \
+ eval_fun::eval(mp); \
+ return temp; \
+}
+
+#define __GMPZ_DEFINE_INCREMENT_OPERATOR(fun, eval_fun) \
+__GMP_DEFINE_INCREMENT_OPERATOR(mpz, fun, eval_fun)
+
+#define __GMPQ_DEFINE_INCREMENT_OPERATOR(fun, eval_fun) \
+__GMP_DEFINE_INCREMENT_OPERATOR(mpq, fun, eval_fun)
+
+#define __GMPF_DEFINE_INCREMENT_OPERATOR(fun, eval_fun) \
+__GMP_DEFINE_INCREMENT_OPERATOR(mpf, fun, eval_fun)
+
+
+#define __GMPP_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun) \
+template <class U> \
+__gmp_expr<T, __gmp_unary_expr<__gmp_expr<T, U>, eval_fun> > \
+fun(const __gmp_expr<T, U> &expr) \
+{ \
+ return __gmp_expr<T, __gmp_unary_expr<__gmp_expr<T, U>, eval_fun> >(expr); \
+}
+
+#define __GMPNN_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type, bigtype) \
+inline __gmp_expr<T, __gmp_unary_expr<bigtype, eval_fun> > \
+fun(type expr) \
+{ \
+ return __gmp_expr<T, __gmp_unary_expr<bigtype, eval_fun> >(expr); \
+}
+
+#define __GMPNS_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type) \
+__GMPNN_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type, signed long)
+#define __GMPNU_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type) \
+__GMPNN_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type, unsigned long)
+#define __GMPND_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type) \
+__GMPNN_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, type, double)
+
+#define __GMPN_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun) \
+__GMPNS_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, signed char) \
+__GMPNU_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, unsigned char) \
+__GMPNS_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, signed int) \
+__GMPNU_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, unsigned int) \
+__GMPNS_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, signed short int) \
+__GMPNU_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, unsigned short int) \
+__GMPNS_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, signed long int) \
+__GMPNU_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, unsigned long int) \
+__GMPND_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, float) \
+__GMPND_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun, double) \
+
+#define __GMP_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun) \
+__GMPP_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun) \
+__GMPN_DEFINE_UNARY_STATIC_MEMFUN(T, fun, eval_fun) \
+
+
+/**************** Arithmetic operators and functions ****************/
+
+// non-member operators and functions
+
+__GMP_DEFINE_UNARY_FUNCTION(operator+, __gmp_unary_plus)
+__GMP_DEFINE_UNARY_FUNCTION(operator-, __gmp_unary_minus)
+__GMP_DEFINE_UNARY_FUNCTION_1(mpz_t, operator~, __gmp_unary_com)
+
+__GMP_DEFINE_BINARY_FUNCTION(operator+, __gmp_binary_plus)
+__GMP_DEFINE_BINARY_FUNCTION(operator-, __gmp_binary_minus)
+__GMP_DEFINE_BINARY_FUNCTION(operator*, __gmp_binary_multiplies)
+__GMP_DEFINE_BINARY_FUNCTION(operator/, __gmp_binary_divides)
+__GMP_DEFINE_BINARY_FUNCTION_1(mpz_t, operator%, __gmp_binary_modulus)
+__GMP_DEFINE_BINARY_FUNCTION_1(mpz_t, operator&, __gmp_binary_and)
+__GMP_DEFINE_BINARY_FUNCTION_1(mpz_t, operator|, __gmp_binary_ior)
+__GMP_DEFINE_BINARY_FUNCTION_1(mpz_t, operator^, __gmp_binary_xor)
+
+__GMP_DEFINE_BINARY_FUNCTION_UI(operator<<, __gmp_binary_lshift)
+__GMP_DEFINE_BINARY_FUNCTION_UI(operator>>, __gmp_binary_rshift)
+
+__GMP_DEFINE_BINARY_TYPE_FUNCTION(bool, operator==, __gmp_binary_equal)
+__GMP_DEFINE_BINARY_TYPE_FUNCTION(bool, operator!=, ! __gmp_binary_equal)
+__GMP_DEFINE_BINARY_TYPE_FUNCTION(bool, operator<, __gmp_binary_less)
+__GMP_DEFINE_BINARY_TYPE_FUNCTION(bool, operator<=, ! __gmp_binary_greater)
+__GMP_DEFINE_BINARY_TYPE_FUNCTION(bool, operator>, __gmp_binary_greater)
+__GMP_DEFINE_BINARY_TYPE_FUNCTION(bool, operator>=, ! __gmp_binary_less)
+
+__GMP_DEFINE_UNARY_FUNCTION(abs, __gmp_abs_function)
+__GMP_DEFINE_UNARY_FUNCTION_1(mpf_t, trunc, __gmp_trunc_function)
+__GMP_DEFINE_UNARY_FUNCTION_1(mpf_t, floor, __gmp_floor_function)
+__GMP_DEFINE_UNARY_FUNCTION_1(mpf_t, ceil, __gmp_ceil_function)
+__GMP_DEFINE_UNARY_FUNCTION_1(mpf_t, sqrt, __gmp_sqrt_function)
+__GMP_DEFINE_UNARY_FUNCTION_1(mpz_t, sqrt, __gmp_sqrt_function)
+__GMP_DEFINE_UNARY_FUNCTION_1(mpz_t, factorial, __gmp_fac_function)
+__GMP_DEFINE_UNARY_FUNCTION_1(mpz_t, primorial, __gmp_primorial_function)
+__GMP_DEFINE_UNARY_FUNCTION_1(mpz_t, fibonacci, __gmp_fib_function)
+__GMP_DEFINE_BINARY_FUNCTION_1(mpf_t, hypot, __gmp_hypot_function)
+__GMP_DEFINE_BINARY_FUNCTION_1(mpz_t, gcd, __gmp_gcd_function)
+__GMP_DEFINE_BINARY_FUNCTION_1(mpz_t, lcm, __gmp_lcm_function)
+
+__GMP_DEFINE_UNARY_TYPE_FUNCTION(int, sgn, __gmp_sgn_function)
+__GMP_DEFINE_BINARY_TYPE_FUNCTION(int, cmp, __gmp_cmp_function)
+
+template <class T>
+void swap(__gmp_expr<T, T>& x, __gmp_expr<T, T>& y) __GMPXX_NOEXCEPT
+{ x.swap(y); }
+
+// member operators for mpz_class
+
+__GMPZ_DEFINE_COMPOUND_OPERATOR(operator+=, __gmp_binary_plus)
+__GMPZ_DEFINE_COMPOUND_OPERATOR(operator-=, __gmp_binary_minus)
+__GMPZ_DEFINE_COMPOUND_OPERATOR(operator*=, __gmp_binary_multiplies)
+__GMPZ_DEFINE_COMPOUND_OPERATOR(operator/=, __gmp_binary_divides)
+__GMPZ_DEFINE_COMPOUND_OPERATOR(operator%=, __gmp_binary_modulus)
+
+__GMPZ_DEFINE_COMPOUND_OPERATOR(operator&=, __gmp_binary_and)
+__GMPZ_DEFINE_COMPOUND_OPERATOR(operator|=, __gmp_binary_ior)
+__GMPZ_DEFINE_COMPOUND_OPERATOR(operator^=, __gmp_binary_xor)
+
+__GMPZ_DEFINE_COMPOUND_OPERATOR_UI(operator<<=, __gmp_binary_lshift)
+__GMPZ_DEFINE_COMPOUND_OPERATOR_UI(operator>>=, __gmp_binary_rshift)
+
+__GMPZ_DEFINE_INCREMENT_OPERATOR(operator++, __gmp_unary_increment)
+__GMPZ_DEFINE_INCREMENT_OPERATOR(operator--, __gmp_unary_decrement)
+
+__GMP_DEFINE_UNARY_STATIC_MEMFUN(mpz_t, mpz_class::factorial, __gmp_fac_function)
+__GMP_DEFINE_UNARY_STATIC_MEMFUN(mpz_t, mpz_class::primorial, __gmp_primorial_function)
+__GMP_DEFINE_UNARY_STATIC_MEMFUN(mpz_t, mpz_class::fibonacci, __gmp_fib_function)
+
+// member operators for mpq_class
+
+__GMPQ_DEFINE_COMPOUND_OPERATOR(operator+=, __gmp_binary_plus)
+__GMPQ_DEFINE_COMPOUND_OPERATOR(operator-=, __gmp_binary_minus)
+__GMPQ_DEFINE_COMPOUND_OPERATOR(operator*=, __gmp_binary_multiplies)
+__GMPQ_DEFINE_COMPOUND_OPERATOR(operator/=, __gmp_binary_divides)
+
+__GMPQ_DEFINE_COMPOUND_OPERATOR_UI(operator<<=, __gmp_binary_lshift)
+__GMPQ_DEFINE_COMPOUND_OPERATOR_UI(operator>>=, __gmp_binary_rshift)
+
+__GMPQ_DEFINE_INCREMENT_OPERATOR(operator++, __gmp_unary_increment)
+__GMPQ_DEFINE_INCREMENT_OPERATOR(operator--, __gmp_unary_decrement)
+
+// member operators for mpf_class
+
+__GMPF_DEFINE_COMPOUND_OPERATOR(operator+=, __gmp_binary_plus)
+__GMPF_DEFINE_COMPOUND_OPERATOR(operator-=, __gmp_binary_minus)
+__GMPF_DEFINE_COMPOUND_OPERATOR(operator*=, __gmp_binary_multiplies)
+__GMPF_DEFINE_COMPOUND_OPERATOR(operator/=, __gmp_binary_divides)
+
+__GMPF_DEFINE_COMPOUND_OPERATOR_UI(operator<<=, __gmp_binary_lshift)
+__GMPF_DEFINE_COMPOUND_OPERATOR_UI(operator>>=, __gmp_binary_rshift)
+
+__GMPF_DEFINE_INCREMENT_OPERATOR(operator++, __gmp_unary_increment)
+__GMPF_DEFINE_INCREMENT_OPERATOR(operator--, __gmp_unary_decrement)
+
+
+
+/**************** Class wrapper for gmp_randstate_t ****************/
+
+class __gmp_urandomb_value { };
+class __gmp_urandomm_value { };
+
+template <>
+class __gmp_expr<mpz_t, __gmp_urandomb_value>
+{
+private:
+ __gmp_randstate_struct *state;
+ mp_bitcnt_t bits;
+public:
+ __gmp_expr(gmp_randstate_t s, mp_bitcnt_t l) : state(s), bits(l) { }
+ void eval(mpz_ptr z) const { __gmp_rand_function::eval(z, state, bits); }
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); }
+};
+
+template <>
+class __gmp_expr<mpz_t, __gmp_urandomm_value>
+{
+private:
+ __gmp_randstate_struct *state;
+ mpz_class range;
+public:
+ __gmp_expr(gmp_randstate_t s, const mpz_class &z) : state(s), range(z) { }
+ void eval(mpz_ptr z) const
+ { __gmp_rand_function::eval(z, state, range.get_mpz_t()); }
+ mp_bitcnt_t get_prec() const { return mpf_get_default_prec(); }
+};
+
+template <>
+class __gmp_expr<mpf_t, __gmp_urandomb_value>
+{
+private:
+ __gmp_randstate_struct *state;
+ mp_bitcnt_t bits;
+public:
+ __gmp_expr(gmp_randstate_t s, mp_bitcnt_t l) : state(s), bits(l) { }
+ void eval(mpf_ptr f) const
+ {
+ __gmp_rand_function::eval(f, state,
+ (bits>0) ? bits : mpf_get_prec(f));
+ }
+ mp_bitcnt_t get_prec() const
+ {
+ if (bits == 0)
+ return mpf_get_default_prec();
+ else
+ return bits;
+ }
+};
+
+extern "C" {
+ typedef void __gmp_randinit_default_t (gmp_randstate_t);
+ typedef void __gmp_randinit_lc_2exp_t (gmp_randstate_t, mpz_srcptr, unsigned long int, mp_bitcnt_t);
+ typedef int __gmp_randinit_lc_2exp_size_t (gmp_randstate_t, mp_bitcnt_t);
+}
+
+class gmp_randclass
+{
+private:
+ gmp_randstate_t state;
+
+ // copy construction and assignment not allowed
+ gmp_randclass(const gmp_randclass &);
+ void operator=(const gmp_randclass &);
+public:
+ // constructors and destructor
+ gmp_randclass(gmp_randalg_t alg, unsigned long int size)
+ {
+ switch (alg)
+ {
+ case GMP_RAND_ALG_LC: // no other cases for now
+ default:
+ gmp_randinit(state, alg, size);
+ break;
+ }
+ }
+
+ // gmp_randinit_default
+ gmp_randclass(__gmp_randinit_default_t* f) { f(state); }
+
+ // gmp_randinit_lc_2exp
+ gmp_randclass(__gmp_randinit_lc_2exp_t* f,
+ mpz_class z, unsigned long int l1, mp_bitcnt_t l2)
+ { f(state, z.get_mpz_t(), l1, l2); }
+
+ // gmp_randinit_lc_2exp_size
+ gmp_randclass(__gmp_randinit_lc_2exp_size_t* f,
+ mp_bitcnt_t size)
+ {
+ if (f (state, size) == 0)
+ throw std::length_error ("gmp_randinit_lc_2exp_size");
+ }
+
+ ~gmp_randclass() { gmp_randclear(state); }
+
+ // initialize
+ void seed(); // choose a random seed some way (?)
+ void seed(unsigned long int s) { gmp_randseed_ui(state, s); }
+ void seed(const mpz_class &z) { gmp_randseed(state, z.get_mpz_t()); }
+
+ // get random number
+ __gmp_expr<mpz_t, __gmp_urandomb_value> get_z_bits(mp_bitcnt_t l)
+ { return __gmp_expr<mpz_t, __gmp_urandomb_value>(state, l); }
+ __gmp_expr<mpz_t, __gmp_urandomb_value> get_z_bits(const mpz_class &z)
+ { return get_z_bits(z.get_ui()); }
+ // FIXME: z.get_bitcnt_t() ?
+
+ __gmp_expr<mpz_t, __gmp_urandomm_value> get_z_range(const mpz_class &z)
+ { return __gmp_expr<mpz_t, __gmp_urandomm_value>(state, z); }
+
+ __gmp_expr<mpf_t, __gmp_urandomb_value> get_f(mp_bitcnt_t prec = 0)
+ { return __gmp_expr<mpf_t, __gmp_urandomb_value>(state, prec); }
+};
+
+
+/**************** Specialize std::numeric_limits ****************/
+
+namespace std {
+ template <> class numeric_limits<mpz_class>
+ {
+ public:
+ static const bool is_specialized = true;
+ static mpz_class min() { return mpz_class(); }
+ static mpz_class max() { return mpz_class(); }
+ static mpz_class lowest() { return mpz_class(); }
+ static const int digits = 0;
+ static const int digits10 = 0;
+ static const int max_digits10 = 0;
+ static const bool is_signed = true;
+ static const bool is_integer = true;
+ static const bool is_exact = true;
+ static const int radix = 2;
+ static mpz_class epsilon() { return mpz_class(); }
+ static mpz_class round_error() { return mpz_class(); }
+ static const int min_exponent = 0;
+ static const int min_exponent10 = 0;
+ static const int max_exponent = 0;
+ static const int max_exponent10 = 0;
+ static const bool has_infinity = false;
+ static const bool has_quiet_NaN = false;
+ static const bool has_signaling_NaN = false;
+ static const float_denorm_style has_denorm = denorm_absent;
+ static const bool has_denorm_loss = false;
+ static mpz_class infinity() { return mpz_class(); }
+ static mpz_class quiet_NaN() { return mpz_class(); }
+ static mpz_class signaling_NaN() { return mpz_class(); }
+ static mpz_class denorm_min() { return mpz_class(); }
+ static const bool is_iec559 = false;
+ static const bool is_bounded = false;
+ static const bool is_modulo = false;
+ static const bool traps = false;
+ static const bool tinyness_before = false;
+ static const float_round_style round_style = round_toward_zero;
+ };
+
+ template <> class numeric_limits<mpq_class>
+ {
+ public:
+ static const bool is_specialized = true;
+ static mpq_class min() { return mpq_class(); }
+ static mpq_class max() { return mpq_class(); }
+ static mpq_class lowest() { return mpq_class(); }
+ static const int digits = 0;
+ static const int digits10 = 0;
+ static const int max_digits10 = 0;
+ static const bool is_signed = true;
+ static const bool is_integer = false;
+ static const bool is_exact = true;
+ static const int radix = 2;
+ static mpq_class epsilon() { return mpq_class(); }
+ static mpq_class round_error() { return mpq_class(); }
+ static const int min_exponent = 0;
+ static const int min_exponent10 = 0;
+ static const int max_exponent = 0;
+ static const int max_exponent10 = 0;
+ static const bool has_infinity = false;
+ static const bool has_quiet_NaN = false;
+ static const bool has_signaling_NaN = false;
+ static const float_denorm_style has_denorm = denorm_absent;
+ static const bool has_denorm_loss = false;
+ static mpq_class infinity() { return mpq_class(); }
+ static mpq_class quiet_NaN() { return mpq_class(); }
+ static mpq_class signaling_NaN() { return mpq_class(); }
+ static mpq_class denorm_min() { return mpq_class(); }
+ static const bool is_iec559 = false;
+ static const bool is_bounded = false;
+ static const bool is_modulo = false;
+ static const bool traps = false;
+ static const bool tinyness_before = false;
+ static const float_round_style round_style = round_toward_zero;
+ };
+
+ template <> class numeric_limits<mpf_class>
+ {
+ public:
+ static const bool is_specialized = true;
+ static mpf_class min() { return mpf_class(); }
+ static mpf_class max() { return mpf_class(); }
+ static mpf_class lowest() { return mpf_class(); }
+ static const int digits = 0;
+ static const int digits10 = 0;
+ static const int max_digits10 = 0;
+ static const bool is_signed = true;
+ static const bool is_integer = false;
+ static const bool is_exact = false;
+ static const int radix = 2;
+ static mpf_class epsilon() { return mpf_class(); }
+ static mpf_class round_error() { return mpf_class(); }
+ static const int min_exponent = 0;
+ static const int min_exponent10 = 0;
+ static const int max_exponent = 0;
+ static const int max_exponent10 = 0;
+ static const bool has_infinity = false;
+ static const bool has_quiet_NaN = false;
+ static const bool has_signaling_NaN = false;
+ static const float_denorm_style has_denorm = denorm_absent;
+ static const bool has_denorm_loss = false;
+ static mpf_class infinity() { return mpf_class(); }
+ static mpf_class quiet_NaN() { return mpf_class(); }
+ static mpf_class signaling_NaN() { return mpf_class(); }
+ static mpf_class denorm_min() { return mpf_class(); }
+ static const bool is_iec559 = false;
+ static const bool is_bounded = false;
+ static const bool is_modulo = false;
+ static const bool traps = false;
+ static const bool tinyness_before = false;
+ static const float_round_style round_style = round_indeterminate;
+ };
+}
+
+
+/**************** #undef all private macros ****************/
+
+#undef __GMPP_DECLARE_COMPOUND_OPERATOR
+#undef __GMPN_DECLARE_COMPOUND_OPERATOR
+#undef __GMP_DECLARE_COMPOUND_OPERATOR
+#undef __GMP_DECLARE_COMPOUND_OPERATOR_UI
+#undef __GMP_DECLARE_INCREMENT_OPERATOR
+#undef __GMPXX_DEFINE_ARITHMETIC_CONSTRUCTORS
+#undef __GMPXX_DEFINE_ARITHMETIC_ASSIGNMENTS
+
+#undef __GMPZQ_DEFINE_EXPR
+
+#undef __GMP_DEFINE_UNARY_FUNCTION_1
+#undef __GMP_DEFINE_UNARY_FUNCTION
+#undef __GMP_DEFINE_UNARY_TYPE_FUNCTION
+
+#undef __GMPP_DEFINE_BINARY_FUNCTION
+#undef __GMPNN_DEFINE_BINARY_FUNCTION
+#undef __GMPNS_DEFINE_BINARY_FUNCTION
+#undef __GMPNU_DEFINE_BINARY_FUNCTION
+#undef __GMPND_DEFINE_BINARY_FUNCTION
+#undef __GMPNLD_DEFINE_BINARY_FUNCTION
+#undef __GMPN_DEFINE_BINARY_FUNCTION
+#undef __GMP_DEFINE_BINARY_FUNCTION
+
+#undef __GMP_DEFINE_BINARY_FUNCTION_UI
+
+#undef __GMPP_DEFINE_BINARY_TYPE_FUNCTION
+#undef __GMPNN_DEFINE_BINARY_TYPE_FUNCTION
+#undef __GMPNS_DEFINE_BINARY_TYPE_FUNCTION
+#undef __GMPNU_DEFINE_BINARY_TYPE_FUNCTION
+#undef __GMPND_DEFINE_BINARY_TYPE_FUNCTION
+#undef __GMPNLD_DEFINE_BINARY_TYPE_FUNCTION
+#undef __GMPN_DEFINE_BINARY_TYPE_FUNCTION
+#undef __GMP_DEFINE_BINARY_TYPE_FUNCTION
+
+#undef __GMPZ_DEFINE_COMPOUND_OPERATOR
+
+#undef __GMPP_DEFINE_COMPOUND_OPERATOR
+#undef __GMPNN_DEFINE_COMPOUND_OPERATOR
+#undef __GMPNS_DEFINE_COMPOUND_OPERATOR
+#undef __GMPNU_DEFINE_COMPOUND_OPERATOR
+#undef __GMPND_DEFINE_COMPOUND_OPERATOR
+#undef __GMPNLD_DEFINE_COMPOUND_OPERATOR
+#undef __GMPN_DEFINE_COMPOUND_OPERATOR
+#undef __GMP_DEFINE_COMPOUND_OPERATOR
+
+#undef __GMPQ_DEFINE_COMPOUND_OPERATOR
+#undef __GMPF_DEFINE_COMPOUND_OPERATOR
+
+#undef __GMP_DEFINE_COMPOUND_OPERATOR_UI
+#undef __GMPZ_DEFINE_COMPOUND_OPERATOR_UI
+#undef __GMPQ_DEFINE_COMPOUND_OPERATOR_UI
+#undef __GMPF_DEFINE_COMPOUND_OPERATOR_UI
+
+#undef __GMP_DEFINE_INCREMENT_OPERATOR
+#undef __GMPZ_DEFINE_INCREMENT_OPERATOR
+#undef __GMPQ_DEFINE_INCREMENT_OPERATOR
+#undef __GMPF_DEFINE_INCREMENT_OPERATOR
+
+#undef __GMPXX_CONSTANT_TRUE
+#undef __GMPXX_CONSTANT
+
+#endif /* __GMP_PLUSPLUS__ */
--- /dev/null
+# libgmp.la - a libtool library file
+# Generated by libtool (GNU libtool) 2.4.6
+#
+# Please DO NOT delete this file!
+# It is necessary for linking the library.
+
+# The name that we can dlopen(3).
+dlname=''
+
+# Names of this library.
+library_names=''
+
+# The name of the static archive.
+old_library='libgmp.a'
+
+# Linker flags that cannot go in dependency_libs.
+inherited_linker_flags=''
+
+# Libraries that this one depends upon.
+dependency_libs=''
+
+# Names of additional weak libraries provided by this library
+weak_library_names=''
+
+# Version information for libgmp.
+current=15
+age=5
+revision=0
+
+# Is this an already installed library?
+installed=yes
+
+# Should we warn about portability when linking against -modules?
+shouldnotlink=no
+
+# Files to dlopen/dlpreopen
+dlopen=''
+dlpreopen=''
+
+# Directory that this library needs to be installed in:
+libdir='/home/gitpod/opt/lib'
--- /dev/null
+# libgmpxx.la - a libtool library file
+# Generated by libtool (GNU libtool) 2.4.6
+#
+# Please DO NOT delete this file!
+# It is necessary for linking the library.
+
+# The name that we can dlopen(3).
+dlname=''
+
+# Names of this library.
+library_names=''
+
+# The name of the static archive.
+old_library='libgmpxx.a'
+
+# Linker flags that cannot go in dependency_libs.
+inherited_linker_flags=''
+
+# Libraries that this one depends upon.
+dependency_libs=' /home/gitpod/opt/lib/libgmp.la'
+
+# Names of additional weak libraries provided by this library
+weak_library_names=''
+
+# Version information for libgmpxx.
+current=11
+age=7
+revision=0
+
+# Is this an already installed library?
+installed=yes
+
+# Should we warn about portability when linking against -modules?
+shouldnotlink=no
+
+# Files to dlopen/dlpreopen
+dlopen=''
+dlpreopen=''
+
+# Directory that this library needs to be installed in:
+libdir='/home/gitpod/opt/lib'
--- /dev/null
+prefix=/home/gitpod/opt
+exec_prefix=${prefix}
+includedir=${prefix}/include
+libdir=${exec_prefix}/lib
+
+Name: GNU MP
+Description: GNU Multiple Precision Arithmetic Library
+URL: https://gmplib.org
+Version: 6.3.0
+Cflags: -I${includedir}
+Libs: -L${libdir} -lgmp
--- /dev/null
+prefix=/home/gitpod/opt
+exec_prefix=${prefix}
+includedir=${prefix}/include
+libdir=${exec_prefix}/lib
+
+Name: GNU MP C++
+Description: GNU Multiple Precision Arithmetic Library (C++ bindings)
+URL: https://gmplib.org
+Version: 6.3.0
+Requires: gmp
+Cflags: -I${includedir}
+Libs: -L${libdir} -lgmpxx
--- /dev/null
+This is the file .../info/dir, which contains the
+topmost node of the Info hierarchy, called (dir)Top.
+The first time you invoke Info you start off looking at this node.
+\1f
+File: dir, Node: Top This is the top of the INFO tree
+
+ This (the Directory node) gives a menu of major topics.
+ Typing "q" exits, "H" lists all Info commands, "d" returns here,
+ "h" gives a primer for first-timers,
+ "mEmacs<Return>" visits the Emacs manual, etc.
+
+ In Emacs, you can click mouse button 2 on a menu item or cross reference
+ to select it.
+
+* Menu:
+
+GNU libraries
+* gmp: (gmp). GNU Multiple Precision Arithmetic Library.
--- /dev/null
+This is gmp.info, produced by makeinfo version 6.7 from gmp.texi.
+
+This manual describes how to install and use the GNU multiple precision
+arithmetic library, version 6.3.0.
+
+ Copyright 1991, 1993-2016, 2018-2020 Free Software Foundation, Inc.
+
+ Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.3 or
+any later version published by the Free Software Foundation; with no
+Invariant Sections, with the Front-Cover Texts being "A GNU Manual", and
+with the Back-Cover Texts being "You have freedom to copy and modify
+this GNU Manual, like GNU software". A copy of the license is included
+in *note GNU Free Documentation License::.
+INFO-DIR-SECTION GNU libraries
+START-INFO-DIR-ENTRY
+* gmp: (gmp). GNU Multiple Precision Arithmetic Library.
+END-INFO-DIR-ENTRY
+
+\1f
+Indirect:
+gmp.info-1: 863
+gmp.info-2: 301246
+\1f
+Tag Table:
+(Indirect)
+Node: Top\7f863
+Node: Copying\7f2941
+Node: Introduction to GMP\7f5288
+Node: Installing GMP\7f8006
+Node: Build Options\7f8738
+Node: ABI and ISA\7f24450
+Node: Notes for Package Builds\7f34296
+Node: Notes for Particular Systems\7f37383
+Node: Known Build Problems\7f45134
+Node: Performance optimization\7f48667
+Node: GMP Basics\7f49795
+Node: Headers and Libraries\7f50443
+Node: Nomenclature and Types\7f52054
+Node: Function Classes\7f56262
+Node: Variable Conventions\7f57797
+Node: Parameter Conventions\7f60151
+Node: Memory Management\7f62103
+Node: Reentrancy\7f63231
+Node: Useful Macros and Constants\7f65099
+Node: Compatibility with older versions\7f66090
+Node: Demonstration Programs\7f67000
+Node: Efficiency\7f68859
+Node: Debugging\7f76461
+Node: Profiling\7f83236
+Node: Autoconf\7f87227
+Node: Emacs\7f89008
+Node: Reporting Bugs\7f89614
+Node: Integer Functions\7f92311
+Node: Initializing Integers\7f93087
+Node: Assigning Integers\7f95463
+Node: Simultaneous Integer Init & Assign\7f97076
+Node: Converting Integers\7f98723
+Node: Integer Arithmetic\7f101663
+Node: Integer Division\7f103399
+Node: Integer Exponentiation\7f110158
+Node: Integer Roots\7f111655
+Node: Number Theoretic Functions\7f113372
+Node: Integer Comparisons\7f121149
+Node: Integer Logic and Bit Fiddling\7f122587
+Node: I/O of Integers\7f125385
+Node: Integer Random Numbers\7f128378
+Node: Integer Import and Export\7f131002
+Node: Miscellaneous Integer Functions\7f135018
+Node: Integer Special Functions\7f136932
+Node: Rational Number Functions\7f141105
+Node: Initializing Rationals\7f142298
+Node: Rational Conversions\7f144771
+Node: Rational Arithmetic\7f146793
+Node: Comparing Rationals\7f148205
+Node: Applying Integer Functions\7f149674
+Node: I/O of Rationals\7f151380
+Node: Floating-point Functions\7f153739
+Node: Initializing Floats\7f156790
+Node: Assigning Floats\7f160882
+Node: Simultaneous Float Init & Assign\7f163472
+Node: Converting Floats\7f165022
+Node: Float Arithmetic\7f168287
+Node: Float Comparison\7f170440
+Node: I/O of Floats\7f172011
+Node: Miscellaneous Float Functions\7f174700
+Node: Low-level Functions\7f176702
+Node: Random Number Functions\7f210955
+Node: Random State Initialization\7f212023
+Node: Random State Seeding\7f214889
+Node: Random State Miscellaneous\7f216289
+Node: Formatted Output\7f216931
+Node: Formatted Output Strings\7f217176
+Node: Formatted Output Functions\7f222572
+Node: C++ Formatted Output\7f226636
+Node: Formatted Input\7f229337
+Node: Formatted Input Strings\7f229573
+Node: Formatted Input Functions\7f234233
+Node: C++ Formatted Input\7f237202
+Node: C++ Class Interface\7f239105
+Node: C++ Interface General\7f240056
+Node: C++ Interface Integers\7f243125
+Node: C++ Interface Rationals\7f247358
+Node: C++ Interface Floats\7f251382
+Node: C++ Interface Random Numbers\7f257398
+Node: C++ Interface Limitations\7f259798
+Node: Custom Allocation\7f263373
+Node: Language Bindings\7f267592
+Node: Algorithms\7f270905
+Node: Multiplication Algorithms\7f271605
+Node: Basecase Multiplication\7f272694
+Node: Karatsuba Multiplication\7f274602
+Node: Toom 3-Way Multiplication\7f278226
+Node: Toom 4-Way Multiplication\7f284650
+Node: Higher degree Toom'n'half\7f286028
+Node: FFT Multiplication\7f287316
+Node: Other Multiplication\7f292651
+Node: Unbalanced Multiplication\7f295125
+Node: Division Algorithms\7f295913
+Node: Single Limb Division\7f296292
+Node: Basecase Division\7f299180
+Node: Divide and Conquer Division\7f301246
+Node: Block-Wise Barrett Division\7f303314
+Node: Exact Division\7f303966
+Node: Exact Remainder\7f307130
+Node: Small Quotient Division\7f309380
+Node: Greatest Common Divisor Algorithms\7f310978
+Node: Binary GCD\7f311275
+Node: Lehmer's Algorithm\7f314127
+Node: Subquadratic GCD\7f316363
+Node: Extended GCD\7f318833
+Node: Jacobi Symbol\7f320152
+Node: Powering Algorithms\7f322061
+Node: Normal Powering Algorithm\7f322324
+Node: Modular Powering Algorithm\7f322852
+Node: Root Extraction Algorithms\7f323634
+Node: Square Root Algorithm\7f323949
+Node: Nth Root Algorithm\7f326090
+Node: Perfect Square Algorithm\7f326875
+Node: Perfect Power Algorithm\7f328962
+Node: Radix Conversion Algorithms\7f329583
+Node: Binary to Radix\7f329959
+Node: Radix to Binary\7f333580
+Node: Other Algorithms\7f335668
+Node: Prime Testing Algorithm\7f336020
+Node: Factorial Algorithm\7f337204
+Node: Binomial Coefficients Algorithm\7f339606
+Node: Fibonacci Numbers Algorithm\7f340500
+Node: Lucas Numbers Algorithm\7f342974
+Node: Random Number Algorithms\7f343695
+Node: Assembly Coding\7f345815
+Node: Assembly Code Organisation\7f346775
+Node: Assembly Basics\7f347742
+Node: Assembly Carry Propagation\7f348892
+Node: Assembly Cache Handling\7f350722
+Node: Assembly Functional Units\7f352883
+Node: Assembly Floating Point\7f354502
+Node: Assembly SIMD Instructions\7f358281
+Node: Assembly Software Pipelining\7f359263
+Node: Assembly Loop Unrolling\7f360324
+Node: Assembly Writing Guide\7f362539
+Node: Internals\7f365304
+Node: Integer Internals\7f365816
+Node: Rational Internals\7f368282
+Node: Float Internals\7f369520
+Node: Raw Output Internals\7f376925
+Node: C++ Interface Internals\7f378120
+Node: Contributors\7f381441
+Node: References\7f387669
+Node: GNU Free Documentation License\7f393588
+Node: Concept Index\7f418730
+Node: Function Index\7f466824
+\1f
+End Tag Table
+
+\1f
+Local Variables:
+coding: iso-8859-1
+End:
--- /dev/null
+This is gmp.info, produced by makeinfo version 6.7 from gmp.texi.
+
+This manual describes how to install and use the GNU multiple precision
+arithmetic library, version 6.3.0.
+
+ Copyright 1991, 1993-2016, 2018-2020 Free Software Foundation, Inc.
+
+ Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.3 or
+any later version published by the Free Software Foundation; with no
+Invariant Sections, with the Front-Cover Texts being "A GNU Manual", and
+with the Back-Cover Texts being "You have freedom to copy and modify
+this GNU Manual, like GNU software". A copy of the license is included
+in *note GNU Free Documentation License::.
+INFO-DIR-SECTION GNU libraries
+START-INFO-DIR-ENTRY
+* gmp: (gmp). GNU Multiple Precision Arithmetic Library.
+END-INFO-DIR-ENTRY
+
+\1f
+File: gmp.info, Node: Top, Next: Copying, Prev: (dir), Up: (dir)
+
+GNU MP
+******
+
+This manual describes how to install and use the GNU multiple precision
+arithmetic library, version 6.3.0.
+
+ Copyright 1991, 1993-2016, 2018-2020 Free Software Foundation, Inc.
+
+ Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.3 or
+any later version published by the Free Software Foundation; with no
+Invariant Sections, with the Front-Cover Texts being "A GNU Manual", and
+with the Back-Cover Texts being "You have freedom to copy and modify
+this GNU Manual, like GNU software". A copy of the license is included
+in *note GNU Free Documentation License::.
+
+* Menu:
+
+* Copying:: GMP Copying Conditions (LGPL).
+* Introduction to GMP:: Brief introduction to GNU MP.
+* Installing GMP:: How to configure and compile the GMP library.
+* GMP Basics:: What every GMP user should know.
+* Reporting Bugs:: How to usefully report bugs.
+* Integer Functions:: Functions for arithmetic on signed integers.
+* Rational Number Functions:: Functions for arithmetic on rational numbers.
+* Floating-point Functions:: Functions for arithmetic on floats.
+* Low-level Functions:: Fast functions for natural numbers.
+* Random Number Functions:: Functions for generating random numbers.
+* Formatted Output:: 'printf' style output.
+* Formatted Input:: 'scanf' style input.
+* C++ Class Interface:: Class wrappers around GMP types.
+* Custom Allocation:: How to customize the internal allocation.
+* Language Bindings:: Using GMP from other languages.
+* Algorithms:: What happens behind the scenes.
+* Internals:: How values are represented behind the scenes.
+
+* Contributors:: Who brings you this library?
+* References:: Some useful papers and books to read.
+* GNU Free Documentation License::
+* Concept Index::
+* Function Index::
+
+\1f
+File: gmp.info, Node: Copying, Next: Introduction to GMP, Prev: Top, Up: Top
+
+GNU MP Copying Conditions
+*************************
+
+This library is "free"; this means that everyone is free to use it and
+free to redistribute it on a free basis. The library is not in the
+public domain; it is copyrighted and there are restrictions on its
+distribution, but these restrictions are designed to permit everything
+that a good cooperating citizen would want to do. What is not allowed
+is to try to prevent others from further sharing any version of this
+library that they might get from you.
+
+ Specifically, we want to make sure that you have the right to give
+away copies of the library, that you receive source code or else can get
+it if you want it, that you can change this library or use pieces of it
+in new free programs, and that you know you can do these things.
+
+ To make sure that everyone has such rights, we have to forbid you to
+deprive anyone else of these rights. For example, if you distribute
+copies of the GNU MP library, you must give the recipients all the
+rights that you have. You must make sure that they, too, receive or can
+get the source code. And you must tell them their rights.
+
+ Also, for our own protection, we must make certain that everyone
+finds out that there is no warranty for the GNU MP library. If it is
+modified by someone else and passed on, we want their recipients to know
+that what they have is not what we distributed, so that any problems
+introduced by others will not reflect on our reputation.
+
+ More precisely, the GNU MP library is dual licensed, under the
+conditions of the GNU Lesser General Public License version 3 (see
+'COPYING.LESSERv3'), or the GNU General Public License version 2 (see
+'COPYINGv2'). This is the recipient's choice, and the recipient also
+has the additional option of applying later versions of these licenses.
+(The reason for this dual licensing is to make it possible to use the
+library with programs which are licensed under GPL version 2, but which
+for historical or other reasons do not allow use under later versions of
+the GPL.)
+
+ Programs which are not part of the library itself, such as
+demonstration programs and the GMP testsuite, are licensed under the
+terms of the GNU General Public License version 3 (see 'COPYINGv3'), or
+any later version.
+
+\1f
+File: gmp.info, Node: Introduction to GMP, Next: Installing GMP, Prev: Copying, Up: Top
+
+1 Introduction to GNU MP
+************************
+
+GNU MP is a portable library written in C for arbitrary precision
+arithmetic on integers, rational numbers, and floating-point numbers.
+It aims to provide the fastest possible arithmetic for all applications
+that need higher precision than is directly supported by the basic C
+types.
+
+ Many applications use just a few hundred bits of precision; but some
+applications may need thousands or even millions of bits. GMP is
+designed to give good performance for both, by choosing algorithms based
+on the sizes of the operands, and by carefully keeping the overhead at a
+minimum.
+
+ The speed of GMP is achieved by using fullwords as the basic
+arithmetic type, by using sophisticated algorithms, by including
+carefully optimized assembly code for the most common inner loops for
+many different CPUs, and by a general emphasis on speed (as opposed to
+simplicity or elegance).
+
+ There is assembly code for these CPUs: ARM Cortex-A9, Cortex-A15, and
+generic ARM, DEC Alpha 21064, 21164, and 21264, AMD K8 and K10 (sold
+under many brands, e.g. Athlon64, Phenom, Opteron), Bulldozer, and
+Bobcat, Intel Pentium, Pentium Pro/II/III, Pentium 4, Core2, Nehalem,
+Sandy bridge, Haswell, generic x86, Intel IA-64, Motorola/IBM PowerPC 32
+and 64 such as POWER970, POWER5, POWER6, and POWER7, MIPS 32-bit and
+64-bit, SPARC 32-bit and 64-bit with special support for all UltraSPARC
+models. There is also assembly code for many obsolete CPUs.
+
+For up-to-date information on GMP, please see the GMP web pages at
+
+ <https://gmplib.org/>
+
+The latest version of the library is available at
+
+ <https://ftp.gnu.org/gnu/gmp/>
+
+ Many sites around the world mirror 'ftp.gnu.org', please use a mirror
+near you, see <https://www.gnu.org/order/ftp.html> for a full list.
+
+ There are three public mailing lists of interest. One for release
+announcements, one for general questions and discussions about usage of
+the GMP library and one for bug reports. For more information, see
+
+ <https://gmplib.org/mailman/listinfo/>.
+
+ The proper place for bug reports is <gmp-bugs@gmplib.org>. See *note
+Reporting Bugs:: for information about reporting bugs.
+
+
+1.1 How to use this Manual
+==========================
+
+Everyone should read *note GMP Basics::. If you need to install the
+library yourself, then read *note Installing GMP::. If you have a
+system with multiple ABIs, then read *note ABI and ISA::, for the
+compiler options that must be used on applications.
+
+ The rest of the manual can be used for later reference, although it
+is probably a good idea to glance through it.
+
+\1f
+File: gmp.info, Node: Installing GMP, Next: GMP Basics, Prev: Introduction to GMP, Up: Top
+
+2 Installing GMP
+****************
+
+GMP has an autoconf/automake/libtool based configuration system. On a
+Unix-like system a basic build can be done with
+
+ ./configure
+ make
+
+Some self-tests can be run with
+
+ make check
+
+And you can install (under '/usr/local' by default) with
+
+ make install
+
+ If you experience problems, please report them to
+<gmp-bugs@gmplib.org>. See *note Reporting Bugs::, for information on
+what to include in useful bug reports.
+
+* Menu:
+
+* Build Options::
+* ABI and ISA::
+* Notes for Package Builds::
+* Notes for Particular Systems::
+* Known Build Problems::
+* Performance optimization::
+
+\1f
+File: gmp.info, Node: Build Options, Next: ABI and ISA, Prev: Installing GMP, Up: Installing GMP
+
+2.1 Build Options
+=================
+
+All the usual autoconf configure options are available, run './configure
+--help' for a summary. The file 'INSTALL.autoconf' has some generic
+installation information too.
+
+Tools
+ 'configure' requires various Unix-like tools. See *note Notes for
+ Particular Systems::, for some options on non-Unix systems.
+
+ It might be possible to build without the help of 'configure',
+ certainly all the code is there, but unfortunately you'll be on
+ your own.
+
+Build Directory
+ To compile in a separate build directory, 'cd' to that directory,
+ and prefix the configure command with the path to the GMP source
+ directory. For example
+
+ cd /my/build/dir
+ /my/sources/gmp-6.3.0/configure
+
+ Not all 'make' programs have the necessary features ('VPATH') to
+ support this. In particular, SunOS and Slowaris 'make' have bugs
+ that make them unable to build in a separate directory. Use GNU
+ 'make' instead.
+
+'--prefix' and '--exec-prefix'
+ The '--prefix' option can be used in the normal way to direct GMP
+ to install under a particular tree. The default is '/usr/local'.
+
+ '--exec-prefix' can be used to direct architecture-dependent files
+ like 'libgmp.a' to a different location. This can be used to share
+ architecture-independent parts like the documentation, but separate
+ the dependent parts. Note however that 'gmp.h' is
+ architecture-dependent since it encodes certain aspects of
+ 'libgmp', so it will be necessary to ensure both '$prefix/include'
+ and '$exec_prefix/include' are available to the compiler.
+
+'--disable-shared', '--disable-static'
+ By default both shared and static libraries are built (where
+ possible), but one or other can be disabled. Shared libraries
+ result in smaller executables and permit code sharing between
+ separate running processes, but on some CPUs are slightly slower,
+ having a small cost on each function call.
+
+Native Compilation, '--build=CPU-VENDOR-OS'
+ For normal native compilation, the system can be specified with
+ '--build'. By default './configure' uses the output from running
+ './config.guess'. On some systems './config.guess' can determine
+ the exact CPU type, on others it will be necessary to give it
+ explicitly. For example,
+
+ ./configure --build=ultrasparc-sun-solaris2.7
+
+ In all cases the 'OS' part is important, since it controls how
+ libtool generates shared libraries. Running './config.guess' is
+ the simplest way to see what it should be, if you don't know
+ already.
+
+Cross Compilation, '--host=CPU-VENDOR-OS'
+ When cross-compiling, the system used for compiling is given by
+ '--build' and the system where the library will run is given by
+ '--host'. For example when using a FreeBSD Athlon system to build
+ GNU/Linux m68k binaries,
+
+ ./configure --build=athlon-pc-freebsd3.5 --host=m68k-mac-linux-gnu
+
+ Compiler tools are sought first with the host system type as a
+ prefix. For example 'm68k-mac-linux-gnu-ranlib' is tried, then
+ plain 'ranlib'. This makes it possible for a set of
+ cross-compiling tools to co-exist with native tools. The prefix is
+ the argument to '--host', and this can be an alias, such as
+ 'm68k-linux'. But note that tools don't have to be set up this
+ way, it's enough to just have a 'PATH' with a suitable
+ cross-compiling 'cc' etc.
+
+ Compiling for a different CPU in the same family as the build
+ system is a form of cross-compilation, though very possibly this
+ would merely be special options on a native compiler. In any case
+ './configure' avoids depending on being able to run code on the
+ build system, which is important when creating binaries for a newer
+ CPU since they very possibly won't run on the build system.
+
+ In all cases the compiler must be able to produce an executable (of
+ whatever format) from a standard C 'main'. Although only object
+ files will go to make up 'libgmp', './configure' uses linking tests
+ for various purposes, such as determining what functions are
+ available on the host system.
+
+ Currently a warning is given unless an explicit '--build' is used
+ when cross-compiling, because it may not be possible to correctly
+ guess the build system type if the 'PATH' has only a
+ cross-compiling 'cc'.
+
+ Note that the '--target' option is not appropriate for GMP. It's
+ for use when building compiler tools, with '--host' being where
+ they will run, and '--target' what they'll produce code for.
+ Ordinary programs or libraries like GMP are only interested in the
+ '--host' part, being where they'll run. (Some past versions of GMP
+ used '--target' incorrectly.)
+
+CPU types
+ In general, if you want a library that runs as fast as possible,
+ you should configure GMP for the exact CPU type your system uses.
+ However, this may mean the binaries won't run on older members of
+ the family, and might run slower on other members, older or newer.
+ The best idea is always to build GMP for the exact machine type you
+ intend to run it on.
+
+ The following CPUs have specific support. See 'configure.ac' for
+ details of what code and compiler options they select.
+
+ * Alpha: alpha, alphaev5, alphaev56, alphapca56, alphapca57,
+ alphaev6, alphaev67, alphaev68, alphaev7
+
+ * Cray: c90, j90, t90, sv1
+
+ * HPPA: hppa1.0, hppa1.1, hppa2.0, hppa2.0n, hppa2.0w, hppa64
+
+ * IA-64: ia64, itanium, itanium2
+
+ * MIPS: mips, mips3, mips64
+
+ * Motorola: m68k, m68000, m68010, m68020, m68030, m68040,
+ m68060, m68302, m68360, m88k, m88110
+
+ * POWER: power, power1, power2, power2sc
+
+ * PowerPC: powerpc, powerpc64, powerpc401, powerpc403,
+ powerpc405, powerpc505, powerpc601, powerpc602, powerpc603,
+ powerpc603e, powerpc604, powerpc604e, powerpc620, powerpc630,
+ powerpc740, powerpc7400, powerpc7450, powerpc750, powerpc801,
+ powerpc821, powerpc823, powerpc860, powerpc970
+
+ * SPARC: sparc, sparcv8, microsparc, supersparc, sparcv9,
+ ultrasparc, ultrasparc2, ultrasparc2i, ultrasparc3, sparc64
+
+ * x86 family: i386, i486, i586, pentium, pentiummmx, pentiumpro,
+ pentium2, pentium3, pentium4, k6, k62, k63, athlon, amd64,
+ viac3, viac32
+
+ * Other: arm, sh, sh2, vax,
+
+ CPUs not listed will use generic C code.
+
+Generic C Build
+ If some of the assembly code causes problems, or if otherwise
+ desired, the generic C code can be selected with the configure
+ '--disable-assembly'.
+
+ Note that this will run quite slowly, but it should be portable and
+ should at least make it possible to get something running if all
+ else fails.
+
+Fat binary, '--enable-fat'
+ Using '--enable-fat' selects a "fat binary" build on x86, where
+ optimized low level subroutines are chosen at runtime according to
+ the CPU detected. This means more code, but gives good performance
+ on all x86 chips. (This option might become available for more
+ architectures in the future.)
+
+'ABI'
+ On some systems GMP supports multiple ABIs (application binary
+ interfaces), meaning data type sizes and calling conventions. By
+ default GMP chooses the best ABI available, but a particular ABI
+ can be selected. For example
+
+ ./configure --host=mips64-sgi-irix6 ABI=n32
+
+ See *note ABI and ISA::, for the available choices on relevant
+ CPUs, and what applications need to do.
+
+'CC', 'CFLAGS'
+ By default the C compiler used is chosen from among some likely
+ candidates, with 'gcc' normally preferred if it's present. The
+ usual 'CC=whatever' can be passed to './configure' to choose
+ something different.
+
+ For various systems, default compiler flags are set based on the
+ CPU and compiler. The usual 'CFLAGS="-whatever"' can be passed to
+ './configure' to use something different or to set good flags for
+ systems GMP doesn't otherwise know.
+
+ The 'CC' and 'CFLAGS' used are printed during './configure', and
+ can be found in each generated 'Makefile'. This is the easiest way
+ to check the defaults when considering changing or adding
+ something.
+
+ Note that when 'CC' and 'CFLAGS' are specified on a system
+ supporting multiple ABIs it's important to give an explicit
+ 'ABI=whatever', since GMP can't determine the ABI just from the
+ flags and won't be able to select the correct assembly code.
+
+ If just 'CC' is selected then normal default 'CFLAGS' for that
+ compiler will be used (if GMP recognises it). For example 'CC=gcc'
+ can be used to force the use of GCC, with default flags (and
+ default ABI).
+
+'CPPFLAGS'
+ Any flags like '-D' defines or '-I' includes required by the
+ preprocessor should be set in 'CPPFLAGS' rather than 'CFLAGS'.
+ Compiling is done with both 'CPPFLAGS' and 'CFLAGS', but
+ preprocessing uses just 'CPPFLAGS'. This distinction is because
+ most preprocessors won't accept all the flags the compiler does.
+ Preprocessing is done separately in some configure tests.
+
+'CC_FOR_BUILD'
+ Some build-time programs are compiled and run to generate
+ host-specific data tables. 'CC_FOR_BUILD' is the compiler used for
+ this. It doesn't need to be in any particular ABI or mode, it
+ merely needs to generate executables that can run. The default is
+ to try the selected 'CC' and some likely candidates such as 'cc'
+ and 'gcc', looking for something that works.
+
+ No flags are used with 'CC_FOR_BUILD' because a simple invocation
+ like 'cc foo.c' should be enough. If some particular options are
+ required they can be included as for instance 'CC_FOR_BUILD="cc
+ -whatever"'.
+
+C++ Support, '--enable-cxx'
+ C++ support in GMP can be enabled with '--enable-cxx', in which
+ case a C++ compiler will be required. As a convenience
+ '--enable-cxx=detect' can be used to enable C++ support only if a
+ compiler can be found. The C++ support consists of a library
+ 'libgmpxx.la' and header file 'gmpxx.h' (*note Headers and
+ Libraries::).
+
+ A separate 'libgmpxx.la' has been adopted rather than having C++
+ objects within 'libgmp.la' in order to ensure dynamic linked C
+ programs aren't bloated by a dependency on the C++ standard
+ library, and to avoid any chance that the C++ compiler could be
+ required when linking plain C programs.
+
+ 'libgmpxx.la' will use certain internals from 'libgmp.la' and can
+ only be expected to work with 'libgmp.la' from the same GMP
+ version. Future changes to the relevant internals will be
+ accompanied by renaming, so a mismatch will cause unresolved
+ symbols rather than perhaps mysterious misbehaviour.
+
+ In general 'libgmpxx.la' will be usable only with the C++ compiler
+ that built it, since name mangling and runtime support are usually
+ incompatible between different compilers.
+
+'CXX', 'CXXFLAGS'
+ When C++ support is enabled, the C++ compiler and its flags can be
+ set with variables 'CXX' and 'CXXFLAGS' in the usual way. The
+ default for 'CXX' is the first compiler that works from a list of
+ likely candidates, with 'g++' normally preferred when available.
+ The default for 'CXXFLAGS' is to try 'CFLAGS', 'CFLAGS' without
+ '-g', then for 'g++' either '-g -O2' or '-O2', or for other
+ compilers '-g' or nothing. Trying 'CFLAGS' this way is convenient
+ when using 'gcc' and 'g++' together, since the flags for 'gcc' will
+ usually suit 'g++'.
+
+ It's important that the C and C++ compilers match, meaning their
+ startup and runtime support routines are compatible and that they
+ generate code in the same ABI (if there's a choice of ABIs on the
+ system). './configure' isn't currently able to check these things
+ very well itself, so for that reason '--disable-cxx' is the
+ default, to avoid a build failure due to a compiler mismatch.
+ Perhaps this will change in the future.
+
+ Incidentally, it's normally not good enough to set 'CXX' to the
+ same as 'CC'. Although 'gcc' for instance recognises 'foo.cc' as
+ C++ code, only 'g++' will invoke the linker the right way when
+ building an executable or shared library from C++ object files.
+
+Temporary Memory, '--enable-alloca=<choice>'
+ GMP allocates temporary workspace using one of the following three
+ methods, which can be selected with for instance
+ '--enable-alloca=malloc-reentrant'.
+
+ * 'alloca' - C library or compiler builtin.
+ * 'malloc-reentrant' - the heap, in a re-entrant fashion.
+ * 'malloc-notreentrant' - the heap, with global variables.
+
+ For convenience, the following choices are also available.
+ '--disable-alloca' is the same as 'no'.
+
+ * 'yes' - a synonym for 'alloca'.
+ * 'no' - a synonym for 'malloc-reentrant'.
+ * 'reentrant' - 'alloca' if available, otherwise
+ 'malloc-reentrant'. This is the default.
+ * 'notreentrant' - 'alloca' if available, otherwise
+ 'malloc-notreentrant'.
+
+ 'alloca' is reentrant and fast, and is recommended. It actually
+ allocates just small blocks on the stack; larger ones use
+ malloc-reentrant.
+
+ 'malloc-reentrant' is, as the name suggests, reentrant and thread
+ safe, but 'malloc-notreentrant' is faster and should be used if
+ reentrancy is not required.
+
+ The two malloc methods in fact use the memory allocation functions
+ selected by 'mp_set_memory_functions', these being 'malloc' and
+ friends by default. *Note Custom Allocation::.
+
+ An additional choice '--enable-alloca=debug' is available, to help
+ when debugging memory related problems (*note Debugging::).
+
+FFT Multiplication, '--disable-fft'
+ By default multiplications are done using Karatsuba, 3-way Toom,
+ higher degree Toom, and Fermat FFT. The FFT is only used on large
+ to very large operands and can be disabled to save code size if
+ desired.
+
+Assertion Checking, '--enable-assert'
+ This option enables some consistency checking within the library.
+ This can be of use while debugging, *note Debugging::.
+
+Execution Profiling, '--enable-profiling=prof/gprof/instrument'
+ Enable profiling support, in one of various styles, *note
+ Profiling::.
+
+'MPN_PATH'
+ Various assembly versions of each mpn subroutines are provided.
+ For a given CPU, a search is made through a path to choose a
+ version of each. For example 'sparcv8' has
+
+ MPN_PATH="sparc32/v8 sparc32 generic"
+
+ which means look first for v8 code, then plain sparc32 (which is
+ v7), and finally fall back on generic C. Knowledgeable users with
+ special requirements can specify a different path. Normally this
+ is completely unnecessary.
+
+Documentation
+ The source for the document you're now reading is 'doc/gmp.texi',
+ in Texinfo format, see *note Texinfo: (texinfo)Top.
+
+ Info format 'doc/gmp.info' is included in the distribution. The
+ usual automake targets are available to make PostScript, DVI, PDF
+ and HTML (these will require various TeX and Texinfo tools).
+
+ DocBook and XML can be generated by the Texinfo 'makeinfo' program
+ too, see *note Options for 'makeinfo': (texinfo)makeinfo options.
+
+ Some supplementary notes can also be found in the 'doc'
+ subdirectory.
+
+\1f
+File: gmp.info, Node: ABI and ISA, Next: Notes for Package Builds, Prev: Build Options, Up: Installing GMP
+
+2.2 ABI and ISA
+===============
+
+ABI (Application Binary Interface) refers to the calling conventions
+between functions, meaning what registers are used and what sizes the
+various C data types are. ISA (Instruction Set Architecture) refers to
+the instructions and registers a CPU has available.
+
+ Some 64-bit ISA CPUs have both a 64-bit ABI and a 32-bit ABI defined,
+the latter for compatibility with older CPUs in the family. GMP
+supports some CPUs like this in both ABIs. In fact within GMP 'ABI'
+means a combination of chip ABI, plus how GMP chooses to use it. For
+example in some 32-bit ABIs, GMP may support a limb as either a 32-bit
+'long' or a 64-bit 'long long'.
+
+ By default GMP chooses the best ABI available for a given system, and
+this generally gives significantly greater speed. But an ABI can be
+chosen explicitly to make GMP compatible with other libraries, or
+particular application requirements. For example,
+
+ ./configure ABI=32
+
+ In all cases it's vital that all object code used in a given program
+is compiled for the same ABI.
+
+ Usually a limb is implemented as a 'long'. When a 'long long' limb
+is used this is encoded in the generated 'gmp.h'. This is convenient
+for applications, but it does mean that 'gmp.h' will vary, and can't be
+just copied around. 'gmp.h' remains compiler independent though, since
+all compilers for a particular ABI will be expected to use the same limb
+type.
+
+ Currently no attempt is made to follow whatever conventions a system
+has for installing library or header files built for a particular ABI.
+This will probably only matter when installing multiple builds of GMP,
+and it might be as simple as configuring with a special 'libdir', or it
+might require more than that. Note that builds for different ABIs need
+to be done separately, with a fresh './configure' and 'make' each.
+
+
+AMD64 ('x86_64')
+ On AMD64 systems supporting both 32-bit and 64-bit modes for
+ applications, the following ABI choices are available.
+
+ 'ABI=64'
+ The 64-bit ABI uses 64-bit limbs and pointers and makes full
+ use of the chip architecture. This is the default.
+ Applications will usually not need special compiler flags, but
+ for reference the option is
+
+ gcc -m64
+
+ 'ABI=32'
+ The 32-bit ABI is the usual i386 conventions. This will be
+ slower, and is not recommended except for inter-operating with
+ other code not yet 64-bit capable. Applications must be
+ compiled with
+
+ gcc -m32
+
+ (In GCC 2.95 and earlier there's no '-m32' option, it's the
+ only mode.)
+
+ 'ABI=x32'
+ The x32 ABI uses 64-bit limbs but 32-bit pointers. Like the
+ 64-bit ABI, it makes full use of the chip's arithmetic
+ capabilities. This ABI is not supported by all operating
+ systems.
+
+ gcc -mx32
+
+
+HPPA 2.0 ('hppa2.0*', 'hppa64')
+ 'ABI=2.0w'
+ The 2.0w ABI uses 64-bit limbs and pointers and is available
+ on HP-UX 11 or up. Applications must be compiled with
+
+ gcc [built for 2.0w]
+ cc +DD64
+
+ 'ABI=2.0n'
+ The 2.0n ABI means the 32-bit HPPA 1.0 ABI and all its normal
+ calling conventions, but with 64-bit instructions permitted
+ within functions. GMP uses a 64-bit 'long long' for a limb.
+ This ABI is available on hppa64 GNU/Linux and on HP-UX 10 or
+ higher. Applications must be compiled with
+
+ gcc [built for 2.0n]
+ cc +DA2.0 +e
+
+ Note that current versions of GCC (e.g. 3.2) don't generate
+ 64-bit instructions for 'long long' operations and so may be
+ slower than for 2.0w. (The GMP assembly code is the same
+ though.)
+
+ 'ABI=1.0'
+ HPPA 2.0 CPUs can run all HPPA 1.0 and 1.1 code in the 32-bit
+ HPPA 1.0 ABI. No special compiler options are needed for
+ applications.
+
+ All three ABIs are available for CPU types 'hppa2.0w', 'hppa2.0'
+ and 'hppa64', but for CPU type 'hppa2.0n' only 2.0n or 1.0 are
+ considered.
+
+ Note that GCC on HP-UX has no options to choose between 2.0n and
+ 2.0w modes, unlike HP 'cc'. Instead it must be built for one or
+ the other ABI. GMP will detect how it was built, and skip to the
+ corresponding 'ABI'.
+
+
+IA-64 under HP-UX ('ia64*-*-hpux*', 'itanium*-*-hpux*')
+ HP-UX supports two ABIs for IA-64. GMP performance is the same in
+ both.
+
+ 'ABI=32'
+ In the 32-bit ABI, pointers, 'int's and 'long's are 32 bits
+ and GMP uses a 64 bit 'long long' for a limb. Applications
+ can be compiled without any special flags since this ABI is
+ the default in both HP C and GCC, but for reference the flags
+ are
+
+ gcc -milp32
+ cc +DD32
+
+ 'ABI=64'
+ In the 64-bit ABI, 'long's and pointers are 64 bits and GMP
+ uses a 'long' for a limb. Applications must be compiled with
+
+ gcc -mlp64
+ cc +DD64
+
+ On other IA-64 systems, GNU/Linux for instance, 'ABI=64' is the
+ only choice.
+
+
+MIPS under IRIX 6 ('mips*-*-irix[6789]')
+ IRIX 6 always has a 64-bit MIPS 3 or better CPU, and supports ABIs
+ o32, n32, and 64. n32 or 64 are recommended, and GMP performance
+ will be the same in each. The default is n32.
+
+ 'ABI=o32'
+ The o32 ABI is 32-bit pointers and integers, and no 64-bit
+ operations. GMP will be slower than in n32 or 64, this option
+ only exists to support old compilers, e.g. GCC 2.7.2.
+ Applications can be compiled with no special flags on an old
+ compiler, or on a newer compiler with
+
+ gcc -mabi=32
+ cc -32
+
+ 'ABI=n32'
+ The n32 ABI is 32-bit pointers and integers, but with a 64-bit
+ limb using a 'long long'. Applications must be compiled with
+
+ gcc -mabi=n32
+ cc -n32
+
+ 'ABI=64'
+ The 64-bit ABI is 64-bit pointers and integers. Applications
+ must be compiled with
+
+ gcc -mabi=64
+ cc -64
+
+ Note that MIPS GNU/Linux, as of kernel version 2.2, doesn't have
+ the necessary support for n32 or 64 and so only gets a 32-bit limb
+ and the MIPS 2 code.
+
+
+PowerPC 64 ('powerpc64', 'powerpc620', 'powerpc630', 'powerpc970', 'power4', 'power5')
+ 'ABI=mode64'
+ The AIX 64 ABI uses 64-bit limbs and pointers and is the
+ default on PowerPC 64 '*-*-aix*' systems. Applications must
+ be compiled with
+
+ gcc -maix64
+ xlc -q64
+
+ On 64-bit GNU/Linux, BSD, and Mac OS X/Darwin systems, the
+ applications must be compiled with
+
+ gcc -m64
+
+ 'ABI=mode32'
+ The 'mode32' ABI uses a 64-bit 'long long' limb but with the
+ chip still in 32-bit mode and using 32-bit calling
+ conventions. This is the default for systems where the true
+ 64-bit ABI is unavailable. No special compiler options are
+ typically needed for applications. This ABI is not available
+ under AIX.
+
+ 'ABI=32'
+ This is the basic 32-bit PowerPC ABI, with a 32-bit limb. No
+ special compiler options are needed for applications.
+
+ GMP's speed is greatest for the 'mode64' ABI, the 'mode32' ABI is
+ 2nd best. In 'ABI=32' only the 32-bit ISA is used and this doesn't
+ make full use of a 64-bit chip.
+
+
+Sparc V9 ('sparc64', 'sparcv9', 'ultrasparc*')
+ 'ABI=64'
+ The 64-bit V9 ABI is available on the various BSD sparc64
+ ports, recent versions of Sparc64 GNU/Linux, and Solaris 2.7
+ and up (when the kernel is in 64-bit mode). GCC 3.2 or
+ higher, or Sun 'cc' is required. On GNU/Linux, depending on
+ the default 'gcc' mode, applications must be compiled with
+
+ gcc -m64
+
+ On Solaris applications must be compiled with
+
+ gcc -m64 -mptr64 -Wa,-xarch=v9 -mcpu=v9
+ cc -xarch=v9
+
+ On the BSD sparc64 systems no special options are required,
+ since 64-bits is the only ABI available.
+
+ 'ABI=32'
+ For the basic 32-bit ABI, GMP still uses as much of the V9 ISA
+ as it can. In the Sun documentation this combination is known
+ as "v8plus". On GNU/Linux, depending on the default 'gcc'
+ mode, applications may need to be compiled with
+
+ gcc -m32
+
+ On Solaris, no special compiler options are required for
+ applications, though using something like the following is
+ recommended. ('gcc' 2.8 and earlier only support '-mv8'
+ though.)
+
+ gcc -mv8plus
+ cc -xarch=v8plus
+
+ GMP speed is greatest in 'ABI=64', so it's the default where
+ available. The speed is partly because there are extra registers
+ available and partly because 64-bits is considered the more
+ important case and has therefore had better code written for it.
+
+ Don't be confused by the names of the '-m' and '-x' compiler
+ options, they're called 'arch' but effectively control both ABI and
+ ISA.
+
+ On Solaris 2.6 and earlier, only 'ABI=32' is available since the
+ kernel doesn't save all registers.
+
+ On Solaris 2.7 with the kernel in 32-bit mode, a normal native
+ build will reject 'ABI=64' because the resulting executables won't
+ run. 'ABI=64' can still be built if desired by making it look like
+ a cross-compile, for example
+
+ ./configure --build=none --host=sparcv9-sun-solaris2.7 ABI=64
+
+\1f
+File: gmp.info, Node: Notes for Package Builds, Next: Notes for Particular Systems, Prev: ABI and ISA, Up: Installing GMP
+
+2.3 Notes for Package Builds
+============================
+
+GMP should present no great difficulties for packaging in a binary
+distribution.
+
+ Libtool is used to build the library and '-version-info' is set
+appropriately, having started from '3:0:0' in GMP 3.0 (*note Library
+interface versions: (libtool)Versioning.).
+
+ The GMP 4 series will be upwardly binary compatible in each release
+and will be upwardly binary compatible with all of the GMP 3 series.
+Additional function interfaces may be added in each release, so on
+systems where libtool versioning is not fully checked by the loader an
+auxiliary mechanism may be needed to express that a dynamic linked
+application depends on a new enough GMP.
+
+ An auxiliary mechanism may also be needed to express that
+'libgmpxx.la' (from '--enable-cxx', *note Build Options::) requires
+'libgmp.la' from the same GMP version, since this is not done by the
+libtool versioning, nor otherwise. A mismatch will result in unresolved
+symbols from the linker, or perhaps the loader.
+
+ When building a package for a CPU family, care should be taken to use
+'--host' (or '--build') to choose the least common denominator among the
+CPUs which might use the package. For example this might mean plain
+'sparc' (meaning V7) for SPARCs.
+
+ For x86s, '--enable-fat' sets things up for a fat binary build,
+making a runtime selection of optimized low level routines. This is a
+good choice for packaging to run on a range of x86 chips.
+
+ Users who care about speed will want GMP built for their exact CPU
+type, to make best use of the available optimizations. Providing a way
+to suitably rebuild a package may be useful. This could be as simple as
+making it possible for a user to omit '--build' (and '--host') so
+'./config.guess' will detect the CPU. But a way to manually specify a
+'--build' will be wanted for systems where './config.guess' is inexact.
+
+ On systems with multiple ABIs, a packaged build will need to decide
+which among the choices is to be provided, see *note ABI and ISA::. A
+given run of './configure' etc will only build one ABI. If a second ABI
+is also required then a second run of './configure' etc must be made,
+starting from a clean directory tree ('make distclean').
+
+ As noted under "ABI and ISA", currently no attempt is made to follow
+system conventions for install locations that vary with ABI, such as
+'/usr/lib/sparcv9' for 'ABI=64' as opposed to '/usr/lib' for 'ABI=32'.
+A package build can override 'libdir' and other standard variables as
+necessary.
+
+ Note that 'gmp.h' is a generated file, and will be architecture and
+ABI dependent. When attempting to install two ABIs simultaneously it
+will be important that an application compile gets the correct 'gmp.h'
+for its desired ABI. If compiler include paths don't vary with ABI
+options then it might be necessary to create a '/usr/include/gmp.h'
+which tests preprocessor symbols and chooses the correct actual 'gmp.h'.
+
+\1f
+File: gmp.info, Node: Notes for Particular Systems, Next: Known Build Problems, Prev: Notes for Package Builds, Up: Installing GMP
+
+2.4 Notes for Particular Systems
+================================
+
+AIX 3 and 4
+ On systems '*-*-aix[34]*' shared libraries are disabled by default,
+ since some versions of the native 'ar' fail on the convenience
+ libraries used. A shared build can be attempted with
+
+ ./configure --enable-shared --disable-static
+
+ Note that the '--disable-static' is necessary because in a shared
+ build libtool makes 'libgmp.a' a symlink to 'libgmp.so', apparently
+ for the benefit of old versions of 'ld' which only recognise '.a',
+ but unfortunately this is done even if a fully functional 'ld' is
+ available.
+
+ARM
+ On systems 'arm*-*-*', versions of GCC up to and including 2.95.3
+ have a bug in unsigned division, giving wrong results for some
+ operands. GMP './configure' will demand GCC 2.95.4 or later.
+
+Compaq C++
+ Compaq C++ on OSF 5.1 has two flavours of 'iostream', a standard
+ one and an old pre-standard one (see 'man iostream_intro'). GMP
+ can only use the standard one, which unfortunately is not the
+ default but must be selected by defining '__USE_STD_IOSTREAM'.
+ Configure with for instance
+
+ ./configure --enable-cxx CPPFLAGS=-D__USE_STD_IOSTREAM
+
+Floating Point Mode
+ On some systems, the hardware floating point has a control mode
+ which can set all operations to be done in a particular precision,
+ for instance single, double or extended on x86 systems (x87
+ floating point). The GMP functions involving a 'double' cannot be
+ expected to operate to their full precision when the hardware is in
+ single precision mode. Of course this affects all code, including
+ application code, not just GMP.
+
+FreeBSD 7.x, 8.x, 9.0, 9.1, 9.2
+ 'm4' in these releases of FreeBSD has an eval function which
+ ignores its 2nd and 3rd arguments, which makes it unsuitable for
+ '.asm' file processing. './configure' will detect the problem and
+ either abort or choose another m4 in the 'PATH'. The bug is fixed
+ in FreeBSD 9.3 and 10.0, so either upgrade or use GNU m4. Note
+ that the FreeBSD package system installs GNU m4 under the name
+ 'gm4', which GMP cannot guess.
+
+FreeBSD 7.x, 8.x, 9.x
+ GMP releases starting with 6.0 do not support 'ABI=32' on
+ FreeBSD/amd64 prior to release 10.0 of the system. The cause is a
+ broken 'limits.h', which GMP no longer works around.
+
+MS-DOS and MS Windows
+ On an MS-DOS system DJGPP can be used to build GMP, and on an MS
+ Windows system Cygwin, DJGPP and MINGW can be used. All three are
+ excellent ports of GCC and the various GNU tools.
+
+ <https://www.cygwin.com/>
+ <http://www.delorie.com/djgpp/>
+ <http://www.mingw.org/>
+
+ Microsoft also publishes an Interix "Services for Unix" which can
+ be used to build GMP on Windows (with a normal './configure'), but
+ it's not free software.
+
+MS Windows DLLs
+ On systems '*-*-cygwin*', '*-*-mingw*' and '*-*-pw32*' by default
+ GMP builds only a static library, but a DLL can be built instead
+ using
+
+ ./configure --disable-static --enable-shared
+
+ Static and DLL libraries can't both be built, since certain export
+ directives in 'gmp.h' must be different.
+
+ A MINGW DLL build of GMP can be used with Microsoft C. Libtool
+ doesn't install a '.lib' format import library, but it can be
+ created with MS 'lib' as follows, and copied to the install
+ directory. Similarly for 'libmp' and 'libgmpxx'.
+
+ cd .libs
+ lib /def:libgmp-3.dll.def /out:libgmp-3.lib
+
+ MINGW uses the C runtime library 'msvcrt.dll' for I/O, so
+ applications wanting to use the GMP I/O routines must be compiled
+ with 'cl /MD' to do the same. If one of the other C runtime
+ library choices provided by MS C is desired then the suggestion is
+ to use the GMP string functions and confine I/O to the application.
+
+Motorola 68k CPU Types
+ 'm68k' is taken to mean 68000. 'm68020' or higher will give a
+ performance boost on applicable CPUs. 'm68360' can be used for
+ CPU32 series chips. 'm68302' can be used for "Dragonball" series
+ chips, though this is merely a synonym for 'm68000'.
+
+NetBSD 5.x
+ 'm4' in these releases of NetBSD has an eval function which ignores
+ its 2nd and 3rd arguments, which makes it unsuitable for '.asm'
+ file processing. './configure' will detect the problem and either
+ abort or choose another m4 in the 'PATH'. The bug is fixed in
+ NetBSD 6, so either upgrade or use GNU m4. Note that the NetBSD
+ package system installs GNU m4 under the name 'gm4', which GMP
+ cannot guess.
+
+OpenBSD 2.6
+ 'm4' in this release of OpenBSD has a bug in 'eval' that makes it
+ unsuitable for '.asm' file processing. './configure' will detect
+ the problem and either abort or choose another m4 in the 'PATH'.
+ The bug is fixed in OpenBSD 2.7, so either upgrade or use GNU m4.
+
+Power CPU Types
+ In GMP, CPU types 'power*' and 'powerpc*' will each use
+ instructions not available on the other, so it's important to
+ choose the right one for the CPU that will be used. Currently GMP
+ has no assembly code support for using just the common instruction
+ subset. To get executables that run on both, the current
+ suggestion is to use the generic C code ('--disable-assembly'),
+ possibly with appropriate compiler options (like '-mcpu=common' for
+ 'gcc'). CPU 'rs6000' (which is not a CPU but a family of
+ workstations) is accepted by 'config.sub', but is currently
+ equivalent to '--disable-assembly'.
+
+Sparc CPU Types
+ 'sparcv8' or 'supersparc' on relevant systems will give a
+ significant performance increase over the V7 code selected by plain
+ 'sparc'.
+
+Sparc App Regs
+ The GMP assembly code for both 32-bit and 64-bit Sparc clobbers the
+ "application registers" 'g2', 'g3' and 'g4', the same way that the
+ GCC default '-mapp-regs' does (*note SPARC Options: (gcc)SPARC
+ Options.).
+
+ This makes that code unsuitable for use with the special V9
+ '-mcmodel=embmedany' (which uses 'g4' as a data segment pointer),
+ and for applications wanting to use those registers for special
+ purposes. In these cases the only suggestion currently is to build
+ GMP with '--disable-assembly' to avoid the assembly code.
+
+SunOS 4
+ '/usr/bin/m4' lacks various features needed to process '.asm'
+ files, and instead './configure' will automatically use
+ '/usr/5bin/m4', which we believe is always available (if not then
+ use GNU m4).
+
+x86 CPU Types
+ 'i586', 'pentium' or 'pentiummmx' code is good for its intended P5
+ Pentium chips, but quite slow when run on Intel P6 class chips
+ (PPro, P-II, P-III). 'i386' is a better choice when making
+ binaries that must run on both.
+
+x86 MMX and SSE2 Code
+ If the CPU selected has MMX code but the assembler doesn't support
+ it, a warning is given and non-MMX code is used instead. This will
+ be an inferior build, since the MMX code that's present is there
+ because it's faster than the corresponding plain integer code. The
+ same applies to SSE2.
+
+ Old versions of 'gas' don't support MMX instructions, in particular
+ version 1.92.3 that comes with FreeBSD 2.2.8 or the more recent
+ OpenBSD 3.1 doesn't.
+
+ Solaris 2.6 and 2.7 'as' generate incorrect object code for
+ register to register 'movq' instructions, and so can't be used for
+ MMX code. Install a recent 'gas' if MMX code is wanted on these
+ systems.
+
+\1f
+File: gmp.info, Node: Known Build Problems, Next: Performance optimization, Prev: Notes for Particular Systems, Up: Installing GMP
+
+2.5 Known Build Problems
+========================
+
+You might find more up-to-date information at <https://gmplib.org/>.
+
+Compiler link options
+ The version of libtool currently in use rather aggressively strips
+ compiler options when linking a shared library. This will
+ hopefully be relaxed in the future, but for now if this is a
+ problem the suggestion is to create a little script to hide them,
+ and for instance configure with
+
+ ./configure CC=gcc-with-my-options
+
+DJGPP ('*-*-msdosdjgpp*')
+ The DJGPP port of 'bash' 2.03 is unable to run the 'configure'
+ script, it exits silently, having died writing a preamble to
+ 'config.log'. Use 'bash' 2.04 or higher.
+
+ 'make all' was found to run out of memory during the final
+ 'libgmp.la' link on one system tested, despite having 64MiB
+ available. Running 'make libgmp.la' directly helped, perhaps
+ recursing into the various subdirectories uses up memory.
+
+GNU binutils 'strip' prior to 2.12
+ 'strip' from GNU binutils 2.11 and earlier should not be used on
+ the static libraries 'libgmp.a' and 'libmp.a' since it will discard
+ all but the last of multiple archive members with the same name,
+ like the three versions of 'init.o' in 'libgmp.a'. Binutils 2.12
+ or higher can be used successfully.
+
+ The shared libraries 'libgmp.so' and 'libmp.so' are not affected by
+ this and any version of 'strip' can be used on them.
+
+'make' syntax error
+ On certain versions of SCO OpenServer 5 and IRIX 6.5 the native
+ 'make' is unable to handle the long dependencies list for
+ 'libgmp.la'. The symptom is a "syntax error" on the following line
+ of the top-level 'Makefile'.
+
+ libgmp.la: $(libgmp_la_OBJECTS) $(libgmp_la_DEPENDENCIES)
+
+ Either use GNU Make, or as a workaround remove
+ '$(libgmp_la_DEPENDENCIES)' from that line (which will make the
+ initial build work, but if any recompiling is done 'libgmp.la'
+ might not be rebuilt).
+
+MacOS X ('*-*-darwin*')
+ Libtool currently only knows how to create shared libraries on
+ MacOS X using the native 'cc' (which is a modified GCC), not a
+ plain GCC. A static-only build should work though
+ ('--disable-shared').
+
+NeXT prior to 3.3
+ The system compiler on old versions of NeXT was a massacred and old
+ GCC, even if it called itself 'cc'. This compiler cannot be used
+ to build GMP, you need to get a real GCC, and install that. (NeXT
+ may have fixed this in release 3.3 of their system.)
+
+POWER and PowerPC
+ Bugs in GCC 2.7.2 (and 2.6.3) mean it can't be used to compile GMP
+ on POWER or PowerPC. If you want to use GCC for these machines,
+ get GCC 2.7.2.1 (or later).
+
+Sequent Symmetry
+ Use the GNU assembler instead of the system assembler, since the
+ latter has serious bugs.
+
+Solaris 2.6
+ The system 'sed' prints an error "Output line too long" when
+ libtool builds 'libgmp.la'. This doesn't seem to cause any obvious
+ ill effects, but GNU 'sed' is recommended, to avoid any doubt.
+
+Sparc Solaris 2.7 with gcc 2.95.2 in 'ABI=32'
+ A shared library build of GMP seems to fail in this combination, it
+ builds but then fails the tests, apparently due to some incorrect
+ data relocations within 'gmp_randinit_lc_2exp_size'. The exact
+ cause is unknown, '--disable-shared' is recommended.
+
+\1f
+File: gmp.info, Node: Performance optimization, Prev: Known Build Problems, Up: Installing GMP
+
+2.6 Performance optimization
+============================
+
+For optimal performance, build GMP for the exact CPU type of the target
+computer, see *note Build Options::.
+
+ Unlike what is the case for most other programs, the compiler
+typically doesn't matter much, since GMP uses assembly language for the
+most critical operation.
+
+ In particular for long-running GMP applications, and applications
+demanding extremely large numbers, building and running the 'tuneup'
+program in the 'tune' subdirectory can be important. For example,
+
+ cd tune
+ make tuneup
+ ./tuneup
+
+ will generate better contents for the 'gmp-mparam.h' parameter file.
+
+ To use the results, put the output in the file indicated in the
+'Parameters for ...' header. Then recompile from scratch.
+
+ The 'tuneup' program takes one useful parameter, '-f NNN', which
+instructs the program how long to check FFT multiply parameters. If
+you're going to use GMP for extremely large numbers, you may want to run
+'tuneup' with a large NNN value.
+
+\1f
+File: gmp.info, Node: GMP Basics, Next: Reporting Bugs, Prev: Installing GMP, Up: Top
+
+3 GMP Basics
+************
+
+*Using functions, macros, data types, etc. not documented in this manual
+is strongly discouraged. If you do so your application is guaranteed to
+be incompatible with future versions of GMP.*
+
+* Menu:
+
+* Headers and Libraries::
+* Nomenclature and Types::
+* Function Classes::
+* Variable Conventions::
+* Parameter Conventions::
+* Memory Management::
+* Reentrancy::
+* Useful Macros and Constants::
+* Compatibility with older versions::
+* Demonstration Programs::
+* Efficiency::
+* Debugging::
+* Profiling::
+* Autoconf::
+* Emacs::
+
+\1f
+File: gmp.info, Node: Headers and Libraries, Next: Nomenclature and Types, Prev: GMP Basics, Up: GMP Basics
+
+3.1 Headers and Libraries
+=========================
+
+All declarations needed to use GMP are collected in the include file
+'gmp.h', except for the *note C++ Class Interface:: which comes with its
+own separate header 'gmpxx.h'. 'gmp.h' is designed to work with both C
+and C++ compilers.
+
+ #include <gmp.h>
+
+ Note however that prototypes for GMP functions with 'FILE *'
+parameters are only provided if '<stdio.h>' is included before.
+
+ #include <stdio.h>
+ #include <gmp.h>
+
+ Likewise '<stdarg.h>' is required for prototypes with 'va_list'
+parameters, such as 'gmp_vprintf'. And '<obstack.h>' for prototypes
+with 'struct obstack' parameters, such as 'gmp_obstack_printf', when
+available.
+
+ All programs using GMP must link against the 'libgmp' library. On a
+typical Unix-like system this can be done with '-lgmp', for example
+
+ gcc myprogram.c -lgmp
+
+ GMP C++ functions are in a separate 'libgmpxx' library, including the
+*note C++ Class Interface:: but also *note C++ Formatted Output:: for
+regular GMP types. This is built and installed if C++ support has been
+enabled (*note Build Options::). For example,
+
+ g++ mycxxprog.cc -lgmpxx -lgmp
+
+ GMP is built using Libtool and an application can use that to link if
+desired, *note GNU Libtool: (libtool)Top.
+
+ If GMP has been installed to a non-standard location then it may be
+necessary to use '-I' and '-L' compiler options to point to the right
+directories, and some sort of run-time path for a shared library.
+
+\1f
+File: gmp.info, Node: Nomenclature and Types, Next: Function Classes, Prev: Headers and Libraries, Up: GMP Basics
+
+3.2 Nomenclature and Types
+==========================
+
+In this manual, "integer" usually means a multiple precision integer, as
+defined by the GMP library. The C data type for such integers is
+'mpz_t'. Here are some examples of how to declare such integers:
+
+ mpz_t sum;
+
+ struct foo { mpz_t x, y; };
+
+ mpz_t vec[20];
+
+ "Rational number" means a multiple precision fraction. The C data
+type for these fractions is 'mpq_t'. For example:
+
+ mpq_t quotient;
+
+ "Floating point number" or "Float" for short, is an arbitrary
+precision mantissa with a limited precision exponent. The C data type
+for such objects is 'mpf_t'. For example:
+
+ mpf_t fp;
+
+ The floating point functions accept and return exponents in the C
+type 'mp_exp_t'. Currently this is usually a 'long', but on some
+systems it's an 'int' for efficiency.
+
+ A "limb" means the part of a multi-precision number that fits in a
+single machine word. (We chose this word because a limb of the human
+body is analogous to a digit, only larger, and containing several
+digits.) Normally a limb is 32 or 64 bits. The C data type for a limb
+is 'mp_limb_t'.
+
+ Counts of limbs of a multi-precision number represented in the C type
+'mp_size_t'. Currently this is normally a 'long', but on some systems
+it's an 'int' for efficiency, and on some systems it will be 'long long'
+in the future.
+
+ Counts of bits of a multi-precision number are represented in the C
+type 'mp_bitcnt_t'. Currently this is always an 'unsigned long', but on
+some systems it will be an 'unsigned long long' in the future.
+
+ "Random state" means an algorithm selection and current state data.
+The C data type for such objects is 'gmp_randstate_t'. For example:
+
+ gmp_randstate_t rstate;
+
+ Also, in general 'mp_bitcnt_t' is used for bit counts and ranges, and
+'size_t' is used for byte or character counts.
+
+
+ Internally, GMP data types such as 'mpz_t' are defined as one-element
+arrays, whose element type is part of the GMP internals (*note
+Internals::).
+
+ When an array is used as a function argument in C, it is not passed
+by value, instead its value is a pointer to the first element. In C
+jargon, this is sometimes referred to as the array "decaying" to a
+pointer. For GMP types like 'mpz_t', that means that the function
+called gets a pointer to the caller's 'mpz_t' value, which is why no
+explicit '&' operator is needed when passing output arguments (*note
+Parameter Conventions::).
+
+ GMP defines names for these pointer types, e.g., 'mpz_ptr'
+corresponding to 'mpz_t', and 'mpz_srcptr' corresponding to 'const
+mpz_t'. Most functions don't need to use these pointer types directly;
+it works fine to declare a function using the 'mpz_t' or 'const mpz_t'
+as the argument types, the same "pointer decay" happens in the
+background regardless.
+
+ Occasionally, it is useful to manipulate pointers directly, e.g., to
+conditionally swap _references_ to a function's inputs without changing
+the _values_ as seen by the caller, or returning a pointer to an 'mpz_t'
+which is part of a larger structure. For these cases, the pointer types
+are necessary. And a 'mpz_ptr' can be passed as argument to any GMP
+function declared to take an 'mpz_t' argument.
+
+ Their definition is equivalent to the following code, which is given
+for illustratory purposes only:
+
+ typedef foo_internal foo_t[1];
+ typedef foo_internal * foo_ptr;
+ typedef const foo_internal * foo_srcptr;
+
+ The following pointer types are defined by GMP:
+ * 'mpz_ptr' for pointers to the element type in 'mpz_t'
+ * 'mpz_srcptr' for 'const' pointers to the element type in 'mpz_t'
+ * 'mpq_ptr' for pointers to the element type in 'mpq_t'
+ * 'mpq_srcptr' for 'const' pointers to the element type in 'mpq_t'
+ * 'mpf_ptr' for pointers to the element type in 'mpf_t'
+ * 'mpf_srcptr' for 'const' pointers to the element type in 'mpf_t'
+ * 'gmp_randstate_ptr' for pointers to the element type in
+ 'gmp_randstate_t'
+ * 'gmp_randstate_srcptr' for 'const' pointers to the element type in
+ 'gmp_randstate_t'
+
+\1f
+File: gmp.info, Node: Function Classes, Next: Variable Conventions, Prev: Nomenclature and Types, Up: GMP Basics
+
+3.3 Function Classes
+====================
+
+There are six classes of functions in the GMP library:
+
+ 1. Functions for signed integer arithmetic, with names beginning with
+ 'mpz_'. The associated type is 'mpz_t'. There are about 150
+ functions in this class. (*note Integer Functions::)
+
+ 2. Functions for rational number arithmetic, with names beginning with
+ 'mpq_'. The associated type is 'mpq_t'. There are about 35
+ functions in this class, but the integer functions can be used for
+ arithmetic on the numerator and denominator separately. (*note
+ Rational Number Functions::)
+
+ 3. Functions for floating-point arithmetic, with names beginning with
+ 'mpf_'. The associated type is 'mpf_t'. There are about 70
+ functions in this class. (*note Floating-point Functions::)
+
+ 4. Fast low-level functions that operate on natural numbers. These
+ are used by the functions in the preceding groups, and you can also
+ call them directly from very time-critical user programs. These
+ functions' names begin with 'mpn_'. The associated type is array
+ of 'mp_limb_t'. There are about 60 (hard-to-use) functions in this
+ class. (*note Low-level Functions::)
+
+ 5. Miscellaneous functions. Functions for setting up custom
+ allocation and functions for generating random numbers. (*note
+ Custom Allocation::, and *note Random Number Functions::)
+
+\1f
+File: gmp.info, Node: Variable Conventions, Next: Parameter Conventions, Prev: Function Classes, Up: GMP Basics
+
+3.4 Variable Conventions
+========================
+
+GMP functions generally have output arguments before input arguments.
+This notation is by analogy with the assignment operator.
+
+ GMP lets you use the same variable for both input and output in one
+call. For example, the main function for integer multiplication,
+'mpz_mul', can be used to square 'x' and put the result back in 'x' with
+
+ mpz_mul (x, x, x);
+
+ Before you can assign to a GMP variable, you need to initialize it by
+calling one of the special initialization functions. When you're done
+with a variable, you need to clear it out, using one of the functions
+for that purpose. Which function to use depends on the type of
+variable. See the chapters on integer functions, rational number
+functions, and floating-point functions for details.
+
+ A variable should only be initialized once, or at least cleared
+between each initialization. After a variable has been initialized, it
+may be assigned to any number of times.
+
+ For efficiency reasons, avoid excessive initializing and clearing.
+In general, initialize near the start of a function and clear near the
+end. For example,
+
+ void
+ foo (void)
+ {
+ mpz_t n;
+ int i;
+ mpz_init (n);
+ for (i = 1; i < 100; i++)
+ {
+ mpz_mul (n, ...);
+ mpz_fdiv_q (n, ...);
+ ...
+ }
+ mpz_clear (n);
+ }
+
+ GMP types like 'mpz_t' are implemented as one-element arrays of
+certain structures. Declaring a variable creates an object with the
+fields GMP needs, but variables are normally manipulated by using the
+pointer to the object. The appropriate pointer types (*note
+Nomenclature and Types::) may be used to explicitly manipulate the
+pointer. For both behavior and efficiency reasons, it is discouraged to
+make copies of the GMP object itself (either directly or via aggregate
+objects containing such GMP objects). If copies are done, all of them
+must be used read-only; using a copy as the output of some function will
+invalidate all the other copies. Note that the actual fields in each
+'mpz_t' etc are for internal use only and should not be accessed
+directly by code that expects to be compatible with future GMP releases.
+
+\1f
+File: gmp.info, Node: Parameter Conventions, Next: Memory Management, Prev: Variable Conventions, Up: GMP Basics
+
+3.5 Parameter Conventions
+=========================
+
+When a GMP variable is used as a function parameter, it's effectively a
+call-by-reference, meaning that when the function stores a value there
+it will change the original in the caller. Parameters which are
+input-only can be designated 'const' to provoke a compiler error or
+warning on attempting to modify them.
+
+ When a function is going to return a GMP result, it should designate
+a parameter that it sets, like the library functions do. More than one
+value can be returned by having more than one output parameter, again
+like the library functions. A 'return' of an 'mpz_t' etc doesn't return
+the object, only a pointer, and this is almost certainly not what's
+wanted.
+
+ Here's an example accepting an 'mpz_t' parameter, doing a
+calculation, and storing the result to the indicated parameter.
+
+ void
+ foo (mpz_t result, const mpz_t param, unsigned long n)
+ {
+ unsigned long i;
+ mpz_mul_ui (result, param, n);
+ for (i = 1; i < n; i++)
+ mpz_add_ui (result, result, i*7);
+ }
+
+ int
+ main (void)
+ {
+ mpz_t r, n;
+ mpz_init (r);
+ mpz_init_set_str (n, "123456", 0);
+ foo (r, n, 20L);
+ gmp_printf ("%Zd\n", r);
+ return 0;
+ }
+
+ Our function 'foo' works even if its caller passes the same variable
+for 'param' and 'result', just like the library functions. But
+sometimes it's tricky to make that work, and an application might not
+want to bother supporting that sort of thing.
+
+ Since GMP types are implemented as one-element arrays, using a GMP
+variable as a parameter passes a pointer to the object. Hence the
+call-by-reference. A more explicit (and equivalent) prototype for our
+function 'foo' could be:
+
+ void foo (mpz_ptr result, mpz_srcptr param, unsigned long n);
+
+\1f
+File: gmp.info, Node: Memory Management, Next: Reentrancy, Prev: Parameter Conventions, Up: GMP Basics
+
+3.6 Memory Management
+=====================
+
+The GMP types like 'mpz_t' are small, containing only a couple of sizes,
+and pointers to allocated data. Once a variable is initialized, GMP
+takes care of all space allocation. Additional space is allocated
+whenever a variable doesn't have enough.
+
+ 'mpz_t' and 'mpq_t' variables never reduce their allocated space.
+Normally this is the best policy, since it avoids frequent reallocation.
+Applications that need to return memory to the heap at some particular
+point can use 'mpz_realloc2', or clear variables no longer needed.
+
+ 'mpf_t' variables, in the current implementation, use a fixed amount
+of space, determined by the chosen precision and allocated at
+initialization, so their size doesn't change.
+
+ All memory is allocated using 'malloc' and friends by default, but
+this can be changed, see *note Custom Allocation::. Temporary memory on
+the stack is also used (via 'alloca'), but this can be changed at
+build-time if desired, see *note Build Options::.
+
+\1f
+File: gmp.info, Node: Reentrancy, Next: Useful Macros and Constants, Prev: Memory Management, Up: GMP Basics
+
+3.7 Reentrancy
+==============
+
+GMP is reentrant and thread-safe, with some exceptions:
+
+ * If configured with '--enable-alloca=malloc-notreentrant' (or with
+ '--enable-alloca=notreentrant' when 'alloca' is not available),
+ then naturally GMP is not reentrant.
+
+ * 'mpf_set_default_prec' and 'mpf_init' use a global variable for the
+ selected precision. 'mpf_init2' can be used instead, and in the
+ C++ interface an explicit precision to the 'mpf_class' constructor.
+
+ * 'mpz_random' and the other old random number functions use a global
+ random state and are hence not reentrant. The newer random number
+ functions that accept a 'gmp_randstate_t' parameter can be used
+ instead.
+
+ * 'gmp_randinit' (obsolete) returns an error indication through a
+ global variable, which is not thread safe. Applications are
+ advised to use 'gmp_randinit_default' or 'gmp_randinit_lc_2exp'
+ instead.
+
+ * 'mp_set_memory_functions' uses global variables to store the
+ selected memory allocation functions.
+
+ * If the memory allocation functions set by a call to
+ 'mp_set_memory_functions' (or 'malloc' and friends by default) are
+ not reentrant, then GMP will not be reentrant either.
+
+ * If the standard I/O functions such as 'fwrite' are not reentrant
+ then the GMP I/O functions using them will not be reentrant either.
+
+ * It's safe for two threads to read from the same GMP variable
+ simultaneously, but it's not safe for one to read while another
+ might be writing, nor for two threads to write simultaneously.
+ It's not safe for two threads to generate a random number from the
+ same 'gmp_randstate_t' simultaneously, since this involves an
+ update of that variable.
+
+\1f
+File: gmp.info, Node: Useful Macros and Constants, Next: Compatibility with older versions, Prev: Reentrancy, Up: GMP Basics
+
+3.8 Useful Macros and Constants
+===============================
+
+ -- Global Constant: const int mp_bits_per_limb
+ The number of bits per limb.
+
+ -- Macro: __GNU_MP_VERSION
+ -- Macro: __GNU_MP_VERSION_MINOR
+ -- Macro: __GNU_MP_VERSION_PATCHLEVEL
+ The major and minor GMP version, and patch level, respectively, as
+ integers. For GMP i.j, these numbers will be i, j, and 0,
+ respectively. For GMP i.j.k, these numbers will be i, j, and k,
+ respectively.
+
+ -- Global Constant: const char * const gmp_version
+ The GMP version number, as a null-terminated string, in the form
+ "i.j.k". This release is "6.3.0". Note that the format "i.j" was
+ used, before version 4.3.0, when k was zero.
+
+ -- Macro: __GMP_CC
+ -- Macro: __GMP_CFLAGS
+ The compiler and compiler flags, respectively, used when compiling
+ GMP, as strings.
+
+\1f
+File: gmp.info, Node: Compatibility with older versions, Next: Demonstration Programs, Prev: Useful Macros and Constants, Up: GMP Basics
+
+3.9 Compatibility with older versions
+=====================================
+
+This version of GMP is upwardly binary compatible with all 5.x, 4.x, and
+3.x versions, and upwardly compatible at the source level with all 2.x
+versions, with the following exceptions.
+
+ * 'mpn_gcd' had its source arguments swapped as of GMP 3.0, for
+ consistency with other 'mpn' functions.
+
+ * 'mpf_get_prec' counted precision slightly differently in GMP 3.0
+ and 3.0.1, but in 3.1 reverted to the 2.x style.
+
+ * 'mpn_bdivmod', documented as preliminary in GMP 4, has been
+ removed.
+
+ There are a number of compatibility issues between GMP 1 and GMP 2
+that of course also apply when porting applications from GMP 1 to GMP 5.
+Please see the GMP 2 manual for details.
+
+\1f
+File: gmp.info, Node: Demonstration Programs, Next: Efficiency, Prev: Compatibility with older versions, Up: GMP Basics
+
+3.10 Demonstration programs
+===========================
+
+The 'demos' subdirectory has some sample programs using GMP. These
+aren't built or installed, but there's a 'Makefile' with rules for them.
+For instance,
+
+ make pexpr
+ ./pexpr 68^975+10
+
+The following programs are provided
+
+ * 'pexpr' is an expression evaluator, the program used on the GMP web
+ page.
+ * The 'calc' subdirectory has a similar but simpler evaluator using
+ 'lex' and 'yacc'.
+ * The 'expr' subdirectory is yet another expression evaluator, a
+ library designed for ease of use within a C program. See
+ 'demos/expr/README' for more information.
+ * 'factorize' is a Pollard-Rho factorization program.
+ * 'isprime' is a command-line interface to the 'mpz_probab_prime_p'
+ function.
+ * 'primes' counts or lists primes in an interval, using a sieve.
+ * 'qcn' is an example use of 'mpz_kronecker_ui' to estimate quadratic
+ class numbers.
+ * The 'perl' subdirectory is a comprehensive perl interface to GMP.
+ See 'demos/perl/INSTALL' for more information. Documentation is in
+ POD format in 'demos/perl/GMP.pm'.
+
+ As an aside, consideration has been given at various times to some
+sort of expression evaluation within the main GMP library. Going beyond
+something minimal quickly leads to matters like user-defined functions,
+looping, fixnums for control variables, etc, which are considered
+outside the scope of GMP (much closer to language interpreters or
+compilers, *Note Language Bindings::). Something simple for program
+input convenience may yet be a possibility, a combination of the 'expr'
+demo and the 'pexpr' tree back-end perhaps. But for now the above
+evaluators are offered as illustrations.
+
+\1f
+File: gmp.info, Node: Efficiency, Next: Debugging, Prev: Demonstration Programs, Up: GMP Basics
+
+3.11 Efficiency
+===============
+
+Small Operands
+ On small operands, the time for function call overheads and memory
+ allocation can be significant in comparison to actual calculation.
+ This is unavoidable in a general purpose variable precision
+ library, although GMP attempts to be as efficient as it can on both
+ large and small operands.
+
+Static Linking
+ On some CPUs, in particular the x86s, the static 'libgmp.a' should
+ be used for maximum speed, since the PIC code in the shared
+ 'libgmp.so' will have a small overhead on each function call and
+ global data address. For many programs this will be insignificant,
+ but for long calculations there's a gain to be had.
+
+Initializing and Clearing
+ Avoid excessive initializing and clearing of variables, since this
+ can be quite time consuming, especially in comparison to otherwise
+ fast operations like addition.
+
+ A language interpreter might want to keep a free list or stack of
+ initialized variables ready for use. It should be possible to
+ integrate something like that with a garbage collector too.
+
+Reallocations
+ An 'mpz_t' or 'mpq_t' variable used to hold successively increasing
+ values will have its memory repeatedly 'realloc'ed, which could be
+ quite slow or could fragment memory, depending on the C library.
+ If an application can estimate the final size then 'mpz_init2' or
+ 'mpz_realloc2' can be called to allocate the necessary space from
+ the beginning (*note Initializing Integers::).
+
+ It doesn't matter if a size set with 'mpz_init2' or 'mpz_realloc2'
+ is too small, since all functions will do a further reallocation if
+ necessary. Badly overestimating memory required will waste space
+ though.
+
+'2exp' Functions
+ It's up to an application to call functions like 'mpz_mul_2exp'
+ when appropriate. General purpose functions like 'mpz_mul' make no
+ attempt to identify powers of two or other special forms, because
+ such inputs will usually be very rare and testing every time would
+ be wasteful.
+
+'ui' and 'si' Functions
+ The 'ui' functions and the small number of 'si' functions exist for
+ convenience and should be used where applicable. But if for
+ example an 'mpz_t' contains a value that fits in an 'unsigned long'
+ there's no need to extract it and call a 'ui' function, just use
+ the regular 'mpz' function.
+
+In-Place Operations
+ 'mpz_abs', 'mpq_abs', 'mpf_abs', 'mpz_neg', 'mpq_neg' and 'mpf_neg'
+ are fast when used for in-place operations like 'mpz_abs(x,x)',
+ since in the current implementation only a single field of 'x'
+ needs changing. On suitable compilers (GCC for instance) this is
+ inlined too.
+
+ 'mpz_add_ui', 'mpz_sub_ui', 'mpf_add_ui' and 'mpf_sub_ui' benefit
+ from an in-place operation like 'mpz_add_ui(x,x,y)', since usually
+ only one or two limbs of 'x' will need to be changed. The same
+ applies to the full precision 'mpz_add' etc if 'y' is small. If
+ 'y' is big then cache locality may be helped, but that's all.
+
+ 'mpz_mul' is currently the opposite, a separate destination is
+ slightly better. A call like 'mpz_mul(x,x,y)' will, unless 'y' is
+ only one limb, make a temporary copy of 'x' before forming the
+ result. Normally that copying will only be a tiny fraction of the
+ time for the multiply, so this is not a particularly important
+ consideration.
+
+ 'mpz_set', 'mpq_set', 'mpq_set_num', 'mpf_set', etc, make no
+ attempt to recognise a copy of something to itself, so a call like
+ 'mpz_set(x,x)' will be wasteful. Naturally that would never be
+ written deliberately, but if it might arise from two pointers to
+ the same object then a test to avoid it might be desirable.
+
+ if (x != y)
+ mpz_set (x, y);
+
+ Note that it's never worth introducing extra 'mpz_set' calls just
+ to get in-place operations. If a result should go to a particular
+ variable then just direct it there and let GMP take care of data
+ movement.
+
+Divisibility Testing (Small Integers)
+ 'mpz_divisible_ui_p' and 'mpz_congruent_ui_p' are the best
+ functions for testing whether an 'mpz_t' is divisible by an
+ individual small integer. They use an algorithm which is faster
+ than 'mpz_tdiv_ui', but which gives no useful information about the
+ actual remainder, only whether it's zero (or a particular value).
+
+ However when testing divisibility by several small integers, it's
+ best to take a remainder modulo their product, to save
+ multi-precision operations. For instance to test whether a number
+ is divisible by 23, 29 or 31 take a remainder modulo 23*29*31 =
+ 20677 and then test that.
+
+ The division functions like 'mpz_tdiv_q_ui' which give a quotient
+ as well as a remainder are generally a little slower than the
+ remainder-only functions like 'mpz_tdiv_ui'. If the quotient is
+ only rarely wanted then it's probably best to just take a remainder
+ and then go back and calculate the quotient if and when it's wanted
+ ('mpz_divexact_ui' can be used if the remainder is zero).
+
+Rational Arithmetic
+ The 'mpq' functions operate on 'mpq_t' values with no common
+ factors in the numerator and denominator. Common factors are
+ checked-for and cast out as necessary. In general, cancelling
+ factors every time is the best approach since it minimizes the
+ sizes for subsequent operations.
+
+ However, applications that know something about the factorization
+ of the values they're working with might be able to avoid some of
+ the GCDs used for canonicalization, or swap them for divisions.
+ For example when multiplying by a prime it's enough to check for
+ factors of it in the denominator instead of doing a full GCD. Or
+ when forming a big product it might be known that very little
+ cancellation will be possible, and so canonicalization can be left
+ to the end.
+
+ The 'mpq_numref' and 'mpq_denref' macros give access to the
+ numerator and denominator to do things outside the scope of the
+ supplied 'mpq' functions. *Note Applying Integer Functions::.
+
+ The canonical form for rationals allows mixed-type 'mpq_t' and
+ integer additions or subtractions to be done directly with
+ multiples of the denominator. This will be somewhat faster than
+ 'mpq_add'. For example,
+
+ /* mpq increment */
+ mpz_add (mpq_numref(q), mpq_numref(q), mpq_denref(q));
+
+ /* mpq += unsigned long */
+ mpz_addmul_ui (mpq_numref(q), mpq_denref(q), 123UL);
+
+ /* mpq -= mpz */
+ mpz_submul (mpq_numref(q), mpq_denref(q), z);
+
+Number Sequences
+ Functions like 'mpz_fac_ui', 'mpz_fib_ui' and 'mpz_bin_uiui' are
+ designed for calculating isolated values. If a range of values is
+ wanted it's probably best to get a starting point and iterate from
+ there.
+
+Text Input/Output
+ Hexadecimal or octal are suggested for input or output in text
+ form. Power-of-2 bases like these can be converted much more
+ efficiently than other bases, like decimal. For big numbers
+ there's usually nothing of particular interest to be seen in the
+ digits, so the base doesn't matter much.
+
+ Maybe we can hope octal will one day become the normal base for
+ everyday use, as proposed by King Charles XII of Sweden and later
+ reformers.
+
+\1f
+File: gmp.info, Node: Debugging, Next: Profiling, Prev: Efficiency, Up: GMP Basics
+
+3.12 Debugging
+==============
+
+Stack Overflow
+ Depending on the system, a segmentation violation or bus error
+ might be the only indication of stack overflow. See
+ '--enable-alloca' choices in *note Build Options::, for how to
+ address this.
+
+ In new enough versions of GCC, '-fstack-check' may be able to
+ ensure an overflow is recognised by the system before too much
+ damage is done, or '-fstack-limit-symbol' or
+ '-fstack-limit-register' may be able to add checking if the system
+ itself doesn't do any (*note Options for Code Generation: (gcc)Code
+ Gen Options.). These options must be added to the 'CFLAGS' used in
+ the GMP build (*note Build Options::), adding them just to an
+ application will have no effect. Note also they're a slowdown,
+ adding overhead to each function call and each stack allocation.
+
+Heap Problems
+ The most likely cause of application problems with GMP is heap
+ corruption. Failing to 'init' GMP variables will have
+ unpredictable effects, and corruption arising elsewhere in a
+ program may well affect GMP. Initializing GMP variables more than
+ once or failing to clear them will cause memory leaks.
+
+ In all such cases a 'malloc' debugger is recommended. On a GNU or
+ BSD system the standard C library 'malloc' has some diagnostic
+ facilities, see *note Allocation Debugging: (libc)Allocation
+ Debugging, or 'man 3 malloc'. Other possibilities, in no
+ particular order, include
+
+ <http://cs.ecs.baylor.edu/~donahoo/tools/ccmalloc/>
+ <http://dmalloc.com/>
+ <https://wiki.gnome.org/Apps/MemProf>
+
+ The GMP default allocation routines in 'memory.c' also have a
+ simple sentinel scheme which can be enabled with '#define DEBUG' in
+ that file. This is mainly designed for detecting buffer overruns
+ during GMP development, but might find other uses.
+
+Stack Backtraces
+ On some systems the compiler options GMP uses by default can
+ interfere with debugging. In particular on x86 and 68k systems
+ '-fomit-frame-pointer' is used and this generally inhibits stack
+ backtracing. Recompiling without such options may help while
+ debugging, though the usual caveats about it potentially moving a
+ memory problem or hiding a compiler bug will apply.
+
+GDB, the GNU Debugger
+ A sample '.gdbinit' is included in the distribution, showing how to
+ call some undocumented dump functions to print GMP variables from
+ within GDB. Note that these functions shouldn't be used in final
+ application code since they're undocumented and may be subject to
+ incompatible changes in future versions of GMP.
+
+Source File Paths
+ GMP has multiple source files with the same name, in different
+ directories. For example 'mpz', 'mpq' and 'mpf' each have an
+ 'init.c'. If the debugger can't already determine the right one it
+ may help to build with absolute paths on each C file. One way to
+ do that is to use a separate object directory with an absolute path
+ to the source directory.
+
+ cd /my/build/dir
+ /my/source/dir/gmp-6.3.0/configure
+
+ This works via 'VPATH', and might require GNU 'make'. Alternately
+ it might be possible to change the '.c.lo' rules appropriately.
+
+Assertion Checking
+ The build option '--enable-assert' is available to add some
+ consistency checks to the library (see *note Build Options::).
+ These are likely to be of limited value to most applications.
+ Assertion failures are just as likely to indicate memory corruption
+ as a library or compiler bug.
+
+ Applications using the low-level 'mpn' functions, however, will
+ benefit from '--enable-assert' since it adds checks on the
+ parameters of most such functions, many of which have subtle
+ restrictions on their usage. Note however that only the generic C
+ code has checks, not the assembly code, so '--disable-assembly'
+ should be used for maximum checking.
+
+Temporary Memory Checking
+ The build option '--enable-alloca=debug' arranges that each block
+ of temporary memory in GMP is allocated with a separate call to
+ 'malloc' (or the allocation function set with
+ 'mp_set_memory_functions').
+
+ This can help a malloc debugger detect accesses outside the
+ intended bounds, or detect memory not released. In a normal build,
+ on the other hand, temporary memory is allocated in blocks which
+ GMP divides up for its own use, or may be allocated with a compiler
+ builtin 'alloca' which will go nowhere near any malloc debugger
+ hooks.
+
+Maximum Debuggability
+ To summarize the above, a GMP build for maximum debuggability would
+ be
+
+ ./configure --disable-shared --enable-assert \
+ --enable-alloca=debug --disable-assembly CFLAGS=-g
+
+ For C++, add '--enable-cxx CXXFLAGS=-g'.
+
+Checker
+ The GCC checker (<https://savannah.nongnu.org/projects/checker/>)
+ can be used with GMP. It contains a stub library which means GMP
+ applications compiled with checker can use a normal GMP build.
+
+ A build of GMP with checking within GMP itself can be made. This
+ will run very very slowly. On GNU/Linux for example,
+
+ ./configure --disable-assembly CC=checkergcc
+
+ '--disable-assembly' must be used, since the GMP assembly code
+ doesn't support the checking scheme. The GMP C++ features cannot
+ be used, since current versions of checker (0.9.9.1) don't yet
+ support the standard C++ library.
+
+Valgrind
+ Valgrind (<http://valgrind.org/>) is a memory checker for x86, ARM,
+ MIPS, PowerPC, and S/390. It translates and emulates machine
+ instructions to do strong checks for uninitialized data (at the
+ level of individual bits), memory accesses through bad pointers,
+ and memory leaks.
+
+ Valgrind does not always support every possible instruction, in
+ particular ones recently added to an ISA. Valgrind might therefore
+ be incompatible with a recent GMP or even a less recent GMP which
+ is compiled using a recent GCC.
+
+ GMP's assembly code sometimes promotes a read of the limbs to some
+ larger size, for efficiency. GMP will do this even at the start
+ and end of a multilimb operand, using naturally aligned operations
+ on the larger type. This may lead to benign reads outside of
+ allocated areas, triggering complaints from Valgrind. Valgrind's
+ option '--partial-loads-ok=yes' should help.
+
+Other Problems
+ Any suspected bug in GMP itself should be isolated to make sure
+ it's not an application problem, see *note Reporting Bugs::.
+
+\1f
+File: gmp.info, Node: Profiling, Next: Autoconf, Prev: Debugging, Up: GMP Basics
+
+3.13 Profiling
+==============
+
+Running a program under a profiler is a good way to find where it's
+spending most time and where improvements can be best sought. The
+profiling choices for a GMP build are as follows.
+
+'--disable-profiling'
+ The default is to add nothing special for profiling.
+
+ It should be possible to just compile the mainline of a program
+ with '-p' and use 'prof' to get a profile consisting of timer-based
+ sampling of the program counter. Most of the GMP assembly code has
+ the necessary symbol information.
+
+ This approach has the advantage of minimizing interference with
+ normal program operation, but on most systems the resolution of the
+ sampling is quite low (10 milliseconds for instance), requiring
+ long runs to get accurate information.
+
+'--enable-profiling=prof'
+ Build with support for the system 'prof', which means '-p' added to
+ the 'CFLAGS'.
+
+ This provides call counting in addition to program counter
+ sampling, which allows the most frequently called routines to be
+ identified, and an average time spent in each routine to be
+ determined.
+
+ The x86 assembly code has support for this option, but on other
+ processors the assembly routines will be as if compiled without
+ '-p' and therefore won't appear in the call counts.
+
+ On some systems, such as GNU/Linux, '-p' in fact means '-pg' and in
+ this case '--enable-profiling=gprof' described below should be used
+ instead.
+
+'--enable-profiling=gprof'
+ Build with support for 'gprof', which means '-pg' added to the
+ 'CFLAGS'.
+
+ This provides call graph construction in addition to call counting
+ and program counter sampling, which makes it possible to count
+ calls coming from different locations. For example the number of
+ calls to 'mpn_mul' from 'mpz_mul' versus the number from 'mpf_mul'.
+ The program counter sampling is still flat though, so only a total
+ time in 'mpn_mul' would be accumulated, not a separate amount for
+ each call site.
+
+ The x86 assembly code has support for this option, but on other
+ processors the assembly routines will be as if compiled without
+ '-pg' and therefore not be included in the call counts.
+
+ On x86 and m68k systems '-pg' and '-fomit-frame-pointer' are
+ incompatible, so the latter is omitted from the default flags in
+ that case, which might result in poorer code generation.
+
+ Incidentally, it should be possible to use the 'gprof' program with
+ a plain '--enable-profiling=prof' build. But in that case only the
+ 'gprof -p' flat profile and call counts can be expected to be
+ valid, not the 'gprof -q' call graph.
+
+'--enable-profiling=instrument'
+ Build with the GCC option '-finstrument-functions' added to the
+ 'CFLAGS' (*note Options for Code Generation: (gcc)Code Gen
+ Options.).
+
+ This inserts special instrumenting calls at the start and end of
+ each function, allowing exact timing and full call graph
+ construction.
+
+ This instrumenting is not normally a standard system feature and
+ will require support from an external library, such as
+
+ <https://sourceforge.net/projects/fnccheck/>
+
+ This should be included in 'LIBS' during the GMP configure so that
+ test programs will link. For example,
+
+ ./configure --enable-profiling=instrument LIBS=-lfc
+
+ On a GNU system the C library provides dummy instrumenting
+ functions, so programs compiled with this option will link. In
+ this case it's only necessary to ensure the correct library is
+ added when linking an application.
+
+ The x86 assembly code supports this option, but on other processors
+ the assembly routines will be as if compiled without
+ '-finstrument-functions' meaning time spent in them will
+ effectively be attributed to their caller.
+
+\1f
+File: gmp.info, Node: Autoconf, Next: Emacs, Prev: Profiling, Up: GMP Basics
+
+3.14 Autoconf
+=============
+
+Autoconf based applications can easily check whether GMP is installed.
+The only thing to be noted is that GMP library symbols from version 3
+onwards have prefixes like '__gmpz'. The following therefore would be a
+simple test,
+
+ AC_CHECK_LIB(gmp, __gmpz_init)
+
+ This just uses the default 'AC_CHECK_LIB' actions for found or not
+found, but an application that must have GMP would want to generate an
+error if not found. For example,
+
+ AC_CHECK_LIB(gmp, __gmpz_init, ,
+ [AC_MSG_ERROR([GNU MP not found, see https://gmplib.org/])])
+
+ If functions added in some particular version of GMP are required,
+then one of those can be used when checking. For example 'mpz_mul_si'
+was added in GMP 3.1,
+
+ AC_CHECK_LIB(gmp, __gmpz_mul_si, ,
+ [AC_MSG_ERROR(
+ [GNU MP not found, or not 3.1 or up, see https://gmplib.org/])])
+
+ An alternative would be to test the version number in 'gmp.h' using
+say 'AC_EGREP_CPP'. That would make it possible to test the exact
+version, if some particular sub-minor release is known to be necessary.
+
+ In general it's recommended that applications should simply demand a
+new enough GMP rather than trying to provide supplements for features
+not available in past versions.
+
+ Occasionally an application will need or want to know the size of a
+type at configuration or preprocessing time, not just with 'sizeof' in
+the code. This can be done in the normal way with 'mp_limb_t' etc, but
+GMP 4.0 or up is best for this, since prior versions needed certain '-D'
+defines on systems using a 'long long' limb. The following would suit
+Autoconf 2.50 or up,
+
+ AC_CHECK_SIZEOF(mp_limb_t, , [#include <gmp.h>])
+
+\1f
+File: gmp.info, Node: Emacs, Prev: Autoconf, Up: GMP Basics
+
+3.15 Emacs
+==========
+
+<C-h C-i> ('info-lookup-symbol') is a good way to find documentation on
+C functions while editing (*note Info Documentation Lookup: (emacs)Info
+Lookup.).
+
+ The GMP manual can be included in such lookups by putting the
+following in your '.emacs',
+
+ (eval-after-load "info-look"
+ '(let ((mode-value (assoc 'c-mode (assoc 'symbol info-lookup-alist))))
+ (setcar (nthcdr 3 mode-value)
+ (cons '("(gmp)Function Index" nil "^ -.* " "\\>")
+ (nth 3 mode-value)))))
+
+\1f
+File: gmp.info, Node: Reporting Bugs, Next: Integer Functions, Prev: GMP Basics, Up: Top
+
+4 Reporting Bugs
+****************
+
+If you think you have found a bug in the GMP library, please investigate
+it and report it. We have made this library available to you, and it is
+not too much to ask you to report the bugs you find.
+
+ Before you report a bug, check it's not already addressed in *note
+Known Build Problems::, or perhaps *note Notes for Particular Systems::.
+You may also want to check <https://gmplib.org/> for patches for this
+release, or try a recent snapshot from
+<https://gmplib.org/download/snapshot/>.
+
+ Please include the following in any report:
+
+ * The GMP version number, and if pre-packaged or patched then say so.
+
+ * A test program that makes it possible for us to reproduce the bug.
+ Include instructions on how to run the program.
+
+ * A description of what is wrong. If the results are incorrect, in
+ what way. If you get a crash, say so.
+
+ * If you get a crash, include a stack backtrace from the debugger if
+ it's informative ('where' in 'gdb', or '$C' in 'adb').
+
+ * Please do not send core dumps, executables or 'strace's.
+
+ * The 'configure' options you used when building GMP, if any.
+
+ * The output from 'configure', as printed to stdout, with any options
+ used.
+
+ * The name of the compiler and its version. For 'gcc', get the
+ version with 'gcc -v', otherwise perhaps 'what `which cc`', or
+ similar.
+
+ * The output from running 'uname -a'.
+
+ * The output from running './config.guess', and from running
+ './configfsf.guess' (might be the same).
+
+ * If the bug is related to 'configure', then the compressed contents
+ of 'config.log'.
+
+ * If the bug is related to an 'asm' file not assembling, then the
+ contents of 'config.m4' and the offending line or lines from the
+ temporary 'mpn/tmp-<file>.s'.
+
+ Please make an effort to produce a self-contained report, with
+something definite that can be tested or debugged. Vague queries or
+piecemeal messages are difficult to act on and don't help the
+development effort.
+
+ It is not uncommon that an observed problem is actually due to a bug
+in the compiler; the GMP code tends to explore interesting corners in
+compilers.
+
+ If your bug report is good, we will do our best to help you get a
+corrected version of the library; if the bug report is poor, we won't do
+anything about it (except maybe ask you to send a better report).
+
+ Send your report to: <gmp-bugs@gmplib.org>.
+
+ If you think something in this manual is unclear, or downright
+incorrect, or if the language needs to be improved, please send a note
+to the same address.
+
+\1f
+File: gmp.info, Node: Integer Functions, Next: Rational Number Functions, Prev: Reporting Bugs, Up: Top
+
+5 Integer Functions
+*******************
+
+This chapter describes the GMP functions for performing integer
+arithmetic. These functions start with the prefix 'mpz_'.
+
+ GMP integers are stored in objects of type 'mpz_t'.
+
+* Menu:
+
+* Initializing Integers::
+* Assigning Integers::
+* Simultaneous Integer Init & Assign::
+* Converting Integers::
+* Integer Arithmetic::
+* Integer Division::
+* Integer Exponentiation::
+* Integer Roots::
+* Number Theoretic Functions::
+* Integer Comparisons::
+* Integer Logic and Bit Fiddling::
+* I/O of Integers::
+* Integer Random Numbers::
+* Integer Import and Export::
+* Miscellaneous Integer Functions::
+* Integer Special Functions::
+
+\1f
+File: gmp.info, Node: Initializing Integers, Next: Assigning Integers, Prev: Integer Functions, Up: Integer Functions
+
+5.1 Initialization Functions
+============================
+
+The functions for integer arithmetic assume that all integer objects are
+initialized. You do that by calling the function 'mpz_init'. For
+example,
+
+ {
+ mpz_t integ;
+ mpz_init (integ);
+ ...
+ mpz_add (integ, ...);
+ ...
+ mpz_sub (integ, ...);
+
+ /* Unless the program is about to exit, do ... */
+ mpz_clear (integ);
+ }
+
+ As you can see, you can store new values any number of times, once an
+object is initialized.
+
+ -- Function: void mpz_init (mpz_t X)
+ Initialize X, and set its value to 0.
+
+ -- Function: void mpz_inits (mpz_t X, ...)
+ Initialize a NULL-terminated list of 'mpz_t' variables, and set
+ their values to 0.
+
+ -- Function: void mpz_init2 (mpz_t X, mp_bitcnt_t N)
+ Initialize X, with space for N-bit numbers, and set its value to 0.
+ Calling this function instead of 'mpz_init' or 'mpz_inits' is never
+ necessary; reallocation is handled automatically by GMP when
+ needed.
+
+ While N defines the initial space, X will grow automatically in the
+ normal way, if necessary, for subsequent values stored.
+ 'mpz_init2' makes it possible to avoid such reallocations if a
+ maximum size is known in advance.
+
+ In preparation for an operation, GMP often allocates one limb more
+ than ultimately needed. To make sure GMP will not perform
+ reallocation for X, you need to add the number of bits in
+ 'mp_limb_t' to N.
+
+ -- Function: void mpz_clear (mpz_t X)
+ Free the space occupied by X. Call this function for all 'mpz_t'
+ variables when you are done with them.
+
+ -- Function: void mpz_clears (mpz_t X, ...)
+ Free the space occupied by a NULL-terminated list of 'mpz_t'
+ variables.
+
+ -- Function: void mpz_realloc2 (mpz_t X, mp_bitcnt_t N)
+ Change the space allocated for X to N bits. The value in X is
+ preserved if it fits, or is set to 0 if not.
+
+ Calling this function is never necessary; reallocation is handled
+ automatically by GMP when needed. But this function can be used to
+ increase the space for a variable in order to avoid repeated
+ automatic reallocations, or to decrease it to give memory back to
+ the heap.
+
+\1f
+File: gmp.info, Node: Assigning Integers, Next: Simultaneous Integer Init & Assign, Prev: Initializing Integers, Up: Integer Functions
+
+5.2 Assignment Functions
+========================
+
+These functions assign new values to already initialized integers (*note
+Initializing Integers::).
+
+ -- Function: void mpz_set (mpz_t ROP, const mpz_t OP)
+ -- Function: void mpz_set_ui (mpz_t ROP, unsigned long int OP)
+ -- Function: void mpz_set_si (mpz_t ROP, signed long int OP)
+ -- Function: void mpz_set_d (mpz_t ROP, double OP)
+ -- Function: void mpz_set_q (mpz_t ROP, const mpq_t OP)
+ -- Function: void mpz_set_f (mpz_t ROP, const mpf_t OP)
+ Set the value of ROP from OP.
+
+ 'mpz_set_d', 'mpz_set_q' and 'mpz_set_f' truncate OP to make it an
+ integer.
+
+ -- Function: int mpz_set_str (mpz_t ROP, const char *STR, int BASE)
+ Set the value of ROP from STR, a null-terminated C string in base
+ BASE. White space is allowed in the string, and is simply ignored.
+
+ The BASE may vary from 2 to 62, or if BASE is 0, then the leading
+ characters are used: '0x' and '0X' for hexadecimal, '0b' and '0B'
+ for binary, '0' for octal, or decimal otherwise.
+
+ For bases up to 36, case is ignored; upper-case and lower-case
+ letters have the same value. For bases 37 to 62, upper-case
+ letters represent the usual 10..35 while lower-case letters
+ represent 36..61.
+
+ This function returns 0 if the entire string is a valid number in
+ base BASE. Otherwise it returns -1.
+
+ -- Function: void mpz_swap (mpz_t ROP1, mpz_t ROP2)
+ Swap the values ROP1 and ROP2 efficiently.
+
+\1f
+File: gmp.info, Node: Simultaneous Integer Init & Assign, Next: Converting Integers, Prev: Assigning Integers, Up: Integer Functions
+
+5.3 Combined Initialization and Assignment Functions
+====================================================
+
+For convenience, GMP provides a parallel series of initialize-and-set
+functions which initialize the output and then store the value there.
+These functions' names have the form 'mpz_init_set...'
+
+ Here is an example of using one:
+
+ {
+ mpz_t pie;
+ mpz_init_set_str (pie, "3141592653589793238462643383279502884", 10);
+ ...
+ mpz_sub (pie, ...);
+ ...
+ mpz_clear (pie);
+ }
+
+Once the integer has been initialized by any of the 'mpz_init_set...'
+functions, it can be used as the source or destination operand for the
+ordinary integer functions. Don't use an initialize-and-set function on
+a variable already initialized!
+
+ -- Function: void mpz_init_set (mpz_t ROP, const mpz_t OP)
+ -- Function: void mpz_init_set_ui (mpz_t ROP, unsigned long int OP)
+ -- Function: void mpz_init_set_si (mpz_t ROP, signed long int OP)
+ -- Function: void mpz_init_set_d (mpz_t ROP, double OP)
+ Initialize ROP with limb space and set the initial numeric value
+ from OP.
+
+ -- Function: int mpz_init_set_str (mpz_t ROP, const char *STR, int
+ BASE)
+ Initialize ROP and set its value like 'mpz_set_str' (see its
+ documentation above for details).
+
+ If the string is a correct base BASE number, the function returns
+ 0; if an error occurs it returns -1. ROP is initialized even if an
+ error occurs. (I.e., you have to call 'mpz_clear' for it.)
+
+\1f
+File: gmp.info, Node: Converting Integers, Next: Integer Arithmetic, Prev: Simultaneous Integer Init & Assign, Up: Integer Functions
+
+5.4 Conversion Functions
+========================
+
+This section describes functions for converting GMP integers to standard
+C types. Functions for converting _to_ GMP integers are described in
+*note Assigning Integers:: and *note I/O of Integers::.
+
+ -- Function: unsigned long int mpz_get_ui (const mpz_t OP)
+ Return the value of OP as an 'unsigned long'.
+
+ If OP is too big to fit an 'unsigned long' then just the least
+ significant bits that do fit are returned. The sign of OP is
+ ignored, only the absolute value is used.
+
+ -- Function: signed long int mpz_get_si (const mpz_t OP)
+ If OP fits into a 'signed long int' return the value of OP.
+ Otherwise return the least significant part of OP, with the same
+ sign as OP.
+
+ If OP is too big to fit in a 'signed long int', the returned result
+ is probably not very useful. To find out if the value will fit,
+ use the function 'mpz_fits_slong_p'.
+
+ -- Function: double mpz_get_d (const mpz_t OP)
+ Convert OP to a 'double', truncating if necessary (i.e. rounding
+ towards zero).
+
+ If the exponent from the conversion is too big, the result is
+ system dependent. An infinity is returned where available. A
+ hardware overflow trap may or may not occur.
+
+ -- Function: double mpz_get_d_2exp (signed long int *EXP, const mpz_t
+ OP)
+ Convert OP to a 'double', truncating if necessary (i.e. rounding
+ towards zero), and returning the exponent separately.
+
+ The return value is in the range 0.5<=abs(D)<1 and the exponent is
+ stored to '*EXP'. D * 2^EXP is the (truncated) OP value. If OP is
+ zero, the return is 0.0 and 0 is stored to '*EXP'.
+
+ This is similar to the standard C 'frexp' function (*note
+ (libc)Normalization Functions::).
+
+ -- Function: char * mpz_get_str (char *STR, int BASE, const mpz_t OP)
+ Convert OP to a string of digits in base BASE. The base argument
+ may vary from 2 to 62 or from -2 to -36.
+
+ For BASE in the range 2..36, digits and lower-case letters are
+ used; for -2..-36, digits and upper-case letters are used; for
+ 37..62, digits, upper-case letters, and lower-case letters (in that
+ significance order) are used.
+
+ If STR is 'NULL', the result string is allocated using the current
+ allocation function (*note Custom Allocation::). The block will be
+ 'strlen(str)+1' bytes, that being exactly enough for the string and
+ null-terminator.
+
+ If STR is not 'NULL', it should point to a block of storage large
+ enough for the result, that being 'mpz_sizeinbase (OP, BASE) + 2'.
+ The two extra bytes are for a possible minus sign, and the
+ null-terminator.
+
+ A pointer to the result string is returned, being either the
+ allocated block, or the given STR.
+
+\1f
+File: gmp.info, Node: Integer Arithmetic, Next: Integer Division, Prev: Converting Integers, Up: Integer Functions
+
+5.5 Arithmetic Functions
+========================
+
+ -- Function: void mpz_add (mpz_t ROP, const mpz_t OP1, const mpz_t OP2)
+ -- Function: void mpz_add_ui (mpz_t ROP, const mpz_t OP1, unsigned long
+ int OP2)
+ Set ROP to OP1 + OP2.
+
+ -- Function: void mpz_sub (mpz_t ROP, const mpz_t OP1, const mpz_t OP2)
+ -- Function: void mpz_sub_ui (mpz_t ROP, const mpz_t OP1, unsigned long
+ int OP2)
+ -- Function: void mpz_ui_sub (mpz_t ROP, unsigned long int OP1, const
+ mpz_t OP2)
+ Set ROP to OP1 - OP2.
+
+ -- Function: void mpz_mul (mpz_t ROP, const mpz_t OP1, const mpz_t OP2)
+ -- Function: void mpz_mul_si (mpz_t ROP, const mpz_t OP1, long int OP2)
+ -- Function: void mpz_mul_ui (mpz_t ROP, const mpz_t OP1, unsigned long
+ int OP2)
+ Set ROP to OP1 times OP2.
+
+ -- Function: void mpz_addmul (mpz_t ROP, const mpz_t OP1, const mpz_t
+ OP2)
+ -- Function: void mpz_addmul_ui (mpz_t ROP, const mpz_t OP1, unsigned
+ long int OP2)
+ Set ROP to ROP + OP1 times OP2.
+
+ -- Function: void mpz_submul (mpz_t ROP, const mpz_t OP1, const mpz_t
+ OP2)
+ -- Function: void mpz_submul_ui (mpz_t ROP, const mpz_t OP1, unsigned
+ long int OP2)
+ Set ROP to ROP - OP1 times OP2.
+
+ -- Function: void mpz_mul_2exp (mpz_t ROP, const mpz_t OP1, mp_bitcnt_t
+ OP2)
+ Set ROP to OP1 times 2 raised to OP2. This operation can also be
+ defined as a left shift by OP2 bits.
+
+ -- Function: void mpz_neg (mpz_t ROP, const mpz_t OP)
+ Set ROP to -OP.
+
+ -- Function: void mpz_abs (mpz_t ROP, const mpz_t OP)
+ Set ROP to the absolute value of OP.
+
+\1f
+File: gmp.info, Node: Integer Division, Next: Integer Exponentiation, Prev: Integer Arithmetic, Up: Integer Functions
+
+5.6 Division Functions
+======================
+
+Division is undefined if the divisor is zero. Passing a zero divisor to
+the division or modulo functions (including the modular powering
+functions 'mpz_powm' and 'mpz_powm_ui') will cause an intentional
+division by zero. This lets a program handle arithmetic exceptions in
+these functions the same way as for normal C 'int' arithmetic.
+
+ -- Function: void mpz_cdiv_q (mpz_t Q, const mpz_t N, const mpz_t D)
+ -- Function: void mpz_cdiv_r (mpz_t R, const mpz_t N, const mpz_t D)
+ -- Function: void mpz_cdiv_qr (mpz_t Q, mpz_t R, const mpz_t N, const
+ mpz_t D)
+
+ -- Function: unsigned long int mpz_cdiv_q_ui (mpz_t Q, const mpz_t N,
+ unsigned long int D)
+ -- Function: unsigned long int mpz_cdiv_r_ui (mpz_t R, const mpz_t N,
+ unsigned long int D)
+ -- Function: unsigned long int mpz_cdiv_qr_ui (mpz_t Q, mpz_t R,
+ const mpz_t N, unsigned long int D)
+ -- Function: unsigned long int mpz_cdiv_ui (const mpz_t N,
+ unsigned long int D)
+
+ -- Function: void mpz_cdiv_q_2exp (mpz_t Q, const mpz_t N,
+ mp_bitcnt_t B)
+ -- Function: void mpz_cdiv_r_2exp (mpz_t R, const mpz_t N,
+ mp_bitcnt_t B)
+
+ -- Function: void mpz_fdiv_q (mpz_t Q, const mpz_t N, const mpz_t D)
+ -- Function: void mpz_fdiv_r (mpz_t R, const mpz_t N, const mpz_t D)
+ -- Function: void mpz_fdiv_qr (mpz_t Q, mpz_t R, const mpz_t N, const
+ mpz_t D)
+
+ -- Function: unsigned long int mpz_fdiv_q_ui (mpz_t Q, const mpz_t N,
+ unsigned long int D)
+ -- Function: unsigned long int mpz_fdiv_r_ui (mpz_t R, const mpz_t N,
+ unsigned long int D)
+ -- Function: unsigned long int mpz_fdiv_qr_ui (mpz_t Q, mpz_t R,
+ const mpz_t N, unsigned long int D)
+ -- Function: unsigned long int mpz_fdiv_ui (const mpz_t N,
+ unsigned long int D)
+
+ -- Function: void mpz_fdiv_q_2exp (mpz_t Q, const mpz_t N,
+ mp_bitcnt_t B)
+ -- Function: void mpz_fdiv_r_2exp (mpz_t R, const mpz_t N,
+ mp_bitcnt_t B)
+
+ -- Function: void mpz_tdiv_q (mpz_t Q, const mpz_t N, const mpz_t D)
+ -- Function: void mpz_tdiv_r (mpz_t R, const mpz_t N, const mpz_t D)
+ -- Function: void mpz_tdiv_qr (mpz_t Q, mpz_t R, const mpz_t N, const
+ mpz_t D)
+
+ -- Function: unsigned long int mpz_tdiv_q_ui (mpz_t Q, const mpz_t N,
+ unsigned long int D)
+ -- Function: unsigned long int mpz_tdiv_r_ui (mpz_t R, const mpz_t N,
+ unsigned long int D)
+ -- Function: unsigned long int mpz_tdiv_qr_ui (mpz_t Q, mpz_t R,
+ const mpz_t N, unsigned long int D)
+ -- Function: unsigned long int mpz_tdiv_ui (const mpz_t N,
+ unsigned long int D)
+
+ -- Function: void mpz_tdiv_q_2exp (mpz_t Q, const mpz_t N,
+ mp_bitcnt_t B)
+ -- Function: void mpz_tdiv_r_2exp (mpz_t R, const mpz_t N,
+ mp_bitcnt_t B)
+
+
+ Divide N by D, forming a quotient Q and/or remainder R. For the
+ '2exp' functions, D=2^B. The rounding is in three styles, each
+ suiting different applications.
+
+ * 'cdiv' rounds Q up towards +infinity, and R will have the
+ opposite sign to D. The 'c' stands for "ceil".
+
+ * 'fdiv' rounds Q down towards -infinity, and R will have the
+ same sign as D. The 'f' stands for "floor".
+
+ * 'tdiv' rounds Q towards zero, and R will have the same sign as
+ N. The 't' stands for "truncate".
+
+ In all cases Q and R will satisfy N=Q*D+R, and R will satisfy
+ 0<=abs(R)<abs(D).
+
+ The 'q' functions calculate only the quotient, the 'r' functions
+ only the remainder, and the 'qr' functions calculate both. Note
+ that for 'qr' the same variable cannot be passed for both Q and R,
+ or results will be unpredictable.
+
+ For the 'ui' variants the return value is the remainder, and in
+ fact returning the remainder is all the 'div_ui' functions do. For
+ 'tdiv' and 'cdiv' the remainder can be negative, so for those the
+ return value is the absolute value of the remainder.
+
+ For the '2exp' variants the divisor is 2^B. These functions are
+ implemented as right shifts and bit masks, but of course they round
+ the same as the other functions.
+
+ For positive N both 'mpz_fdiv_q_2exp' and 'mpz_tdiv_q_2exp' are
+ simple bitwise right shifts. For negative N, 'mpz_fdiv_q_2exp' is
+ effectively an arithmetic right shift treating N as two's
+ complement the same as the bitwise logical functions do, whereas
+ 'mpz_tdiv_q_2exp' effectively treats N as sign and magnitude.
+
+ -- Function: void mpz_mod (mpz_t R, const mpz_t N, const mpz_t D)
+ -- Function: unsigned long int mpz_mod_ui (mpz_t R, const mpz_t N,
+ unsigned long int D)
+ Set R to N 'mod' D. The sign of the divisor is ignored; the result
+ is always non-negative.
+
+ 'mpz_mod_ui' is identical to 'mpz_fdiv_r_ui' above, returning the
+ remainder as well as setting R. See 'mpz_fdiv_ui' above if only
+ the return value is wanted.
+
+ -- Function: void mpz_divexact (mpz_t Q, const mpz_t N, const mpz_t D)
+ -- Function: void mpz_divexact_ui (mpz_t Q, const mpz_t N, unsigned
+ long D)
+ Set Q to N/D. These functions produce correct results only when it
+ is known in advance that D divides N.
+
+ These routines are much faster than the other division functions,
+ and are the best choice when exact division is known to occur, for
+ example reducing a rational to lowest terms.
+
+ -- Function: int mpz_divisible_p (const mpz_t N, const mpz_t D)
+ -- Function: int mpz_divisible_ui_p (const mpz_t N, unsigned long int
+ D)
+ -- Function: int mpz_divisible_2exp_p (const mpz_t N, mp_bitcnt_t B)
+ Return non-zero if N is exactly divisible by D, or in the case of
+ 'mpz_divisible_2exp_p' by 2^B.
+
+ N is divisible by D if there exists an integer Q satisfying N =
+ Q*D. Unlike the other division functions, D=0 is accepted and
+ following the rule it can be seen that only 0 is considered
+ divisible by 0.
+
+ -- Function: int mpz_congruent_p (const mpz_t N, const mpz_t C, const
+ mpz_t D)
+ -- Function: int mpz_congruent_ui_p (const mpz_t N, unsigned long int
+ C, unsigned long int D)
+ -- Function: int mpz_congruent_2exp_p (const mpz_t N, const mpz_t C,
+ mp_bitcnt_t B)
+ Return non-zero if N is congruent to C modulo D, or in the case of
+ 'mpz_congruent_2exp_p' modulo 2^B.
+
+ N is congruent to C mod D if there exists an integer Q satisfying N
+ = C + Q*D. Unlike the other division functions, D=0 is accepted
+ and following the rule it can be seen that N and C are considered
+ congruent mod 0 only when exactly equal.
+
+\1f
+File: gmp.info, Node: Integer Exponentiation, Next: Integer Roots, Prev: Integer Division, Up: Integer Functions
+
+5.7 Exponentiation Functions
+============================
+
+ -- Function: void mpz_powm (mpz_t ROP, const mpz_t BASE, const mpz_t
+ EXP, const mpz_t MOD)
+ -- Function: void mpz_powm_ui (mpz_t ROP, const mpz_t BASE, unsigned
+ long int EXP, const mpz_t MOD)
+ Set ROP to (BASE raised to EXP) modulo MOD.
+
+ Negative EXP is supported if the inverse BASE^(-1) mod MOD exists
+ (see 'mpz_invert' in *note Number Theoretic Functions::). If an
+ inverse doesn't exist then a divide by zero is raised.
+
+ -- Function: void mpz_powm_sec (mpz_t ROP, const mpz_t BASE, const
+ mpz_t EXP, const mpz_t MOD)
+ Set ROP to (BASE raised to EXP) modulo MOD.
+
+ It is required that EXP > 0 and that MOD is odd.
+
+ This function is designed to take the same time and have the same
+ cache access patterns for any two same-size arguments, assuming
+ that function arguments are placed at the same position and that
+ the machine state is identical upon function entry. This function
+ is intended for cryptographic purposes, where resilience to
+ side-channel attacks is desired.
+
+ -- Function: void mpz_pow_ui (mpz_t ROP, const mpz_t BASE, unsigned
+ long int EXP)
+ -- Function: void mpz_ui_pow_ui (mpz_t ROP, unsigned long int BASE,
+ unsigned long int EXP)
+ Set ROP to BASE raised to EXP. The case 0^0 yields 1.
+
+\1f
+File: gmp.info, Node: Integer Roots, Next: Number Theoretic Functions, Prev: Integer Exponentiation, Up: Integer Functions
+
+5.8 Root Extraction Functions
+=============================
+
+ -- Function: int mpz_root (mpz_t ROP, const mpz_t OP, unsigned long int
+ N)
+ Set ROP to the truncated integer part of the Nth root of OP.
+ Return non-zero if the computation was exact, i.e., if OP is ROP to
+ the Nth power.
+
+ -- Function: void mpz_rootrem (mpz_t ROOT, mpz_t REM, const mpz_t U,
+ unsigned long int N)
+ Set ROOT to the truncated integer part of the Nth root of U. Set
+ REM to the remainder, U-ROOT**N.
+
+ -- Function: void mpz_sqrt (mpz_t ROP, const mpz_t OP)
+ Set ROP to the truncated integer part of the square root of OP.
+
+ -- Function: void mpz_sqrtrem (mpz_t ROP1, mpz_t ROP2, const mpz_t OP)
+ Set ROP1 to the truncated integer part of the square root of OP,
+ like 'mpz_sqrt'. Set ROP2 to the remainder OP-ROP1*ROP1, which
+ will be zero if OP is a perfect square.
+
+ If ROP1 and ROP2 are the same variable, the results are undefined.
+
+ -- Function: int mpz_perfect_power_p (const mpz_t OP)
+ Return non-zero if OP is a perfect power, i.e., if there exist
+ integers A and B, with B>1, such that OP equals A raised to the
+ power B.
+
+ Under this definition both 0 and 1 are considered to be perfect
+ powers. Negative values of OP are accepted, but of course can only
+ be odd perfect powers.
+
+ -- Function: int mpz_perfect_square_p (const mpz_t OP)
+ Return non-zero if OP is a perfect square, i.e., if the square root
+ of OP is an integer. Under this definition both 0 and 1 are
+ considered to be perfect squares.
+
+\1f
+File: gmp.info, Node: Number Theoretic Functions, Next: Integer Comparisons, Prev: Integer Roots, Up: Integer Functions
+
+5.9 Number Theoretic Functions
+==============================
+
+ -- Function: int mpz_probab_prime_p (const mpz_t N, int REPS)
+ Determine whether N is prime. Return 2 if N is definitely prime,
+ return 1 if N is probably prime (without being certain), or return
+ 0 if N is definitely non-prime.
+
+ This function performs some trial divisions, a Baillie-PSW probable
+ prime test, then REPS-24 Miller-Rabin probabilistic primality
+ tests. A higher REPS value will reduce the chances of a non-prime
+ being identified as "probably prime". A composite number will be
+ identified as a prime with an asymptotic probability of less than
+ 4^(-REPS). Reasonable values of REPS are between 15 and 50.
+
+ GMP versions up to and including 6.1.2 did not use the Baillie-PSW
+ primality test. In those older versions of GMP, this function
+ performed REPS Miller-Rabin tests.
+
+ -- Function: void mpz_nextprime (mpz_t ROP, const mpz_t OP)
+ Set ROP to the next prime greater than OP.
+
+ -- Function: int mpz_prevprime (mpz_t ROP, const mpz_t OP)
+ Set ROP to the greatest prime less than OP.
+
+ If a previous prime doesn't exist (i.e. OP < 3), rop is unchanged
+ and 0 is returned.
+
+ Return 1 if ROP is a probably prime, and 2 if ROP is definitely
+ prime.
+
+ These functions use a probabilistic algorithm to identify primes.
+ For practical purposes it's adequate, the chance of a composite
+ passing will be extremely small.
+
+ -- Function: void mpz_gcd (mpz_t ROP, const mpz_t OP1, const mpz_t OP2)
+ Set ROP to the greatest common divisor of OP1 and OP2. The result
+ is always positive even if one or both input operands are negative.
+ Except if both inputs are zero; then this function defines gcd(0,0)
+ = 0.
+
+ -- Function: unsigned long int mpz_gcd_ui (mpz_t ROP, const mpz_t OP1,
+ unsigned long int OP2)
+ Compute the greatest common divisor of OP1 and OP2. If ROP is not
+ 'NULL', store the result there.
+
+ If the result is small enough to fit in an 'unsigned long int', it
+ is returned. If the result does not fit, 0 is returned, and the
+ result is equal to the argument OP1. Note that the result will
+ always fit if OP2 is non-zero.
+
+ -- Function: void mpz_gcdext (mpz_t G, mpz_t S, mpz_t T, const mpz_t A,
+ const mpz_t B)
+ Set G to the greatest common divisor of A and B, and in addition
+ set S and T to coefficients satisfying A*S + B*T = G. The value in
+ G is always positive, even if one or both of A and B are negative
+ (or zero if both inputs are zero). The values in S and T are
+ chosen such that normally, abs(S) < abs(B) / (2 G) and abs(T) <
+ abs(A) / (2 G), and these relations define S and T uniquely. There
+ are a few exceptional cases:
+
+ If abs(A) = abs(B), then S = 0, T = sgn(B).
+
+ Otherwise, S = sgn(A) if B = 0 or abs(B) = 2 G, and T = sgn(B) if A
+ = 0 or abs(A) = 2 G.
+
+ In all cases, S = 0 if and only if G = abs(B), i.e., if B divides A
+ or A = B = 0.
+
+ If T or G is 'NULL' then that value is not computed.
+
+ -- Function: void mpz_lcm (mpz_t ROP, const mpz_t OP1, const mpz_t OP2)
+ -- Function: void mpz_lcm_ui (mpz_t ROP, const mpz_t OP1, unsigned long
+ OP2)
+ Set ROP to the least common multiple of OP1 and OP2. ROP is always
+ positive, irrespective of the signs of OP1 and OP2. ROP will be
+ zero if either OP1 or OP2 is zero.
+
+ -- Function: int mpz_invert (mpz_t ROP, const mpz_t OP1, const mpz_t
+ OP2)
+ Compute the inverse of OP1 modulo OP2 and put the result in ROP.
+ If the inverse exists, the return value is non-zero and ROP will
+ satisfy 0 <= ROP < abs(OP2) (with ROP = 0 possible only when
+ abs(OP2) = 1, i.e., in the somewhat degenerate zero ring). If an
+ inverse doesn't exist the return value is zero and ROP is
+ undefined. The behaviour of this function is undefined when OP2 is
+ zero.
+
+ -- Function: int mpz_jacobi (const mpz_t A, const mpz_t B)
+ Calculate the Jacobi symbol (A/B). This is defined only for B odd.
+
+ -- Function: int mpz_legendre (const mpz_t A, const mpz_t P)
+ Calculate the Legendre symbol (A/P). This is defined only for P an
+ odd positive prime, and for such P it's identical to the Jacobi
+ symbol.
+
+ -- Function: int mpz_kronecker (const mpz_t A, const mpz_t B)
+ -- Function: int mpz_kronecker_si (const mpz_t A, long B)
+ -- Function: int mpz_kronecker_ui (const mpz_t A, unsigned long B)
+ -- Function: int mpz_si_kronecker (long A, const mpz_t B)
+ -- Function: int mpz_ui_kronecker (unsigned long A, const mpz_t B)
+ Calculate the Jacobi symbol (A/B) with the Kronecker extension
+ (a/2)=(2/a) when a odd, or (a/2)=0 when a even.
+
+ When B is odd the Jacobi symbol and Kronecker symbol are identical,
+ so 'mpz_kronecker_ui' etc can be used for mixed precision Jacobi
+ symbols too.
+
+ For more information see Henri Cohen section 1.4.2 (*note
+ References::), or any number theory textbook. See also the example
+ program 'demos/qcn.c' which uses 'mpz_kronecker_ui'.
+
+ -- Function: mp_bitcnt_t mpz_remove (mpz_t ROP, const mpz_t OP, const
+ mpz_t F)
+ Remove all occurrences of the factor F from OP and store the result
+ in ROP. The return value is how many such occurrences were
+ removed.
+
+ -- Function: void mpz_fac_ui (mpz_t ROP, unsigned long int N)
+ -- Function: void mpz_2fac_ui (mpz_t ROP, unsigned long int N)
+ -- Function: void mpz_mfac_uiui (mpz_t ROP, unsigned long int N,
+ unsigned long int M)
+ Set ROP to the factorial of N: 'mpz_fac_ui' computes the plain
+ factorial N!, 'mpz_2fac_ui' computes the double-factorial N!!, and
+ 'mpz_mfac_uiui' the M-multi-factorial N!^(M).
+
+ -- Function: void mpz_primorial_ui (mpz_t ROP, unsigned long int N)
+ Set ROP to the primorial of N, i.e. the product of all positive
+ prime numbers <=N.
+
+ -- Function: void mpz_bin_ui (mpz_t ROP, const mpz_t N, unsigned long
+ int K)
+ -- Function: void mpz_bin_uiui (mpz_t ROP, unsigned long int N,
+ unsigned long int K)
+ Compute the binomial coefficient N over K and store the result in
+ ROP. Negative values of N are supported by 'mpz_bin_ui', using the
+ identity bin(-n,k) = (-1)^k * bin(n+k-1,k), see Knuth volume 1
+ section 1.2.6 part G.
+
+ -- Function: void mpz_fib_ui (mpz_t FN, unsigned long int N)
+ -- Function: void mpz_fib2_ui (mpz_t FN, mpz_t FNSUB1, unsigned long
+ int N)
+ 'mpz_fib_ui' sets FN to F[n], the Nth Fibonacci number.
+ 'mpz_fib2_ui' sets FN to F[n], and FNSUB1 to F[n-1].
+
+ These functions are designed for calculating isolated Fibonacci
+ numbers. When a sequence of values is wanted it's best to start
+ with 'mpz_fib2_ui' and iterate the defining F[n+1]=F[n]+F[n-1] or
+ similar.
+
+ -- Function: void mpz_lucnum_ui (mpz_t LN, unsigned long int N)
+ -- Function: void mpz_lucnum2_ui (mpz_t LN, mpz_t LNSUB1, unsigned long
+ int N)
+ 'mpz_lucnum_ui' sets LN to L[n], the Nth Lucas number.
+ 'mpz_lucnum2_ui' sets LN to L[n], and LNSUB1 to L[n-1].
+
+ These functions are designed for calculating isolated Lucas
+ numbers. When a sequence of values is wanted it's best to start
+ with 'mpz_lucnum2_ui' and iterate the defining L[n+1]=L[n]+L[n-1]
+ or similar.
+
+ The Fibonacci numbers and Lucas numbers are related sequences, so
+ it's never necessary to call both 'mpz_fib2_ui' and
+ 'mpz_lucnum2_ui'. The formulas for going from Fibonacci to Lucas
+ can be found in *note Lucas Numbers Algorithm::, the reverse is
+ straightforward too.
+
+\1f
+File: gmp.info, Node: Integer Comparisons, Next: Integer Logic and Bit Fiddling, Prev: Number Theoretic Functions, Up: Integer Functions
+
+5.10 Comparison Functions
+=========================
+
+ -- Function: int mpz_cmp (const mpz_t OP1, const mpz_t OP2)
+ -- Function: int mpz_cmp_d (const mpz_t OP1, double OP2)
+ -- Macro: int mpz_cmp_si (const mpz_t OP1, signed long int OP2)
+ -- Macro: int mpz_cmp_ui (const mpz_t OP1, unsigned long int OP2)
+ Compare OP1 and OP2. Return a positive value if OP1 > OP2, zero if
+ OP1 = OP2, or a negative value if OP1 < OP2.
+
+ 'mpz_cmp_ui' and 'mpz_cmp_si' are macros and will evaluate their
+ arguments more than once. 'mpz_cmp_d' can be called with an
+ infinity, but results are undefined for a NaN.
+
+ -- Function: int mpz_cmpabs (const mpz_t OP1, const mpz_t OP2)
+ -- Function: int mpz_cmpabs_d (const mpz_t OP1, double OP2)
+ -- Function: int mpz_cmpabs_ui (const mpz_t OP1, unsigned long int OP2)
+ Compare the absolute values of OP1 and OP2. Return a positive
+ value if abs(OP1) > abs(OP2), zero if abs(OP1) = abs(OP2), or a
+ negative value if abs(OP1) < abs(OP2).
+
+ 'mpz_cmpabs_d' can be called with an infinity, but results are
+ undefined for a NaN.
+
+ -- Macro: int mpz_sgn (const mpz_t OP)
+ Return +1 if OP > 0, 0 if OP = 0, and -1 if OP < 0.
+
+ This function is actually implemented as a macro. It evaluates its
+ argument multiple times.
+
+\1f
+File: gmp.info, Node: Integer Logic and Bit Fiddling, Next: I/O of Integers, Prev: Integer Comparisons, Up: Integer Functions
+
+5.11 Logical and Bit Manipulation Functions
+===========================================
+
+These functions behave as if two's complement arithmetic were used
+(although sign-magnitude is the actual implementation). The least
+significant bit is number 0.
+
+ -- Function: void mpz_and (mpz_t ROP, const mpz_t OP1, const mpz_t OP2)
+ Set ROP to OP1 bitwise-and OP2.
+
+ -- Function: void mpz_ior (mpz_t ROP, const mpz_t OP1, const mpz_t OP2)
+ Set ROP to OP1 bitwise inclusive-or OP2.
+
+ -- Function: void mpz_xor (mpz_t ROP, const mpz_t OP1, const mpz_t OP2)
+ Set ROP to OP1 bitwise exclusive-or OP2.
+
+ -- Function: void mpz_com (mpz_t ROP, const mpz_t OP)
+ Set ROP to the one's complement of OP.
+
+ -- Function: mp_bitcnt_t mpz_popcount (const mpz_t OP)
+ If OP>=0, return the population count of OP, which is the number of
+ 1 bits in the binary representation. If OP<0, the number of 1s is
+ infinite, and the return value is the largest possible
+ 'mp_bitcnt_t'.
+
+ -- Function: mp_bitcnt_t mpz_hamdist (const mpz_t OP1, const mpz_t OP2)
+ If OP1 and OP2 are both >=0 or both <0, return the hamming distance
+ between the two operands, which is the number of bit positions
+ where OP1 and OP2 have different bit values. If one operand is >=0
+ and the other <0 then the number of bits different is infinite, and
+ the return value is the largest possible 'mp_bitcnt_t'.
+
+ -- Function: mp_bitcnt_t mpz_scan0 (const mpz_t OP, mp_bitcnt_t
+ STARTING_BIT)
+ -- Function: mp_bitcnt_t mpz_scan1 (const mpz_t OP, mp_bitcnt_t
+ STARTING_BIT)
+ Scan OP, starting from bit STARTING_BIT, towards more significant
+ bits, until the first 0 or 1 bit (respectively) is found. Return
+ the index of the found bit.
+
+ If the bit at STARTING_BIT is already what's sought, then
+ STARTING_BIT is returned.
+
+ If there's no bit found, then the largest possible 'mp_bitcnt_t' is
+ returned. This will happen in 'mpz_scan0' past the end of a
+ negative number, or 'mpz_scan1' past the end of a nonnegative
+ number.
+
+ -- Function: void mpz_setbit (mpz_t ROP, mp_bitcnt_t BIT_INDEX)
+ Set bit BIT_INDEX in ROP.
+
+ -- Function: void mpz_clrbit (mpz_t ROP, mp_bitcnt_t BIT_INDEX)
+ Clear bit BIT_INDEX in ROP.
+
+ -- Function: void mpz_combit (mpz_t ROP, mp_bitcnt_t BIT_INDEX)
+ Complement bit BIT_INDEX in ROP.
+
+ -- Function: int mpz_tstbit (const mpz_t OP, mp_bitcnt_t BIT_INDEX)
+ Test bit BIT_INDEX in OP and return 0 or 1 accordingly.
+
+ Shifting is also possible using multiplication (*note Integer
+Arithmetic::) and division (*note Integer Division::), in particular the
+'2exp' functions.
+
+\1f
+File: gmp.info, Node: I/O of Integers, Next: Integer Random Numbers, Prev: Integer Logic and Bit Fiddling, Up: Integer Functions
+
+5.12 Input and Output Functions
+===============================
+
+Functions that perform input from a stdio stream, and functions that
+output to a stdio stream, of 'mpz' numbers. Passing a 'NULL' pointer
+for a STREAM argument to any of these functions will make them read from
+'stdin' and write to 'stdout', respectively.
+
+ When using any of these functions, it is a good idea to include
+'stdio.h' before 'gmp.h', since that will allow 'gmp.h' to define
+prototypes for these functions.
+
+ See also *note Formatted Output:: and *note Formatted Input::.
+
+ -- Function: size_t mpz_out_str (FILE *STREAM, int BASE, const mpz_t
+ OP)
+ Output OP on stdio stream STREAM, as a string of digits in base
+ BASE. The base argument may vary from 2 to 62 or from -2 to -36.
+
+ For BASE in the range 2..36, digits and lower-case letters are
+ used; for -2..-36, digits and upper-case letters are used; for
+ 37..62, digits, upper-case letters, and lower-case letters (in that
+ significance order) are used.
+
+ Return the number of bytes written, or if an error occurred, return
+ 0.
+
+ -- Function: size_t mpz_inp_str (mpz_t ROP, FILE *STREAM, int BASE)
+ Input a possibly white-space preceded string in base BASE from
+ stdio stream STREAM, and put the read integer in ROP.
+
+ The BASE may vary from 2 to 62, or if BASE is 0, then the leading
+ characters are used: '0x' and '0X' for hexadecimal, '0b' and '0B'
+ for binary, '0' for octal, or decimal otherwise.
+
+ For bases up to 36, case is ignored; upper-case and lower-case
+ letters have the same value. For bases 37 to 62, upper-case
+ letters represent the usual 10..35 while lower-case letters
+ represent 36..61.
+
+ Return the number of bytes read, or if an error occurred, return 0.
+
+ -- Function: size_t mpz_out_raw (FILE *STREAM, const mpz_t OP)
+ Output OP on stdio stream STREAM, in raw binary format. The
+ integer is written in a portable format, with 4 bytes of size
+ information, and that many bytes of limbs. Both the size and the
+ limbs are written in decreasing significance order (i.e., in
+ big-endian).
+
+ The output can be read with 'mpz_inp_raw'.
+
+ Return the number of bytes written, or if an error occurred, return
+ 0.
+
+ The output of this can not be read by 'mpz_inp_raw' from GMP 1,
+ because of changes necessary for compatibility between 32-bit and
+ 64-bit machines.
+
+ -- Function: size_t mpz_inp_raw (mpz_t ROP, FILE *STREAM)
+ Input from stdio stream STREAM in the format written by
+ 'mpz_out_raw', and put the result in ROP. Return the number of
+ bytes read, or if an error occurred, return 0.
+
+ This routine can read the output from 'mpz_out_raw' also from GMP
+ 1, in spite of changes necessary for compatibility between 32-bit
+ and 64-bit machines.
+
+\1f
+File: gmp.info, Node: Integer Random Numbers, Next: Integer Import and Export, Prev: I/O of Integers, Up: Integer Functions
+
+5.13 Random Number Functions
+============================
+
+The random number functions of GMP come in two groups; older functions
+that rely on a global state, and newer functions that accept a state
+parameter that is read and modified. Please see the *note Random Number
+Functions:: for more information on how to use and not to use random
+number functions.
+
+ -- Function: void mpz_urandomb (mpz_t ROP, gmp_randstate_t STATE,
+ mp_bitcnt_t N)
+ Generate a uniformly distributed random integer in the range 0 to
+ 2^N-1, inclusive.
+
+ The variable STATE must be initialized by calling one of the
+ 'gmp_randinit' functions (*note Random State Initialization::)
+ before invoking this function.
+
+ -- Function: void mpz_urandomm (mpz_t ROP, gmp_randstate_t STATE, const
+ mpz_t N)
+ Generate a uniform random integer in the range 0 to N-1, inclusive.
+
+ The variable STATE must be initialized by calling one of the
+ 'gmp_randinit' functions (*note Random State Initialization::)
+ before invoking this function.
+
+ -- Function: void mpz_rrandomb (mpz_t ROP, gmp_randstate_t STATE,
+ mp_bitcnt_t N)
+ Generate a random integer with long strings of zeros and ones in
+ the binary representation. Useful for testing functions and
+ algorithms, since this kind of random numbers have proven to be
+ more likely to trigger corner-case bugs. The random number will be
+ in the range 2^(N-1) to 2^N-1, inclusive.
+
+ The variable STATE must be initialized by calling one of the
+ 'gmp_randinit' functions (*note Random State Initialization::)
+ before invoking this function.
+
+ -- Function: void mpz_random (mpz_t ROP, mp_size_t MAX_SIZE)
+ Generate a random integer of at most MAX_SIZE limbs. The generated
+ random number doesn't satisfy any particular requirements of
+ randomness. Negative random numbers are generated when MAX_SIZE is
+ negative.
+
+ This function is obsolete. Use 'mpz_urandomb' or 'mpz_urandomm'
+ instead.
+
+ -- Function: void mpz_random2 (mpz_t ROP, mp_size_t MAX_SIZE)
+ Generate a random integer of at most MAX_SIZE limbs, with long
+ strings of zeros and ones in the binary representation. Useful for
+ testing functions and algorithms, since this kind of random numbers
+ have proven to be more likely to trigger corner-case bugs.
+ Negative random numbers are generated when MAX_SIZE is negative.
+
+ This function is obsolete. Use 'mpz_rrandomb' instead.
+
+\1f
+File: gmp.info, Node: Integer Import and Export, Next: Miscellaneous Integer Functions, Prev: Integer Random Numbers, Up: Integer Functions
+
+5.14 Integer Import and Export
+==============================
+
+'mpz_t' variables can be converted to and from arbitrary words of binary
+data with the following functions.
+
+ -- Function: void mpz_import (mpz_t ROP, size_t COUNT, int ORDER,
+ size_t SIZE, int ENDIAN, size_t NAILS, const void *OP)
+ Set ROP from an array of word data at OP.
+
+ The parameters specify the format of the data. COUNT many words
+ are read, each SIZE bytes. ORDER can be 1 for most significant
+ word first or -1 for least significant first. Within each word
+ ENDIAN can be 1 for most significant byte first, -1 for least
+ significant first, or 0 for the native endianness of the host CPU.
+ The most significant NAILS bits of each word are skipped, this can
+ be 0 to use the full words.
+
+ There is no sign taken from the data, ROP will simply be a positive
+ integer. An application can handle any sign itself, and apply it
+ for instance with 'mpz_neg'.
+
+ There are no data alignment restrictions on OP, any address is
+ allowed.
+
+ Here's an example converting an array of 'unsigned long' data, most
+ significant element first, and host byte order within each value.
+
+ unsigned long a[20];
+ /* Initialize Z and A */
+ mpz_import (z, 20, 1, sizeof(a[0]), 0, 0, a);
+
+ This example assumes the full 'sizeof' bytes are used for data in
+ the given type, which is usually true, and certainly true for
+ 'unsigned long' everywhere we know of. However on Cray vector
+ systems it may be noted that 'short' and 'int' are always stored in
+ 8 bytes (and with 'sizeof' indicating that) but use only 32 or 46
+ bits. The NAILS feature can account for this, by passing for
+ instance '8*sizeof(int)-INT_BIT'.
+
+ -- Function: void * mpz_export (void *ROP, size_t *COUNTP, int ORDER,
+ size_t SIZE, int ENDIAN, size_t NAILS, const mpz_t OP)
+ Fill ROP with word data from OP.
+
+ The parameters specify the format of the data produced. Each word
+ will be SIZE bytes and ORDER can be 1 for most significant word
+ first or -1 for least significant first. Within each word ENDIAN
+ can be 1 for most significant byte first, -1 for least significant
+ first, or 0 for the native endianness of the host CPU. The most
+ significant NAILS bits of each word are unused and set to zero,
+ this can be 0 to produce full words.
+
+ The number of words produced is written to '*COUNTP', or COUNTP can
+ be 'NULL' to discard the count. ROP must have enough space for the
+ data, or if ROP is 'NULL' then a result array of the necessary size
+ is allocated using the current GMP allocation function (*note
+ Custom Allocation::). In either case the return value is the
+ destination used, either ROP or the allocated block.
+
+ If OP is non-zero then the most significant word produced will be
+ non-zero. If OP is zero then the count returned will be zero and
+ nothing written to ROP. If ROP is 'NULL' in this case, no block is
+ allocated, just 'NULL' is returned.
+
+ The sign of OP is ignored, just the absolute value is exported. An
+ application can use 'mpz_sgn' to get the sign and handle it as
+ desired. (*note Integer Comparisons::)
+
+ There are no data alignment restrictions on ROP, any address is
+ allowed.
+
+ When an application is allocating space itself the required size
+ can be determined with a calculation like the following. Since
+ 'mpz_sizeinbase' always returns at least 1, 'count' here will be at
+ least one, which avoids any portability problems with 'malloc(0)',
+ though if 'z' is zero no space at all is actually needed (or
+ written).
+
+ numb = 8*size - nail;
+ count = (mpz_sizeinbase (z, 2) + numb-1) / numb;
+ p = malloc (count * size);
+
+\1f
+File: gmp.info, Node: Miscellaneous Integer Functions, Next: Integer Special Functions, Prev: Integer Import and Export, Up: Integer Functions
+
+5.15 Miscellaneous Functions
+============================
+
+ -- Function: int mpz_fits_ulong_p (const mpz_t OP)
+ -- Function: int mpz_fits_slong_p (const mpz_t OP)
+ -- Function: int mpz_fits_uint_p (const mpz_t OP)
+ -- Function: int mpz_fits_sint_p (const mpz_t OP)
+ -- Function: int mpz_fits_ushort_p (const mpz_t OP)
+ -- Function: int mpz_fits_sshort_p (const mpz_t OP)
+ Return non-zero iff the value of OP fits in an 'unsigned long int',
+ 'signed long int', 'unsigned int', 'signed int', 'unsigned short
+ int', or 'signed short int', respectively. Otherwise, return zero.
+
+ -- Macro: int mpz_odd_p (const mpz_t OP)
+ -- Macro: int mpz_even_p (const mpz_t OP)
+ Determine whether OP is odd or even, respectively. Return non-zero
+ if yes, zero if no. These macros evaluate their argument more than
+ once.
+
+ -- Function: size_t mpz_sizeinbase (const mpz_t OP, int BASE)
+ Return the size of OP measured in number of digits in the given
+ BASE. BASE can vary from 2 to 62. The sign of OP is ignored, just
+ the absolute value is used. The result will be either exact or 1
+ too big. If BASE is a power of 2, the result is always exact. If
+ OP is zero the return value is always 1.
+
+ This function can be used to determine the space required when
+ converting OP to a string. The right amount of allocation is
+ normally two more than the value returned by 'mpz_sizeinbase', one
+ extra for a minus sign and one for the null-terminator.
+
+ It will be noted that 'mpz_sizeinbase(OP,2)' can be used to locate
+ the most significant 1 bit in OP, counting from 1. (Unlike the
+ bitwise functions which start from 0, *Note Logical and Bit
+ Manipulation Functions: Integer Logic and Bit Fiddling.)
+
+\1f
+File: gmp.info, Node: Integer Special Functions, Prev: Miscellaneous Integer Functions, Up: Integer Functions
+
+5.16 Special Functions
+======================
+
+The functions in this section are for various special purposes. Most
+applications will not need them.
+
+ -- Function: void mpz_array_init (mpz_t INTEGER_ARRAY, mp_size_t
+ ARRAY_SIZE, mp_size_t FIXED_NUM_BITS)
+ *This is an obsolete function. Do not use it.*
+
+ -- Function: void * _mpz_realloc (mpz_t INTEGER, mp_size_t NEW_ALLOC)
+ Change the space for INTEGER to NEW_ALLOC limbs. The value in
+ INTEGER is preserved if it fits, or is set to 0 if not. The return
+ value is not useful to applications and should be ignored.
+
+ 'mpz_realloc2' is the preferred way to accomplish allocation
+ changes like this. 'mpz_realloc2' and '_mpz_realloc' are the same
+ except that '_mpz_realloc' takes its size in limbs.
+
+ -- Function: mp_limb_t mpz_getlimbn (const mpz_t OP, mp_size_t N)
+ Return limb number N from OP. The sign of OP is ignored, just the
+ absolute value is used. The least significant limb is number 0.
+
+ 'mpz_size' can be used to find how many limbs make up OP.
+ 'mpz_getlimbn' returns zero if N is outside the range 0 to
+ 'mpz_size(OP)-1'.
+
+ -- Function: size_t mpz_size (const mpz_t OP)
+ Return the size of OP measured in number of limbs. If OP is zero,
+ the returned value will be zero.
+
+ -- Function: const mp_limb_t * mpz_limbs_read (const mpz_t X)
+ Return a pointer to the limb array representing the absolute value
+ of X. The size of the array is 'mpz_size(X)'. Intended for read
+ access only.
+
+ -- Function: mp_limb_t * mpz_limbs_write (mpz_t X, mp_size_t N)
+ -- Function: mp_limb_t * mpz_limbs_modify (mpz_t X, mp_size_t N)
+ Return a pointer to the limb array, intended for write access. The
+ array is reallocated as needed, to make room for N limbs. Requires
+ N > 0. The 'mpz_limbs_modify' function returns an array that holds
+ the old absolute value of X, while 'mpz_limbs_write' may destroy
+ the old value and return an array with unspecified contents.
+
+ -- Function: void mpz_limbs_finish (mpz_t X, mp_size_t S)
+ Updates the internal size field of X. Used after writing to the
+ limb array pointer returned by 'mpz_limbs_write' or
+ 'mpz_limbs_modify' is completed. The array should contain abs(S)
+ valid limbs, representing the new absolute value for X, and the
+ sign of X is taken from the sign of S. This function never
+ reallocates X, so the limb pointer remains valid.
+
+ void foo (mpz_t x)
+ {
+ mp_size_t n, i;
+ mp_limb_t *xp;
+
+ n = mpz_size (x);
+ xp = mpz_limbs_modify (x, 2*n);
+ for (i = 0; i < n; i++)
+ xp[n+i] = xp[n-1-i];
+ mpz_limbs_finish (x, mpz_sgn (x) < 0 ? - 2*n : 2*n);
+ }
+
+ -- Function: mpz_srcptr mpz_roinit_n (mpz_t X, const mp_limb_t *XP,
+ mp_size_t XS)
+ Special initialization of X, using the given limb array and size.
+ X should be treated as read-only: it can be passed safely as input
+ to any mpz function, but not as an output. The array XP must point
+ to at least a readable limb, its size is abs(XS), and the sign of X
+ is the sign of XS. For convenience, the function returns X, but
+ cast to a const pointer type.
+
+ void foo (mpz_t x)
+ {
+ static const mp_limb_t y[3] = { 0x1, 0x2, 0x3 };
+ mpz_t tmp;
+ mpz_add (x, x, mpz_roinit_n (tmp, y, 3));
+ }
+
+ -- Macro: mpz_t MPZ_ROINIT_N (mp_limb_t *XP, mp_size_t XS)
+ This macro expands to an initializer which can be assigned to an
+ mpz_t variable. The limb array XP must point to at least a
+ readable limb, moreover, unlike the 'mpz_roinit_n' function, the
+ array must be normalized: if XS is non-zero, then 'XP[abs(XS)-1]'
+ must be non-zero. Intended primarily for constant values. Using
+ it for non-constant values requires a C compiler supporting C99.
+
+ void foo (mpz_t x)
+ {
+ static const mp_limb_t ya[3] = { 0x1, 0x2, 0x3 };
+ static const mpz_t y = MPZ_ROINIT_N ((mp_limb_t *) ya, 3);
+
+ mpz_add (x, x, y);
+ }
+
+\1f
+File: gmp.info, Node: Rational Number Functions, Next: Floating-point Functions, Prev: Integer Functions, Up: Top
+
+6 Rational Number Functions
+***************************
+
+This chapter describes the GMP functions for performing arithmetic on
+rational numbers. These functions start with the prefix 'mpq_'.
+
+ Rational numbers are stored in objects of type 'mpq_t'.
+
+ All rational arithmetic functions assume operands have a canonical
+form, and canonicalize their result. The canonical form means that the
+denominator and the numerator have no common factors, and that the
+denominator is positive. Zero has the unique representation 0/1.
+
+ Pure assignment functions do not canonicalize the assigned variable.
+It is the responsibility of the user to canonicalize the assigned
+variable before any arithmetic operations are performed on that
+variable.
+
+ -- Function: void mpq_canonicalize (mpq_t OP)
+ Remove any factors that are common to the numerator and denominator
+ of OP, and make the denominator positive.
+
+* Menu:
+
+* Initializing Rationals::
+* Rational Conversions::
+* Rational Arithmetic::
+* Comparing Rationals::
+* Applying Integer Functions::
+* I/O of Rationals::
+
+\1f
+File: gmp.info, Node: Initializing Rationals, Next: Rational Conversions, Prev: Rational Number Functions, Up: Rational Number Functions
+
+6.1 Initialization and Assignment Functions
+===========================================
+
+ -- Function: void mpq_init (mpq_t X)
+ Initialize X and set it to 0/1. Each variable should normally only
+ be initialized once, or at least cleared out (using the function
+ 'mpq_clear') between each initialization.
+
+ -- Function: void mpq_inits (mpq_t X, ...)
+ Initialize a NULL-terminated list of 'mpq_t' variables, and set
+ their values to 0/1.
+
+ -- Function: void mpq_clear (mpq_t X)
+ Free the space occupied by X. Make sure to call this function for
+ all 'mpq_t' variables when you are done with them.
+
+ -- Function: void mpq_clears (mpq_t X, ...)
+ Free the space occupied by a NULL-terminated list of 'mpq_t'
+ variables.
+
+ -- Function: void mpq_set (mpq_t ROP, const mpq_t OP)
+ -- Function: void mpq_set_z (mpq_t ROP, const mpz_t OP)
+ Assign ROP from OP.
+
+ -- Function: void mpq_set_ui (mpq_t ROP, unsigned long int OP1,
+ unsigned long int OP2)
+ -- Function: void mpq_set_si (mpq_t ROP, signed long int OP1, unsigned
+ long int OP2)
+ Set the value of ROP to OP1/OP2. Note that if OP1 and OP2 have
+ common factors, ROP has to be passed to 'mpq_canonicalize' before
+ any operations are performed on ROP.
+
+ -- Function: int mpq_set_str (mpq_t ROP, const char *STR, int BASE)
+ Set ROP from a null-terminated string STR in the given BASE.
+
+ The string can be an integer like "41" or a fraction like "41/152".
+ The fraction must be in canonical form (*note Rational Number
+ Functions::), or if not then 'mpq_canonicalize' must be called.
+
+ The numerator and optional denominator are parsed the same as in
+ 'mpz_set_str' (*note Assigning Integers::). White space is allowed
+ in the string, and is simply ignored. The BASE can vary from 2 to
+ 62, or if BASE is 0 then the leading characters are used: '0x' or
+ '0X' for hex, '0b' or '0B' for binary, '0' for octal, or decimal
+ otherwise. Note that this is done separately for the numerator and
+ denominator, so for instance '0xEF/100' is 239/100, whereas
+ '0xEF/0x100' is 239/256.
+
+ The return value is 0 if the entire string is a valid number, or -1
+ if not.
+
+ -- Function: void mpq_swap (mpq_t ROP1, mpq_t ROP2)
+ Swap the values ROP1 and ROP2 efficiently.
+
+\1f
+File: gmp.info, Node: Rational Conversions, Next: Rational Arithmetic, Prev: Initializing Rationals, Up: Rational Number Functions
+
+6.2 Conversion Functions
+========================
+
+ -- Function: double mpq_get_d (const mpq_t OP)
+ Convert OP to a 'double', truncating if necessary (i.e. rounding
+ towards zero).
+
+ If the exponent from the conversion is too big or too small to fit
+ a 'double' then the result is system dependent. For too big an
+ infinity is returned when available. For too small 0.0 is normally
+ returned. Hardware overflow, underflow and denorm traps may or may
+ not occur.
+
+ -- Function: void mpq_set_d (mpq_t ROP, double OP)
+ -- Function: void mpq_set_f (mpq_t ROP, const mpf_t OP)
+ Set ROP to the value of OP. There is no rounding, this conversion
+ is exact.
+
+ -- Function: char * mpq_get_str (char *STR, int BASE, const mpq_t OP)
+ Convert OP to a string of digits in base BASE. The base argument
+ may vary from 2 to 62 or from -2 to -36. The string will be of the
+ form 'num/den', or if the denominator is 1 then just 'num'.
+
+ For BASE in the range 2..36, digits and lower-case letters are
+ used; for -2..-36, digits and upper-case letters are used; for
+ 37..62, digits, upper-case letters, and lower-case letters (in that
+ significance order) are used.
+
+ If STR is 'NULL', the result string is allocated using the current
+ allocation function (*note Custom Allocation::). The block will be
+ 'strlen(str)+1' bytes, that being exactly enough for the string and
+ null-terminator.
+
+ If STR is not 'NULL', it should point to a block of storage large
+ enough for the result, that being
+
+ mpz_sizeinbase (mpq_numref(OP), BASE)
+ + mpz_sizeinbase (mpq_denref(OP), BASE) + 3
+
+ The three extra bytes are for a possible minus sign, possible
+ slash, and the null-terminator.
+
+ A pointer to the result string is returned, being either the
+ allocated block, or the given STR.
+
+\1f
+File: gmp.info, Node: Rational Arithmetic, Next: Comparing Rationals, Prev: Rational Conversions, Up: Rational Number Functions
+
+6.3 Arithmetic Functions
+========================
+
+ -- Function: void mpq_add (mpq_t SUM, const mpq_t ADDEND1, const mpq_t
+ ADDEND2)
+ Set SUM to ADDEND1 + ADDEND2.
+
+ -- Function: void mpq_sub (mpq_t DIFFERENCE, const mpq_t MINUEND, const
+ mpq_t SUBTRAHEND)
+ Set DIFFERENCE to MINUEND - SUBTRAHEND.
+
+ -- Function: void mpq_mul (mpq_t PRODUCT, const mpq_t MULTIPLIER, const
+ mpq_t MULTIPLICAND)
+ Set PRODUCT to MULTIPLIER times MULTIPLICAND.
+
+ -- Function: void mpq_mul_2exp (mpq_t ROP, const mpq_t OP1, mp_bitcnt_t
+ OP2)
+ Set ROP to OP1 times 2 raised to OP2.
+
+ -- Function: void mpq_div (mpq_t QUOTIENT, const mpq_t DIVIDEND, const
+ mpq_t DIVISOR)
+ Set QUOTIENT to DIVIDEND/DIVISOR.
+
+ -- Function: void mpq_div_2exp (mpq_t ROP, const mpq_t OP1, mp_bitcnt_t
+ OP2)
+ Set ROP to OP1 divided by 2 raised to OP2.
+
+ -- Function: void mpq_neg (mpq_t NEGATED_OPERAND, const mpq_t OPERAND)
+ Set NEGATED_OPERAND to -OPERAND.
+
+ -- Function: void mpq_abs (mpq_t ROP, const mpq_t OP)
+ Set ROP to the absolute value of OP.
+
+ -- Function: void mpq_inv (mpq_t INVERTED_NUMBER, const mpq_t NUMBER)
+ Set INVERTED_NUMBER to 1/NUMBER. If the new denominator is zero,
+ this routine will divide by zero.
+
+\1f
+File: gmp.info, Node: Comparing Rationals, Next: Applying Integer Functions, Prev: Rational Arithmetic, Up: Rational Number Functions
+
+6.4 Comparison Functions
+========================
+
+ -- Function: int mpq_cmp (const mpq_t OP1, const mpq_t OP2)
+ -- Function: int mpq_cmp_z (const mpq_t OP1, const mpz_t OP2)
+ Compare OP1 and OP2. Return a positive value if OP1 > OP2, zero if
+ OP1 = OP2, and a negative value if OP1 < OP2.
+
+ To determine if two rationals are equal, 'mpq_equal' is faster than
+ 'mpq_cmp'.
+
+ -- Macro: int mpq_cmp_ui (const mpq_t OP1, unsigned long int NUM2,
+ unsigned long int DEN2)
+ -- Macro: int mpq_cmp_si (const mpq_t OP1, long int NUM2, unsigned long
+ int DEN2)
+ Compare OP1 and NUM2/DEN2. Return a positive value if OP1 >
+ NUM2/DEN2, zero if OP1 = NUM2/DEN2, and a negative value if OP1 <
+ NUM2/DEN2.
+
+ NUM2 and DEN2 are allowed to have common factors.
+
+ These functions are implemented as macros and evaluate their
+ arguments multiple times.
+
+ -- Macro: int mpq_sgn (const mpq_t OP)
+ Return +1 if OP > 0, 0 if OP = 0, and -1 if OP < 0.
+
+ This function is actually implemented as a macro. It evaluates its
+ argument multiple times.
+
+ -- Function: int mpq_equal (const mpq_t OP1, const mpq_t OP2)
+ Return non-zero if OP1 and OP2 are equal, zero if they are
+ non-equal. Although 'mpq_cmp' can be used for the same purpose,
+ this function is much faster.
+
+\1f
+File: gmp.info, Node: Applying Integer Functions, Next: I/O of Rationals, Prev: Comparing Rationals, Up: Rational Number Functions
+
+6.5 Applying Integer Functions to Rationals
+===========================================
+
+The set of 'mpq' functions is quite small. In particular, there are few
+functions for either input or output. The following functions give
+direct access to the numerator and denominator of an 'mpq_t'.
+
+ Note that if an assignment to the numerator and/or denominator could
+take an 'mpq_t' out of the canonical form described at the start of this
+chapter (*note Rational Number Functions::) then 'mpq_canonicalize' must
+be called before any other 'mpq' functions are applied to that 'mpq_t'.
+
+ -- Macro: mpz_ptr mpq_numref (const mpq_t OP)
+ -- Macro: mpz_ptr mpq_denref (const mpq_t OP)
+ Return a reference to the numerator and denominator of OP,
+ respectively. The 'mpz' functions can be used on the result of
+ these macros. Such calls may modify the numerator or denominator.
+ However, care should be taken so that OP remains in canonical form
+ prior to a possible later call to an 'mpq' function.
+
+ -- Function: void mpq_get_num (mpz_t NUMERATOR, const mpq_t RATIONAL)
+ -- Function: void mpq_get_den (mpz_t DENOMINATOR, const mpq_t RATIONAL)
+ -- Function: void mpq_set_num (mpq_t RATIONAL, const mpz_t NUMERATOR)
+ -- Function: void mpq_set_den (mpq_t RATIONAL, const mpz_t DENOMINATOR)
+ Get or set the numerator or denominator of a rational. These
+ functions are equivalent to calling 'mpz_set' with an appropriate
+ 'mpq_numref' or 'mpq_denref'. Direct use of 'mpq_numref' or
+ 'mpq_denref' is recommended instead of these functions.
+
+\1f
+File: gmp.info, Node: I/O of Rationals, Prev: Applying Integer Functions, Up: Rational Number Functions
+
+6.6 Input and Output Functions
+==============================
+
+Functions that perform input from a stdio stream, and functions that
+output to a stdio stream, of 'mpq' numbers. Passing a 'NULL' pointer
+for a STREAM argument to any of these functions will make them read from
+'stdin' and write to 'stdout', respectively.
+
+ When using any of these functions, it is a good idea to include
+'stdio.h' before 'gmp.h', since that will allow 'gmp.h' to define
+prototypes for these functions.
+
+ See also *note Formatted Output:: and *note Formatted Input::.
+
+ -- Function: size_t mpq_out_str (FILE *STREAM, int BASE, const mpq_t
+ OP)
+ Output OP on stdio stream STREAM, as a string of digits in base
+ BASE. The base argument may vary from 2 to 62 or from -2 to -36.
+ Output is in the form 'num/den' or if the denominator is 1 then
+ just 'num'.
+
+ For BASE in the range 2..36, digits and lower-case letters are
+ used; for -2..-36, digits and upper-case letters are used; for
+ 37..62, digits, upper-case letters, and lower-case letters (in that
+ significance order) are used.
+
+ Return the number of bytes written, or if an error occurred, return
+ 0.
+
+ -- Function: size_t mpq_inp_str (mpq_t ROP, FILE *STREAM, int BASE)
+ Read a string of digits from STREAM and convert them to a rational
+ in ROP. Any initial white-space characters are read and discarded.
+ Return the number of characters read (including white space), or 0
+ if a rational could not be read.
+
+ The input can be a fraction like '17/63' or just an integer like
+ '123'. Reading stops at the first character not in this form, and
+ white space is not permitted within the string. If the input might
+ not be in canonical form, then 'mpq_canonicalize' must be called
+ (*note Rational Number Functions::).
+
+ The BASE can be between 2 and 62, or can be 0 in which case the
+ leading characters of the string determine the base, '0x' or '0X'
+ for hexadecimal, '0b' and '0B' for binary, '0' for octal, or
+ decimal otherwise. The leading characters are examined separately
+ for the numerator and denominator of a fraction, so for instance
+ '0x10/11' is 16/11, whereas '0x10/0x11' is 16/17.
+
+\1f
+File: gmp.info, Node: Floating-point Functions, Next: Low-level Functions, Prev: Rational Number Functions, Up: Top
+
+7 Floating-point Functions
+**************************
+
+GMP floating point numbers are stored in objects of type 'mpf_t' and
+functions operating on them have an 'mpf_' prefix.
+
+ The mantissa of each float has a user-selectable precision, in
+practice only limited by available memory. Each variable has its own
+precision, and that can be increased or decreased at any time. This
+selectable precision is a minimum value, GMP rounds it up to a whole
+limb.
+
+ The accuracy of a calculation is determined by the priorly set
+precision of the destination variable and the numeric values of the
+input variables. Input variables' set precisions do not affect
+calculations (except indirectly as their values might have been affected
+when they were assigned).
+
+ The exponent of each float has fixed precision, one machine word on
+most systems. In the current implementation the exponent is a count of
+limbs, so for example on a 32-bit system this means a range of roughly
+2^-68719476768 to 2^68719476736, or on a 64-bit system this will be much
+greater. Note however that 'mpf_get_str' can only return an exponent
+which fits an 'mp_exp_t' and currently 'mpf_set_str' doesn't accept
+exponents bigger than a 'long'.
+
+ Each variable keeps track of the mantissa data actually in use. This
+means that if a float is exactly represented in only a few bits then
+only those bits will be used in a calculation, even if the variable's
+selected precision is high. This is a performance optimization; it does
+not affect the numeric results.
+
+ Internally, GMP sometimes calculates with higher precision than that
+of the destination variable in order to limit errors. Final results are
+always truncated to the destination variable's precision.
+
+ The mantissa is stored in binary. One consequence of this is that
+decimal fractions like 0.1 cannot be represented exactly. The same is
+true of plain IEEE 'double' floats. This makes both highly unsuitable
+for calculations involving money or other values that should be exact
+decimal fractions. (Suitably scaled integers, or perhaps rationals, are
+better choices.)
+
+ The 'mpf' functions and variables have no special notion of infinity
+or not-a-number, and applications must take care not to overflow the
+exponent or results will be unpredictable.
+
+ Note that the 'mpf' functions are _not_ intended as a smooth
+extension to IEEE P754 arithmetic. In particular results obtained on
+one computer often differ from the results on a computer with a
+different word size.
+
+ New projects should consider using the GMP extension library MPFR
+(<https://www.mpfr.org/>) instead. MPFR provides well-defined precision
+and accurate rounding, and thereby naturally extends IEEE P754.
+
+* Menu:
+
+* Initializing Floats::
+* Assigning Floats::
+* Simultaneous Float Init & Assign::
+* Converting Floats::
+* Float Arithmetic::
+* Float Comparison::
+* I/O of Floats::
+* Miscellaneous Float Functions::
+
+\1f
+File: gmp.info, Node: Initializing Floats, Next: Assigning Floats, Prev: Floating-point Functions, Up: Floating-point Functions
+
+7.1 Initialization Functions
+============================
+
+ -- Function: void mpf_set_default_prec (mp_bitcnt_t PREC)
+ Set the default precision to be *at least* PREC bits. All
+ subsequent calls to 'mpf_init' will use this precision, but
+ previously initialized variables are unaffected.
+
+ -- Function: mp_bitcnt_t mpf_get_default_prec (void)
+ Return the default precision actually used.
+
+ An 'mpf_t' object must be initialized before storing the first value
+in it. The functions 'mpf_init' and 'mpf_init2' are used for that
+purpose.
+
+ -- Function: void mpf_init (mpf_t X)
+ Initialize X to 0. Normally, a variable should be initialized once
+ only or at least be cleared, using 'mpf_clear', between
+ initializations. The precision of X is undefined unless a default
+ precision has already been established by a call to
+ 'mpf_set_default_prec'.
+
+ -- Function: void mpf_init2 (mpf_t X, mp_bitcnt_t PREC)
+ Initialize X to 0 and set its precision to be *at least* PREC bits.
+ Normally, a variable should be initialized once only or at least be
+ cleared, using 'mpf_clear', between initializations.
+
+ -- Function: void mpf_inits (mpf_t X, ...)
+ Initialize a NULL-terminated list of 'mpf_t' variables, and set
+ their values to 0. The precision of the initialized variables is
+ undefined unless a default precision has already been established
+ by a call to 'mpf_set_default_prec'.
+
+ -- Function: void mpf_clear (mpf_t X)
+ Free the space occupied by X. Make sure to call this function for
+ all 'mpf_t' variables when you are done with them.
+
+ -- Function: void mpf_clears (mpf_t X, ...)
+ Free the space occupied by a NULL-terminated list of 'mpf_t'
+ variables.
+
+ Here is an example on how to initialize floating-point variables:
+ {
+ mpf_t x, y;
+ mpf_init (x); /* use default precision */
+ mpf_init2 (y, 256); /* precision _at least_ 256 bits */
+ ...
+ /* Unless the program is about to exit, do ... */
+ mpf_clear (x);
+ mpf_clear (y);
+ }
+
+ The following three functions are useful for changing the precision
+during a calculation. A typical use would be for adjusting the
+precision gradually in iterative algorithms like Newton-Raphson, making
+the computation precision closely match the actual accurate part of the
+numbers.
+
+ -- Function: mp_bitcnt_t mpf_get_prec (const mpf_t OP)
+ Return the current precision of OP, in bits.
+
+ -- Function: void mpf_set_prec (mpf_t ROP, mp_bitcnt_t PREC)
+ Set the precision of ROP to be *at least* PREC bits. The value in
+ ROP will be truncated to the new precision.
+
+ This function requires a call to 'realloc', and so should not be
+ used in a tight loop.
+
+ -- Function: void mpf_set_prec_raw (mpf_t ROP, mp_bitcnt_t PREC)
+ Set the precision of ROP to be *at least* PREC bits, without
+ changing the memory allocated.
+
+ PREC must be no more than the allocated precision for ROP, that
+ being the precision when ROP was initialized, or in the most recent
+ 'mpf_set_prec'.
+
+ The value in ROP is unchanged, and in particular if it had a higher
+ precision than PREC it will retain that higher precision. New
+ values written to ROP will use the new PREC.
+
+ Before calling 'mpf_clear' or the full 'mpf_set_prec', another
+ 'mpf_set_prec_raw' call must be made to restore ROP to its original
+ allocated precision. Failing to do so will have unpredictable
+ results.
+
+ 'mpf_get_prec' can be used before 'mpf_set_prec_raw' to get the
+ original allocated precision. After 'mpf_set_prec_raw' it reflects
+ the PREC value set.
+
+ 'mpf_set_prec_raw' is an efficient way to use an 'mpf_t' variable
+ at different precisions during a calculation, perhaps to gradually
+ increase precision in an iteration, or just to use various
+ different precisions for different purposes during a calculation.
+
+\1f
+File: gmp.info, Node: Assigning Floats, Next: Simultaneous Float Init & Assign, Prev: Initializing Floats, Up: Floating-point Functions
+
+7.2 Assignment Functions
+========================
+
+These functions assign new values to already initialized floats (*note
+Initializing Floats::).
+
+ -- Function: void mpf_set (mpf_t ROP, const mpf_t OP)
+ -- Function: void mpf_set_ui (mpf_t ROP, unsigned long int OP)
+ -- Function: void mpf_set_si (mpf_t ROP, signed long int OP)
+ -- Function: void mpf_set_d (mpf_t ROP, double OP)
+ -- Function: void mpf_set_z (mpf_t ROP, const mpz_t OP)
+ -- Function: void mpf_set_q (mpf_t ROP, const mpq_t OP)
+ Set the value of ROP from OP.
+
+ -- Function: int mpf_set_str (mpf_t ROP, const char *STR, int BASE)
+ Set the value of ROP from the string in STR. The string is of the
+ form 'M@N' or, if the base is 10 or less, alternatively 'MeN'. 'M'
+ is the mantissa and 'N' is the exponent. The mantissa is always in
+ the specified base. The exponent is either in the specified base
+ or, if BASE is negative, in decimal. The decimal point expected is
+ taken from the current locale, on systems providing 'localeconv'.
+
+ The argument BASE may be in the ranges 2 to 62, or -62 to -2.
+ Negative values are used to specify that the exponent is in
+ decimal.
+
+ For bases up to 36, case is ignored; upper-case and lower-case
+ letters have the same value; for bases 37 to 62, upper-case letters
+ represent the usual 10..35 while lower-case letters represent
+ 36..61.
+
+ Unlike the corresponding 'mpz' function, the base will not be
+ determined from the leading characters of the string if BASE is 0.
+ This is so that numbers like '0.23' are not interpreted as octal.
+
+ White space is allowed in the string, and is simply ignored. [This
+ is not really true; white-space is ignored in the beginning of the
+ string and within the mantissa, but not in other places, such as
+ after a minus sign or in the exponent. We are considering changing
+ the definition of this function, making it fail when there is any
+ white-space in the input, since that makes a lot of sense. Please
+ tell us your opinion about this change. Do you really want it to
+ accept "3 14" as meaning 314 as it does now?]
+
+ This function returns 0 if the entire string is a valid number in
+ base BASE. Otherwise it returns -1.
+
+ -- Function: void mpf_swap (mpf_t ROP1, mpf_t ROP2)
+ Swap ROP1 and ROP2 efficiently. Both the values and the precisions
+ of the two variables are swapped.
+
+\1f
+File: gmp.info, Node: Simultaneous Float Init & Assign, Next: Converting Floats, Prev: Assigning Floats, Up: Floating-point Functions
+
+7.3 Combined Initialization and Assignment Functions
+====================================================
+
+For convenience, GMP provides a parallel series of initialize-and-set
+functions which initialize the output and then store the value there.
+These functions' names have the form 'mpf_init_set...'
+
+ Once the float has been initialized by any of the 'mpf_init_set...'
+functions, it can be used as the source or destination operand for the
+ordinary float functions. Don't use an initialize-and-set function on a
+variable already initialized!
+
+ -- Function: void mpf_init_set (mpf_t ROP, const mpf_t OP)
+ -- Function: void mpf_init_set_ui (mpf_t ROP, unsigned long int OP)
+ -- Function: void mpf_init_set_si (mpf_t ROP, signed long int OP)
+ -- Function: void mpf_init_set_d (mpf_t ROP, double OP)
+ Initialize ROP and set its value from OP.
+
+ The precision of ROP will be taken from the active default
+ precision, as set by 'mpf_set_default_prec'.
+
+ -- Function: int mpf_init_set_str (mpf_t ROP, const char *STR, int
+ BASE)
+ Initialize ROP and set its value from the string in STR. See
+ 'mpf_set_str' above for details on the assignment operation.
+
+ Note that ROP is initialized even if an error occurs. (I.e., you
+ have to call 'mpf_clear' for it.)
+
+ The precision of ROP will be taken from the active default
+ precision, as set by 'mpf_set_default_prec'.
+
+\1f
+File: gmp.info, Node: Converting Floats, Next: Float Arithmetic, Prev: Simultaneous Float Init & Assign, Up: Floating-point Functions
+
+7.4 Conversion Functions
+========================
+
+ -- Function: double mpf_get_d (const mpf_t OP)
+ Convert OP to a 'double', truncating if necessary (i.e. rounding
+ towards zero).
+
+ If the exponent in OP is too big or too small to fit a 'double'
+ then the result is system dependent. For too big an infinity is
+ returned when available. For too small 0.0 is normally returned.
+ Hardware overflow, underflow and denorm traps may or may not occur.
+
+ -- Function: double mpf_get_d_2exp (signed long int *EXP, const mpf_t
+ OP)
+ Convert OP to a 'double', truncating if necessary (i.e. rounding
+ towards zero), and with an exponent returned separately.
+
+ The return value is in the range 0.5<=abs(D)<1 and the exponent is
+ stored to '*EXP'. D * 2^EXP is the (truncated) OP value. If OP is
+ zero, the return is 0.0 and 0 is stored to '*EXP'.
+
+ This is similar to the standard C 'frexp' function (*note
+ (libc)Normalization Functions::).
+
+ -- Function: long mpf_get_si (const mpf_t OP)
+ -- Function: unsigned long mpf_get_ui (const mpf_t OP)
+ Convert OP to a 'long' or 'unsigned long', truncating any fraction
+ part. If OP is too big for the return type, the result is
+ undefined.
+
+ See also 'mpf_fits_slong_p' and 'mpf_fits_ulong_p' (*note
+ Miscellaneous Float Functions::).
+
+ -- Function: char * mpf_get_str (char *STR, mp_exp_t *EXPPTR, int BASE,
+ size_t N_DIGITS, const mpf_t OP)
+ Convert OP to a string of digits in base BASE. The base argument
+ may vary from 2 to 62 or from -2 to -36. Up to N_DIGITS digits
+ will be generated. Trailing zeros are not returned. No more
+ digits than can be accurately represented by OP are ever generated.
+ If N_DIGITS is 0 then that accurate maximum number of digits are
+ generated.
+
+ For BASE in the range 2..36, digits and lower-case letters are
+ used; for -2..-36, digits and upper-case letters are used; for
+ 37..62, digits, upper-case letters, and lower-case letters (in that
+ significance order) are used.
+
+ If STR is 'NULL', the result string is allocated using the current
+ allocation function (*note Custom Allocation::). The block will be
+ 'strlen(str)+1' bytes, that being exactly enough for the string and
+ null-terminator.
+
+ If STR is not 'NULL', it should point to a block of N_DIGITS + 2
+ bytes, that being enough for the mantissa, a possible minus sign,
+ and a null-terminator. When N_DIGITS is 0 to get all significant
+ digits, an application won't be able to know the space required,
+ and STR should be 'NULL' in that case.
+
+ The generated string is a fraction, with an implicit radix point
+ immediately to the left of the first digit. The applicable
+ exponent is written through the EXPPTR pointer. For example, the
+ number 3.1416 would be returned as string "31416" and exponent 1.
+
+ When OP is zero, an empty string is produced and the exponent
+ returned is 0.
+
+ A pointer to the result string is returned, being either the
+ allocated block or the given STR.
+
+\1f
+File: gmp.info, Node: Float Arithmetic, Next: Float Comparison, Prev: Converting Floats, Up: Floating-point Functions
+
+7.5 Arithmetic Functions
+========================
+
+ -- Function: void mpf_add (mpf_t ROP, const mpf_t OP1, const mpf_t OP2)
+ -- Function: void mpf_add_ui (mpf_t ROP, const mpf_t OP1, unsigned long
+ int OP2)
+ Set ROP to OP1 + OP2.
+
+ -- Function: void mpf_sub (mpf_t ROP, const mpf_t OP1, const mpf_t OP2)
+ -- Function: void mpf_ui_sub (mpf_t ROP, unsigned long int OP1, const
+ mpf_t OP2)
+ -- Function: void mpf_sub_ui (mpf_t ROP, const mpf_t OP1, unsigned long
+ int OP2)
+ Set ROP to OP1 - OP2.
+
+ -- Function: void mpf_mul (mpf_t ROP, const mpf_t OP1, const mpf_t OP2)
+ -- Function: void mpf_mul_ui (mpf_t ROP, const mpf_t OP1, unsigned long
+ int OP2)
+ Set ROP to OP1 times OP2.
+
+ Division is undefined if the divisor is zero, and passing a zero
+divisor to the divide functions will make these functions intentionally
+divide by zero. This lets the user handle arithmetic exceptions in
+these functions in the same manner as other arithmetic exceptions.
+
+ -- Function: void mpf_div (mpf_t ROP, const mpf_t OP1, const mpf_t OP2)
+ -- Function: void mpf_ui_div (mpf_t ROP, unsigned long int OP1, const
+ mpf_t OP2)
+ -- Function: void mpf_div_ui (mpf_t ROP, const mpf_t OP1, unsigned long
+ int OP2)
+ Set ROP to OP1/OP2.
+
+ -- Function: void mpf_sqrt (mpf_t ROP, const mpf_t OP)
+ -- Function: void mpf_sqrt_ui (mpf_t ROP, unsigned long int OP)
+ Set ROP to the square root of OP.
+
+ -- Function: void mpf_pow_ui (mpf_t ROP, const mpf_t OP1, unsigned long
+ int OP2)
+ Set ROP to OP1 raised to the power OP2.
+
+ -- Function: void mpf_neg (mpf_t ROP, const mpf_t OP)
+ Set ROP to -OP.
+
+ -- Function: void mpf_abs (mpf_t ROP, const mpf_t OP)
+ Set ROP to the absolute value of OP.
+
+ -- Function: void mpf_mul_2exp (mpf_t ROP, const mpf_t OP1, mp_bitcnt_t
+ OP2)
+ Set ROP to OP1 times 2 raised to OP2.
+
+ -- Function: void mpf_div_2exp (mpf_t ROP, const mpf_t OP1, mp_bitcnt_t
+ OP2)
+ Set ROP to OP1 divided by 2 raised to OP2.
+
+\1f
+File: gmp.info, Node: Float Comparison, Next: I/O of Floats, Prev: Float Arithmetic, Up: Floating-point Functions
+
+7.6 Comparison Functions
+========================
+
+ -- Function: int mpf_cmp (const mpf_t OP1, const mpf_t OP2)
+ -- Function: int mpf_cmp_z (const mpf_t OP1, const mpz_t OP2)
+ -- Function: int mpf_cmp_d (const mpf_t OP1, double OP2)
+ -- Function: int mpf_cmp_ui (const mpf_t OP1, unsigned long int OP2)
+ -- Function: int mpf_cmp_si (const mpf_t OP1, signed long int OP2)
+ Compare OP1 and OP2. Return a positive value if OP1 > OP2, zero if
+ OP1 = OP2, and a negative value if OP1 < OP2.
+
+ 'mpf_cmp_d' can be called with an infinity, but results are
+ undefined for a NaN.
+
+ -- Function: int mpf_eq (const mpf_t OP1, const mpf_t OP2, mp_bitcnt_t
+ op3)
+ *This function is mathematically ill-defined and should not be
+ used.*
+
+ Return non-zero if the first OP3 bits of OP1 and OP2 are equal,
+ zero otherwise. Note that numbers like e.g., 256 (binary
+ 100000000) and 255 (binary 11111111) will never be equal by this
+ function's measure, and furthermore that 0 will only be equal to
+ itself.
+
+ -- Function: void mpf_reldiff (mpf_t ROP, const mpf_t OP1, const mpf_t
+ OP2)
+ Compute the relative difference between OP1 and OP2 and store the
+ result in ROP. This is abs(OP1-OP2)/OP1.
+
+ -- Macro: int mpf_sgn (const mpf_t OP)
+ Return +1 if OP > 0, 0 if OP = 0, and -1 if OP < 0.
+
+ This function is actually implemented as a macro. It evaluates its
+ argument multiple times.
+
+\1f
+File: gmp.info, Node: I/O of Floats, Next: Miscellaneous Float Functions, Prev: Float Comparison, Up: Floating-point Functions
+
+7.7 Input and Output Functions
+==============================
+
+Functions that perform input from a stdio stream, and functions that
+output to a stdio stream, of 'mpf' numbers. Passing a 'NULL' pointer
+for a STREAM argument to any of these functions will make them read from
+'stdin' and write to 'stdout', respectively.
+
+ When using any of these functions, it is a good idea to include
+'stdio.h' before 'gmp.h', since that will allow 'gmp.h' to define
+prototypes for these functions.
+
+ See also *note Formatted Output:: and *note Formatted Input::.
+
+ -- Function: size_t mpf_out_str (FILE *STREAM, int BASE, size_t
+ N_DIGITS, const mpf_t OP)
+ Print OP to STREAM, as a string of digits. Return the number of
+ bytes written, or if an error occurred, return 0.
+
+ The mantissa is prefixed with an '0.' and is in the given BASE,
+ which may vary from 2 to 62 or from -2 to -36. An exponent is then
+ printed, separated by an 'e', or if the base is greater than 10
+ then by an '@'. The exponent is always in decimal. The decimal
+ point follows the current locale, on systems providing
+ 'localeconv'.
+
+ For BASE in the range 2..36, digits and lower-case letters are
+ used; for -2..-36, digits and upper-case letters are used; for
+ 37..62, digits, upper-case letters, and lower-case letters (in that
+ significance order) are used.
+
+ Up to N_DIGITS will be printed from the mantissa, except that no
+ more digits than are accurately representable by OP will be
+ printed. N_DIGITS can be 0 to select that accurate maximum.
+
+ -- Function: size_t mpf_inp_str (mpf_t ROP, FILE *STREAM, int BASE)
+ Read a string in base BASE from STREAM, and put the read float in
+ ROP. The string is of the form 'M@N' or, if the base is 10 or
+ less, alternatively 'MeN'. 'M' is the mantissa and 'N' is the
+ exponent. The mantissa is always in the specified base. The
+ exponent is either in the specified base or, if BASE is negative,
+ in decimal. The decimal point expected is taken from the current
+ locale, on systems providing 'localeconv'.
+
+ The argument BASE may be in the ranges 2 to 36, or -36 to -2.
+ Negative values are used to specify that the exponent is in
+ decimal.
+
+ Unlike the corresponding 'mpz' function, the base will not be
+ determined from the leading characters of the string if BASE is 0.
+ This is so that numbers like '0.23' are not interpreted as octal.
+
+ Return the number of bytes read, or if an error occurred, return 0.
+
+\1f
+File: gmp.info, Node: Miscellaneous Float Functions, Prev: I/O of Floats, Up: Floating-point Functions
+
+7.8 Miscellaneous Functions
+===========================
+
+ -- Function: void mpf_ceil (mpf_t ROP, const mpf_t OP)
+ -- Function: void mpf_floor (mpf_t ROP, const mpf_t OP)
+ -- Function: void mpf_trunc (mpf_t ROP, const mpf_t OP)
+ Set ROP to OP rounded to an integer. 'mpf_ceil' rounds to the next
+ higher integer, 'mpf_floor' to the next lower, and 'mpf_trunc' to
+ the integer towards zero.
+
+ -- Function: int mpf_integer_p (const mpf_t OP)
+ Return non-zero if OP is an integer.
+
+ -- Function: int mpf_fits_ulong_p (const mpf_t OP)
+ -- Function: int mpf_fits_slong_p (const mpf_t OP)
+ -- Function: int mpf_fits_uint_p (const mpf_t OP)
+ -- Function: int mpf_fits_sint_p (const mpf_t OP)
+ -- Function: int mpf_fits_ushort_p (const mpf_t OP)
+ -- Function: int mpf_fits_sshort_p (const mpf_t OP)
+ Return non-zero if OP would fit in the respective C data type, when
+ truncated to an integer.
+
+ -- Function: void mpf_urandomb (mpf_t ROP, gmp_randstate_t STATE,
+ mp_bitcnt_t NBITS)
+ Generate a uniformly distributed random float in ROP, such that 0
+ <= ROP < 1, with NBITS significant bits in the mantissa or less if
+ the precision of ROP is smaller.
+
+ The variable STATE must be initialized by calling one of the
+ 'gmp_randinit' functions (*note Random State Initialization::)
+ before invoking this function.
+
+ -- Function: void mpf_random2 (mpf_t ROP, mp_size_t MAX_SIZE, mp_exp_t
+ EXP)
+ Generate a random float of at most MAX_SIZE limbs, with long
+ strings of zeros and ones in the binary representation. The
+ exponent of the number is in the interval -EXP to EXP (in limbs).
+ This function is useful for testing functions and algorithms, since
+ these kind of random numbers have proven to be more likely to
+ trigger corner-case bugs. Negative random numbers are generated
+ when MAX_SIZE is negative.
+
+\1f
+File: gmp.info, Node: Low-level Functions, Next: Random Number Functions, Prev: Floating-point Functions, Up: Top
+
+8 Low-level Functions
+*********************
+
+This chapter describes low-level GMP functions, used to implement the
+high-level GMP functions, but also intended for time-critical user code.
+
+ These functions start with the prefix 'mpn_'.
+
+ The 'mpn' functions are designed to be as fast as possible, *not* to
+provide a coherent calling interface. The different functions have
+somewhat similar interfaces, but there are variations that make them
+hard to use. These functions do as little as possible apart from the
+real multiple precision computation, so that no time is spent on things
+that not all callers need.
+
+ A source operand is specified by a pointer to the least significant
+limb and a limb count. A destination operand is specified by just a
+pointer. It is the responsibility of the caller to ensure that the
+destination has enough space for storing the result.
+
+ With this way of specifying operands, it is possible to perform
+computations on subranges of an argument, and store the result into a
+subrange of a destination.
+
+ A common requirement for all functions is that each source area needs
+at least one limb. No size argument may be zero. Unless otherwise
+stated, in-place operations are allowed where source and destination are
+the same, but not where they only partly overlap.
+
+ The 'mpn' functions are the base for the implementation of the
+'mpz_', 'mpf_', and 'mpq_' functions.
+
+ This example adds the number beginning at S1P and the number
+beginning at S2P and writes the sum at DESTP. All areas have N limbs.
+
+ cy = mpn_add_n (destp, s1p, s2p, n)
+
+ It should be noted that the 'mpn' functions make no attempt to
+identify high or low zero limbs on their operands, or other special
+forms. On random data such cases will be unlikely and it'd be wasteful
+for every function to check every time. An application knowing
+something about its data can take steps to trim or perhaps split its
+calculations.
+
+
+In the notation used below, a source operand is identified by the
+pointer to the least significant limb, and the limb count in braces.
+For example, {S1P, S1N}.
+
+ -- Function: mp_limb_t mpn_add_n (mp_limb_t *RP, const mp_limb_t *S1P,
+ const mp_limb_t *S2P, mp_size_t N)
+ Add {S1P, N} and {S2P, N}, and write the N least significant limbs
+ of the result to RP. Return carry, either 0 or 1.
+
+ This is the lowest-level function for addition. It is the
+ preferred function for addition, since it is written in assembly
+ for most CPUs. For addition of a variable to itself (i.e., S1P
+ equals S2P) use 'mpn_lshift' with a count of 1 for optimal speed.
+
+ -- Function: mp_limb_t mpn_add_1 (mp_limb_t *RP, const mp_limb_t *S1P,
+ mp_size_t N, mp_limb_t S2LIMB)
+ Add {S1P, N} and S2LIMB, and write the N least significant limbs of
+ the result to RP. Return carry, either 0 or 1.
+
+ -- Function: mp_limb_t mpn_add (mp_limb_t *RP, const mp_limb_t *S1P,
+ mp_size_t S1N, const mp_limb_t *S2P, mp_size_t S2N)
+ Add {S1P, S1N} and {S2P, S2N}, and write the S1N least significant
+ limbs of the result to RP. Return carry, either 0 or 1.
+
+ This function requires that S1N is greater than or equal to S2N.
+
+ -- Function: mp_limb_t mpn_sub_n (mp_limb_t *RP, const mp_limb_t *S1P,
+ const mp_limb_t *S2P, mp_size_t N)
+ Subtract {S2P, N} from {S1P, N}, and write the N least significant
+ limbs of the result to RP. Return borrow, either 0 or 1.
+
+ This is the lowest-level function for subtraction. It is the
+ preferred function for subtraction, since it is written in assembly
+ for most CPUs.
+
+ -- Function: mp_limb_t mpn_sub_1 (mp_limb_t *RP, const mp_limb_t *S1P,
+ mp_size_t N, mp_limb_t S2LIMB)
+ Subtract S2LIMB from {S1P, N}, and write the N least significant
+ limbs of the result to RP. Return borrow, either 0 or 1.
+
+ -- Function: mp_limb_t mpn_sub (mp_limb_t *RP, const mp_limb_t *S1P,
+ mp_size_t S1N, const mp_limb_t *S2P, mp_size_t S2N)
+ Subtract {S2P, S2N} from {S1P, S1N}, and write the S1N least
+ significant limbs of the result to RP. Return borrow, either 0 or
+ 1.
+
+ This function requires that S1N is greater than or equal to S2N.
+
+ -- Function: mp_limb_t mpn_neg (mp_limb_t *RP, const mp_limb_t *SP,
+ mp_size_t N)
+ Perform the negation of {SP, N}, and write the result to {RP, N}.
+ This is equivalent to calling 'mpn_sub_n' with an N-limb zero
+ minuend and passing {SP, N} as subtrahend. Return borrow, either 0
+ or 1.
+
+ -- Function: void mpn_mul_n (mp_limb_t *RP, const mp_limb_t *S1P, const
+ mp_limb_t *S2P, mp_size_t N)
+ Multiply {S1P, N} and {S2P, N}, and write the 2*N-limb result to
+ RP.
+
+ The destination has to have space for 2*N limbs, even if the
+ product's most significant limb is zero. No overlap is permitted
+ between the destination and either source.
+
+ If the two input operands are the same, use 'mpn_sqr'.
+
+ -- Function: mp_limb_t mpn_mul (mp_limb_t *RP, const mp_limb_t *S1P,
+ mp_size_t S1N, const mp_limb_t *S2P, mp_size_t S2N)
+ Multiply {S1P, S1N} and {S2P, S2N}, and write the (S1N+S2N)-limb
+ result to RP. Return the most significant limb of the result.
+
+ The destination has to have space for S1N + S2N limbs, even if the
+ product's most significant limb is zero. No overlap is permitted
+ between the destination and either source.
+
+ This function requires that S1N is greater than or equal to S2N.
+
+ -- Function: void mpn_sqr (mp_limb_t *RP, const mp_limb_t *S1P,
+ mp_size_t N)
+ Compute the square of {S1P, N} and write the 2*N-limb result to RP.
+
+ The destination has to have space for 2N limbs, even if the
+ result's most significant limb is zero. No overlap is permitted
+ between the destination and the source.
+
+ -- Function: mp_limb_t mpn_mul_1 (mp_limb_t *RP, const mp_limb_t *S1P,
+ mp_size_t N, mp_limb_t S2LIMB)
+ Multiply {S1P, N} by S2LIMB, and write the N least significant
+ limbs of the product to RP. Return the most significant limb of
+ the product. {S1P, N} and {RP, N} are allowed to overlap provided
+ RP <= S1P.
+
+ This is a low-level function that is a building block for general
+ multiplication as well as other operations in GMP. It is written
+ in assembly for most CPUs.
+
+ Don't call this function if S2LIMB is a power of 2; use
+ 'mpn_lshift' with a count equal to the logarithm of S2LIMB instead,
+ for optimal speed.
+
+ -- Function: mp_limb_t mpn_addmul_1 (mp_limb_t *RP, const mp_limb_t
+ *S1P, mp_size_t N, mp_limb_t S2LIMB)
+ Multiply {S1P, N} and S2LIMB, and add the N least significant limbs
+ of the product to {RP, N} and write the result to RP. Return the
+ most significant limb of the product, plus carry-out from the
+ addition. {S1P, N} and {RP, N} are allowed to overlap provided RP
+ <= S1P.
+
+ This is a low-level function that is a building block for general
+ multiplication as well as other operations in GMP. It is written
+ in assembly for most CPUs.
+
+ -- Function: mp_limb_t mpn_submul_1 (mp_limb_t *RP, const mp_limb_t
+ *S1P, mp_size_t N, mp_limb_t S2LIMB)
+ Multiply {S1P, N} and S2LIMB, and subtract the N least significant
+ limbs of the product from {RP, N} and write the result to RP.
+ Return the most significant limb of the product, plus borrow-out
+ from the subtraction. {S1P, N} and {RP, N} are allowed to overlap
+ provided RP <= S1P.
+
+ This is a low-level function that is a building block for general
+ multiplication and division as well as other operations in GMP. It
+ is written in assembly for most CPUs.
+
+ -- Function: void mpn_tdiv_qr (mp_limb_t *QP, mp_limb_t *RP, mp_size_t
+ QXN, const mp_limb_t *NP, mp_size_t NN, const mp_limb_t *DP,
+ mp_size_t DN)
+ Divide {NP, NN} by {DP, DN} and put the quotient at {QP, NN-DN+1}
+ and the remainder at {RP, DN}. The quotient is rounded towards 0.
+
+ No overlap is permitted between arguments, except that NP might
+ equal RP. The dividend size NN must be greater than or equal to
+ divisor size DN. The most significant limb of the divisor must be
+ non-zero. The QXN operand must be zero.
+
+ -- Function: mp_limb_t mpn_divrem (mp_limb_t *R1P, mp_size_t QXN,
+ mp_limb_t *RS2P, mp_size_t RS2N, const mp_limb_t *S3P,
+ mp_size_t S3N)
+ [This function is obsolete. Please call 'mpn_tdiv_qr' instead for
+ best performance.]
+
+ Divide {RS2P, RS2N} by {S3P, S3N}, and write the quotient at R1P,
+ with the exception of the most significant limb, which is returned.
+ The remainder replaces the dividend at RS2P; it will be S3N limbs
+ long (i.e., as many limbs as the divisor).
+
+ In addition to an integer quotient, QXN fraction limbs are
+ developed, and stored after the integral limbs. For most usages,
+ QXN will be zero.
+
+ It is required that RS2N is greater than or equal to S3N. It is
+ required that the most significant bit of the divisor is set.
+
+ If the quotient is not needed, pass RS2P + S3N as R1P. Aside from
+ that special case, no overlap between arguments is permitted.
+
+ Return the most significant limb of the quotient, either 0 or 1.
+
+ The area at R1P needs to be RS2N - S3N + QXN limbs large.
+
+ -- Function: mp_limb_t mpn_divrem_1 (mp_limb_t *R1P, mp_size_t QXN,
+ mp_limb_t *S2P, mp_size_t S2N, mp_limb_t S3LIMB)
+ -- Macro: mp_limb_t mpn_divmod_1 (mp_limb_t *R1P, mp_limb_t *S2P,
+ mp_size_t S2N, mp_limb_t S3LIMB)
+ Divide {S2P, S2N} by S3LIMB, and write the quotient at R1P. Return
+ the remainder.
+
+ The integer quotient is written to {R1P+QXN, S2N} and in addition
+ QXN fraction limbs are developed and written to {R1P, QXN}. Either
+ or both S2N and QXN can be zero. For most usages, QXN will be
+ zero.
+
+ 'mpn_divmod_1' exists for upward source compatibility and is simply
+ a macro calling 'mpn_divrem_1' with a QXN of 0.
+
+ The areas at R1P and S2P have to be identical or completely
+ separate, not partially overlapping.
+
+ -- Function: mp_limb_t mpn_divmod (mp_limb_t *R1P, mp_limb_t *RS2P,
+ mp_size_t RS2N, const mp_limb_t *S3P, mp_size_t S3N)
+ [This function is obsolete. Please call 'mpn_tdiv_qr' instead for
+ best performance.]
+
+ -- Function: void mpn_divexact_1 (mp_limb_t * RP, const mp_limb_t * SP,
+ mp_size_t N, mp_limb_t D)
+ Divide {SP, N} by D, expecting it to divide exactly, and writing
+ the result to {RP, N}. If D doesn't divide exactly, the value
+ written to {RP, N} is undefined. The areas at RP and SP have to be
+ identical or completely separate, not partially overlapping.
+
+ -- Macro: mp_limb_t mpn_divexact_by3 (mp_limb_t *RP, mp_limb_t *SP,
+ mp_size_t N)
+ -- Function: mp_limb_t mpn_divexact_by3c (mp_limb_t *RP, mp_limb_t *SP,
+ mp_size_t N, mp_limb_t CARRY)
+ Divide {SP, N} by 3, expecting it to divide exactly, and writing
+ the result to {RP, N}. If 3 divides exactly, the return value is
+ zero and the result is the quotient. If not, the return value is
+ non-zero and the result won't be anything useful.
+
+ 'mpn_divexact_by3c' takes an initial carry parameter, which can be
+ the return value from a previous call, so a large calculation can
+ be done piece by piece from low to high. 'mpn_divexact_by3' is
+ simply a macro calling 'mpn_divexact_by3c' with a 0 carry
+ parameter.
+
+ These routines use a multiply-by-inverse and will be faster than
+ 'mpn_divrem_1' on CPUs with fast multiplication but slow division.
+
+ The source a, result q, size n, initial carry i, and return value c
+ satisfy c*b^n + a-i = 3*q, where b=2^GMP_NUMB_BITS. The return c is
+ always 0, 1 or 2, and the initial carry i must also be 0, 1 or 2
+ (these are both borrows really). When c=0 clearly q=(a-i)/3. When
+ c!=0, the remainder (a-i) mod 3 is given by 3-c, because b == 1 mod
+ 3 (when 'mp_bits_per_limb' is even, which is always so currently).
+
+ -- Function: mp_limb_t mpn_mod_1 (const mp_limb_t *S1P, mp_size_t S1N,
+ mp_limb_t S2LIMB)
+ Divide {S1P, S1N} by S2LIMB, and return the remainder. S1N can be
+ zero.
+
+ -- Function: mp_limb_t mpn_lshift (mp_limb_t *RP, const mp_limb_t *SP,
+ mp_size_t N, unsigned int COUNT)
+ Shift {SP, N} left by COUNT bits, and write the result to {RP, N}.
+ The bits shifted out at the left are returned in the least
+ significant COUNT bits of the return value (the rest of the return
+ value is zero).
+
+ COUNT must be in the range 1 to mp_bits_per_limb{}-1. The regions
+ {SP, N} and {RP, N} may overlap, provided RP >= SP.
+
+ This function is written in assembly for most CPUs.
+
+ -- Function: mp_limb_t mpn_rshift (mp_limb_t *RP, const mp_limb_t *SP,
+ mp_size_t N, unsigned int COUNT)
+ Shift {SP, N} right by COUNT bits, and write the result to {RP, N}.
+ The bits shifted out at the right are returned in the most
+ significant COUNT bits of the return value (the rest of the return
+ value is zero).
+
+ COUNT must be in the range 1 to mp_bits_per_limb{}-1. The regions
+ {SP, N} and {RP, N} may overlap, provided RP <= SP.
+
+ This function is written in assembly for most CPUs.
+
+ -- Function: int mpn_cmp (const mp_limb_t *S1P, const mp_limb_t *S2P,
+ mp_size_t N)
+ Compare {S1P, N} and {S2P, N} and return a positive value if S1 >
+ S2, 0 if they are equal, or a negative value if S1 < S2.
+
+ -- Function: int mpn_zero_p (const mp_limb_t *SP, mp_size_t N)
+ Test {SP, N} and return 1 if the operand is zero, 0 otherwise.
+
+ -- Function: mp_size_t mpn_gcd (mp_limb_t *RP, mp_limb_t *XP, mp_size_t
+ XN, mp_limb_t *YP, mp_size_t YN)
+ Set {RP, RETVAL} to the greatest common divisor of {XP, XN} and
+ {YP, YN}. The result can be up to YN limbs, the return value is
+ the actual number produced. Both source operands are destroyed.
+
+ It is required that XN >= YN > 0, the most significant limb of {YP,
+ YN} must be non-zero, and at least one of the two operands must be
+ odd. No overlap is permitted between {XP, XN} and {YP, YN}.
+
+ -- Function: mp_limb_t mpn_gcd_1 (const mp_limb_t *XP, mp_size_t XN,
+ mp_limb_t YLIMB)
+ Return the greatest common divisor of {XP, XN} and YLIMB. Both
+ operands must be non-zero.
+
+ -- Function: mp_size_t mpn_gcdext (mp_limb_t *GP, mp_limb_t *SP,
+ mp_size_t *SN, mp_limb_t *UP, mp_size_t UN, mp_limb_t *VP,
+ mp_size_t VN)
+ Let U be defined by {UP, UN} and let V be defined by {VP, VN}.
+
+ Compute the greatest common divisor G of U and V. Compute a
+ cofactor S such that G = US + VT. The second cofactor T is not
+ computed but can easily be obtained from (G - U*S) / V (the
+ division will be exact). It is required that UN >= VN > 0, and the
+ most significant limb of {VP, VN} must be non-zero.
+
+ S satisfies S = 1 or abs(S) < V / (2 G). S = 0 if and only if V
+ divides U (i.e., G = V).
+
+ Store G at GP and let the return value define its limb count.
+ Store S at SP and let |*SN| define its limb count. S can be
+ negative; when this happens *SN will be negative. The area at GP
+ should have room for VN limbs and the area at SP should have room
+ for VN+1 limbs.
+
+ Both source operands are destroyed.
+
+ Compatibility notes: GMP 4.3.0 and 4.3.1 defined S less strictly.
+ Earlier as well as later GMP releases define S as described here.
+ GMP releases before GMP 4.3.0 required additional space for both
+ input and output areas. More precisely, the areas {UP, UN+1} and
+ {VP, VN+1} were destroyed (i.e. the operands plus an extra limb
+ past the end of each), and the areas pointed to by GP and SP should
+ each have room for UN+1 limbs.
+
+ -- Function: mp_size_t mpn_sqrtrem (mp_limb_t *R1P, mp_limb_t *R2P,
+ const mp_limb_t *SP, mp_size_t N)
+ Compute the square root of {SP, N} and put the result at {R1P,
+ ceil(N/2)} and the remainder at {R2P, RETVAL}. R2P needs space for
+ N limbs, but the return value indicates how many are produced.
+
+ The most significant limb of {SP, N} must be non-zero. The areas
+ {R1P, ceil(N/2)} and {SP, N} must be completely separate. The
+ areas {R2P, N} and {SP, N} must be either identical or completely
+ separate.
+
+ If the remainder is not wanted then R2P can be 'NULL', and in this
+ case the return value is zero or non-zero according to whether the
+ remainder would have been zero or non-zero.
+
+ A return value of zero indicates a perfect square. See also
+ 'mpn_perfect_square_p'.
+
+ -- Function: size_t mpn_sizeinbase (const mp_limb_t *XP, mp_size_t N,
+ int BASE)
+ Return the size of {XP,N} measured in number of digits in the given
+ BASE. BASE can vary from 2 to 62. Requires N > 0 and XP[N-1] > 0.
+ The result will be either exact or 1 too big. If BASE is a power
+ of 2, the result is always exact.
+
+ -- Function: mp_size_t mpn_get_str (unsigned char *STR, int BASE,
+ mp_limb_t *S1P, mp_size_t S1N)
+ Convert {S1P, S1N} to a raw unsigned char array at STR in base
+ BASE, and return the number of characters produced. There may be
+ leading zeros in the string. The string is not in ASCII; to
+ convert it to printable format, add the ASCII codes for '0' or 'A',
+ depending on the base and range. BASE can vary from 2 to 256.
+
+ The most significant limb of the input {S1P, S1N} must be non-zero.
+ The input {S1P, S1N} is clobbered, except when BASE is a power of
+ 2, in which case it's unchanged.
+
+ The area at STR has to have space for the largest possible number
+ represented by a S1N long limb array, plus one extra character.
+
+ -- Function: mp_size_t mpn_set_str (mp_limb_t *RP, const unsigned char
+ *STR, size_t STRSIZE, int BASE)
+ Convert bytes {STR,STRSIZE} in the given BASE to limbs at RP.
+
+ STR[0] is the most significant input byte and STR[STRSIZE-1] is the
+ least significant input byte. Each byte should be a value in the
+ range 0 to BASE-1, not an ASCII character. BASE can vary from 2 to
+ 256.
+
+ The converted value is {RP,RN} where RN is the return value. If
+ the most significant input byte STR[0] is non-zero, then RP[RN-1]
+ will be non-zero, else RP[RN-1] and some number of subsequent limbs
+ may be zero.
+
+ The area at RP has to have space for the largest possible number
+ with STRSIZE digits in the chosen base, plus one extra limb.
+
+ The input must have at least one byte, and no overlap is permitted
+ between {STR,STRSIZE} and the result at RP.
+
+ -- Function: mp_bitcnt_t mpn_scan0 (const mp_limb_t *S1P, mp_bitcnt_t
+ BIT)
+ Scan S1P from bit position BIT for the next clear bit.
+
+ It is required that there be a clear bit within the area at S1P at
+ or beyond bit position BIT, so that the function has something to
+ return.
+
+ -- Function: mp_bitcnt_t mpn_scan1 (const mp_limb_t *S1P, mp_bitcnt_t
+ BIT)
+ Scan S1P from bit position BIT for the next set bit.
+
+ It is required that there be a set bit within the area at S1P at or
+ beyond bit position BIT, so that the function has something to
+ return.
+
+ -- Function: void mpn_random (mp_limb_t *R1P, mp_size_t R1N)
+ -- Function: void mpn_random2 (mp_limb_t *R1P, mp_size_t R1N)
+ Generate a random number of length R1N and store it at R1P. The
+ most significant limb is always non-zero. 'mpn_random' generates
+ uniformly distributed limb data, 'mpn_random2' generates long
+ strings of zeros and ones in the binary representation.
+
+ 'mpn_random2' is intended for testing the correctness of the 'mpn'
+ routines.
+
+ -- Function: mp_bitcnt_t mpn_popcount (const mp_limb_t *S1P, mp_size_t
+ N)
+ Count the number of set bits in {S1P, N}.
+
+ -- Function: mp_bitcnt_t mpn_hamdist (const mp_limb_t *S1P, const
+ mp_limb_t *S2P, mp_size_t N)
+ Compute the hamming distance between {S1P, N} and {S2P, N}, which
+ is the number of bit positions where the two operands have
+ different bit values.
+
+ -- Function: int mpn_perfect_square_p (const mp_limb_t *S1P, mp_size_t
+ N)
+ Return non-zero iff {S1P, N} is a perfect square. The most
+ significant limb of the input {S1P, N} must be non-zero.
+
+ -- Function: void mpn_and_n (mp_limb_t *RP, const mp_limb_t *S1P, const
+ mp_limb_t *S2P, mp_size_t N)
+ Perform the bitwise logical and of {S1P, N} and {S2P, N}, and write
+ the result to {RP, N}.
+
+ -- Function: void mpn_ior_n (mp_limb_t *RP, const mp_limb_t *S1P, const
+ mp_limb_t *S2P, mp_size_t N)
+ Perform the bitwise logical inclusive or of {S1P, N} and {S2P, N},
+ and write the result to {RP, N}.
+
+ -- Function: void mpn_xor_n (mp_limb_t *RP, const mp_limb_t *S1P, const
+ mp_limb_t *S2P, mp_size_t N)
+ Perform the bitwise logical exclusive or of {S1P, N} and {S2P, N},
+ and write the result to {RP, N}.
+
+ -- Function: void mpn_andn_n (mp_limb_t *RP, const mp_limb_t *S1P,
+ const mp_limb_t *S2P, mp_size_t N)
+ Perform the bitwise logical and of {S1P, N} and the bitwise
+ complement of {S2P, N}, and write the result to {RP, N}.
+
+ -- Function: void mpn_iorn_n (mp_limb_t *RP, const mp_limb_t *S1P,
+ const mp_limb_t *S2P, mp_size_t N)
+ Perform the bitwise logical inclusive or of {S1P, N} and the
+ bitwise complement of {S2P, N}, and write the result to {RP, N}.
+
+ -- Function: void mpn_nand_n (mp_limb_t *RP, const mp_limb_t *S1P,
+ const mp_limb_t *S2P, mp_size_t N)
+ Perform the bitwise logical and of {S1P, N} and {S2P, N}, and write
+ the bitwise complement of the result to {RP, N}.
+
+ -- Function: void mpn_nior_n (mp_limb_t *RP, const mp_limb_t *S1P,
+ const mp_limb_t *S2P, mp_size_t N)
+ Perform the bitwise logical inclusive or of {S1P, N} and {S2P, N},
+ and write the bitwise complement of the result to {RP, N}.
+
+ -- Function: void mpn_xnor_n (mp_limb_t *RP, const mp_limb_t *S1P,
+ const mp_limb_t *S2P, mp_size_t N)
+ Perform the bitwise logical exclusive or of {S1P, N} and {S2P, N},
+ and write the bitwise complement of the result to {RP, N}.
+
+ -- Function: void mpn_com (mp_limb_t *RP, const mp_limb_t *SP,
+ mp_size_t N)
+ Perform the bitwise complement of {SP, N}, and write the result to
+ {RP, N}.
+
+ -- Function: void mpn_copyi (mp_limb_t *RP, const mp_limb_t *S1P,
+ mp_size_t N)
+ Copy from {S1P, N} to {RP, N}, increasingly.
+
+ -- Function: void mpn_copyd (mp_limb_t *RP, const mp_limb_t *S1P,
+ mp_size_t N)
+ Copy from {S1P, N} to {RP, N}, decreasingly.
+
+ -- Function: void mpn_zero (mp_limb_t *RP, mp_size_t N)
+ Zero {RP, N}.
+
+
+8.1 Low-level functions for cryptography
+========================================
+
+The functions prefixed with 'mpn_sec_' and 'mpn_cnd_' are designed to
+perform the exact same low-level operations and have the same cache
+access patterns for any two same-size arguments, assuming that function
+arguments are placed at the same position and that the machine state is
+identical upon function entry. These functions are intended for
+cryptographic purposes, where resilience to side-channel attacks is
+desired.
+
+ These functions are less efficient than their "leaky" counterparts;
+their performance for operands of the sizes typically used for
+cryptographic applications is between 15% and 100% worse. For larger
+operands, these functions might be inadequate, since they rely on
+asymptotically elementary algorithms.
+
+ These functions do not make any explicit allocations. Those of these
+functions that need scratch space accept a scratch space operand. This
+convention allows callers to keep sensitive data in designated memory
+areas. Note however that compilers may choose to spill scalar values
+used within these functions to their stack frame and that such scalars
+may contain sensitive data.
+
+ In addition to these specially crafted functions, the following 'mpn'
+functions are naturally side-channel resistant: 'mpn_add_n',
+'mpn_sub_n', 'mpn_lshift', 'mpn_rshift', 'mpn_zero', 'mpn_copyi',
+'mpn_copyd', 'mpn_com', and the logical function ('mpn_and_n', etc).
+
+ There are some exceptions from the side-channel resilience: (1) Some
+assembly implementations of 'mpn_lshift' identify shift-by-one as a
+special case. This is a problem iff the shift count is a function of
+sensitive data. (2) Alpha ev6 and Pentium4 using 64-bit limbs have
+leaky 'mpn_add_n' and 'mpn_sub_n'. (3) Alpha ev6 has a leaky
+'mpn_mul_1' which also makes 'mpn_sec_mul' on those systems unsafe.
+
+ -- Function: mp_limb_t mpn_cnd_add_n (mp_limb_t CND, mp_limb_t *RP,
+ const mp_limb_t *S1P, const mp_limb_t *S2P, mp_size_t N)
+ -- Function: mp_limb_t mpn_cnd_sub_n (mp_limb_t CND, mp_limb_t *RP,
+ const mp_limb_t *S1P, const mp_limb_t *S2P, mp_size_t N)
+ These functions do conditional addition and subtraction. If CND is
+ non-zero, they produce the same result as a regular 'mpn_add_n' or
+ 'mpn_sub_n', and if CND is zero, they copy {S1P,N} to the result
+ area and return zero. The functions are designed to have timing
+ and memory access patterns depending only on size and location of
+ the data areas, but independent of the condition CND. Like for
+ 'mpn_add_n' and 'mpn_sub_n', on most machines, the timing will also
+ be independent of the actual limb values.
+
+ -- Function: mp_limb_t mpn_sec_add_1 (mp_limb_t *RP, const mp_limb_t
+ *AP, mp_size_t N, mp_limb_t B, mp_limb_t *TP)
+ -- Function: mp_limb_t mpn_sec_sub_1 (mp_limb_t *RP, const mp_limb_t
+ *AP, mp_size_t N, mp_limb_t B, mp_limb_t *TP)
+ Set R to A + B or A - B, respectively, where R = {RP,N}, A =
+ {AP,N}, and B is a single limb. Returns carry.
+
+ These functions take O(N) time, unlike the leaky functions
+ 'mpn_add_1' which are O(1) on average. They require scratch space
+ of 'mpn_sec_add_1_itch(N)' and 'mpn_sec_sub_1_itch(N)' limbs,
+ respectively, to be passed in the TP parameter. The scratch space
+ requirements are guaranteed to be at most N limbs, and increase
+ monotonously in the operand size.
+
+ -- Function: void mpn_cnd_swap (mp_limb_t CND, volatile mp_limb_t *AP,
+ volatile mp_limb_t *BP, mp_size_t N)
+ If CND is non-zero, swaps the contents of the areas {AP,N} and
+ {BP,N}. Otherwise, the areas are left unmodified. Implemented
+ using logical operations on the limbs, with the same memory
+ accesses independent of the value of CND.
+
+ -- Function: void mpn_sec_mul (mp_limb_t *RP, const mp_limb_t *AP,
+ mp_size_t AN, const mp_limb_t *BP, mp_size_t BN, mp_limb_t
+ *TP)
+ -- Function: mp_size_t mpn_sec_mul_itch (mp_size_t AN, mp_size_t BN)
+ Set R to A * B, where A = {AP,AN}, B = {BP,BN}, and R = {RP,AN+BN}.
+
+ It is required that AN >= BN > 0.
+
+ No overlapping between R and the input operands is allowed. For A
+ = B, use 'mpn_sec_sqr' for optimal performance.
+
+ This function requires scratch space of 'mpn_sec_mul_itch(AN, BN)'
+ limbs to be passed in the TP parameter. The scratch space
+ requirements are guaranteed to increase monotonously in the operand
+ sizes.
+
+ -- Function: void mpn_sec_sqr (mp_limb_t *RP, const mp_limb_t *AP,
+ mp_size_t AN, mp_limb_t *TP)
+ -- Function: mp_size_t mpn_sec_sqr_itch (mp_size_t AN)
+ Set R to A^2, where A = {AP,AN}, and R = {RP,2AN}.
+
+ It is required that AN > 0.
+
+ No overlapping between R and the input operands is allowed.
+
+ This function requires scratch space of 'mpn_sec_sqr_itch(AN)'
+ limbs to be passed in the TP parameter. The scratch space
+ requirements are guaranteed to increase monotonously in the operand
+ size.
+
+ -- Function: void mpn_sec_powm (mp_limb_t *RP, const mp_limb_t *BP,
+ mp_size_t BN, const mp_limb_t *EP, mp_bitcnt_t ENB, const
+ mp_limb_t *MP, mp_size_t N, mp_limb_t *TP)
+ -- Function: mp_size_t mpn_sec_powm_itch (mp_size_t BN, mp_bitcnt_t
+ ENB, size_t N)
+ Set R to (B raised to E) modulo M, where R = {RP,N}, M = {MP,N},
+ and E = {EP,ceil(ENB / 'GMP\_NUMB\_BITS')}.
+
+ It is required that B > 0, that M > 0 is odd, and that E < 2^ENB,
+ with ENB > 0.
+
+ No overlapping between R and the input operands is allowed.
+
+ This function requires scratch space of 'mpn_sec_powm_itch(BN, ENB,
+ N)' limbs to be passed in the TP parameter. The scratch space
+ requirements are guaranteed to increase monotonously in the operand
+ sizes.
+
+ -- Function: void mpn_sec_tabselect (mp_limb_t *RP, const mp_limb_t
+ *TAB, mp_size_t N, mp_size_t NENTS, mp_size_t WHICH)
+ Select entry WHICH from table TAB, which has NENTS entries, each N
+ limbs. Store the selected entry at RP.
+
+ This function reads the entire table to avoid side-channel
+ information leaks.
+
+ -- Function: mp_limb_t mpn_sec_div_qr (mp_limb_t *QP, mp_limb_t *NP,
+ mp_size_t NN, const mp_limb_t *DP, mp_size_t DN, mp_limb_t
+ *TP)
+ -- Function: mp_size_t mpn_sec_div_qr_itch (mp_size_t NN, mp_size_t DN)
+
+ Set Q to the truncated quotient N / D and R to N modulo D, where N
+ = {NP,NN}, D = {DP,DN}, Q's most significant limb is the function
+ return value and the remaining limbs are {QP,NN-DN}, and R =
+ {NP,DN}.
+
+ It is required that NN >= DN >= 1, and that DP[DN-1] != 0. This
+ does not imply that N >= D since N might be zero-padded.
+
+ Note the overlapping between N and R. No other operand overlapping
+ is allowed. The entire space occupied by N is overwritten.
+
+ This function requires scratch space of 'mpn_sec_div_qr_itch(NN,
+ DN)' limbs to be passed in the TP parameter.
+
+ -- Function: void mpn_sec_div_r (mp_limb_t *NP, mp_size_t NN, const
+ mp_limb_t *DP, mp_size_t DN, mp_limb_t *TP)
+ -- Function: mp_size_t mpn_sec_div_r_itch (mp_size_t NN, mp_size_t DN)
+
+ Set R to N modulo D, where N = {NP,NN}, D = {DP,DN}, and R =
+ {NP,DN}.
+
+ It is required that NN >= DN >= 1, and that DP[DN-1] != 0. This
+ does not imply that N >= D since N might be zero-padded.
+
+ Note the overlapping between N and R. No other operand overlapping
+ is allowed. The entire space occupied by N is overwritten.
+
+ This function requires scratch space of 'mpn_sec_div_r_itch(NN,
+ DN)' limbs to be passed in the TP parameter.
+
+ -- Function: int mpn_sec_invert (mp_limb_t *RP, mp_limb_t *AP, const
+ mp_limb_t *MP, mp_size_t N, mp_bitcnt_t NBCNT, mp_limb_t *TP)
+ -- Function: mp_size_t mpn_sec_invert_itch (mp_size_t N)
+ Set R to the inverse of A modulo M, where R = {RP,N}, A = {AP,N},
+ and M = {MP,N}. *This function's interface is preliminary.*
+
+ If an inverse exists, return 1, otherwise return 0 and leave R
+ undefined. In either case, the input A is destroyed.
+
+ It is required that M is odd, and that NBCNT >= ceil(\log(A+1)) +
+ ceil(\log(M+1)). A safe choice is NBCNT = 2 * N * GMP_NUMB_BITS,
+ but a smaller value might improve performance if M or A are known
+ to have leading zero bits.
+
+ This function requires scratch space of 'mpn_sec_invert_itch(N)'
+ limbs to be passed in the TP parameter.
+
+
+8.2 Nails
+=========
+
+*Everything in this section is highly experimental and may disappear or
+be subject to incompatible changes in a future version of GMP.*
+
+ Nails are an experimental feature whereby a few bits are left unused
+at the top of each 'mp_limb_t'. This can significantly improve carry
+handling on some processors.
+
+ All the 'mpn' functions accepting limb data will expect the nail bits
+to be zero on entry, and will return data with the nails similarly all
+zero. This applies both to limb vectors and to single limb arguments.
+
+ Nails can be enabled by configuring with '--enable-nails'. By
+default the number of bits will be chosen according to what suits the
+host processor, but a particular number can be selected with
+'--enable-nails=N'.
+
+ At the mpn level, a nail build is neither source nor binary
+compatible with a non-nail build, strictly speaking. But programs
+acting on limbs only through the mpn functions are likely to work
+equally well with either build, and judicious use of the definitions
+below should make any program compatible with either build, at the
+source level.
+
+ For the higher level routines, meaning 'mpz' etc, a nail build should
+be fully source and binary compatible with a non-nail build.
+
+ -- Macro: GMP_NAIL_BITS
+ -- Macro: GMP_NUMB_BITS
+ -- Macro: GMP_LIMB_BITS
+ 'GMP_NAIL_BITS' is the number of nail bits, or 0 when nails are not
+ in use. 'GMP_NUMB_BITS' is the number of data bits in a limb.
+ 'GMP_LIMB_BITS' is the total number of bits in an 'mp_limb_t'. In
+ all cases
+
+ GMP_LIMB_BITS == GMP_NAIL_BITS + GMP_NUMB_BITS
+
+ -- Macro: GMP_NAIL_MASK
+ -- Macro: GMP_NUMB_MASK
+ Bit masks for the nail and number parts of a limb. 'GMP_NAIL_MASK'
+ is 0 when nails are not in use.
+
+ 'GMP_NAIL_MASK' is not often needed, since the nail part can be
+ obtained with 'x >> GMP_NUMB_BITS', and that means one less large
+ constant, which can help various RISC chips.
+
+ -- Macro: GMP_NUMB_MAX
+ The maximum value that can be stored in the number part of a limb.
+ This is the same as 'GMP_NUMB_MASK', but can be used for clarity
+ when doing comparisons rather than bit-wise operations.
+
+ The term "nails" comes from finger or toe nails, which are at the
+ends of a limb (arm or leg). "numb" is short for number, but is also
+how the developers felt after trying for a long time to come up with
+sensible names for these things.
+
+ In the future (the distant future most likely) a non-zero nail might
+be permitted, giving non-unique representations for numbers in a limb
+vector. This would help vector processors since carries would only ever
+need to propagate one or two limbs.
+
+\1f
+File: gmp.info, Node: Random Number Functions, Next: Formatted Output, Prev: Low-level Functions, Up: Top
+
+9 Random Number Functions
+*************************
+
+Sequences of pseudo-random numbers in GMP are generated using a variable
+of type 'gmp_randstate_t', which holds an algorithm selection and a
+current state. Such a variable must be initialized by a call to one of
+the 'gmp_randinit' functions, and can be seeded with one of the
+'gmp_randseed' functions.
+
+ The functions actually generating random numbers are described in
+*note Integer Random Numbers::, and *note Miscellaneous Float
+Functions::.
+
+ The older style random number functions don't accept a
+'gmp_randstate_t' parameter but instead share a global variable of that
+type. They use a default algorithm and are currently not seeded (though
+perhaps that will change in the future). The new functions accepting a
+'gmp_randstate_t' are recommended for applications that care about
+randomness.
+
+* Menu:
+
+* Random State Initialization::
+* Random State Seeding::
+* Random State Miscellaneous::
+
+\1f
+File: gmp.info, Node: Random State Initialization, Next: Random State Seeding, Prev: Random Number Functions, Up: Random Number Functions
+
+9.1 Random State Initialization
+===============================
+
+ -- Function: void gmp_randinit_default (gmp_randstate_t STATE)
+ Initialize STATE with a default algorithm. This will be a
+ compromise between speed and randomness, and is recommended for
+ applications with no special requirements. Currently this is
+ 'gmp_randinit_mt'.
+
+ -- Function: void gmp_randinit_mt (gmp_randstate_t STATE)
+ Initialize STATE for a Mersenne Twister algorithm. This algorithm
+ is fast and has good randomness properties.
+
+ -- Function: void gmp_randinit_lc_2exp (gmp_randstate_t STATE, const
+ mpz_t A, unsigned long C, mp_bitcnt_t M2EXP)
+ Initialize STATE with a linear congruential algorithm X = (A*X + C)
+ mod 2^M2EXP.
+
+ The low bits of X in this algorithm are not very random. The least
+ significant bit will have a period no more than 2, and the second
+ bit no more than 4, etc. For this reason only the high half of
+ each X is actually used.
+
+ When a random number of more than M2EXP/2 bits is to be generated,
+ multiple iterations of the recurrence are used and the results
+ concatenated.
+
+ -- Function: int gmp_randinit_lc_2exp_size (gmp_randstate_t STATE,
+ mp_bitcnt_t SIZE)
+ Initialize STATE for a linear congruential algorithm as per
+ 'gmp_randinit_lc_2exp'. A, C and M2EXP are selected from a table,
+ chosen so that SIZE bits (or more) of each X will be used, i.e.
+ M2EXP/2 >= SIZE.
+
+ If successful the return value is non-zero. If SIZE is bigger than
+ the table data provides then the return value is zero. The maximum
+ SIZE currently supported is 128.
+
+ -- Function: void gmp_randinit_set (gmp_randstate_t ROP,
+ gmp_randstate_t OP)
+ Initialize ROP with a copy of the algorithm and state from OP.
+
+ -- Function: void gmp_randinit (gmp_randstate_t STATE,
+ gmp_randalg_t ALG, ...)
+ *This function is obsolete.*
+
+ Initialize STATE with an algorithm selected by ALG. The only
+ choice is 'GMP_RAND_ALG_LC', which is 'gmp_randinit_lc_2exp_size'
+ described above. A third parameter of type 'unsigned long' is
+ required, this is the SIZE for that function.
+ 'GMP_RAND_ALG_DEFAULT' and 0 are the same as 'GMP_RAND_ALG_LC'.
+
+ 'gmp_randinit' sets bits in the global variable 'gmp_errno' to
+ indicate an error. 'GMP_ERROR_UNSUPPORTED_ARGUMENT' if ALG is
+ unsupported, or 'GMP_ERROR_INVALID_ARGUMENT' if the SIZE parameter
+ is too big. It may be noted this error reporting is not thread
+ safe (a good reason to use 'gmp_randinit_lc_2exp_size' instead).
+
+ -- Function: void gmp_randclear (gmp_randstate_t STATE)
+ Free all memory occupied by STATE.
+
+\1f
+File: gmp.info, Node: Random State Seeding, Next: Random State Miscellaneous, Prev: Random State Initialization, Up: Random Number Functions
+
+9.2 Random State Seeding
+========================
+
+ -- Function: void gmp_randseed (gmp_randstate_t STATE, const mpz_t
+ SEED)
+ -- Function: void gmp_randseed_ui (gmp_randstate_t STATE,
+ unsigned long int SEED)
+ Set an initial seed value into STATE.
+
+ The size of a seed determines how many different sequences of
+ random numbers it's possible to generate. The "quality" of the
+ seed is the randomness of a given seed compared to the previous
+ seed used, and this affects the randomness of separate number
+ sequences. The method for choosing a seed is critical if the
+ generated numbers are to be used for important applications, such
+ as generating cryptographic keys.
+
+ Traditionally the system time has been used to seed, but care needs
+ to be taken with this. If an application seeds often and the
+ resolution of the system clock is low, then the same sequence of
+ numbers might be repeated. Also, the system time is quite easy to
+ guess, so if unpredictability is required then it should definitely
+ not be the only source for the seed value. On some systems there's
+ a special device '/dev/random' which provides random data better
+ suited for use as a seed.
+
+\1f
+File: gmp.info, Node: Random State Miscellaneous, Prev: Random State Seeding, Up: Random Number Functions
+
+9.3 Random State Miscellaneous
+==============================
+
+ -- Function: unsigned long gmp_urandomb_ui (gmp_randstate_t STATE,
+ unsigned long N)
+ Return a uniformly distributed random number of N bits, i.e. in the
+ range 0 to 2^N-1 inclusive. N must be less than or equal to the
+ number of bits in an 'unsigned long'.
+
+ -- Function: unsigned long gmp_urandomm_ui (gmp_randstate_t STATE,
+ unsigned long N)
+ Return a uniformly distributed random number in the range 0 to N-1,
+ inclusive.
+
+\1f
+File: gmp.info, Node: Formatted Output, Next: Formatted Input, Prev: Random Number Functions, Up: Top
+
+10 Formatted Output
+*******************
+
+* Menu:
+
+* Formatted Output Strings::
+* Formatted Output Functions::
+* C++ Formatted Output::
+
+\1f
+File: gmp.info, Node: Formatted Output Strings, Next: Formatted Output Functions, Prev: Formatted Output, Up: Formatted Output
+
+10.1 Format Strings
+===================
+
+'gmp_printf' and friends accept format strings similar to the standard C
+'printf' (*note Formatted Output: (libc)Formatted Output.). A format
+specification is of the form
+
+ % [flags] [width] [.[precision]] [type] conv
+
+ GMP adds types 'Z', 'Q' and 'F' for 'mpz_t', 'mpq_t' and 'mpf_t'
+respectively, 'M' for 'mp_limb_t', and 'N' for an 'mp_limb_t' array.
+'Z', 'Q', 'M' and 'N' behave like integers. 'Q' will print a '/' and a
+denominator, if needed. 'F' behaves like a float. For example,
+
+ mpz_t z;
+ gmp_printf ("%s is an mpz %Zd\n", "here", z);
+
+ mpq_t q;
+ gmp_printf ("a hex rational: %#40Qx\n", q);
+
+ mpf_t f;
+ int n;
+ gmp_printf ("fixed point mpf %.*Ff with %d digits\n", n, f, n);
+
+ mp_limb_t l;
+ gmp_printf ("limb %Mu\n", l);
+
+ const mp_limb_t *ptr;
+ mp_size_t size;
+ gmp_printf ("limb array %Nx\n", ptr, size);
+
+ For 'N' the limbs are expected least significant first, as per the
+'mpn' functions (*note Low-level Functions::). A negative size can be
+given to print the value as a negative.
+
+ All the standard C 'printf' types behave the same as the C library
+'printf', and can be freely intermixed with the GMP extensions. In the
+current implementation the standard parts of the format string are
+simply handed to 'printf' and only the GMP extensions handled directly.
+
+ The flags accepted are as follows. GLIBC style ' is only for the
+standard C types (not the GMP types), and only if the C library supports
+it.
+
+ 0 pad with zeros (rather than spaces)
+ # show the base with '0x', '0X' or '0'
+ + always show a sign
+ (space) show a space or a '-' sign
+ ' group digits, GLIBC style (not GMP
+ types)
+
+ The optional width and precision can be given as a number within the
+format string, or as a '*' to take an extra parameter of type 'int', the
+same as the standard 'printf'.
+
+ The standard types accepted are as follows. 'h' and 'l' are
+portable, the rest will depend on the compiler (or include files) for
+the type and the C library for the output.
+
+ h short
+ hh char
+ j intmax_t or uintmax_t
+ l long or wchar_t
+ ll long long
+ L long double
+ q quad_t or u_quad_t
+ t ptrdiff_t
+ z size_t
+
+The GMP types are
+
+ F mpf_t, float conversions
+ Q mpq_t, integer conversions
+ M mp_limb_t, integer conversions
+ N mp_limb_t array, integer conversions
+ Z mpz_t, integer conversions
+
+ The conversions accepted are as follows. 'a' and 'A' are always
+supported for 'mpf_t' but depend on the C library for standard C float
+types. 'm' and 'p' depend on the C library.
+
+ a A hex floats, C99 style
+ c character
+ d decimal integer
+ e E scientific format float
+ f fixed point float
+ i same as d
+ g G fixed or scientific float
+ m 'strerror' string, GLIBC style
+ n store characters written so far
+ o octal integer
+ p pointer
+ s string
+ u unsigned integer
+ x X hex integer
+
+ 'o', 'x' and 'X' are unsigned for the standard C types, but for types
+'Z', 'Q' and 'N' they are signed. 'u' is not meaningful for 'Z', 'Q'
+and 'N'.
+
+ 'M' is a proxy for the C library 'l' or 'L', according to the size of
+'mp_limb_t'. Unsigned conversions will be usual, but a signed
+conversion can be used and will interpret the value as a two's
+complement negative.
+
+ 'n' can be used with any type, even the GMP types.
+
+ Other types or conversions that might be accepted by the C library
+'printf' cannot be used through 'gmp_printf', this includes for instance
+extensions registered with GLIBC 'register_printf_function'. Also
+currently there's no support for POSIX '$' style numbered arguments
+(perhaps this will be added in the future).
+
+ The precision field has its usual meaning for integer 'Z' and float
+'F' types, but is currently undefined for 'Q' and should not be used
+with that.
+
+ 'mpf_t' conversions only ever generate as many digits as can be
+accurately represented by the operand, the same as 'mpf_get_str' does.
+Zeros will be used if necessary to pad to the requested precision. This
+happens even for an 'f' conversion of an 'mpf_t' which is an integer,
+for instance 2^1024 in an 'mpf_t' of 128 bits precision will only
+produce about 40 digits, then pad with zeros to the decimal point. An
+empty precision field like '%.Fe' or '%.Ff' can be used to specifically
+request just the significant digits. Without any dot and thus no
+precision field, a precision value of 6 will be used. Note that these
+rules mean that '%Ff', '%.Ff', and '%.0Ff' will all be different.
+
+ The decimal point character (or string) is taken from the current
+locale settings on systems which provide 'localeconv' (*note Locales and
+Internationalization: (libc)Locales.). The C library will normally do
+the same for standard float output.
+
+ The format string is only interpreted as plain 'char's, multibyte
+characters are not recognised. Perhaps this will change in the future.
+
+\1f
+File: gmp.info, Node: Formatted Output Functions, Next: C++ Formatted Output, Prev: Formatted Output Strings, Up: Formatted Output
+
+10.2 Functions
+==============
+
+Each of the following functions is similar to the corresponding C
+library function. The basic 'printf' forms take a variable argument
+list. The 'vprintf' forms take an argument pointer, see *note Variadic
+Functions: (libc)Variadic Functions, or 'man 3 va_start'.
+
+ It should be emphasised that if a format string is invalid, or the
+arguments don't match what the format specifies, then the behaviour of
+any of these functions will be unpredictable. GCC format string
+checking is not available, since it doesn't recognise the GMP
+extensions.
+
+ The file based functions 'gmp_printf' and 'gmp_fprintf' will return
+-1 to indicate a write error. Output is not "atomic", so partial output
+may be produced if a write error occurs. All the functions can return
+-1 if the C library 'printf' variant in use returns -1, but this
+shouldn't normally occur.
+
+ -- Function: int gmp_printf (const char *FMT, ...)
+ -- Function: int gmp_vprintf (const char *FMT, va_list AP)
+ Print to the standard output 'stdout'. Return the number of
+ characters written, or -1 if an error occurred.
+
+ -- Function: int gmp_fprintf (FILE *FP, const char *FMT, ...)
+ -- Function: int gmp_vfprintf (FILE *FP, const char *FMT, va_list AP)
+ Print to the stream FP. Return the number of characters written,
+ or -1 if an error occurred.
+
+ -- Function: int gmp_sprintf (char *BUF, const char *FMT, ...)
+ -- Function: int gmp_vsprintf (char *BUF, const char *FMT, va_list AP)
+ Form a null-terminated string in BUF. Return the number of
+ characters written, excluding the terminating null.
+
+ No overlap is permitted between the space at BUF and the string
+ FMT.
+
+ These functions are not recommended, since there's no protection
+ against exceeding the space available at BUF.
+
+ -- Function: int gmp_snprintf (char *BUF, size_t SIZE, const char *FMT,
+ ...)
+ -- Function: int gmp_vsnprintf (char *BUF, size_t SIZE, const char
+ *FMT, va_list AP)
+ Form a null-terminated string in BUF. No more than SIZE bytes will
+ be written. To get the full output, SIZE must be enough for the
+ string and null-terminator.
+
+ The return value is the total number of characters which ought to
+ have been produced, excluding the terminating null. If RETVAL >=
+ SIZE then the actual output has been truncated to the first SIZE-1
+ characters, and a null appended.
+
+ No overlap is permitted between the region {BUF,SIZE} and the FMT
+ string.
+
+ Notice the return value is in ISO C99 'snprintf' style. This is so
+ even if the C library 'vsnprintf' is the older GLIBC 2.0.x style.
+
+ -- Function: int gmp_asprintf (char **PP, const char *FMT, ...)
+ -- Function: int gmp_vasprintf (char **PP, const char *FMT, va_list AP)
+ Form a null-terminated string in a block of memory obtained from
+ the current memory allocation function (*note Custom Allocation::).
+ The block will be the size of the string and null-terminator. The
+ address of the block is stored to *PP. The return value is the
+ number of characters produced, excluding the null-terminator.
+
+ Unlike the C library 'asprintf', 'gmp_asprintf' doesn't return -1
+ if there's no more memory available, it lets the current allocation
+ function handle that.
+
+ -- Function: int gmp_obstack_printf (struct obstack *OB, const char
+ *FMT, ...)
+ -- Function: int gmp_obstack_vprintf (struct obstack *OB, const char
+ *FMT, va_list AP)
+ Append to the current object in OB. The return value is the number
+ of characters written. A null-terminator is not written.
+
+ FMT cannot be within the current object in OB, since that object
+ might move as it grows.
+
+ These functions are available only when the C library provides the
+ obstack feature, which probably means only on GNU systems, see
+ *note Obstacks: (libc)Obstacks.
+
+\1f
+File: gmp.info, Node: C++ Formatted Output, Prev: Formatted Output Functions, Up: Formatted Output
+
+10.3 C++ Formatted Output
+=========================
+
+The following functions are provided in 'libgmpxx' (*note Headers and
+Libraries::), which is built if C++ support is enabled (*note Build
+Options::). Prototypes are available from '<gmp.h>'.
+
+ -- Function: ostream& operator<< (ostream& STREAM, const mpz_t OP)
+ Print OP to STREAM, using its 'ios' formatting settings.
+ 'ios::width' is reset to 0 after output, the same as the standard
+ 'ostream operator<<' routines do.
+
+ In hex or octal, OP is printed as a signed number, the same as for
+ decimal. This is unlike the standard 'operator<<' routines on
+ 'int' etc, which instead give two's complement.
+
+ -- Function: ostream& operator<< (ostream& STREAM, const mpq_t OP)
+ Print OP to STREAM, using its 'ios' formatting settings.
+ 'ios::width' is reset to 0 after output, the same as the standard
+ 'ostream operator<<' routines do.
+
+ Output will be a fraction like '5/9', or if the denominator is 1
+ then just a plain integer like '123'.
+
+ In hex or octal, OP is printed as a signed value, the same as for
+ decimal. If 'ios::showbase' is set then a base indicator is shown
+ on both the numerator and denominator (if the denominator is
+ required).
+
+ -- Function: ostream& operator<< (ostream& STREAM, const mpf_t OP)
+ Print OP to STREAM, using its 'ios' formatting settings.
+ 'ios::width' is reset to 0 after output, the same as the standard
+ 'ostream operator<<' routines do.
+
+ The decimal point follows the standard library float 'operator<<',
+ which on recent systems means the 'std::locale' imbued on STREAM.
+
+ Hex and octal are supported, unlike the standard 'operator<<' on
+ 'double'. The mantissa will be in hex or octal, the exponent will
+ be in decimal. For hex the exponent delimiter is an '@'. This is
+ as per 'mpf_out_str'.
+
+ 'ios::showbase' is supported, and will put a base on the mantissa,
+ for example hex '0x1.8' or '0x0.8', or octal '01.4' or '00.4'.
+ This last form is slightly strange, but at least differentiates
+ itself from decimal.
+
+ These operators mean that GMP types can be printed in the usual C++
+way, for example,
+
+ mpz_t z;
+ int n;
+ ...
+ cout << "iteration " << n << " value " << z << "\n";
+
+ But note that 'ostream' output (and 'istream' input, *note C++
+Formatted Input::) is the only overloading available for the GMP types
+and that for instance using '+' with an 'mpz_t' will have unpredictable
+results. For classes with overloading, see *note C++ Class Interface::.
+
+\1f
+File: gmp.info, Node: Formatted Input, Next: C++ Class Interface, Prev: Formatted Output, Up: Top
+
+11 Formatted Input
+******************
+
+* Menu:
+
+* Formatted Input Strings::
+* Formatted Input Functions::
+* C++ Formatted Input::
+
+\1f
+File: gmp.info, Node: Formatted Input Strings, Next: Formatted Input Functions, Prev: Formatted Input, Up: Formatted Input
+
+11.1 Formatted Input Strings
+============================
+
+'gmp_scanf' and friends accept format strings similar to the standard C
+'scanf' (*note Formatted Input: (libc)Formatted Input.). A format
+specification is of the form
+
+ % [flags] [width] [type] conv
+
+ GMP adds types 'Z', 'Q' and 'F' for 'mpz_t', 'mpq_t' and 'mpf_t'
+respectively. 'Z' and 'Q' behave like integers. 'Q' will read a '/'
+and a denominator, if present. 'F' behaves like a float.
+
+ GMP variables don't require an '&' when passed to 'gmp_scanf', since
+they're already "call-by-reference". For example,
+
+ /* to read say "a(5) = 1234" */
+ int n;
+ mpz_t z;
+ gmp_scanf ("a(%d) = %Zd\n", &n, z);
+
+ mpq_t q1, q2;
+ gmp_sscanf ("0377 + 0x10/0x11", "%Qi + %Qi", q1, q2);
+
+ /* to read say "topleft (1.55,-2.66)" */
+ mpf_t x, y;
+ char buf[32];
+ gmp_scanf ("%31s (%Ff,%Ff)", buf, x, y);
+
+ All the standard C 'scanf' types behave the same as in the C library
+'scanf', and can be freely intermixed with the GMP extensions. In the
+current implementation the standard parts of the format string are
+simply handed to 'scanf' and only the GMP extensions handled directly.
+
+ The flags accepted are as follows. 'a' and ''' will depend on
+support from the C library, and ''' cannot be used with GMP types.
+
+ * read but don't store
+ a allocate a buffer (string conversions)
+ ' grouped digits, GLIBC style (not GMP
+ types)
+
+ The standard types accepted are as follows. 'h' and 'l' are
+portable, the rest will depend on the compiler (or include files) for
+the type and the C library for the input.
+
+ h short
+ hh char
+ j intmax_t or uintmax_t
+ l long int, double or wchar_t
+ ll long long
+ L long double
+ q quad_t or u_quad_t
+ t ptrdiff_t
+ z size_t
+
+The GMP types are
+
+ F mpf_t, float conversions
+ Q mpq_t, integer conversions
+ Z mpz_t, integer conversions
+
+ The conversions accepted are as follows. 'p' and '[' will depend on
+support from the C library, the rest are standard.
+
+ c character or characters
+ d decimal integer
+ e E f g float
+ G
+ i integer with base indicator
+ n characters read so far
+ o octal integer
+ p pointer
+ s string of non-whitespace characters
+ u decimal integer
+ x X hex integer
+ [ string of characters in a set
+
+ 'e', 'E', 'f', 'g' and 'G' are identical, they all read either fixed
+point or scientific format, and either upper or lower case 'e' for the
+exponent in scientific format.
+
+ C99 style hex float format ('printf %a', *note Formatted Output
+Strings::) is always accepted for 'mpf_t', but for the standard float
+types it will depend on the C library.
+
+ 'x' and 'X' are identical, both accept both upper and lower case
+hexadecimal.
+
+ 'o', 'u', 'x' and 'X' all read positive or negative values. For the
+standard C types these are described as "unsigned" conversions, but that
+merely affects certain overflow handling, negatives are still allowed
+(per 'strtoul', *note Parsing of Integers: (libc)Parsing of Integers.).
+For GMP types there are no overflows, so 'd' and 'u' are identical.
+
+ 'Q' type reads the numerator and (optional) denominator as given. If
+the value might not be in canonical form then 'mpq_canonicalize' must be
+called before using it in any calculations (*note Rational Number
+Functions::).
+
+ 'Qi' will read a base specification separately for the numerator and
+denominator. For example '0x10/11' would be 16/11, whereas '0x10/0x11'
+would be 16/17.
+
+ 'n' can be used with any of the types above, even the GMP types. '*'
+to suppress assignment is allowed, though in that case it would do
+nothing at all.
+
+ Other conversions or types that might be accepted by the C library
+'scanf' cannot be used through 'gmp_scanf'.
+
+ Whitespace is read and discarded before a field, except for 'c' and
+'[' conversions.
+
+ For float conversions, the decimal point character (or string)
+expected is taken from the current locale settings on systems which
+provide 'localeconv' (*note Locales and Internationalization:
+(libc)Locales.). The C library will normally do the same for standard
+float input.
+
+ The format string is only interpreted as plain 'char's, multibyte
+characters are not recognised. Perhaps this will change in the future.
+
+\1f
+File: gmp.info, Node: Formatted Input Functions, Next: C++ Formatted Input, Prev: Formatted Input Strings, Up: Formatted Input
+
+11.2 Formatted Input Functions
+==============================
+
+Each of the following functions is similar to the corresponding C
+library function. The plain 'scanf' forms take a variable argument
+list. The 'vscanf' forms take an argument pointer, see *note Variadic
+Functions: (libc)Variadic Functions, or 'man 3 va_start'.
+
+ It should be emphasised that if a format string is invalid, or the
+arguments don't match what the format specifies, then the behaviour of
+any of these functions will be unpredictable. GCC format string
+checking is not available, since it doesn't recognise the GMP
+extensions.
+
+ No overlap is permitted between the FMT string and any of the results
+produced.
+
+ -- Function: int gmp_scanf (const char *FMT, ...)
+ -- Function: int gmp_vscanf (const char *FMT, va_list AP)
+ Read from the standard input 'stdin'.
+
+ -- Function: int gmp_fscanf (FILE *FP, const char *FMT, ...)
+ -- Function: int gmp_vfscanf (FILE *FP, const char *FMT, va_list AP)
+ Read from the stream FP.
+
+ -- Function: int gmp_sscanf (const char *S, const char *FMT, ...)
+ -- Function: int gmp_vsscanf (const char *S, const char *FMT, va_list
+ AP)
+ Read from a null-terminated string S.
+
+ The return value from each of these functions is the same as the
+standard C99 'scanf', namely the number of fields successfully parsed
+and stored. '%n' fields and fields read but suppressed by '*' don't
+count towards the return value.
+
+ If end of input (or a file error) is reached before a character for a
+field or a literal, and if no previous non-suppressed fields have
+matched, then the return value is 'EOF' instead of 0. A whitespace
+character in the format string is only an optional match and doesn't
+induce an 'EOF' in this fashion. Leading whitespace read and discarded
+for a field don't count as characters for that field.
+
+ For the GMP types, input parsing follows C99 rules, namely one
+character of lookahead is used and characters are read while they
+continue to meet the format requirements. If this doesn't provide a
+complete number then the function terminates, with that field not stored
+nor counted towards the return value. For instance with 'mpf_t' an
+input '1.23e-XYZ' would be read up to the 'X' and that character pushed
+back since it's not a digit. The string '1.23e-' would then be
+considered invalid since an 'e' must be followed by at least one digit.
+
+ For the standard C types, in the current implementation GMP calls the
+C library 'scanf' functions, which might have looser rules about what
+constitutes a valid input.
+
+ Note that 'gmp_sscanf' is the same as 'gmp_fscanf' and only does one
+character of lookahead when parsing. Although clearly it could look at
+its entire input, it is deliberately made identical to 'gmp_fscanf', the
+same way C99 'sscanf' is the same as 'fscanf'.
+
+\1f
+File: gmp.info, Node: C++ Formatted Input, Prev: Formatted Input Functions, Up: Formatted Input
+
+11.3 C++ Formatted Input
+========================
+
+The following functions are provided in 'libgmpxx' (*note Headers and
+Libraries::), which is built only if C++ support is enabled (*note Build
+Options::). Prototypes are available from '<gmp.h>'.
+
+ -- Function: istream& operator>> (istream& STREAM, mpz_t ROP)
+ Read ROP from STREAM, using its 'ios' formatting settings.
+
+ -- Function: istream& operator>> (istream& STREAM, mpq_t ROP)
+ An integer like '123' will be read, or a fraction like '5/9'. No
+ whitespace is allowed around the '/'. If the fraction is not in
+ canonical form then 'mpq_canonicalize' must be called (*note
+ Rational Number Functions::) before operating on it.
+
+ As per integer input, an '0' or '0x' base indicator is read when
+ none of 'ios::dec', 'ios::oct' or 'ios::hex' are set. This is done
+ separately for numerator and denominator, so that for instance
+ '0x10/11' is 16/11 and '0x10/0x11' is 16/17.
+
+ -- Function: istream& operator>> (istream& STREAM, mpf_t ROP)
+ Read ROP from STREAM, using its 'ios' formatting settings.
+
+ Hex or octal floats are not supported, but might be in the future,
+ or perhaps it's best to accept only what the standard float
+ 'operator>>' does.
+
+ Note that digit grouping specified by the 'istream' locale is
+currently not accepted. Perhaps this will change in the future.
+
+
+ These operators mean that GMP types can be read in the usual C++ way,
+for example,
+
+ mpz_t z;
+ ...
+ cin >> z;
+
+ But note that 'istream' input (and 'ostream' output, *note C++
+Formatted Output::) is the only overloading available for the GMP types
+and that for instance using '+' with an 'mpz_t' will have unpredictable
+results. For classes with overloading, see *note C++ Class Interface::.
+
+\1f
+File: gmp.info, Node: C++ Class Interface, Next: Custom Allocation, Prev: Formatted Input, Up: Top
+
+12 C++ Class Interface
+**********************
+
+This chapter describes the C++ class based interface to GMP.
+
+ All GMP C language types and functions can be used in C++ programs,
+since 'gmp.h' has 'extern "C"' qualifiers, but the class interface
+offers overloaded functions and operators which may be more convenient.
+
+ Due to the implementation of this interface, a reasonably recent C++
+compiler is required, one supporting namespaces, partial specialization
+of templates and member templates.
+
+ *Everything described in this chapter is to be considered preliminary
+and might be subject to incompatible changes if some unforeseen
+difficulty reveals itself.*
+
+* Menu:
+
+* C++ Interface General::
+* C++ Interface Integers::
+* C++ Interface Rationals::
+* C++ Interface Floats::
+* C++ Interface Random Numbers::
+* C++ Interface Limitations::
+
+\1f
+File: gmp.info, Node: C++ Interface General, Next: C++ Interface Integers, Prev: C++ Class Interface, Up: C++ Class Interface
+
+12.1 C++ Interface General
+==========================
+
+All the C++ classes and functions are available with
+
+ #include <gmpxx.h>
+
+ Programs should be linked with the 'libgmpxx' and 'libgmp' libraries.
+For example,
+
+ g++ mycxxprog.cc -lgmpxx -lgmp
+
+The classes defined are
+
+ -- Class: mpz_class
+ -- Class: mpq_class
+ -- Class: mpf_class
+
+ The standard operators and various standard functions are overloaded
+to allow arithmetic with these classes. For example,
+
+ int
+ main (void)
+ {
+ mpz_class a, b, c;
+
+ a = 1234;
+ b = "-5678";
+ c = a+b;
+ cout << "sum is " << c << "\n";
+ cout << "absolute value is " << abs(c) << "\n";
+
+ return 0;
+ }
+
+ An important feature of the implementation is that an expression like
+'a=b+c' results in a single call to the corresponding 'mpz_add', without
+using a temporary for the 'b+c' part. Expressions which by their nature
+imply intermediate values, like 'a=b*c+d*e', still use temporaries
+though.
+
+ The classes can be freely intermixed in expressions, as can the
+classes and the standard types 'long', 'unsigned long' and 'double'.
+Smaller types like 'int' or 'float' can also be intermixed, since C++
+will promote them.
+
+ Note that 'bool' is not accepted directly, but must be explicitly
+cast to an 'int' first. This is because C++ will automatically convert
+any pointer to a 'bool', so if GMP accepted 'bool' it would make all
+sorts of invalid class and pointer combinations compile but almost
+certainly not do anything sensible.
+
+ Conversions back from the classes to standard C++ types aren't done
+automatically, instead member functions like 'get_si' are provided (see
+the following sections for details).
+
+ Also there are no automatic conversions from the classes to the
+corresponding GMP C types, instead a reference to the underlying C
+object can be obtained with the following functions,
+
+ -- Function: mpz_t mpz_class::get_mpz_t ()
+ -- Function: mpq_t mpq_class::get_mpq_t ()
+ -- Function: mpf_t mpf_class::get_mpf_t ()
+
+ These can be used to call a C function which doesn't have a C++ class
+interface. For example to set 'a' to the GCD of 'b' and 'c',
+
+ mpz_class a, b, c;
+ ...
+ mpz_gcd (a.get_mpz_t(), b.get_mpz_t(), c.get_mpz_t());
+
+ In the other direction, a class can be initialized from the
+corresponding GMP C type, or assigned to if an explicit constructor is
+used. In both cases this makes a copy of the value, it doesn't create
+any sort of association. For example,
+
+ mpz_t z;
+ // ... init and calculate z ...
+ mpz_class x(z);
+ mpz_class y;
+ y = mpz_class (z);
+
+ There are no namespace setups in 'gmpxx.h', all types and functions
+are simply put into the global namespace. This is what 'gmp.h' has done
+in the past, and continues to do for compatibility. The extras provided
+by 'gmpxx.h' follow GMP naming conventions and are unlikely to clash
+with anything.
+
+\1f
+File: gmp.info, Node: C++ Interface Integers, Next: C++ Interface Rationals, Prev: C++ Interface General, Up: C++ Class Interface
+
+12.2 C++ Interface Integers
+===========================
+
+ -- Function: mpz_class::mpz_class (type N)
+ Construct an 'mpz_class'. All the standard C++ types may be used,
+ except 'long long' and 'long double', and all the GMP C++ classes
+ can be used, although conversions from 'mpq_class' and 'mpf_class'
+ are 'explicit'. Any necessary conversion follows the corresponding
+ C function, for example 'double' follows 'mpz_set_d' (*note
+ Assigning Integers::).
+
+ -- Function: explicit mpz_class::mpz_class (const mpz_t Z)
+ Construct an 'mpz_class' from an 'mpz_t'. The value in Z is copied
+ into the new 'mpz_class', there won't be any permanent association
+ between it and Z.
+
+ -- Function: explicit mpz_class::mpz_class (const char *S, int BASE =
+ 0)
+ -- Function: explicit mpz_class::mpz_class (const string& S, int BASE =
+ 0)
+ Construct an 'mpz_class' converted from a string using
+ 'mpz_set_str' (*note Assigning Integers::).
+
+ If the string is not a valid integer, an 'std::invalid_argument'
+ exception is thrown. The same applies to 'operator='.
+
+ -- Function: mpz_class operator"" _mpz (const char *STR)
+ With C++11 compilers, integers can be constructed with the syntax
+ '123_mpz' which is equivalent to 'mpz_class("123")'.
+
+ -- Function: mpz_class operator/ (mpz_class A, mpz_class D)
+ -- Function: mpz_class operator% (mpz_class A, mpz_class D)
+ Divisions involving 'mpz_class' round towards zero, as per the
+ 'mpz_tdiv_q' and 'mpz_tdiv_r' functions (*note Integer Division::).
+ This is the same as the C99 '/' and '%' operators.
+
+ The 'mpz_fdiv...' or 'mpz_cdiv...' functions can always be called
+ directly if desired. For example,
+
+ mpz_class q, a, d;
+ ...
+ mpz_fdiv_q (q.get_mpz_t(), a.get_mpz_t(), d.get_mpz_t());
+
+ -- Function: mpz_class abs (mpz_class OP)
+ -- Function: int cmp (mpz_class OP1, type OP2)
+ -- Function: int cmp (type OP1, mpz_class OP2)
+
+ -- Function: bool mpz_class::fits_sint_p (void)
+ -- Function: bool mpz_class::fits_slong_p (void)
+ -- Function: bool mpz_class::fits_sshort_p (void)
+
+ -- Function: bool mpz_class::fits_uint_p (void)
+ -- Function: bool mpz_class::fits_ulong_p (void)
+ -- Function: bool mpz_class::fits_ushort_p (void)
+
+ -- Function: double mpz_class::get_d (void)
+ -- Function: long mpz_class::get_si (void)
+ -- Function: string mpz_class::get_str (int BASE = 10)
+ -- Function: unsigned long mpz_class::get_ui (void)
+
+ -- Function: int mpz_class::set_str (const char *STR, int BASE)
+ -- Function: int mpz_class::set_str (const string& STR, int BASE)
+ -- Function: int sgn (mpz_class OP)
+ -- Function: mpz_class sqrt (mpz_class OP)
+
+ -- Function: mpz_class gcd (mpz_class OP1, mpz_class OP2)
+ -- Function: mpz_class lcm (mpz_class OP1, mpz_class OP2)
+ -- Function: mpz_class mpz_class::factorial (type OP)
+ -- Function: mpz_class factorial (mpz_class OP)
+ -- Function: mpz_class mpz_class::primorial (type OP)
+ -- Function: mpz_class primorial (mpz_class OP)
+ -- Function: mpz_class mpz_class::fibonacci (type OP)
+ -- Function: mpz_class fibonacci (mpz_class OP)
+
+ -- Function: void mpz_class::swap (mpz_class& OP)
+ -- Function: void swap (mpz_class& OP1, mpz_class& OP2)
+ These functions provide a C++ class interface to the corresponding
+ GMP C routines. Calling 'factorial' or 'primorial' on a negative
+ number is undefined.
+
+ 'cmp' can be used with any of the classes or the standard C++
+ types, except 'long long' and 'long double'.
+
+
+ Overloaded operators for combinations of 'mpz_class' and 'double' are
+provided for completeness, but it should be noted that if the given
+'double' is not an integer then the way any rounding is done is
+currently unspecified. The rounding might take place at the start, in
+the middle, or at the end of the operation, and it might change in the
+future.
+
+ Conversions between 'mpz_class' and 'double', however, are defined to
+follow the corresponding C functions 'mpz_get_d' and 'mpz_set_d'. And
+comparisons are always made exactly, as per 'mpz_cmp_d'.
+
+\1f
+File: gmp.info, Node: C++ Interface Rationals, Next: C++ Interface Floats, Prev: C++ Interface Integers, Up: C++ Class Interface
+
+12.3 C++ Interface Rationals
+============================
+
+In all the following constructors, if a fraction is given then it should
+be in canonical form, or if not then 'mpq_class::canonicalize' called.
+
+ -- Function: mpq_class::mpq_class (type OP)
+ -- Function: mpq_class::mpq_class (integer NUM, integer DEN)
+ Construct an 'mpq_class'. The initial value can be a single value
+ of any type (conversion from 'mpf_class' is 'explicit'), or a pair
+ of integers ('mpz_class' or standard C++ integer types)
+ representing a fraction, except that 'long long' and 'long double'
+ are not supported. For example,
+
+ mpq_class q (99);
+ mpq_class q (1.75);
+ mpq_class q (1, 3);
+
+ -- Function: explicit mpq_class::mpq_class (const mpq_t Q)
+ Construct an 'mpq_class' from an 'mpq_t'. The value in Q is copied
+ into the new 'mpq_class', there won't be any permanent association
+ between it and Q.
+
+ -- Function: explicit mpq_class::mpq_class (const char *S, int BASE =
+ 0)
+ -- Function: explicit mpq_class::mpq_class (const string& S, int BASE =
+ 0)
+ Construct an 'mpq_class' converted from a string using
+ 'mpq_set_str' (*note Initializing Rationals::).
+
+ If the string is not a valid rational, an 'std::invalid_argument'
+ exception is thrown. The same applies to 'operator='.
+
+ -- Function: mpq_class operator"" _mpq (const char *STR)
+ With C++11 compilers, integral rationals can be constructed with
+ the syntax '123_mpq' which is equivalent to 'mpq_class(123_mpz)'.
+ Other rationals can be built as '-1_mpq/2' or '0xb_mpq/123456_mpz'.
+
+ -- Function: void mpq_class::canonicalize ()
+ Put an 'mpq_class' into canonical form, as per *note Rational
+ Number Functions::. All arithmetic operators require their
+ operands in canonical form, and will return results in canonical
+ form.
+
+ -- Function: mpq_class abs (mpq_class OP)
+ -- Function: int cmp (mpq_class OP1, type OP2)
+ -- Function: int cmp (type OP1, mpq_class OP2)
+
+ -- Function: double mpq_class::get_d (void)
+ -- Function: string mpq_class::get_str (int BASE = 10)
+
+ -- Function: int mpq_class::set_str (const char *STR, int BASE)
+ -- Function: int mpq_class::set_str (const string& STR, int BASE)
+ -- Function: int sgn (mpq_class OP)
+
+ -- Function: void mpq_class::swap (mpq_class& OP)
+ -- Function: void swap (mpq_class& OP1, mpq_class& OP2)
+ These functions provide a C++ class interface to the corresponding
+ GMP C routines.
+
+ 'cmp' can be used with any of the classes or the standard C++
+ types, except 'long long' and 'long double'.
+
+ -- Function: mpz_class& mpq_class::get_num ()
+ -- Function: mpz_class& mpq_class::get_den ()
+ Get a reference to an 'mpz_class' which is the numerator or
+ denominator of an 'mpq_class'. This can be used both for read and
+ write access. If the object returned is modified, it modifies the
+ original 'mpq_class'.
+
+ If direct manipulation might produce a non-canonical value, then
+ 'mpq_class::canonicalize' must be called before further operations.
+
+ -- Function: mpz_t mpq_class::get_num_mpz_t ()
+ -- Function: mpz_t mpq_class::get_den_mpz_t ()
+ Get a reference to the underlying 'mpz_t' numerator or denominator
+ of an 'mpq_class'. This can be passed to C functions expecting an
+ 'mpz_t'. Any modifications made to the 'mpz_t' will modify the
+ original 'mpq_class'.
+
+ If direct manipulation might produce a non-canonical value, then
+ 'mpq_class::canonicalize' must be called before further operations.
+
+ -- Function: istream& operator>> (istream& STREAM, mpq_class& ROP);
+ Read ROP from STREAM, using its 'ios' formatting settings, the same
+ as 'mpq_t operator>>' (*note C++ Formatted Input::).
+
+ If the ROP read might not be in canonical form then
+ 'mpq_class::canonicalize' must be called.
+
+\1f
+File: gmp.info, Node: C++ Interface Floats, Next: C++ Interface Random Numbers, Prev: C++ Interface Rationals, Up: C++ Class Interface
+
+12.4 C++ Interface Floats
+=========================
+
+When an expression requires the use of temporary intermediate
+'mpf_class' values, like 'f=g*h+x*y', those temporaries will have the
+same precision as the destination 'f'. Explicit constructors can be
+used if this doesn't suit.
+
+ -- Function: mpf_class::mpf_class (type OP)
+ -- Function: mpf_class::mpf_class (type OP, mp_bitcnt_t PREC)
+ Construct an 'mpf_class'. Any standard C++ type can be used,
+ except 'long long' and 'long double', and any of the GMP C++
+ classes can be used.
+
+ If PREC is given, the initial precision is that value, in bits. If
+ PREC is not given, then the initial precision is determined by the
+ type of OP given. An 'mpz_class', 'mpq_class', or C++ builtin type
+ will give the default 'mpf' precision (*note Initializing
+ Floats::). An 'mpf_class' or expression will give the precision of
+ that value. The precision of a binary expression is the higher of
+ the two operands.
+
+ mpf_class f(1.5); // default precision
+ mpf_class f(1.5, 500); // 500 bits (at least)
+ mpf_class f(x); // precision of x
+ mpf_class f(abs(x)); // precision of x
+ mpf_class f(-g, 1000); // 1000 bits (at least)
+ mpf_class f(x+y); // greater of precisions of x and y
+
+ -- Function: explicit mpf_class::mpf_class (const mpf_t F)
+ -- Function: mpf_class::mpf_class (const mpf_t F, mp_bitcnt_t PREC)
+ Construct an 'mpf_class' from an 'mpf_t'. The value in F is copied
+ into the new 'mpf_class', there won't be any permanent association
+ between it and F.
+
+ If PREC is given, the initial precision is that value, in bits. If
+ PREC is not given, then the initial precision is that of F.
+
+ -- Function: explicit mpf_class::mpf_class (const char *S)
+ -- Function: mpf_class::mpf_class (const char *S, mp_bitcnt_t PREC, int
+ BASE = 0)
+ -- Function: explicit mpf_class::mpf_class (const string& S)
+ -- Function: mpf_class::mpf_class (const string& S, mp_bitcnt_t PREC,
+ int BASE = 0)
+ Construct an 'mpf_class' converted from a string using
+ 'mpf_set_str' (*note Assigning Floats::). If PREC is given, the
+ initial precision is that value, in bits. If not, the default
+ 'mpf' precision (*note Initializing Floats::) is used.
+
+ If the string is not a valid float, an 'std::invalid_argument'
+ exception is thrown. The same applies to 'operator='.
+
+ -- Function: mpf_class operator"" _mpf (const char *STR)
+ With C++11 compilers, floats can be constructed with the syntax
+ '1.23e-1_mpf' which is equivalent to 'mpf_class("1.23e-1")'.
+
+ -- Function: mpf_class& mpf_class::operator= (type OP)
+ Convert and store the given OP value to an 'mpf_class' object. The
+ same types are accepted as for the constructors above.
+
+ Note that 'operator=' only stores a new value, it doesn't copy or
+ change the precision of the destination, instead the value is
+ truncated if necessary. This is the same as 'mpf_set' etc. Note
+ in particular this means for 'mpf_class' a copy constructor is not
+ the same as a default constructor plus assignment.
+
+ mpf_class x (y); // x created with precision of y
+
+ mpf_class x; // x created with default precision
+ x = y; // value truncated to that precision
+
+ Applications using templated code may need to be careful about the
+ assumptions the code makes in this area, when working with
+ 'mpf_class' values of various different or non-default precisions.
+ For instance implementations of the standard 'complex' template
+ have been seen in both styles above, though of course 'complex' is
+ normally only actually specified for use with the builtin float
+ types.
+
+ -- Function: mpf_class abs (mpf_class OP)
+ -- Function: mpf_class ceil (mpf_class OP)
+ -- Function: int cmp (mpf_class OP1, type OP2)
+ -- Function: int cmp (type OP1, mpf_class OP2)
+
+ -- Function: bool mpf_class::fits_sint_p (void)
+ -- Function: bool mpf_class::fits_slong_p (void)
+ -- Function: bool mpf_class::fits_sshort_p (void)
+
+ -- Function: bool mpf_class::fits_uint_p (void)
+ -- Function: bool mpf_class::fits_ulong_p (void)
+ -- Function: bool mpf_class::fits_ushort_p (void)
+
+ -- Function: mpf_class floor (mpf_class OP)
+ -- Function: mpf_class hypot (mpf_class OP1, mpf_class OP2)
+
+ -- Function: double mpf_class::get_d (void)
+ -- Function: long mpf_class::get_si (void)
+ -- Function: string mpf_class::get_str (mp_exp_t& EXP, int BASE = 10,
+ size_t DIGITS = 0)
+ -- Function: unsigned long mpf_class::get_ui (void)
+
+ -- Function: int mpf_class::set_str (const char *STR, int BASE)
+ -- Function: int mpf_class::set_str (const string& STR, int BASE)
+ -- Function: int sgn (mpf_class OP)
+ -- Function: mpf_class sqrt (mpf_class OP)
+
+ -- Function: void mpf_class::swap (mpf_class& OP)
+ -- Function: void swap (mpf_class& OP1, mpf_class& OP2)
+ -- Function: mpf_class trunc (mpf_class OP)
+ These functions provide a C++ class interface to the corresponding
+ GMP C routines.
+
+ 'cmp' can be used with any of the classes or the standard C++
+ types, except 'long long' and 'long double'.
+
+ The accuracy provided by 'hypot' is not currently guaranteed.
+
+ -- Function: mp_bitcnt_t mpf_class::get_prec ()
+ -- Function: void mpf_class::set_prec (mp_bitcnt_t PREC)
+ -- Function: void mpf_class::set_prec_raw (mp_bitcnt_t PREC)
+ Get or set the current precision of an 'mpf_class'.
+
+ The restrictions described for 'mpf_set_prec_raw' (*note
+ Initializing Floats::) apply to 'mpf_class::set_prec_raw'. Note in
+ particular that the 'mpf_class' must be restored to its allocated
+ precision before being destroyed. This must be done by application
+ code, there's no automatic mechanism for it.
+
+\1f
+File: gmp.info, Node: C++ Interface Random Numbers, Next: C++ Interface Limitations, Prev: C++ Interface Floats, Up: C++ Class Interface
+
+12.5 C++ Interface Random Numbers
+=================================
+
+ -- Class: gmp_randclass
+ The C++ class interface to the GMP random number functions uses
+ 'gmp_randclass' to hold an algorithm selection and current state,
+ as per 'gmp_randstate_t'.
+
+ -- Function: gmp_randclass::gmp_randclass (void (*RANDINIT)
+ (gmp_randstate_t, ...), ...)
+ Construct a 'gmp_randclass', using a call to the given RANDINIT
+ function (*note Random State Initialization::). The arguments
+ expected are the same as RANDINIT, but with 'mpz_class' instead of
+ 'mpz_t'. For example,
+
+ gmp_randclass r1 (gmp_randinit_default);
+ gmp_randclass r2 (gmp_randinit_lc_2exp_size, 32);
+ gmp_randclass r3 (gmp_randinit_lc_2exp, a, c, m2exp);
+ gmp_randclass r4 (gmp_randinit_mt);
+
+ 'gmp_randinit_lc_2exp_size' will fail if the size requested is too
+ big, an 'std::length_error' exception is thrown in that case.
+
+ -- Function: gmp_randclass::gmp_randclass (gmp_randalg_t ALG, ...)
+ Construct a 'gmp_randclass' using the same parameters as
+ 'gmp_randinit' (*note Random State Initialization::). This
+ function is obsolete and the above RANDINIT style should be
+ preferred.
+
+ -- Function: void gmp_randclass::seed (unsigned long int S)
+ -- Function: void gmp_randclass::seed (mpz_class S)
+ Seed a random number generator. See *note Random Number
+ Functions::, for how to choose a good seed.
+
+ -- Function: mpz_class gmp_randclass::get_z_bits (mp_bitcnt_t BITS)
+ -- Function: mpz_class gmp_randclass::get_z_bits (mpz_class BITS)
+ Generate a random integer with a specified number of bits.
+
+ -- Function: mpz_class gmp_randclass::get_z_range (mpz_class N)
+ Generate a random integer in the range 0 to N-1 inclusive.
+
+ -- Function: mpf_class gmp_randclass::get_f ()
+ -- Function: mpf_class gmp_randclass::get_f (mp_bitcnt_t PREC)
+ Generate a random float F in the range 0 <= F < 1. F will be to
+ PREC bits precision, or if PREC is not given then to the precision
+ of the destination. For example,
+
+ gmp_randclass r;
+ ...
+ mpf_class f (0, 512); // 512 bits precision
+ f = r.get_f(); // random number, 512 bits
+
+\1f
+File: gmp.info, Node: C++ Interface Limitations, Prev: C++ Interface Random Numbers, Up: C++ Class Interface
+
+12.6 C++ Interface Limitations
+==============================
+
+'mpq_class' and Templated Reading
+ A generic piece of template code probably won't know that
+ 'mpq_class' requires a 'canonicalize' call if inputs read with
+ 'operator>>' might be non-canonical. This can lead to incorrect
+ results.
+
+ 'operator>>' behaves as it does for reasons of efficiency. A
+ canonicalize can be quite time consuming on large operands, and is
+ best avoided if it's not necessary.
+
+ But this potential difficulty reduces the usefulness of
+ 'mpq_class'. Perhaps a mechanism to tell 'operator>>' what to do
+ will be adopted in the future, maybe a preprocessor define, a
+ global flag, or an 'ios' flag pressed into service. Or maybe, at
+ the risk of inconsistency, the 'mpq_class' 'operator>>' could
+ canonicalize and leave 'mpq_t' 'operator>>' not doing so, for use
+ on those occasions when that's acceptable. Send feedback or
+ alternate ideas to <gmp-bugs@gmplib.org>.
+
+Subclassing
+ Subclassing the GMP C++ classes works, but is not currently
+ recommended.
+
+ Expressions involving subclasses resolve correctly (or seem to),
+ but in normal C++ fashion the subclass doesn't inherit constructors
+ and assignments. There's many of those in the GMP classes, and a
+ good way to reestablish them in a subclass is not yet provided.
+
+Templated Expressions
+ A subtle difficulty exists when using expressions together with
+ application-defined template functions. Consider the following,
+ with 'T' intended to be some numeric type,
+
+ template <class T>
+ T fun (const T &, const T &);
+
+ When used with, say, plain 'mpz_class' variables, it works fine:
+ 'T' is resolved as 'mpz_class'.
+
+ mpz_class f(1), g(2);
+ fun (f, g); // Good
+
+ But when one of the arguments is an expression, it doesn't work.
+
+ mpz_class f(1), g(2), h(3);
+ fun (f, g+h); // Bad
+
+ This is because 'g+h' ends up being a certain expression template
+ type internal to 'gmpxx.h', which the C++ template resolution rules
+ are unable to automatically convert to 'mpz_class'. The workaround
+ is simply to add an explicit cast.
+
+ mpz_class f(1), g(2), h(3);
+ fun (f, mpz_class(g+h)); // Good
+
+ Similarly, within 'fun' it may be necessary to cast an expression
+ to type 'T' when calling a templated 'fun2'.
+
+ template <class T>
+ void fun (T f, T g)
+ {
+ fun2 (f, f+g); // Bad
+ }
+
+ template <class T>
+ void fun (T f, T g)
+ {
+ fun2 (f, T(f+g)); // Good
+ }
+
+C++11
+ C++11 provides several new ways in which types can be inferred:
+ 'auto', 'decltype', etc. While they can be very convenient, they
+ don't mix well with expression templates. In this example, the
+ addition is performed twice, as if we had defined 'sum' as a macro.
+
+ mpz_class z = 33;
+ auto sum = z + z;
+ mpz_class prod = sum * sum;
+
+ This other example may crash, though some compilers might make it
+ look like it is working, because the expression 'z+z' goes out of
+ scope before it is evaluated.
+
+ mpz_class z = 33;
+ auto sum = z + z + z;
+ mpz_class prod = sum * 2;
+
+ It is thus strongly recommended to avoid 'auto' anywhere a GMP C++
+ expression may appear.
+
+\1f
+File: gmp.info, Node: Custom Allocation, Next: Language Bindings, Prev: C++ Class Interface, Up: Top
+
+13 Custom Allocation
+********************
+
+By default GMP uses 'malloc', 'realloc' and 'free' for memory
+allocation, and if they fail GMP prints a message to the standard error
+output and terminates the program.
+
+ Alternate functions can be specified, to allocate memory in a
+different way or to have a different error action on running out of
+memory.
+
+ -- Function: void mp_set_memory_functions (
+ void *(*ALLOC_FUNC_PTR) (size_t),
+ void *(*REALLOC_FUNC_PTR) (void *, size_t, size_t),
+ void (*FREE_FUNC_PTR) (void *, size_t))
+ Replace the current allocation functions from the arguments. If an
+ argument is 'NULL', the corresponding default function is used.
+
+ These functions will be used for all memory allocation done by GMP,
+ apart from temporary space from 'alloca' if that function is
+ available and GMP is configured to use it (*note Build Options::).
+
+ *Be sure to call 'mp_set_memory_functions' only when there are no
+ active GMP objects allocated using the previous memory functions!
+ Usually that means calling it before any other GMP function.*
+
+ The functions supplied should fit the following declarations:
+
+ -- Function: void * allocate_function (size_t ALLOC_SIZE)
+ Return a pointer to newly allocated space with at least ALLOC_SIZE
+ bytes.
+
+ -- Function: void * reallocate_function (void *PTR, size_t OLD_SIZE,
+ size_t NEW_SIZE)
+ Resize a previously allocated block PTR of OLD_SIZE bytes to be
+ NEW_SIZE bytes.
+
+ The block may be moved if necessary or if desired, and in that case
+ the smaller of OLD_SIZE and NEW_SIZE bytes must be copied to the
+ new location. The return value is a pointer to the resized block,
+ that being the new location if moved or just PTR if not.
+
+ PTR is never 'NULL', it's always a previously allocated block.
+ NEW_SIZE may be bigger or smaller than OLD_SIZE.
+
+ -- Function: void free_function (void *PTR, size_t SIZE)
+ De-allocate the space pointed to by PTR.
+
+ PTR is never 'NULL', it's always a previously allocated block of
+ SIZE bytes.
+
+ A "byte" here means the unit used by the 'sizeof' operator.
+
+ The REALLOCATE_FUNCTION parameter OLD_SIZE and the FREE_FUNCTION
+parameter SIZE are passed for convenience, but of course they can be
+ignored if not needed by an implementation. The default functions using
+'malloc' and friends for instance don't use them.
+
+ No error return is allowed from any of these functions, if they
+return then they must have performed the specified operation. In
+particular note that ALLOCATE_FUNCTION or REALLOCATE_FUNCTION mustn't
+return 'NULL'.
+
+ Getting a different fatal error action is a good use for custom
+allocation functions, for example giving a graphical dialog rather than
+the default print to 'stderr'. How much is possible when genuinely out
+of memory is another question though.
+
+ There's currently no defined way for the allocation functions to
+recover from an error such as out of memory, they must terminate program
+execution. A 'longjmp' or throwing a C++ exception will have undefined
+results. This may change in the future.
+
+ GMP may use allocated blocks to hold pointers to other allocated
+blocks. This will limit the assumptions a conservative garbage
+collection scheme can make.
+
+ Since the default GMP allocation uses 'malloc' and friends, those
+functions will be linked in even if the first thing a program does is an
+'mp_set_memory_functions'. It's necessary to change the GMP sources if
+this is a problem.
+
+
+ -- Function: void mp_get_memory_functions (
+ void *(**ALLOC_FUNC_PTR) (size_t),
+ void *(**REALLOC_FUNC_PTR) (void *, size_t, size_t),
+ void (**FREE_FUNC_PTR) (void *, size_t))
+ Get the current allocation functions, storing function pointers to
+ the locations given by the arguments. If an argument is 'NULL',
+ that function pointer is not stored.
+
+ For example, to get just the current free function,
+
+ void (*freefunc) (void *, size_t);
+
+ mp_get_memory_functions (NULL, NULL, &freefunc);
+
+\1f
+File: gmp.info, Node: Language Bindings, Next: Algorithms, Prev: Custom Allocation, Up: Top
+
+14 Language Bindings
+********************
+
+The following packages and projects offer access to GMP from languages
+other than C, though perhaps with varying levels of functionality and
+efficiency.
+
+
+C++
+ * GMP C++ class interface, *note C++ Class Interface::
+ Straightforward interface, expression templates to eliminate
+ temporaries.
+ * ALP <https://www-sop.inria.fr/saga/logiciels/ALP/>
+ Linear algebra and polynomials using templates.
+ * CLN <https://www.ginac.de/CLN/>
+ High level classes for arithmetic.
+ * Linbox <http://www.linalg.org/>
+ Sparse vectors and matrices.
+ * NTL <http://www.shoup.net/ntl/>
+ A C++ number theory library.
+
+Eiffel
+ * Eiffelroom <http://www.eiffelroom.org/node/442>
+
+Haskell
+ * Glasgow Haskell Compiler <https://www.haskell.org/ghc/>
+
+Java
+ * Kaffe <https://github.com/kaffe/kaffe>
+
+Lisp
+ * GNU Common Lisp <https://www.gnu.org/software/gcl/gcl.html>
+ * Librep <http://librep.sourceforge.net/>
+ * XEmacs (21.5.18 beta and up) <https://www.xemacs.org>
+ Optional big integers, rationals and floats using GMP.
+
+ML
+ * MLton compiler <http://mlton.org/>
+
+Objective Caml
+ * MLGMP <https://opam.ocaml.org/packages/mlgmp/>
+ * Numerix <http://pauillac.inria.fr/~quercia/>
+ Optionally using GMP.
+
+Oz
+ * Mozart <https://mozart.github.io/>
+
+Pascal
+ * GNU Pascal Compiler <http://www.gnu-pascal.de/>
+ GMP unit.
+ * Numerix <http://pauillac.inria.fr/~quercia/>
+ For Free Pascal, optionally using GMP.
+
+Perl
+ * GMP module, see 'demos/perl' in the GMP sources (*note
+ Demonstration Programs::).
+ * Math::GMP <https://www.cpan.org/>
+ Compatible with Math::BigInt, but not as many functions as the
+ GMP module above.
+ * Math::BigInt::GMP <https://www.cpan.org/>
+ Plug Math::GMP into normal Math::BigInt operations.
+
+Pike
+ * pikempz module in the standard distribution,
+ <https://pike.lysator.liu.se/>
+
+Prolog
+ * SWI Prolog <http://www.swi-prolog.org/>
+ Arbitrary precision floats.
+
+Python
+ * GMPY <https://code.google.com/p/gmpy/>
+
+Ruby
+ * <https://rubygems.org/gems/gmp>
+
+Scheme
+ * GNU Guile <https://www.gnu.org/software/guile/guile.html>
+ * RScheme <https://www.rscheme.org/>
+ * STklos <http://www.stklos.net/>
+
+Smalltalk
+ * GNU Smalltalk <http://smalltalk.gnu.org/>
+
+Other
+ * Axiom <https://savannah.nongnu.org/projects/axiom>
+ Computer algebra using GCL.
+ * DrGenius <http://drgenius.seul.org/>
+ Geometry system and mathematical programming language.
+ * GiNaC <httsp://www.ginac.de/>
+ C++ computer algebra using CLN.
+ * GOO <https://www.eecs.berkeley.edu/~jrb/goo/>
+ Dynamic object oriented language.
+ * Maxima <https://www.ma.utexas.edu/users/wfs/maxima.html>
+ Macsyma computer algebra using GCL.
+ * Regina <http://regina.sourceforge.net/>
+ Topological calculator.
+ * Yacas <http://yacas.sourceforge.net>
+ Yet another computer algebra system.
+
+\1f
+File: gmp.info, Node: Algorithms, Next: Internals, Prev: Language Bindings, Up: Top
+
+15 Algorithms
+*************
+
+This chapter is an introduction to some of the algorithms used for
+various GMP operations. The code is likely to be hard to understand
+without knowing something about the algorithms.
+
+ Some GMP internals are mentioned, but applications that expect to be
+compatible with future GMP releases should take care to use only the
+documented functions.
+
+* Menu:
+
+* Multiplication Algorithms::
+* Division Algorithms::
+* Greatest Common Divisor Algorithms::
+* Powering Algorithms::
+* Root Extraction Algorithms::
+* Radix Conversion Algorithms::
+* Other Algorithms::
+* Assembly Coding::
+
+\1f
+File: gmp.info, Node: Multiplication Algorithms, Next: Division Algorithms, Prev: Algorithms, Up: Algorithms
+
+15.1 Multiplication
+===================
+
+NxN limb multiplications and squares are done using one of seven
+algorithms, as the size N increases.
+
+ Algorithm Threshold
+ Basecase (none)
+ Karatsuba 'MUL_TOOM22_THRESHOLD'
+ Toom-3 'MUL_TOOM33_THRESHOLD'
+ Toom-4 'MUL_TOOM44_THRESHOLD'
+ Toom-6.5 'MUL_TOOM6H_THRESHOLD'
+ Toom-8.5 'MUL_TOOM8H_THRESHOLD'
+ FFT 'MUL_FFT_THRESHOLD'
+
+ Similarly for squaring, with the 'SQR' thresholds.
+
+ NxM multiplications of operands with different sizes above
+'MUL_TOOM22_THRESHOLD' are currently done by special Toom-inspired
+algorithms or directly with FFT, depending on operand size (*note
+Unbalanced Multiplication::).
+
+* Menu:
+
+* Basecase Multiplication::
+* Karatsuba Multiplication::
+* Toom 3-Way Multiplication::
+* Toom 4-Way Multiplication::
+* Higher degree Toom'n'half::
+* FFT Multiplication::
+* Other Multiplication::
+* Unbalanced Multiplication::
+
+\1f
+File: gmp.info, Node: Basecase Multiplication, Next: Karatsuba Multiplication, Prev: Multiplication Algorithms, Up: Multiplication Algorithms
+
+15.1.1 Basecase Multiplication
+------------------------------
+
+Basecase NxM multiplication is a straightforward rectangular set of
+cross-products, the same as long multiplication done by hand and for
+that reason sometimes known as the schoolbook or grammar school method.
+This is an O(N*M) algorithm. See Knuth section 4.3.1 algorithm M (*note
+References::), and the 'mpn/generic/mul_basecase.c' code.
+
+ Assembly implementations of 'mpn_mul_basecase' are essentially the
+same as the generic C code, but have all the usual assembly tricks and
+obscurities introduced for speed.
+
+ A square can be done in roughly half the time of a multiply, by using
+the fact that the cross products above and below the diagonal are the
+same. A triangle of products below the diagonal is formed, doubled
+(left shift by one bit), and then the products on the diagonal added.
+This can be seen in 'mpn/generic/sqr_basecase.c'. Again the assembly
+implementations take essentially the same approach.
+
+ u0 u1 u2 u3 u4
+ +---+---+---+---+---+
+ u0 | d | | | | |
+ +---+---+---+---+---+
+ u1 | | d | | | |
+ +---+---+---+---+---+
+ u2 | | | d | | |
+ +---+---+---+---+---+
+ u3 | | | | d | |
+ +---+---+---+---+---+
+ u4 | | | | | d |
+ +---+---+---+---+---+
+
+ In practice squaring isn't a full 2x faster than multiplying, it's
+usually around 1.5x. Less than 1.5x probably indicates
+'mpn_sqr_basecase' wants improving on that CPU.
+
+ On some CPUs 'mpn_mul_basecase' can be faster than the generic C
+'mpn_sqr_basecase' on some small sizes. 'SQR_BASECASE_THRESHOLD' is the
+size at which to use 'mpn_sqr_basecase', this will be zero if that
+routine should be used always.
+
+\1f
+File: gmp.info, Node: Karatsuba Multiplication, Next: Toom 3-Way Multiplication, Prev: Basecase Multiplication, Up: Multiplication Algorithms
+
+15.1.2 Karatsuba Multiplication
+-------------------------------
+
+The Karatsuba multiplication algorithm is described in Knuth section
+4.3.3 part A, and various other textbooks. A brief description is given
+here.
+
+ The inputs x and y are treated as each split into two parts of equal
+length (or the most significant part one limb shorter if N is odd).
+
+ high low
+ +----------+----------+
+ | x1 | x0 |
+ +----------+----------+
+
+ +----------+----------+
+ | y1 | y0 |
+ +----------+----------+
+
+ Let b be the power of 2 where the split occurs, i.e. if x0 is k limbs
+(y0 the same) then b=2^(k*mp_bits_per_limb). With that x=x1*b+x0 and
+y=y1*b+y0, and the following holds,
+
+ x*y = (b^2+b)*x1*y1 - b*(x1-x0)*(y1-y0) + (b+1)*x0*y0
+
+ This formula means doing only three multiplies of (N/2)x(N/2) limbs,
+whereas a basecase multiply of NxN limbs is equivalent to four
+multiplies of (N/2)x(N/2). The factors (b^2+b) etc represent the
+positions where the three products must be added.
+
+ high low
+ +--------+--------+ +--------+--------+
+ | x1*y1 | | x0*y0 |
+ +--------+--------+ +--------+--------+
+ +--------+--------+
+ add | x1*y1 |
+ +--------+--------+
+ +--------+--------+
+ add | x0*y0 |
+ +--------+--------+
+ +--------+--------+
+ sub | (x1-x0)*(y1-y0) |
+ +--------+--------+
+
+ The term (x1-x0)*(y1-y0) is best calculated as an absolute value, and
+the sign used to choose to add or subtract. Notice the sum
+high(x0*y0)+low(x1*y1) occurs twice, so it's possible to do 5*k limb
+additions, rather than 6*k, but in GMP extra function call overheads
+outweigh the saving.
+
+ Squaring is similar to multiplying, but with x=y the formula reduces
+to an equivalent with three squares,
+
+ x^2 = (b^2+b)*x1^2 - b*(x1-x0)^2 + (b+1)*x0^2
+
+ The final result is accumulated from those three squares the same way
+as for the three multiplies above. The middle term (x1-x0)^2 is now
+always positive.
+
+ A similar formula for both multiplying and squaring can be
+constructed with a middle term (x1+x0)*(y1+y0). But those sums can
+exceed k limbs, leading to more carry handling and additions than the
+form above.
+
+ Karatsuba multiplication is asymptotically an O(N^1.585) algorithm,
+the exponent being log(3)/log(2), representing 3 multiplies each 1/2 the
+size of the inputs. This is a big improvement over the basecase
+multiply at O(N^2) and the advantage soon overcomes the extra additions
+Karatsuba performs. 'MUL_TOOM22_THRESHOLD' can be as little as 10
+limbs. The 'SQR' threshold is usually about twice the 'MUL'.
+
+ The basecase algorithm will take a time of the form M(N) = a*N^2 +
+b*N + c and the Karatsuba algorithm K(N) = 3*M(N/2) + d*N + e, which
+expands to K(N) = 3/4*a*N^2 + 3/2*b*N + 3*c + d*N + e. The factor 3/4
+for a means per-crossproduct speedups in the basecase code will increase
+the threshold since they benefit M(N) more than K(N). And conversely the
+3/2 for b means linear style speedups of b will increase the threshold
+since they benefit K(N) more than M(N). The latter can be seen for
+instance when adding an optimized 'mpn_sqr_diagonal' to
+'mpn_sqr_basecase'. Of course all speedups reduce total time, and in
+that sense the algorithm thresholds are merely of academic interest.
+
+\1f
+File: gmp.info, Node: Toom 3-Way Multiplication, Next: Toom 4-Way Multiplication, Prev: Karatsuba Multiplication, Up: Multiplication Algorithms
+
+15.1.3 Toom 3-Way Multiplication
+--------------------------------
+
+The Karatsuba formula is the simplest case of a general approach to
+splitting inputs that leads to both Toom and FFT algorithms. A
+description of Toom can be found in Knuth section 4.3.3, with an example
+3-way calculation after Theorem A. The 3-way form used in GMP is
+described here.
+
+ The operands are each considered split into 3 pieces of equal length
+(or the most significant part 1 or 2 limbs shorter than the other two).
+
+ high low
+ +----------+----------+----------+
+ | x2 | x1 | x0 |
+ +----------+----------+----------+
+
+ +----------+----------+----------+
+ | y2 | y1 | y0 |
+ +----------+----------+----------+
+
+These parts are treated as the coefficients of two polynomials
+
+ X(t) = x2*t^2 + x1*t + x0
+ Y(t) = y2*t^2 + y1*t + y0
+
+ Let b equal the power of 2 which is the size of the x0, x1, y0 and y1
+pieces, i.e. if they're k limbs each then b=2^(k*mp_bits_per_limb).
+With this x=X(b) and y=Y(b).
+
+ Let a polynomial W(t)=X(t)*Y(t) and suppose its coefficients are
+
+ W(t) = w4*t^4 + w3*t^3 + w2*t^2 + w1*t + w0
+
+ The w[i] are going to be determined, and when they are they'll give
+the final result using w=W(b), since x*y=X(b)*Y(b)=W(b). The
+coefficients will be roughly b^2 each, and the final W(b) will be an
+addition like this:
+
+ high low
+ +-------+-------+
+ | w4 |
+ +-------+-------+
+ +--------+-------+
+ | w3 |
+ +--------+-------+
+ +--------+-------+
+ | w2 |
+ +--------+-------+
+ +--------+-------+
+ | w1 |
+ +--------+-------+
+ +-------+-------+
+ | w0 |
+ +-------+-------+
+
+ The w[i] coefficients could be formed by a simple set of cross
+products, like w4=x2*y2, w3=x2*y1+x1*y2, w2=x2*y0+x1*y1+x0*y2 etc, but
+this would need all nine x[i]*y[j] for i,j=0,1,2, and would be
+equivalent merely to a basecase multiply. Instead the following
+approach is used.
+
+ X(t) and Y(t) are evaluated and multiplied at 5 points, giving values
+of W(t) at those points. In GMP the following points are used:
+
+ Point Value
+ t=0 x0 * y0, which gives w0 immediately
+ t=1 (x2+x1+x0) * (y2+y1+y0)
+ t=-1 (x2-x1+x0) * (y2-y1+y0)
+ t=2 (4*x2+2*x1+x0) * (4*y2+2*y1+y0)
+ t=inf x2 * y2, which gives w4 immediately
+
+ At t=-1 the values can be negative and that's handled using the
+absolute values and tracking the sign separately. At t=inf the value is
+actually X(t)*Y(t)/t^4 in the limit as t approaches infinity, but it's
+much easier to think of as simply x2*y2 giving w4 immediately (much like
+x0*y0 at t=0 gives w0 immediately).
+
+ Each of the points substituted into W(t)=w4*t^4+...+w0 gives a linear
+combination of the w[i] coefficients, and the value of those
+combinations has just been calculated.
+
+ W(0) = w0
+ W(1) = w4 + w3 + w2 + w1 + w0
+ W(-1) = w4 - w3 + w2 - w1 + w0
+ W(2) = 16*w4 + 8*w3 + 4*w2 + 2*w1 + w0
+ W(inf) = w4
+
+ This is a set of five equations in five unknowns, and some elementary
+linear algebra quickly isolates each w[i]. This involves adding or
+subtracting one W(t) value from another, and a couple of divisions by
+powers of 2 and one division by 3, the latter using the special
+'mpn_divexact_by3' (*note Exact Division::).
+
+ The conversion of W(t) values to the coefficients is interpolation.
+A polynomial of degree 4 like W(t) is uniquely determined by values
+known at 5 different points. The points are arbitrary and can be chosen
+to make the linear equations come out with a convenient set of steps for
+quickly isolating the w[i].
+
+ Squaring follows the same procedure as multiplication, but there's
+only one X(t) and it's evaluated at the 5 points, and those values
+squared to give values of W(t). The interpolation is then identical,
+and in fact the same 'toom_interpolate_5pts' subroutine is used for both
+squaring and multiplying.
+
+ Toom-3 is asymptotically O(N^1.465), the exponent being
+log(5)/log(3), representing 5 recursive multiplies of 1/3 the original
+size each. This is an improvement over Karatsuba at O(N^1.585), though
+Toom does more work in the evaluation and interpolation and so it only
+realizes its advantage above a certain size.
+
+ Near the crossover between Toom-3 and Karatsuba there's generally a
+range of sizes where the difference between the two is small.
+'MUL_TOOM33_THRESHOLD' is a somewhat arbitrary point in that range and
+successive runs of the tune program can give different values due to
+small variations in measuring. A graph of time versus size for the two
+shows the effect, see 'tune/README'.
+
+ At the fairly small sizes where the Toom-3 thresholds occur it's
+worth remembering that the asymptotic behaviour for Karatsuba and Toom-3
+can't be expected to make accurate predictions, due of course to the big
+influence of all sorts of overheads, and the fact that only a few
+recursions of each are being performed. Even at large sizes there's a
+good chance machine dependent effects like cache architecture will mean
+actual performance deviates from what might be predicted.
+
+ The formula given for the Karatsuba algorithm (*note Karatsuba
+Multiplication::) has an equivalent for Toom-3 involving only five
+multiplies, but this would be complicated and unenlightening.
+
+ An alternate view of Toom-3 can be found in Zuras (*note
+References::), using a vector to represent the x and y splits and a
+matrix multiplication for the evaluation and interpolation stages. The
+matrix inverses are not meant to be actually used, and they have
+elements with values much greater than in fact arise in the
+interpolation steps. The diagram shown for the 3-way is attractive, but
+again doesn't have to be implemented that way and for example with a bit
+of rearrangement just one division by 6 can be done.
+
+\1f
+File: gmp.info, Node: Toom 4-Way Multiplication, Next: Higher degree Toom'n'half, Prev: Toom 3-Way Multiplication, Up: Multiplication Algorithms
+
+15.1.4 Toom 4-Way Multiplication
+--------------------------------
+
+Karatsuba and Toom-3 split the operands into 2 and 3 coefficients,
+respectively. Toom-4 analogously splits the operands into 4
+coefficients. Using the notation from the section on Toom-3
+multiplication, we form two polynomials:
+
+ X(t) = x3*t^3 + x2*t^2 + x1*t + x0
+ Y(t) = y3*t^3 + y2*t^2 + y1*t + y0
+
+ X(t) and Y(t) are evaluated and multiplied at 7 points, giving values
+of W(t) at those points. In GMP the following points are used,
+
+ Point Value
+ t=0 x0 * y0, which gives w0 immediately
+ t=1/2 (x3+2*x2+4*x1+8*x0) * (y3+2*y2+4*y1+8*y0)
+ t=-1/2 (-x3+2*x2-4*x1+8*x0) * (-y3+2*y2-4*y1+8*y0)
+ t=1 (x3+x2+x1+x0) * (y3+y2+y1+y0)
+ t=-1 (-x3+x2-x1+x0) * (-y3+y2-y1+y0)
+ t=2 (8*x3+4*x2+2*x1+x0) * (8*y3+4*y2+2*y1+y0)
+ t=inf x3 * y3, which gives w6 immediately
+
+ The number of additions and subtractions for Toom-4 is much larger
+than for Toom-3. But several subexpressions occur multiple times, for
+example x2+x0 occurs for both t=1 and t=-1.
+
+ Toom-4 is asymptotically O(N^1.404), the exponent being
+log(7)/log(4), representing 7 recursive multiplies of 1/4 the original
+size each.
+
+\1f
+File: gmp.info, Node: Higher degree Toom'n'half, Next: FFT Multiplication, Prev: Toom 4-Way Multiplication, Up: Multiplication Algorithms
+
+15.1.5 Higher degree Toom'n'half
+--------------------------------
+
+The Toom algorithms described above (*note Toom 3-Way Multiplication::,
+*note Toom 4-Way Multiplication::) generalize to split into an arbitrary
+number of pieces. In general a split of two equally long operands into
+r pieces leads to evaluations and pointwise multiplications done at
+2*r-1 points. To fully exploit symmetries it would be better to have a
+multiple of 4 points, that's why for higher degree Toom'n'half is used.
+
+ Toom'n'half means that the existence of one more piece is considered
+for a single operand. It can be virtual, i.e. zero, or real, when the
+two operands are not exactly balanced. By choosing an even r,
+Toom-r+1/2 requires 2r points, a multiple of four.
+
+ The quadruplets of points include 0, inf, +1, and +-2^i, +-2^-i.
+Each of them giving shortcuts for the evaluation phase and for some
+steps in the interpolation phase. Further tricks are used to reduce the
+memory footprint of the whole multiplication algorithm to a memory
+buffer equal in size to the result of the product.
+
+ Current GMP uses both Toom-6'n'half and Toom-8'n'half.
+
+\1f
+File: gmp.info, Node: FFT Multiplication, Next: Other Multiplication, Prev: Higher degree Toom'n'half, Up: Multiplication Algorithms
+
+15.1.6 FFT Multiplication
+-------------------------
+
+At large to very large sizes a Fermat style FFT multiplication is used,
+following Schönhage and Strassen (*note References::). Descriptions of
+FFTs in various forms can be found in many textbooks, for instance Knuth
+section 4.3.3 part C or Lipson chapter IX. A brief description of the
+form used in GMP is given here.
+
+ The multiplication done is x*y mod 2^N+1, for a given N. A full
+product x*y is obtained by choosing N>=bits(x)+bits(y) and padding x and
+y with high zero limbs. The modular product is the native form for the
+algorithm, so padding to get a full product is unavoidable.
+
+ The algorithm follows a split, evaluate, pointwise multiply,
+interpolate and combine similar to that described above for Karatsuba
+and Toom-3. A k parameter controls the split, with an FFT-k splitting
+into 2^k pieces of M=N/2^k bits each. N must be a multiple of
+(2^k)*mp_bits_per_limb so the split falls on limb boundaries, avoiding
+bit shifts in the split and combine stages.
+
+ The evaluations, pointwise multiplications, and interpolation are all
+done modulo 2^N'+1 where N' is 2M+k+3 rounded up to a multiple of 2^k
+and of 'mp_bits_per_limb'. The results of interpolation will be the
+following negacyclic convolution of the input pieces, and the choice of
+N' ensures these sums aren't truncated.
+
+ ---
+ \ b
+ w[n] = / (-1) * x[i] * y[j]
+ ---
+ i+j==b*2^k+n
+ b=0,1
+
+ The points used for the evaluation are g^i for i=0 to 2^k-1 where
+g=2^(2N'/2^k). g is a 2^k'th root of unity mod 2^N'+1, which produces
+necessary cancellations at the interpolation stage, and it's also a
+power of 2 so the fast Fourier transforms used for the evaluation and
+interpolation do only shifts, adds and negations.
+
+ The pointwise multiplications are done modulo 2^N'+1 and either
+recurse into a further FFT or use a plain multiplication (Toom-3,
+Karatsuba or basecase), whichever is optimal at the size N'. The
+interpolation is an inverse fast Fourier transform. The resulting set
+of sums of x[i]*y[j] are added at appropriate offsets to give the final
+result.
+
+ Squaring is the same, but x is the only input so it's one transform
+at the evaluate stage and the pointwise multiplies are squares. The
+interpolation is the same.
+
+ For a mod 2^N+1 product, an FFT-k is an O(N^(k/(k-1))) algorithm, the
+exponent representing 2^k recursed modular multiplies each 1/2^(k-1) the
+size of the original. Each successive k is an asymptotic improvement,
+but overheads mean each is only faster at bigger and bigger sizes. In
+the code, 'MUL_FFT_TABLE' and 'SQR_FFT_TABLE' are the thresholds where
+each k is used. Each new k effectively swaps some multiplying for some
+shifts, adds and overheads.
+
+ A mod 2^N+1 product can be formed with a normal NxN->2N bit multiply
+plus a subtraction, so an FFT and Toom-3 etc can be compared directly.
+A k=4 FFT at O(N^1.333) can be expected to be the first faster than
+Toom-3 at O(N^1.465). In practice this is what's found, with
+'MUL_FFT_MODF_THRESHOLD' and 'SQR_FFT_MODF_THRESHOLD' being between 300
+and 1000 limbs, depending on the CPU. So far it's been found that only
+very large FFTs recurse into pointwise multiplies above these sizes.
+
+ When an FFT is to give a full product, the change of N to 2N doesn't
+alter the theoretical complexity for a given k, but for the purposes of
+considering where an FFT might be first used it can be assumed that the
+FFT is recursing into a normal multiply and that on that basis it's
+doing 2^k recursed multiplies each 1/2^(k-2) the size of the inputs,
+making it O(N^(k/(k-2))). This would mean k=7 at O(N^1.4) would be the
+first FFT faster than Toom-3. In practice 'MUL_FFT_THRESHOLD' and
+'SQR_FFT_THRESHOLD' have been found to be in the k=8 range, somewhere
+between 3000 and 10000 limbs.
+
+ The way N is split into 2^k pieces and then 2M+k+3 is rounded up to a
+multiple of 2^k and 'mp_bits_per_limb' means that when
+2^k>=mp\_bits\_per\_limb the effective N is a multiple of 2^(2k-1) bits.
+The +k+3 means some values of N just under such a multiple will be
+rounded to the next. The complexity calculations above assume that a
+favourable size is used, meaning one which isn't padded through
+rounding, and it's also assumed that the extra +k+3 bits are negligible
+at typical FFT sizes.
+
+ The practical effect of the 2^(2k-1) constraint is to introduce a
+step-effect into measured speeds. For example k=8 will round N up to a
+multiple of 32768 bits, so for a 32-bit limb there'll be 512 limb groups
+of sizes for which 'mpn_mul_n' runs at the same speed. Or for k=9
+groups of 2048 limbs, k=10 groups of 8192 limbs, etc. In practice it's
+been found each k is used at quite small multiples of its size
+constraint and so the step effect is quite noticeable in a time versus
+size graph.
+
+ The threshold determinations currently measure at the mid-points of
+size steps, but this is sub-optimal since at the start of a new step it
+can happen that it's better to go back to the previous k for a while.
+Something more sophisticated for 'MUL_FFT_TABLE' and 'SQR_FFT_TABLE'
+will be needed.
+
+\1f
+File: gmp.info, Node: Other Multiplication, Next: Unbalanced Multiplication, Prev: FFT Multiplication, Up: Multiplication Algorithms
+
+15.1.7 Other Multiplication
+---------------------------
+
+The Toom algorithms described above (*note Toom 3-Way Multiplication::,
+*note Toom 4-Way Multiplication::) generalizes to split into an
+arbitrary number of pieces, as per Knuth section 4.3.3 algorithm C.
+This is not currently used. The notes here are merely for interest.
+
+ In general a split into r+1 pieces is made, and evaluations and
+pointwise multiplications done at 2*r+1 points. A 4-way split does 7
+pointwise multiplies, 5-way does 9, etc. Asymptotically an (r+1)-way
+algorithm is O(N^(log(2*r+1)/log(r+1))). Only the pointwise
+multiplications count towards big-O complexity, but the time spent in
+the evaluate and interpolate stages grows with r and has a significant
+practical impact, with the asymptotic advantage of each r realized only
+at bigger and bigger sizes. The overheads grow as O(N*r), whereas in an
+r=2^k FFT they grow only as O(N*log(r)).
+
+ Knuth algorithm C evaluates at points 0,1,2,...,2*r, but exercise 4
+uses -r,...,0,...,r and the latter saves some small multiplies in the
+evaluate stage (or rather trades them for additions), and has a further
+saving of nearly half the interpolate steps. The idea is to separate
+odd and even final coefficients and then perform algorithm C steps C7
+and C8 on them separately. The divisors at step C7 become j^2 and the
+multipliers at C8 become 2*t*j-j^2.
+
+ Splitting odd and even parts through positive and negative points can
+be thought of as using -1 as a square root of unity. If a 4th root of
+unity was available then a further split and speedup would be possible,
+but no such root exists for plain integers. Going to complex integers
+with i=sqrt(-1) doesn't help, essentially because in Cartesian form it
+takes three real multiplies to do a complex multiply. The existence of
+2^k'th roots of unity in a suitable ring or field lets the fast Fourier
+transform keep splitting and get to O(N*log(r)).
+
+ Floating point FFTs use complex numbers approximating Nth roots of
+unity. Some processors have special support for such FFTs. But these
+are not used in GMP since it's very difficult to guarantee an exact
+result (to some number of bits). An occasional difference of 1 in the
+last bit might not matter to a typical signal processing algorithm, but
+is of course of vital importance to GMP.
+
+\1f
+File: gmp.info, Node: Unbalanced Multiplication, Prev: Other Multiplication, Up: Multiplication Algorithms
+
+15.1.8 Unbalanced Multiplication
+--------------------------------
+
+Multiplication of operands with different sizes, both below
+'MUL_TOOM22_THRESHOLD' are done with plain schoolbook multiplication
+(*note Basecase Multiplication::).
+
+ For really large operands, we invoke FFT directly.
+
+ For operands between these sizes, we use Toom inspired algorithms
+suggested by Alberto Zanoni and Marco Bodrato. The idea is to split the
+operands into polynomials of different degree. GMP currently splits the
+smaller operand into 2 coefficients, i.e., a polynomial of degree 1, but
+the larger operand can be split into 2, 3, or 4 coefficients, i.e., a
+polynomial of degree 1 to 3.
+
+\1f
+File: gmp.info, Node: Division Algorithms, Next: Greatest Common Divisor Algorithms, Prev: Multiplication Algorithms, Up: Algorithms
+
+15.2 Division Algorithms
+========================
+
+* Menu:
+
+* Single Limb Division::
+* Basecase Division::
+* Divide and Conquer Division::
+* Block-Wise Barrett Division::
+* Exact Division::
+* Exact Remainder::
+* Small Quotient Division::
+
+\1f
+File: gmp.info, Node: Single Limb Division, Next: Basecase Division, Prev: Division Algorithms, Up: Division Algorithms
+
+15.2.1 Single Limb Division
+---------------------------
+
+Nx1 division is implemented using repeated 2x1 divisions from high to
+low, either with a hardware divide instruction or a multiplication by
+inverse, whichever is best on a given CPU.
+
+ The multiply by inverse follows "Improved division by invariant
+integers" by Möller and Granlund (*note References::) and is implemented
+as 'udiv_qrnnd_preinv' in 'gmp-impl.h'. The idea is to have a
+fixed-point approximation to 1/d (see 'invert_limb') and then multiply
+by the high limb (plus one bit) of the dividend to get a quotient q.
+With d normalized (high bit set), q is no more than 1 too small.
+Subtracting q*d from the dividend gives a remainder, and reveals whether
+q or q-1 is correct.
+
+ The result is a division done with two multiplications and four or
+five arithmetic operations. On CPUs with low latency multipliers this
+can be much faster than a hardware divide, though the cost of
+calculating the inverse at the start may mean it's only better on inputs
+bigger than say 4 or 5 limbs.
+
+ When a divisor must be normalized, either for the generic C
+'__udiv_qrnnd_c' or the multiply by inverse, the division performed is
+actually a*2^k by d*2^k where a is the dividend and k is the power
+necessary to have the high bit of d*2^k set. The bit shifts for the
+dividend are usually accomplished "on the fly" meaning by extracting the
+appropriate bits at each step. Done this way the quotient limbs come
+out aligned ready to store. When only the remainder is wanted, an
+alternative is to take the dividend limbs unshifted and calculate r = a
+mod d*2^k followed by an extra final step r*2^k mod d*2^k. This can
+help on CPUs with poor bit shifts or few registers.
+
+ The multiply by inverse can be done two limbs at a time. The
+calculation is basically the same, but the inverse is two limbs and the
+divisor treated as if padded with a low zero limb. This means more
+work, since the inverse will need a 2x2 multiply, but the four 1x1s to
+do that are independent and can therefore be done partly or wholly in
+parallel. Likewise for a 2x1 calculating q*d. The net effect is to
+process two limbs with roughly the same two multiplies worth of latency
+that one limb at a time gives. This extends to 3 or 4 limbs at a time,
+though the extra work to apply the inverse will almost certainly soon
+reach the limits of multiplier throughput.
+
+ A similar approach in reverse can be taken to process just half a
+limb at a time if the divisor is only a half limb. In this case the 1x1
+multiply for the inverse effectively becomes two (1/2)x1 for each limb,
+which can be a saving on CPUs with a fast half limb multiply, or in fact
+if the only multiply is a half limb, and especially if it's not
+pipelined.
+
+\1f
+File: gmp.info, Node: Basecase Division, Next: Divide and Conquer Division, Prev: Single Limb Division, Up: Division Algorithms
+
+15.2.2 Basecase Division
+------------------------
+
+Basecase NxM division is like long division done by hand, but in base
+2^mp_bits_per_limb. See Knuth section 4.3.1 algorithm D, and
+'mpn/generic/sb_divrem_mn.c'.
+
+ Briefly stated, while the dividend remains larger than the divisor, a
+high quotient limb is formed and the Nx1 product q*d subtracted at the
+top end of the dividend. With a normalized divisor (most significant
+bit set), each quotient limb can be formed with a 2x1 division and a 1x1
+multiplication plus some subtractions. The 2x1 division is by the high
+limb of the divisor and is done either with a hardware divide or a
+multiply by inverse (the same as in *note Single Limb Division::)
+whichever is faster. Such a quotient is sometimes one too big,
+requiring an addback of the divisor, but that happens rarely.
+
+ With Q=N-M being the number of quotient limbs, this is an O(Q*M)
+algorithm and will run at a speed similar to a basecase QxM
+multiplication, differing in fact only in the extra multiply and divide
+for each of the Q quotient limbs.
+
--- /dev/null
+This is gmp.info, produced by makeinfo version 6.7 from gmp.texi.
+
+This manual describes how to install and use the GNU multiple precision
+arithmetic library, version 6.3.0.
+
+ Copyright 1991, 1993-2016, 2018-2020 Free Software Foundation, Inc.
+
+ Permission is granted to copy, distribute and/or modify this document
+under the terms of the GNU Free Documentation License, Version 1.3 or
+any later version published by the Free Software Foundation; with no
+Invariant Sections, with the Front-Cover Texts being "A GNU Manual", and
+with the Back-Cover Texts being "You have freedom to copy and modify
+this GNU Manual, like GNU software". A copy of the license is included
+in *note GNU Free Documentation License::.
+INFO-DIR-SECTION GNU libraries
+START-INFO-DIR-ENTRY
+* gmp: (gmp). GNU Multiple Precision Arithmetic Library.
+END-INFO-DIR-ENTRY
+
+\1f
+File: gmp.info, Node: Divide and Conquer Division, Next: Block-Wise Barrett Division, Prev: Basecase Division, Up: Division Algorithms
+
+15.2.3 Divide and Conquer Division
+----------------------------------
+
+For divisors larger than 'DC_DIV_QR_THRESHOLD', division is done by
+dividing. Or to be precise by a recursive divide and conquer algorithm
+based on work by Moenck and Borodin, Jebelean, and Burnikel and Ziegler
+(*note References::).
+
+ The algorithm consists essentially of recognising that a 2NxN
+division can be done with the basecase division algorithm (*note
+Basecase Division::), but using N/2 limbs as a base, not just a single
+limb. This way the multiplications that arise are (N/2)x(N/2) and can
+take advantage of Karatsuba and higher multiplication algorithms (*note
+Multiplication Algorithms::). The two "digits" of the quotient are
+formed by recursive Nx(N/2) divisions.
+
+ If the (N/2)x(N/2) multiplies are done with a basecase multiplication
+then the work is about the same as a basecase division, but with more
+function call overheads and with some subtractions separated from the
+multiplies. These overheads mean that it's only when N/2 is above
+'MUL_TOOM22_THRESHOLD' that divide and conquer is of use.
+
+ 'DC_DIV_QR_THRESHOLD' is based on the divisor size N, so it will be
+somewhere above twice 'MUL_TOOM22_THRESHOLD', but how much above depends
+on the CPU. An optimized 'mpn_mul_basecase' can lower
+'DC_DIV_QR_THRESHOLD' a little by offering a ready-made advantage over
+repeated 'mpn_submul_1' calls.
+
+ Divide and conquer is asymptotically O(M(N)*log(N)) where M(N) is the
+time for an NxN multiplication done with FFTs. The actual time is a sum
+over multiplications of the recursed sizes, as can be seen near the end
+of section 2.2 of Burnikel and Ziegler. For example, within the Toom-3
+range, divide and conquer is 2.63*M(N). With higher algorithms the M(N)
+term improves and the multiplier tends to log(N). In practice, at
+moderate to large sizes, a 2NxN division is about 2 to 4 times slower
+than an NxN multiplication.
+
+\1f
+File: gmp.info, Node: Block-Wise Barrett Division, Next: Exact Division, Prev: Divide and Conquer Division, Up: Division Algorithms
+
+15.2.4 Block-Wise Barrett Division
+----------------------------------
+
+For the largest divisions, a block-wise Barrett division algorithm is
+used. Here, the divisor is inverted to a precision determined by the
+relative size of the dividend and divisor. Blocks of quotient limbs are
+then generated by multiplying blocks from the dividend by the inverse.
+
+ Our block-wise algorithm computes a smaller inverse than in the plain
+Barrett algorithm. For a 2n/n division, the inverse will be just
+ceil(n/2) limbs.
+
+\1f
+File: gmp.info, Node: Exact Division, Next: Exact Remainder, Prev: Block-Wise Barrett Division, Up: Division Algorithms
+
+15.2.5 Exact Division
+---------------------
+
+A so-called exact division is when the dividend is known to be an exact
+multiple of the divisor. Jebelean's exact division algorithm uses this
+knowledge to make some significant optimizations (*note References::).
+
+ The idea can be illustrated in decimal for example with 368154
+divided by 543. Because the low digit of the dividend is 4, the low
+digit of the quotient must be 8. This is arrived at from 4*7 mod 10,
+using the fact 7 is the modular inverse of 3 (the low digit of the
+divisor), since 3*7 == 1 mod 10. So 8*543=4344 can be subtracted from
+the dividend leaving 363810. Notice the low digit has become zero.
+
+ The procedure is repeated at the second digit, with the next quotient
+digit 7 (7 == 1*7 mod 10), subtracting 7*543=3801, leaving 325800. And
+finally at the third digit with quotient digit 6 (8*7 mod 10),
+subtracting 6*543=3258 leaving 0. So the quotient is 678.
+
+ Notice however that the multiplies and subtractions don't need to
+extend past the low three digits of the dividend, since that's enough to
+determine the three quotient digits. For the last quotient digit no
+subtraction is needed at all. On a 2NxN division like this one, only
+about half the work of a normal basecase division is necessary.
+
+ For an NxM exact division producing Q=N-M quotient limbs, the saving
+over a normal basecase division is in two parts. Firstly, each of the Q
+quotient limbs needs only one multiply, not a 2x1 divide and multiply.
+Secondly, the crossproducts are reduced when Q>M to Q*M-M*(M+1)/2, or
+when Q<=M to Q*(Q-1)/2. Notice the savings are complementary. If Q is
+big then many divisions are saved, or if Q is small then the
+crossproducts reduce to a small number.
+
+ The modular inverse used is calculated efficiently by 'binvert_limb'
+in 'gmp-impl.h'. This does four multiplies for a 32-bit limb, or six
+for a 64-bit limb. 'tune/modlinv.c' has some alternate implementations
+that might suit processors better at bit twiddling than multiplying.
+
+ The sub-quadratic exact division described by Jebelean in "Exact
+Division with Karatsuba Complexity" is not currently implemented. It
+uses a rearrangement similar to the divide and conquer for normal
+division (*note Divide and Conquer Division::), but operating from low
+to high. A further possibility not currently implemented is
+"Bidirectional Exact Integer Division" by Krandick and Jebelean which
+forms quotient limbs from both the high and low ends of the dividend,
+and can halve once more the number of crossproducts needed in a 2NxN
+division.
+
+ A special case exact division by 3 exists in 'mpn_divexact_by3',
+supporting Toom-3 multiplication and 'mpq' canonicalizations. It forms
+quotient digits with a multiply by the modular inverse of 3 (which is
+'0xAA..AAB') and uses two comparisons to determine a borrow for the next
+limb. The multiplications don't need to be on the dependent chain, as
+long as the effect of the borrows is applied, which can help chips with
+pipelined multipliers.
+
+\1f
+File: gmp.info, Node: Exact Remainder, Next: Small Quotient Division, Prev: Exact Division, Up: Division Algorithms
+
+15.2.6 Exact Remainder
+----------------------
+
+If the exact division algorithm is done with a full subtraction at each
+stage and the dividend isn't a multiple of the divisor, then low zero
+limbs are produced but with a remainder in the high limbs. For dividend
+a, divisor d, quotient q, and b = 2^mp_bits_per_limb, this remainder r
+is of the form
+
+ a = q*d + r*b^n
+
+ n represents the number of zero limbs produced by the subtractions,
+that being the number of limbs produced for q. r will be in the range
+0<=r<d and can be viewed as a remainder, but one shifted up by a factor
+of b^n.
+
+ Carrying out full subtractions at each stage means the same number of
+cross products must be done as a normal division, but there's still some
+single limb divisions saved. When d is a single limb some
+simplifications arise, providing good speedups on a number of
+processors.
+
+ The functions 'mpn_divexact_by3', 'mpn_modexact_1_odd' and the
+internal 'mpn_redc_X' functions differ subtly in how they return r,
+leading to some negations in the above formula, but all are essentially
+the same.
+
+ Clearly r is zero when a is a multiple of d, and this leads to
+divisibility or congruence tests which are potentially more efficient
+than a normal division.
+
+ The factor of b^n on r can be ignored in a GCD when d is odd, hence
+the use of 'mpn_modexact_1_odd' by 'mpn_gcd_1' and 'mpz_kronecker_ui'
+etc (*note Greatest Common Divisor Algorithms::).
+
+ Montgomery's REDC method for modular multiplications uses operands of
+the form of x*b^-n and y*b^-n and on calculating (x*b^-n)*(y*b^-n) uses
+the factor of b^n in the exact remainder to reach a product in the same
+form (x*y)*b^-n (*note Modular Powering Algorithm::).
+
+ Notice that r generally gives no useful information about the
+ordinary remainder a mod d since b^n mod d could be anything. If
+however b^n == 1 mod d, then r is the negative of the ordinary
+remainder. This occurs whenever d is a factor of b^n-1, as for example
+with 3 in 'mpn_divexact_by3'. For a 32 or 64 bit limb other such
+factors include 5, 17 and 257, but no particular use has been found for
+this.
+
+\1f
+File: gmp.info, Node: Small Quotient Division, Prev: Exact Remainder, Up: Division Algorithms
+
+15.2.7 Small Quotient Division
+------------------------------
+
+An NxM division where the number of quotient limbs Q=N-M is small can be
+optimized somewhat.
+
+ An ordinary basecase division normalizes the divisor by shifting it
+to make the high bit set, shifting the dividend accordingly, and
+shifting the remainder back down at the end of the calculation. This is
+wasteful if only a few quotient limbs are to be formed. Instead a
+division of just the top 2*Q limbs of the dividend by the top Q limbs of
+the divisor can be used to form a trial quotient. This requires only
+those limbs normalized, not the whole of the divisor and dividend.
+
+ A multiply and subtract then applies the trial quotient to the M-Q
+unused limbs of the divisor and N-Q dividend limbs (which includes Q
+limbs remaining from the trial quotient division). The starting trial
+quotient can be 1 or 2 too big, but all cases of 2 too big and most
+cases of 1 too big are detected by first comparing the most significant
+limbs that will arise from the subtraction. An addback is done if the
+quotient still turns out to be 1 too big.
+
+ This whole procedure is essentially the same as one step of the
+basecase algorithm done in a Q limb base, though with the trial quotient
+test done only with the high limbs, not an entire Q limb "digit"
+product. The correctness of this weaker test can be established by
+following the argument of Knuth section 4.3.1 exercise 20 but with the
+v2*q>b*r+u2 condition appropriately relaxed.
+
+\1f
+File: gmp.info, Node: Greatest Common Divisor Algorithms, Next: Powering Algorithms, Prev: Division Algorithms, Up: Algorithms
+
+15.3 Greatest Common Divisor
+============================
+
+* Menu:
+
+* Binary GCD::
+* Lehmer's Algorithm::
+* Subquadratic GCD::
+* Extended GCD::
+* Jacobi Symbol::
+
+\1f
+File: gmp.info, Node: Binary GCD, Next: Lehmer's Algorithm, Prev: Greatest Common Divisor Algorithms, Up: Greatest Common Divisor Algorithms
+
+15.3.1 Binary GCD
+-----------------
+
+At small sizes GMP uses an O(N^2) binary style GCD. This is described
+in many textbooks, for example Knuth section 4.5.2 algorithm B. It
+simply consists of successively reducing odd operands a and b using
+
+ a,b = abs(a-b),min(a,b)
+ strip factors of 2 from a
+
+ The Euclidean GCD algorithm, as per Knuth algorithms E and A,
+repeatedly computes the quotient q = floor(a/b) and replaces a,b by v, u
+- q v. The binary algorithm has so far been found to be faster than the
+Euclidean algorithm everywhere. One reason the binary method does well
+is that the implied quotient at each step is usually small, so often
+only one or two subtractions are needed to get the same effect as a
+division. Quotients 1, 2 and 3 for example occur 67.7% of the time, see
+Knuth section 4.5.3 Theorem E.
+
+ When the implied quotient is large, meaning b is much smaller than a,
+then a division is worthwhile. This is the basis for the initial a mod
+b reductions in 'mpn_gcd' and 'mpn_gcd_1' (the latter for both Nx1 and
+1x1 cases). But after that initial reduction, big quotients occur too
+rarely to make it worth checking for them.
+
+
+ The final 1x1 GCD in 'mpn_gcd_1' is done in the generic C code as
+described above. For two N-bit operands, the algorithm takes about 0.68
+iterations per bit. For optimum performance some attention needs to be
+paid to the way the factors of 2 are stripped from a.
+
+ Firstly it may be noted that in two's complement the number of low
+zero bits on a-b is the same as b-a, so counting or testing can begin on
+a-b without waiting for abs(a-b) to be determined.
+
+ A loop stripping low zero bits tends not to branch predict well,
+since the condition is data dependent. But on average there's only a
+few low zeros, so an option is to strip one or two bits arithmetically
+then loop for more (as done for AMD K6). Or use a lookup table to get a
+count for several bits then loop for more (as done for AMD K7). An
+alternative approach is to keep just one of a and b odd and iterate
+
+ a,b = abs(a-b), min(a,b)
+ a = a/2 if even
+ b = b/2 if even
+
+ This requires about 1.25 iterations per bit, but stripping of a
+single bit at each step avoids any branching. Repeating the bit strip
+reduces to about 0.9 iterations per bit, which may be a worthwhile
+tradeoff.
+
+ Generally with the above approaches a speed of perhaps 6 cycles per
+bit can be achieved, which is still not terribly fast with for instance
+a 64-bit GCD taking nearly 400 cycles. It's this sort of time which
+means it's not usually advantageous to combine a set of divisibility
+tests into a GCD.
+
+ Currently, the binary algorithm is used for GCD only when N < 3.
+
+\1f
+File: gmp.info, Node: Lehmer's Algorithm, Next: Subquadratic GCD, Prev: Binary GCD, Up: Greatest Common Divisor Algorithms
+
+15.3.2 Lehmer's algorithm
+-------------------------
+
+Lehmer's improvement of the Euclidean algorithms is based on the
+observation that the initial part of the quotient sequence depends only
+on the most significant parts of the inputs. The variant of Lehmer's
+algorithm used in GMP splits off the most significant two limbs, as
+suggested, e.g., in "A Double-Digit Lehmer-Euclid Algorithm" by Jebelean
+(*note References::). The quotients of two double-limb inputs are
+collected as a 2 by 2 matrix with single-limb elements. This is done by
+the function 'mpn_hgcd2'. The resulting matrix is applied to the inputs
+using 'mpn_mul_1' and 'mpn_submul_1'. Each iteration usually reduces
+the inputs by almost one limb. In the rare case of a large quotient, no
+progress can be made by examining just the most significant two limbs,
+and the quotient is computed using plain division.
+
+ The resulting algorithm is asymptotically O(N^2), just as the
+Euclidean algorithm and the binary algorithm. The quadratic part of the
+work are the calls to 'mpn_mul_1' and 'mpn_submul_1'. For small sizes,
+the linear work is also significant. There are roughly N calls to the
+'mpn_hgcd2' function. This function uses a couple of important
+optimizations:
+
+ * It uses the same relaxed notion of correctness as 'mpn_hgcd' (see
+ next section). This means that when called with the most
+ significant two limbs of two large numbers, the returned matrix
+ does not always correspond exactly to the initial quotient sequence
+ for the two large numbers; the final quotient may sometimes be one
+ off.
+
+ * It takes advantage of the fact that the quotients are usually
+ small. The division operator is not used, since the corresponding
+ assembler instruction is very slow on most architectures. (This
+ code could probably be improved further, it uses many branches that
+ are unfriendly to prediction.)
+
+ * It switches from double-limb calculations to single-limb
+ calculations half-way through, when the input numbers have been
+ reduced in size from two limbs to one and a half.
+
+\1f
+File: gmp.info, Node: Subquadratic GCD, Next: Extended GCD, Prev: Lehmer's Algorithm, Up: Greatest Common Divisor Algorithms
+
+15.3.3 Subquadratic GCD
+-----------------------
+
+For inputs larger than 'GCD_DC_THRESHOLD', GCD is computed via the HGCD
+(Half GCD) function, as a generalization to Lehmer's algorithm.
+
+ Let the inputs a,b be of size N limbs each. Put S = floor(N/2) + 1.
+Then HGCD(a,b) returns a transformation matrix T with non-negative
+elements, and reduced numbers (c;d) = T^{-1} (a;b). The reduced numbers
+c,d must be larger than S limbs, while their difference abs(c-d) must
+fit in S limbs. The matrix elements will also be of size roughly N/2.
+
+ The HGCD base case uses Lehmer's algorithm, but with the above stop
+condition that returns reduced numbers and the corresponding
+transformation matrix half-way through. For inputs larger than
+'HGCD_THRESHOLD', HGCD is computed recursively, using the divide and
+conquer algorithm in "On Schönhage's algorithm and subquadratic integer
+GCD computation" by Möller (*note References::). The recursive
+algorithm consists of these main steps.
+
+ * Call HGCD recursively, on the most significant N/2 limbs. Apply
+ the resulting matrix T_1 to the full numbers, reducing them to a
+ size just above 3N/2.
+
+ * Perform a small number of division or subtraction steps to reduce
+ the numbers to size below 3N/2. This is essential mainly for the
+ unlikely case of large quotients.
+
+ * Call HGCD recursively, on the most significant N/2 limbs of the
+ reduced numbers. Apply the resulting matrix T_2 to the full
+ numbers, reducing them to a size just above N/2.
+
+ * Compute T = T_1 T_2.
+
+ * Perform a small number of division and subtraction steps to satisfy
+ the requirements, and return.
+
+ GCD is then implemented as a loop around HGCD, similarly to Lehmer's
+algorithm. Where Lehmer repeatedly chops off the top two limbs, calls
+'mpn_hgcd2', and applies the resulting matrix to the full numbers, the
+sub-quadratic GCD chops off the most significant third of the limbs (the
+proportion is a tuning parameter, and 1/3 seems to be more efficient
+than, e.g., 1/2), calls 'mpn_hgcd', and applies the resulting matrix.
+Once the input numbers are reduced to size below 'GCD_DC_THRESHOLD',
+Lehmer's algorithm is used for the rest of the work.
+
+ The asymptotic running time of both HGCD and GCD is O(M(N)*log(N)),
+where M(N) is the time for multiplying two N-limb numbers.
+
+\1f
+File: gmp.info, Node: Extended GCD, Next: Jacobi Symbol, Prev: Subquadratic GCD, Up: Greatest Common Divisor Algorithms
+
+15.3.4 Extended GCD
+-------------------
+
+The extended GCD function, or GCDEXT, calculates gcd(a,b) and also
+cofactors x and y satisfying a*x+b*y=gcd(a,b). All the algorithms used
+for plain GCD are extended to handle this case. The binary algorithm is
+used only for single-limb GCDEXT. Lehmer's algorithm is used for sizes
+up to 'GCDEXT_DC_THRESHOLD'. Above this threshold, GCDEXT is
+implemented as a loop around HGCD, but with more book-keeping to keep
+track of the cofactors. This gives the same asymptotic running time as
+for GCD and HGCD, O(M(N)*log(N)).
+
+ One difference to plain GCD is that while the inputs a and b are
+reduced as the algorithm proceeds, the cofactors x and y grow in size.
+This makes the tuning of the chopping-point more difficult. The current
+code chops off the most significant half of the inputs for the call to
+HGCD in the first iteration, and the most significant two thirds for the
+remaining calls. This strategy could surely be improved. Also the stop
+condition for the loop, where Lehmer's algorithm is invoked once the
+inputs are reduced below 'GCDEXT_DC_THRESHOLD', could maybe be improved
+by taking into account the current size of the cofactors.
+
+\1f
+File: gmp.info, Node: Jacobi Symbol, Prev: Extended GCD, Up: Greatest Common Divisor Algorithms
+
+15.3.5 Jacobi Symbol
+--------------------
+
+Jacobi symbol (A/B)
+
+ Initially if either operand fits in a single limb, a reduction is
+done with either 'mpn_mod_1' or 'mpn_modexact_1_odd', followed by the
+binary algorithm on a single limb. The binary algorithm is well suited
+to a single limb, and the whole calculation in this case is quite
+efficient.
+
+ For inputs larger than 'GCD_DC_THRESHOLD', 'mpz_jacobi',
+'mpz_legendre' and 'mpz_kronecker' are computed via the HGCD (Half GCD)
+function, as a generalization to Lehmer's algorithm.
+
+ Most GCD algorithms reduce a and b by repeatedly computing the
+quotient q = floor(a/b) and iteratively replacing
+
+ a, b = b, a - q * b
+
+ Different algorithms use different methods for calculating q, but the
+core algorithm is the same if we use *note Lehmer's Algorithm:: or *note
+HGCD: Subquadratic GCD.
+
+ At each step it is possible to compute if the reduction inverts the
+Jacobi symbol based on the two least significant bits of A and B. For
+more details see "Efficient computation of the Jacobi symbol" by Möller
+(*note References::).
+
+ A small set of bits is thus used to track state
+ * current sign of result (1 bit)
+
+ * two least significant bits of A and B (4 bits)
+
+ * a pointer to which input is currently the denominator (1 bit)
+
+ In all the routines sign changes for the result are accumulated using
+fast bit twiddling which avoids conditional jumps.
+
+ The final result is calculated after verifying the inputs are coprime
+(GCD = 1) by raising (-1)^e.
+
+ Much of the HGCD code is shared directly with the HGCD
+implementations, such as the 2x2 matrix calculation, *Note Lehmer's
+Algorithm:: basecase and 'GCD_DC_THRESHOLD'.
+
+ The asymptotic running time is O(M(N)*log(N)), where M(N) is the time
+for multiplying two N-limb numbers.
+
+\1f
+File: gmp.info, Node: Powering Algorithms, Next: Root Extraction Algorithms, Prev: Greatest Common Divisor Algorithms, Up: Algorithms
+
+15.4 Powering Algorithms
+========================
+
+* Menu:
+
+* Normal Powering Algorithm::
+* Modular Powering Algorithm::
+
+\1f
+File: gmp.info, Node: Normal Powering Algorithm, Next: Modular Powering Algorithm, Prev: Powering Algorithms, Up: Powering Algorithms
+
+15.4.1 Normal Powering
+----------------------
+
+Normal 'mpz' or 'mpf' powering uses a simple binary algorithm,
+successively squaring and then multiplying by the base when a 1 bit is
+seen in the exponent, as per Knuth section 4.6.3. The "left to right"
+variant described there is used rather than algorithm A, since it's just
+as easy and can be done with somewhat less temporary memory.
+
+\1f
+File: gmp.info, Node: Modular Powering Algorithm, Prev: Normal Powering Algorithm, Up: Powering Algorithms
+
+15.4.2 Modular Powering
+-----------------------
+
+Modular powering is implemented using a 2^k-ary sliding window
+algorithm, as per "Handbook of Applied Cryptography" algorithm 14.85
+(*note References::). k is chosen according to the size of the
+exponent. Larger exponents use larger values of k, the choice being
+made to minimize the average number of multiplications that must
+supplement the squaring.
+
+ The modular multiplies and squarings use either a simple division or
+the REDC method by Montgomery (*note References::). REDC is a little
+faster, essentially saving N single limb divisions in a fashion similar
+to an exact remainder (*note Exact Remainder::).
+
+\1f
+File: gmp.info, Node: Root Extraction Algorithms, Next: Radix Conversion Algorithms, Prev: Powering Algorithms, Up: Algorithms
+
+15.5 Root Extraction Algorithms
+===============================
+
+* Menu:
+
+* Square Root Algorithm::
+* Nth Root Algorithm::
+* Perfect Square Algorithm::
+* Perfect Power Algorithm::
+
+\1f
+File: gmp.info, Node: Square Root Algorithm, Next: Nth Root Algorithm, Prev: Root Extraction Algorithms, Up: Root Extraction Algorithms
+
+15.5.1 Square Root
+------------------
+
+Square roots are taken using the "Karatsuba Square Root" algorithm by
+Paul Zimmermann (*note References::).
+
+ An input n is split into four parts of k bits each, so with b=2^k we
+have n = a3*b^3 + a2*b^2 + a1*b + a0. Part a3 must be "normalized" so
+that either the high or second highest bit is set. In GMP, k is kept on
+a limb boundary and the input is left shifted (by an even number of
+bits) to normalize.
+
+ The square root of the high two parts is taken, by recursive
+application of the algorithm (bottoming out in a one-limb Newton's
+method),
+
+ s1,r1 = sqrtrem (a3*b + a2)
+
+ This is an approximation to the desired root and is extended by a
+division to give s,r,
+
+ q,u = divrem (r1*b + a1, 2*s1)
+ s = s1*b + q
+ r = u*b + a0 - q^2
+
+ The normalization requirement on a3 means at this point s is either
+correct or 1 too big. r is negative in the latter case, so
+
+ if r < 0 then
+ r = r + 2*s - 1
+ s = s - 1
+
+ The algorithm is expressed in a divide and conquer form, but as noted
+in the paper it can also be viewed as a discrete variant of Newton's
+method, or as a variation on the schoolboy method (no longer taught) for
+square roots two digits at a time.
+
+ If the remainder r is not required then usually only a few high limbs
+of r and u need to be calculated to determine whether an adjustment to s
+is required. This optimization is not currently implemented.
+
+ In the Karatsuba multiplication range this algorithm is
+O(1.5*M(N/2)), where M(n) is the time to multiply two numbers of n
+limbs. In the FFT multiplication range this grows to a bound of
+O(6*M(N/2)). In practice a factor of about 1.5 to 1.8 is found in the
+Karatsuba and Toom-3 ranges, growing to 2 or 3 in the FFT range.
+
+ The algorithm does all its calculations in integers and the resulting
+'mpn_sqrtrem' is used for both 'mpz_sqrt' and 'mpf_sqrt'. The extended
+precision given by 'mpf_sqrt_ui' is obtained by padding with zero limbs.
+
+\1f
+File: gmp.info, Node: Nth Root Algorithm, Next: Perfect Square Algorithm, Prev: Square Root Algorithm, Up: Root Extraction Algorithms
+
+15.5.2 Nth Root
+---------------
+
+Integer Nth roots are taken using Newton's method with the following
+iteration, where A is the input and n is the root to be taken.
+
+ 1 A
+ a[i+1] = - * ( --------- + (n-1)*a[i] )
+ n a[i]^(n-1)
+
+ The initial approximation a[1] is generated bitwise by successively
+powering a trial root with or without new 1 bits, aiming to be just
+above the true root. The iteration converges quadratically when started
+from a good approximation. When n is large more initial bits are needed
+to get good convergence. The current implementation is not particularly
+well optimized.
+
+\1f
+File: gmp.info, Node: Perfect Square Algorithm, Next: Perfect Power Algorithm, Prev: Nth Root Algorithm, Up: Root Extraction Algorithms
+
+15.5.3 Perfect Square
+---------------------
+
+A significant fraction of non-squares can be quickly identified by
+checking whether the input is a quadratic residue modulo small integers.
+
+ 'mpz_perfect_square_p' first tests the input mod 256, which means
+just examining the low byte. Only 44 different values occur for squares
+mod 256, so 82.8% of inputs can be immediately identified as
+non-squares.
+
+ On a 32-bit system similar tests are done mod 9, 5, 7, 13 and 17, for
+a total 99.25% of inputs identified as non-squares. On a 64-bit system
+97 is tested too, for a total 99.62%.
+
+ These moduli are chosen because they're factors of 2^24-1 (or 2^48-1
+for 64-bits), and such a remainder can be quickly taken just using
+additions (see 'mpn_mod_34lsub1').
+
+ When nails are in use moduli are instead selected by the 'gen-psqr.c'
+program and applied with an 'mpn_mod_1'. The same 2^24-1 or 2^48-1
+could be done with nails using some extra bit shifts, but this is not
+currently implemented.
+
+ In any case each modulus is applied to the 'mpn_mod_34lsub1' or
+'mpn_mod_1' remainder and a table lookup identifies non-squares. By
+using a "modexact" style calculation, and suitably permuted tables, just
+one multiply each is required, see the code for details. Moduli are
+also combined to save operations, so long as the lookup tables don't
+become too big. 'gen-psqr.c' does all the pre-calculations.
+
+ A square root must still be taken for any value that passes these
+tests, to verify it's really a square and not one of the small fraction
+of non-squares that get through (i.e. a pseudo-square to all the tested
+bases).
+
+ Clearly more residue tests could be done, 'mpz_perfect_square_p' only
+uses a compact and efficient set. Big inputs would probably benefit
+from more residue testing, small inputs might be better off with less.
+The assumed distribution of squares versus non-squares in the input
+would affect such considerations.
+
+\1f
+File: gmp.info, Node: Perfect Power Algorithm, Prev: Perfect Square Algorithm, Up: Root Extraction Algorithms
+
+15.5.4 Perfect Power
+--------------------
+
+Detecting perfect powers is required by some factorization algorithms.
+Currently 'mpz_perfect_power_p' is implemented using repeated Nth root
+extractions, though naturally only prime roots need to be considered.
+(*Note Nth Root Algorithm::.)
+
+ If a prime divisor p with multiplicity e can be found, then only
+roots which are divisors of e need to be considered, much reducing the
+work necessary. To this end divisibility by a set of small primes is
+checked.
+
+\1f
+File: gmp.info, Node: Radix Conversion Algorithms, Next: Other Algorithms, Prev: Root Extraction Algorithms, Up: Algorithms
+
+15.6 Radix Conversion
+=====================
+
+Radix conversions are less important than other algorithms. A program
+dominated by conversions should probably use a different data
+representation.
+
+* Menu:
+
+* Binary to Radix::
+* Radix to Binary::
+
+\1f
+File: gmp.info, Node: Binary to Radix, Next: Radix to Binary, Prev: Radix Conversion Algorithms, Up: Radix Conversion Algorithms
+
+15.6.1 Binary to Radix
+----------------------
+
+Conversions from binary to a power-of-2 radix use a simple and fast O(N)
+bit extraction algorithm.
+
+ Conversions from binary to other radices use one of two algorithms.
+Sizes below 'GET_STR_PRECOMPUTE_THRESHOLD' use a basic O(N^2) method.
+Repeated divisions by b^n are made, where b is the radix and n is the
+biggest power that fits in a limb. But instead of simply using the
+remainder r from such divisions, an extra divide step is done to give a
+fractional limb representing r/b^n. The digits of r can then be
+extracted using multiplications by b rather than divisions. Special
+case code is provided for decimal, allowing multiplications by 10 to
+optimize to shifts and adds.
+
+ Above 'GET_STR_PRECOMPUTE_THRESHOLD' a sub-quadratic algorithm is
+used. For an input t, powers b^(n*2^i) of the radix are calculated,
+until a power between t and sqrt(t) is reached. t is then divided by
+that largest power, giving a quotient which is the digits above that
+power, and a remainder which is those below. These two parts are in
+turn divided by the second highest power, and so on recursively. When a
+piece has been divided down to less than 'GET_STR_DC_THRESHOLD' limbs,
+the basecase algorithm described above is used.
+
+ The advantage of this algorithm is that big divisions can make use of
+the sub-quadratic divide and conquer division (*note Divide and Conquer
+Division::), and big divisions tend to have less overheads than lots of
+separate single limb divisions anyway. But in any case the cost of
+calculating the powers b^(n*2^i) must first be overcome.
+
+ 'GET_STR_PRECOMPUTE_THRESHOLD' and 'GET_STR_DC_THRESHOLD' represent
+the same basic thing, the point where it becomes worth doing a big
+division to cut the input in half. 'GET_STR_PRECOMPUTE_THRESHOLD'
+includes the cost of calculating the radix power required, whereas
+'GET_STR_DC_THRESHOLD' assumes that's already available, which is the
+case when recursing.
+
+ Since the base case produces digits from least to most significant
+but they want to be stored from most to least, it's necessary to
+calculate in advance how many digits there will be, or at least be sure
+not to underestimate that. For GMP the number of input bits is
+multiplied by 'chars_per_bit_exactly' from 'mp_bases', rounding up. The
+result is either correct or one too big.
+
+ Examining some of the high bits of the input could increase the
+chance of getting the exact number of digits, but an exact result every
+time would not be practical, since in general the difference between
+numbers 100... and 99... is only in the last few bits and the work to
+identify 99... might well be almost as much as a full conversion.
+
+ The r/b^n scheme described above for using multiplications to bring
+out digits might be useful for more than a single limb. Some brief
+experiments with it on the base case when recursing didn't give a
+noticeable improvement, but perhaps that was only due to the
+implementation. Something similar would work for the sub-quadratic
+divisions too, though there would be the cost of calculating a bigger
+radix power.
+
+ Another possible improvement for the sub-quadratic part would be to
+arrange for radix powers that balanced the sizes of quotient and
+remainder produced, i.e. the highest power would be an b^(n*k)
+approximately equal to sqrt(t), not restricted to a 2^i factor. That
+ought to smooth out a graph of times against sizes, but may or may not
+be a net speedup.
+
+\1f
+File: gmp.info, Node: Radix to Binary, Prev: Binary to Radix, Up: Radix Conversion Algorithms
+
+15.6.2 Radix to Binary
+----------------------
+
+*This section needs to be rewritten, it currently describes the
+algorithms used before GMP 4.3.*
+
+ Conversions from a power-of-2 radix into binary use a simple and fast
+O(N) bitwise concatenation algorithm.
+
+ Conversions from other radices use one of two algorithms. Sizes
+below 'SET_STR_PRECOMPUTE_THRESHOLD' use a basic O(N^2) method. Groups
+of n digits are converted to limbs, where n is the biggest power of the
+base b which will fit in a limb, then those groups are accumulated into
+the result by multiplying by b^n and adding. This saves multi-precision
+operations, as per Knuth section 4.4 part E (*note References::). Some
+special case code is provided for decimal, giving the compiler a chance
+to optimize multiplications by 10.
+
+ Above 'SET_STR_PRECOMPUTE_THRESHOLD' a sub-quadratic algorithm is
+used. First groups of n digits are converted into limbs. Then adjacent
+limbs are combined into limb pairs with x*b^n+y, where x and y are the
+limbs. Adjacent limb pairs are combined into quads similarly with
+x*b^(2n)+y. This continues until a single block remains, that being the
+result.
+
+ The advantage of this method is that the multiplications for each x
+are big blocks, allowing Karatsuba and higher algorithms to be used.
+But the cost of calculating the powers b^(n*2^i) must be overcome.
+'SET_STR_PRECOMPUTE_THRESHOLD' usually ends up quite big, around 5000
+digits, and on some processors much bigger still.
+
+ 'SET_STR_PRECOMPUTE_THRESHOLD' is based on the input digits (and
+tuned for decimal), though it might be better based on a limb count, so
+as to be independent of the base. But that sort of count isn't used by
+the base case and so would need some sort of initial calculation or
+estimate.
+
+ The main reason 'SET_STR_PRECOMPUTE_THRESHOLD' is so much bigger than
+the corresponding 'GET_STR_PRECOMPUTE_THRESHOLD' is that 'mpn_mul_1' is
+much faster than 'mpn_divrem_1' (often by a factor of 5, or more).
+
+\1f
+File: gmp.info, Node: Other Algorithms, Next: Assembly Coding, Prev: Radix Conversion Algorithms, Up: Algorithms
+
+15.7 Other Algorithms
+=====================
+
+* Menu:
+
+* Prime Testing Algorithm::
+* Factorial Algorithm::
+* Binomial Coefficients Algorithm::
+* Fibonacci Numbers Algorithm::
+* Lucas Numbers Algorithm::
+* Random Number Algorithms::
+
+\1f
+File: gmp.info, Node: Prime Testing Algorithm, Next: Factorial Algorithm, Prev: Other Algorithms, Up: Other Algorithms
+
+15.7.1 Prime Testing
+--------------------
+
+The primality testing in 'mpz_probab_prime_p' (*note Number Theoretic
+Functions::) first does some trial division by small factors and then
+uses the Miller-Rabin probabilistic primality testing algorithm, as
+described in Knuth section 4.5.4 algorithm P (*note References::).
+
+ For an odd input n, and with n = q*2^k+1 where q is odd, this
+algorithm selects a random base x and tests whether x^q mod n is 1 or
+-1, or an x^(q*2^j) mod n is 1, for 1<=j<=k. If so then n is probably
+prime, if not then n is definitely composite.
+
+ Any prime n will pass the test, but some composites do too. Such
+composites are known as strong pseudoprimes to base x. No n is a strong
+pseudoprime to more than 1/4 of all bases (see Knuth exercise 22), hence
+with x chosen at random there's no more than a 1/4 chance a "probable
+prime" will in fact be composite.
+
+ In fact strong pseudoprimes are quite rare, making the test much more
+powerful than this analysis would suggest, but 1/4 is all that's proven
+for an arbitrary n.
+
+\1f
+File: gmp.info, Node: Factorial Algorithm, Next: Binomial Coefficients Algorithm, Prev: Prime Testing Algorithm, Up: Other Algorithms
+
+15.7.2 Factorial
+----------------
+
+Factorials are calculated by a combination of two algorithms. An idea
+is shared among them: to compute the odd part of the factorial; a final
+step takes account of the power of 2 term, by shifting.
+
+ For small n, the odd factor of n! is computed with the simple
+observation that it is equal to the product of all positive odd numbers
+smaller than n times the odd factor of [n/2]!, where [x] is the integer
+part of x, and so on recursively. The procedure can be best illustrated
+with an example,
+
+ 23! = (23.21.19.17.15.13.11.9.7.5.3)(11.9.7.5.3)(5.3)2^{19}
+
+ Current code collects all the factors in a single list, with a loop
+and no recursion, and computes the product, with no special care for
+repeated chunks.
+
+ When n is larger, computations pass through prime sieving. A helper
+function is used, as suggested by Peter Luschny:
+
+ n
+ -----
+ n! | | L(p,n)
+ msf(n) = -------------- = | | p
+ [n/2]!^2.2^k p=3
+
+ Where p ranges on odd prime numbers. The exponent k is chosen to
+obtain an odd integer number: k is the number of 1 bits in the binary
+representation of [n/2]. The function L(p,n) can be defined as zero
+when p is composite, and, for any prime p, it is computed with:
+
+ ---
+ \ n
+ L(p,n) = / [---] mod 2 <= log (n) .
+ --- p^i p
+ i>0
+
+ With this helper function, we are able to compute the odd part of n!
+using the recursion implied by n!=[n/2]!^2*msf(n)*2^k. The recursion
+stops using the small-n algorithm on some [n/2^i].
+
+ Both the above algorithms use binary splitting to compute the product
+of many small factors. At first as many products as possible are
+accumulated in a single register, generating a list of factors that fit
+in a machine word. This list is then split into halves, and the product
+is computed recursively.
+
+ Such splitting is more efficient than repeated Nx1 multiplies since
+it forms big multiplies, allowing Karatsuba and higher algorithms to be
+used. And even below the Karatsuba threshold a big block of work can be
+more efficient for the basecase algorithm.
+
+\1f
+File: gmp.info, Node: Binomial Coefficients Algorithm, Next: Fibonacci Numbers Algorithm, Prev: Factorial Algorithm, Up: Other Algorithms
+
+15.7.3 Binomial Coefficients
+----------------------------
+
+Binomial coefficients C(n,k) are calculated by first arranging k <= n/2
+using C(n,k) = C(n,n-k) if necessary, and then evaluating the following
+product simply from i=2 to i=k.
+
+ k (n-k+i)
+ C(n,k) = (n-k+1) * prod -------
+ i=2 i
+
+ It's easy to show that each denominator i will divide the product so
+far, so the exact division algorithm is used (*note Exact Division::).
+
+ The numerators n-k+i and denominators i are first accumulated into as
+many fit a limb, to save multi-precision operations, though for
+'mpz_bin_ui' this applies only to the divisors, since n is an 'mpz_t'
+and n-k+i in general won't fit in a limb at all.
+
+\1f
+File: gmp.info, Node: Fibonacci Numbers Algorithm, Next: Lucas Numbers Algorithm, Prev: Binomial Coefficients Algorithm, Up: Other Algorithms
+
+15.7.4 Fibonacci Numbers
+------------------------
+
+The Fibonacci functions 'mpz_fib_ui' and 'mpz_fib2_ui' are designed for
+calculating isolated F[n] or F[n],F[n-1] values efficiently.
+
+ For small n, a table of single limb values in '__gmp_fib_table' is
+used. On a 32-bit limb this goes up to F[47], or on a 64-bit limb up to
+F[93]. For convenience the table starts at F[-1].
+
+ Beyond the table, values are generated with a binary powering
+algorithm, calculating a pair F[n] and F[n-1] working from high to low
+across the bits of n. The formulas used are
+
+ F[2k+1] = 4*F[k]^2 - F[k-1]^2 + 2*(-1)^k
+ F[2k-1] = F[k]^2 + F[k-1]^2
+
+ F[2k] = F[2k+1] - F[2k-1]
+
+ At each step, k is the high b bits of n. If the next bit of n is 0
+then F[2k],F[2k-1] is used, or if it's a 1 then F[2k+1],F[2k] is used,
+and the process repeated until all bits of n are incorporated. Notice
+these formulas require just two squares per bit of n.
+
+ It'd be possible to handle the first few n above the single limb
+table with simple additions, using the defining Fibonacci recurrence
+F[k+1]=F[k]+F[k-1], but this is not done since it usually turns out to
+be faster for only about 10 or 20 values of n, and including a block of
+code for just those doesn't seem worthwhile. If they really mattered
+it'd be better to extend the data table.
+
+ Using a table avoids lots of calculations on small numbers, and makes
+small n go fast. A bigger table would make more small n go fast, it's
+just a question of balancing size against desired speed. For GMP the
+code is kept compact, with the emphasis primarily on a good powering
+algorithm.
+
+ 'mpz_fib2_ui' returns both F[n] and F[n-1], but 'mpz_fib_ui' is only
+interested in F[n]. In this case the last step of the algorithm can
+become one multiply instead of two squares. One of the following two
+formulas is used, according as n is odd or even.
+
+ F[2k] = F[k]*(F[k]+2F[k-1])
+
+ F[2k+1] = (2F[k]+F[k-1])*(2F[k]-F[k-1]) + 2*(-1)^k
+
+ F[2k+1] here is the same as above, just rearranged to be a multiply.
+For interest, the 2*(-1)^k term both here and above can be applied just
+to the low limb of the calculation, without a carry or borrow into
+further limbs, which saves some code size. See comments with
+'mpz_fib_ui' and the internal 'mpn_fib2_ui' for how this is done.
+
+\1f
+File: gmp.info, Node: Lucas Numbers Algorithm, Next: Random Number Algorithms, Prev: Fibonacci Numbers Algorithm, Up: Other Algorithms
+
+15.7.5 Lucas Numbers
+--------------------
+
+'mpz_lucnum2_ui' derives a pair of Lucas numbers from a pair of
+Fibonacci numbers with the following simple formulas.
+
+ L[k] = F[k] + 2*F[k-1]
+ L[k-1] = 2*F[k] - F[k-1]
+
+ 'mpz_lucnum_ui' is only interested in L[n], and some work can be
+saved. Trailing zero bits on n can be handled with a single square
+each.
+
+ L[2k] = L[k]^2 - 2*(-1)^k
+
+ And the lowest 1 bit can be handled with one multiply of a pair of
+Fibonacci numbers, similar to what 'mpz_fib_ui' does.
+
+ L[2k+1] = 5*F[k-1]*(2*F[k]+F[k-1]) - 4*(-1)^k
+
+\1f
+File: gmp.info, Node: Random Number Algorithms, Prev: Lucas Numbers Algorithm, Up: Other Algorithms
+
+15.7.6 Random Numbers
+---------------------
+
+For the 'urandomb' functions, random numbers are generated simply by
+concatenating bits produced by the generator. As long as the generator
+has good randomness properties this will produce well-distributed N bit
+numbers.
+
+ For the 'urandomm' functions, random numbers in a range 0<=R<N are
+generated by taking values R of ceil(log2(N)) bits each until one
+satisfies R<N. This will normally require only one or two attempts, but
+the attempts are limited in case the generator is somehow degenerate and
+produces only 1 bits or similar.
+
+ The Mersenne Twister generator is by Matsumoto and Nishimura (*note
+References::). It has a non-repeating period of 2^19937-1, which is a
+Mersenne prime, hence the name of the generator. The state is 624 words
+of 32-bits each, which is iterated with one XOR and shift for each
+32-bit word generated, making the algorithm very fast. Randomness
+properties are also very good and this is the default algorithm used by
+GMP.
+
+ Linear congruential generators are described in many text books, for
+instance Knuth volume 2 (*note References::). With a modulus M and
+parameters A and C, an integer state S is iterated by the formula S <-
+A*S+C mod M. At each step the new state is a linear function of the
+previous, mod M, hence the name of the generator.
+
+ In GMP only moduli of the form 2^N are supported, and the current
+implementation is not as well optimized as it could be. Overheads are
+significant when N is small, and when N is large clearly the multiply at
+each step will become slow. This is not a big concern, since the
+Mersenne Twister generator is better in every respect and is therefore
+recommended for all normal applications.
+
+ For both generators the current state can be deduced by observing
+enough output and applying some linear algebra (over GF(2) in the case
+of the Mersenne Twister). This generally means raw output is unsuitable
+for cryptographic applications without further hashing or the like.
+
+\1f
+File: gmp.info, Node: Assembly Coding, Prev: Other Algorithms, Up: Algorithms
+
+15.8 Assembly Coding
+====================
+
+The assembly subroutines in GMP are the most significant source of speed
+at small to moderate sizes. At larger sizes algorithm selection becomes
+more important, but of course speedups in low level routines will still
+speed up everything proportionally.
+
+ Carry handling and widening multiplies that are important for GMP
+can't be easily expressed in C. GCC 'asm' blocks help a lot and are
+provided in 'longlong.h', but hand coding low level routines invariably
+offers a speedup over generic C by a factor of anything from 2 to 10.
+
+* Menu:
+
+* Assembly Code Organisation::
+* Assembly Basics::
+* Assembly Carry Propagation::
+* Assembly Cache Handling::
+* Assembly Functional Units::
+* Assembly Floating Point::
+* Assembly SIMD Instructions::
+* Assembly Software Pipelining::
+* Assembly Loop Unrolling::
+* Assembly Writing Guide::
+
+\1f
+File: gmp.info, Node: Assembly Code Organisation, Next: Assembly Basics, Prev: Assembly Coding, Up: Assembly Coding
+
+15.8.1 Code Organisation
+------------------------
+
+The various 'mpn' subdirectories contain machine-dependent code, written
+in C or assembly. The 'mpn/generic' subdirectory contains default code,
+used when there's no machine-specific version of a particular file.
+
+ Each 'mpn' subdirectory is for an ISA family. Generally 32-bit and
+64-bit variants in a family cannot share code and have separate
+directories. Within a family further subdirectories may exist for CPU
+variants.
+
+ In each directory a 'nails' subdirectory may exist, holding code with
+nails support for that CPU variant. A 'NAILS_SUPPORT' directive in each
+file indicates the nails values the code handles. Nails code only
+exists where it's faster, or promises to be faster, than plain code.
+There's no effort put into nails if they're not going to enhance a given
+CPU.
+
+\1f
+File: gmp.info, Node: Assembly Basics, Next: Assembly Carry Propagation, Prev: Assembly Code Organisation, Up: Assembly Coding
+
+15.8.2 Assembly Basics
+----------------------
+
+'mpn_addmul_1' and 'mpn_submul_1' are the most important routines for
+overall GMP performance. All multiplications and divisions come down to
+repeated calls to these. 'mpn_add_n', 'mpn_sub_n', 'mpn_lshift' and
+'mpn_rshift' are next most important.
+
+ On some CPUs assembly versions of the internal functions
+'mpn_mul_basecase' and 'mpn_sqr_basecase' give significant speedups,
+mainly through avoiding function call overheads. They can also
+potentially make better use of a wide superscalar processor, as can
+bigger primitives like 'mpn_addmul_2' or 'mpn_addmul_4'.
+
+ The restrictions on overlaps between sources and destinations (*note
+Low-level Functions::) are designed to facilitate a variety of
+implementations. For example, knowing 'mpn_add_n' won't have partly
+overlapping sources and destination means reading can be done far ahead
+of writing on superscalar processors, and loops can be vectorized on a
+vector processor, depending on the carry handling.
+
+\1f
+File: gmp.info, Node: Assembly Carry Propagation, Next: Assembly Cache Handling, Prev: Assembly Basics, Up: Assembly Coding
+
+15.8.3 Carry Propagation
+------------------------
+
+The problem that presents most challenges in GMP is propagating carries
+from one limb to the next. In functions like 'mpn_addmul_1' and
+'mpn_add_n', carries are the only dependencies between limb operations.
+
+ On processors with carry flags, a straightforward CISC style 'adc' is
+generally best. AMD K6 'mpn_addmul_1' however is an example of an
+unusual set of circumstances where a branch works out better.
+
+ On RISC processors generally an add and compare for overflow is used.
+This sort of thing can be seen in 'mpn/generic/aors_n.c'. Some carry
+propagation schemes require 4 instructions, meaning at least 4 cycles
+per limb, but other schemes may use just 1 or 2. On wide superscalar
+processors performance may be completely determined by the number of
+dependent instructions between carry-in and carry-out for each limb.
+
+ On vector processors good use can be made of the fact that a carry
+bit only very rarely propagates more than one limb. When adding a
+single bit to a limb, there's only a carry out if that limb was
+'0xFF...FF' which on random data will be only 1 in 2^mp_bits_per_limb.
+'mpn/cray/add_n.c' is an example of this, it adds all limbs in parallel,
+adds one set of carry bits in parallel and then only rarely needs to
+fall through to a loop propagating further carries.
+
+ On the x86s, GCC (as of version 2.95.2) doesn't generate particularly
+good code for the RISC style idioms that are necessary to handle carry
+bits in C. Often conditional jumps are generated where 'adc' or 'sbb'
+forms would be better. And so unfortunately almost any loop involving
+carry bits needs to be coded in assembly for best results.
+
+\1f
+File: gmp.info, Node: Assembly Cache Handling, Next: Assembly Functional Units, Prev: Assembly Carry Propagation, Up: Assembly Coding
+
+15.8.4 Cache Handling
+---------------------
+
+GMP aims to perform well both on operands that fit entirely in L1 cache
+and those which don't.
+
+ Basic routines like 'mpn_add_n' or 'mpn_lshift' are often used on
+large operands, so L2 and main memory performance is important for them.
+'mpn_mul_1' and 'mpn_addmul_1' are mostly used for multiply and square
+basecases, so L1 performance matters most for them, unless assembly
+versions of 'mpn_mul_basecase' and 'mpn_sqr_basecase' exist, in which
+case the remaining uses are mostly for larger operands.
+
+ For L2 or main memory operands, memory access times will almost
+certainly be more than the calculation time. The aim therefore is to
+maximize memory throughput, by starting a load of the next cache line
+while processing the contents of the previous one. Clearly this is only
+possible if the chip has a lock-up free cache or some sort of prefetch
+instruction. Most current chips have both these features.
+
+ Prefetching sources combines well with loop unrolling, since a
+prefetch can be initiated once per unrolled loop (or more than once if
+the loop covers more than one cache line).
+
+ On CPUs without write-allocate caches, prefetching destinations will
+ensure individual stores don't go further down the cache hierarchy,
+limiting bandwidth. Of course for calculations which are slow anyway,
+like 'mpn_divrem_1', write-throughs might be fine.
+
+ The distance ahead to prefetch will be determined by memory latency
+versus throughput. The aim of course is to have data arriving
+continuously, at peak throughput. Some CPUs have limits on the number
+of fetches or prefetches in progress.
+
+ If a special prefetch instruction doesn't exist then a plain load can
+be used, but in that case care must be taken not to attempt to read past
+the end of an operand, since that might produce a segmentation
+violation.
+
+ Some CPUs or systems have hardware that detects sequential memory
+accesses and initiates suitable cache movements automatically, making
+life easy.
+
+\1f
+File: gmp.info, Node: Assembly Functional Units, Next: Assembly Floating Point, Prev: Assembly Cache Handling, Up: Assembly Coding
+
+15.8.5 Functional Units
+-----------------------
+
+When choosing an approach for an assembly loop, consideration is given
+to what operations can execute simultaneously and what throughput can
+thereby be achieved. In some cases an algorithm can be tweaked to
+accommodate available resources.
+
+ Loop control will generally require a counter and pointer updates,
+costing as much as 5 instructions, plus any delays a branch introduces.
+CPU addressing modes might reduce pointer updates, perhaps by allowing
+just one updating pointer and others expressed as offsets from it, or on
+CISC chips with all addressing done with the loop counter as a scaled
+index.
+
+ The final loop control cost can be amortised by processing several
+limbs in each iteration (*note Assembly Loop Unrolling::). This at
+least ensures loop control isn't a big fraction of the work done.
+
+ Memory throughput is always a limit. If perhaps only one load or one
+store can be done per cycle then 3 cycles/limb will be the top speed for
+"binary" operations like 'mpn_add_n', and any code achieving that is
+optimal.
+
+ Integer resources can be freed up by having the loop counter in a
+float register, or by pressing the float units into use for some
+multiplying, perhaps doing every second limb on the float side (*note
+Assembly Floating Point::).
+
+ Float resources can be freed up by doing carry propagation on the
+integer side, or even by doing integer to float conversions in integers
+using bit twiddling.
+
+\1f
+File: gmp.info, Node: Assembly Floating Point, Next: Assembly SIMD Instructions, Prev: Assembly Functional Units, Up: Assembly Coding
+
+15.8.6 Floating Point
+---------------------
+
+Floating point arithmetic is used in GMP for multiplications on CPUs
+with poor integer multipliers. It's mostly useful for 'mpn_mul_1',
+'mpn_addmul_1' and 'mpn_submul_1' on 64-bit machines, and
+'mpn_mul_basecase' on both 32-bit and 64-bit machines.
+
+ With IEEE 53-bit double precision floats, integer multiplications
+producing up to 53 bits will give exact results. Breaking a 64x64
+multiplication into eight 16x32->48 bit pieces is convenient. With some
+care though six 21x32->53 bit products can be used, if one of the lower
+two 21-bit pieces also uses the sign bit.
+
+ For the 'mpn_mul_1' family of functions on a 64-bit machine, the
+invariant single limb is split at the start, into 3 or 4 pieces. Inside
+the loop, the bignum operand is split into 32-bit pieces. Fast
+conversion of these unsigned 32-bit pieces to floating point is highly
+machine-dependent. In some cases, reading the data into the integer
+unit, zero-extending to 64-bits, then transferring to the floating point
+unit back via memory is the only option.
+
+ Converting partial products back to 64-bit limbs is usually best done
+as a signed conversion. Since all values are smaller than 2^53, signed
+and unsigned are the same, but most processors lack unsigned
+conversions.
+
+
+
+ Here is a diagram showing 16x32 bit products for an 'mpn_mul_1' or
+'mpn_addmul_1' with a 64-bit limb. The single limb operand V is split
+into four 16-bit parts. The multi-limb operand U is split in the loop
+into two 32-bit parts.
+
+ +---+---+---+---+
+ |v48|v32|v16|v00| V operand
+ +---+---+---+---+
+
+ +-------+---+---+
+ x | u32 | u00 | U operand (one limb)
+ +---------------+
+
+ ---------------------------------
+
+ +-----------+
+ | u00 x v00 | p00 48-bit products
+ +-----------+
+ +-----------+
+ | u00 x v16 | p16
+ +-----------+
+ +-----------+
+ | u00 x v32 | p32
+ +-----------+
+ +-----------+
+ | u00 x v48 | p48
+ +-----------+
+ +-----------+
+ | u32 x v00 | r32
+ +-----------+
+ +-----------+
+ | u32 x v16 | r48
+ +-----------+
+ +-----------+
+ | u32 x v32 | r64
+ +-----------+
+ +-----------+
+ | u32 x v48 | r80
+ +-----------+
+
+ p32 and r32 can be summed using floating-point addition, and likewise
+p48 and r48. p00 and p16 can be summed with r64 and r80 from the
+previous iteration.
+
+ For each loop then, four 49-bit quantities are transferred to the
+integer unit, aligned as follows,
+
+ |-----64bits----|-----64bits----|
+ +------------+
+ | p00 + r64' | i00
+ +------------+
+ +------------+
+ | p16 + r80' | i16
+ +------------+
+ +------------+
+ | p32 + r32 | i32
+ +------------+
+ +------------+
+ | p48 + r48 | i48
+ +------------+
+
+ The challenge then is to sum these efficiently and add in a carry
+limb, generating a low 64-bit result limb and a high 33-bit carry limb
+(i48 extends 33 bits into the high half).
+
+\1f
+File: gmp.info, Node: Assembly SIMD Instructions, Next: Assembly Software Pipelining, Prev: Assembly Floating Point, Up: Assembly Coding
+
+15.8.7 SIMD Instructions
+------------------------
+
+The single-instruction multiple-data support in current microprocessors
+is aimed at signal processing algorithms where each data point can be
+treated more or less independently. There's generally not much support
+for propagating the sort of carries that arise in GMP.
+
+ SIMD multiplications of say four 16x16 bit multiplies only do as much
+work as one 32x32 from GMP's point of view, and need some shifts and
+adds besides. But of course if say the SIMD form is fully pipelined and
+uses less instruction decoding then it may still be worthwhile.
+
+ On the x86 chips, MMX has so far found a use in 'mpn_rshift' and
+'mpn_lshift', and is used in a special case for 16-bit multipliers in
+the P55 'mpn_mul_1'. SSE2 is used for Pentium 4 'mpn_mul_1',
+'mpn_addmul_1', and 'mpn_submul_1'.
+
+\1f
+File: gmp.info, Node: Assembly Software Pipelining, Next: Assembly Loop Unrolling, Prev: Assembly SIMD Instructions, Up: Assembly Coding
+
+15.8.8 Software Pipelining
+--------------------------
+
+Software pipelining consists of scheduling instructions around the
+branch point in a loop. For example a loop might issue a load not for
+use in the present iteration but the next, thereby allowing extra cycles
+for the data to arrive from memory.
+
+ Naturally this is wanted only when doing things like loads or
+multiplies that take several cycles to complete, and only where a CPU
+has multiple functional units so that other work can be done in the
+meantime.
+
+ A pipeline with several stages will have a data value in progress at
+each stage and each loop iteration moves them along one stage. This is
+like juggling.
+
+ If the latency of some instruction is greater than the loop time then
+it will be necessary to unroll, so one register has a result ready to
+use while another (or multiple others) are still in progress (*note
+Assembly Loop Unrolling::).
+
+\1f
+File: gmp.info, Node: Assembly Loop Unrolling, Next: Assembly Writing Guide, Prev: Assembly Software Pipelining, Up: Assembly Coding
+
+15.8.9 Loop Unrolling
+---------------------
+
+Loop unrolling consists of replicating code so that several limbs are
+processed in each loop. At a minimum this reduces loop overheads by a
+corresponding factor, but it can also allow better register usage, for
+example alternately using one register combination and then another.
+Judicious use of 'm4' macros can help avoid lots of duplication in the
+source code.
+
+ Any amount of unrolling can be handled with a loop counter that's
+decremented by N each time, stopping when the remaining count is less
+than the further N the loop will process. Or by subtracting N at the
+start, the termination condition becomes when the counter C is less than
+0 (and the count of remaining limbs is C+N).
+
+ Alternately for a power of 2 unroll the loop count and remainder can
+be established with a shift and mask. This is convenient if also making
+a computed jump into the middle of a large loop.
+
+ The limbs not a multiple of the unrolling can be handled in various
+ways, for example
+
+ * A simple loop at the end (or the start) to process the excess.
+ Care will be wanted that it isn't too much slower than the unrolled
+ part.
+
+ * A set of binary tests, for example after an 8-limb unrolling, test
+ for 4 more limbs to process, then a further 2 more or not, and
+ finally 1 more or not. This will probably take more code space
+ than a simple loop.
+
+ * A 'switch' statement, providing separate code for each possible
+ excess, for example an 8-limb unrolling would have separate code
+ for 0 remaining, 1 remaining, etc, up to 7 remaining. This might
+ take a lot of code, but may be the best way to optimize all cases
+ in combination with a deep pipelined loop.
+
+ * A computed jump into the middle of the loop, thus making the first
+ iteration handle the excess. This should make times smoothly
+ increase with size, which is attractive, but setups for the jump
+ and adjustments for pointers can be tricky and could become quite
+ difficult in combination with deep pipelining.
+
+\1f
+File: gmp.info, Node: Assembly Writing Guide, Prev: Assembly Loop Unrolling, Up: Assembly Coding
+
+15.8.10 Writing Guide
+---------------------
+
+This is a guide to writing software pipelined loops for processing limb
+vectors in assembly.
+
+ First determine the algorithm and which instructions are needed.
+Code it without unrolling or scheduling, to make sure it works. On a
+3-operand CPU try to write each new value to a new register, this will
+greatly simplify later steps.
+
+ Then note for each instruction the functional unit and/or issue port
+requirements. If an instruction can use either of two units, like U0 or
+U1 then make a category "U0/U1". Count the total using each unit (or
+combined unit), and count all instructions.
+
+ Figure out from those counts the best possible loop time. The goal
+will be to find a perfect schedule where instruction latencies are
+completely hidden. The total instruction count might be the limiting
+factor, or perhaps a particular functional unit. It might be possible
+to tweak the instructions to help the limiting factor.
+
+ Suppose the loop time is N, then make N issue buckets, with the final
+loop branch at the end of the last. Now fill the buckets with dummy
+instructions using the functional units desired. Run this to make sure
+the intended speed is reached.
+
+ Now replace the dummy instructions with the real instructions from
+the slow but correct loop you started with. The first will typically be
+a load instruction. Then the instruction using that value is placed in
+a bucket an appropriate distance down. Run the loop again, to check it
+still runs at target speed.
+
+ Keep placing instructions, frequently measuring the loop. After a
+few you will need to wrap around from the last bucket back to the top of
+the loop. If you used the new-register for new-value strategy above
+then there will be no register conflicts. If not then take care not to
+clobber something already in use. Changing registers at this time is
+very error prone.
+
+ The loop will overlap two or more of the original loop iterations,
+and the computation of one vector element result will be started in one
+iteration of the new loop, and completed one or several iterations
+later.
+
+ The final step is to create feed-in and wind-down code for the loop.
+A good way to do this is to make a copy (or copies) of the loop at the
+start and delete those instructions which don't have valid antecedents,
+and at the end replicate and delete those whose results are unwanted
+(including any further loads).
+
+ The loop will have a minimum number of limbs loaded and processed, so
+the feed-in code must test if the request size is smaller and skip
+either to a suitable part of the wind-down or to special code for small
+sizes.
+
+\1f
+File: gmp.info, Node: Internals, Next: Contributors, Prev: Algorithms, Up: Top
+
+16 Internals
+************
+
+*This chapter is provided only for informational purposes and the
+various internals described here may change in future GMP releases.
+Applications expecting to be compatible with future releases should use
+only the documented interfaces described in previous chapters.*
+
+* Menu:
+
+* Integer Internals::
+* Rational Internals::
+* Float Internals::
+* Raw Output Internals::
+* C++ Interface Internals::
+
+\1f
+File: gmp.info, Node: Integer Internals, Next: Rational Internals, Prev: Internals, Up: Internals
+
+16.1 Integer Internals
+======================
+
+'mpz_t' variables represent integers using sign and magnitude, in space
+dynamically allocated and reallocated. The fields are as follows.
+
+'_mp_size'
+ The number of limbs, or the negative of that when representing a
+ negative integer. Zero is represented by '_mp_size' set to zero,
+ in which case the '_mp_d' data is undefined.
+
+'_mp_d'
+ A pointer to an array of limbs which is the magnitude. These are
+ stored "little endian" as per the 'mpn' functions, so '_mp_d[0]' is
+ the least significant limb and '_mp_d[ABS(_mp_size)-1]' is the most
+ significant. Whenever '_mp_size' is non-zero, the most significant
+ limb is non-zero.
+
+ Currently there's always at least one readable limb, so for
+ instance 'mpz_get_ui' can fetch '_mp_d[0]' unconditionally (though
+ its value is undefined if '_mp_size' is zero).
+
+'_mp_alloc'
+ '_mp_alloc' is the number of limbs currently allocated at '_mp_d',
+ and normally '_mp_alloc >= ABS(_mp_size)'. When an 'mpz' routine
+ is about to (or might be about to) increase '_mp_size', it checks
+ '_mp_alloc' to see whether there's enough space, and reallocates if
+ not. 'MPZ_REALLOC' is generally used for this.
+
+ 'mpz_t' variables initialised with the 'mpz_roinit_n' function or
+ the 'MPZ_ROINIT_N' macro have '_mp_alloc = 0' but can have a
+ non-zero '_mp_size'. They can only be used as read-only constants.
+ See *note Integer Special Functions:: for details.
+
+ The various bitwise logical functions like 'mpz_and' behave as if
+negative values were two's complement. But sign and magnitude is always
+used internally, and necessary adjustments are made during the
+calculations. Sometimes this isn't pretty, but sign and magnitude are
+best for other routines.
+
+ Some internal temporary variables are set up with 'MPZ_TMP_INIT' and
+these have '_mp_d' space obtained from 'TMP_ALLOC' rather than the
+memory allocation functions. Care is taken to ensure that these are big
+enough that no reallocation is necessary (since it would have
+unpredictable consequences).
+
+ '_mp_size' and '_mp_alloc' are 'int', although 'mp_size_t' is usually
+a 'long'. This is done to make the fields just 32 bits on some 64 bits
+systems, thereby saving a few bytes of data space but still providing
+plenty of range.
+
+\1f
+File: gmp.info, Node: Rational Internals, Next: Float Internals, Prev: Integer Internals, Up: Internals
+
+16.2 Rational Internals
+=======================
+
+'mpq_t' variables represent rationals using an 'mpz_t' numerator and
+denominator (*note Integer Internals::).
+
+ The canonical form adopted is denominator positive (and non-zero), no
+common factors between numerator and denominator, and zero uniquely
+represented as 0/1.
+
+ It's believed that casting out common factors at each stage of a
+calculation is best in general. A GCD is an O(N^2) operation so it's
+better to do a few small ones immediately than to delay and have to do a
+big one later. Knowing the numerator and denominator have no common
+factors can be used for example in 'mpq_mul' to make only two cross GCDs
+necessary, not four.
+
+ This general approach to common factors is badly sub-optimal in the
+presence of simple factorizations or little prospect for cancellation,
+but GMP has no way to know when this will occur. As per *note
+Efficiency::, that's left to applications. The 'mpq_t' framework might
+still suit, with 'mpq_numref' and 'mpq_denref' for direct access to the
+numerator and denominator, or of course 'mpz_t' variables can be used
+directly.
+
+\1f
+File: gmp.info, Node: Float Internals, Next: Raw Output Internals, Prev: Rational Internals, Up: Internals
+
+16.3 Float Internals
+====================
+
+Efficient calculation is the primary aim of GMP floats and the use of
+whole limbs and simple rounding facilitates this.
+
+ 'mpf_t' floats have a variable precision mantissa and a single
+machine word signed exponent. The mantissa is represented using sign
+and magnitude.
+
+ most least
+ significant significant
+ limb limb
+
+ _mp_d
+ |---- _mp_exp ---> |
+ _____ _____ _____ _____ _____
+ |_____|_____|_____|_____|_____|
+ . <------------ radix point
+
+ <-------- _mp_size --------->
+
+
+The fields are as follows.
+
+'_mp_size'
+ The number of limbs currently in use, or the negative of that when
+ representing a negative value. Zero is represented by '_mp_size'
+ and '_mp_exp' both set to zero, and in that case the '_mp_d' data
+ is unused. (In the future '_mp_exp' might be undefined when
+ representing zero.)
+
+'_mp_prec'
+ The precision of the mantissa, in limbs. In any calculation the
+ aim is to produce '_mp_prec' limbs of result (the most significant
+ being non-zero).
+
+'_mp_d'
+ A pointer to the array of limbs which is the absolute value of the
+ mantissa. These are stored "little endian" as per the 'mpn'
+ functions, so '_mp_d[0]' is the least significant limb and
+ '_mp_d[ABS(_mp_size)-1]' the most significant.
+
+ The most significant limb is always non-zero, but there are no
+ other restrictions on its value, in particular the highest 1 bit
+ can be anywhere within the limb.
+
+ '_mp_prec+1' limbs are allocated to '_mp_d', the extra limb being
+ for convenience (see below). There are no reallocations during a
+ calculation, only in a change of precision with 'mpf_set_prec'.
+
+'_mp_exp'
+ The exponent, in limbs, determining the location of the implied
+ radix point. Zero means the radix point is just above the most
+ significant limb. Positive values mean a radix point offset
+ towards the lower limbs and hence a value >= 1, as for example in
+ the diagram above. Negative exponents mean a radix point further
+ above the highest limb.
+
+ Naturally the exponent can be any value, it doesn't have to fall
+ within the limbs as the diagram shows, it can be a long way above
+ or a long way below. Limbs other than those included in the
+ '{_mp_d,_mp_size}' data are treated as zero.
+
+ The '_mp_size' and '_mp_prec' fields are 'int', although the
+'mp_size_t' type is usually a 'long'. The '_mp_exp' field is usually
+'long'. This is done to make some fields just 32 bits on some 64 bits
+systems, thereby saving a few bytes of data space but still providing
+plenty of precision and a very large range.
+
+
+The following various points should be noted.
+
+Low Zeros
+ The least significant limbs '_mp_d[0]' etc can be zero, though such
+ low zeros can always be ignored. Routines likely to produce low
+ zeros check and avoid them to save time in subsequent calculations,
+ but for most routines they're quite unlikely and aren't checked.
+
+Mantissa Size Range
+ The '_mp_size' count of limbs in use can be less than '_mp_prec' if
+ the value can be represented in less. This means low precision
+ values or small integers stored in a high precision 'mpf_t' can
+ still be operated on efficiently.
+
+ '_mp_size' can also be greater than '_mp_prec'. Firstly a value is
+ allowed to use all of the '_mp_prec+1' limbs available at '_mp_d',
+ and secondly when 'mpf_set_prec_raw' lowers '_mp_prec' it leaves
+ '_mp_size' unchanged and so the size can be arbitrarily bigger than
+ '_mp_prec'.
+
+Rounding
+ All rounding is done on limb boundaries. Calculating '_mp_prec'
+ limbs with the high non-zero will ensure the application requested
+ minimum precision is obtained.
+
+ The use of simple "trunc" rounding towards zero is efficient, since
+ there's no need to examine extra limbs and increment or decrement.
+
+Bit Shifts
+ Since the exponent is in limbs, there are no bit shifts in basic
+ operations like 'mpf_add' and 'mpf_mul'. When differing exponents
+ are encountered all that's needed is to adjust pointers to line up
+ the relevant limbs.
+
+ Of course 'mpf_mul_2exp' and 'mpf_div_2exp' will require bit
+ shifts, but the choice is between an exponent in limbs which
+ requires shifts there, or one in bits which requires them almost
+ everywhere else.
+
+Use of '_mp_prec+1' Limbs
+ The extra limb on '_mp_d' ('_mp_prec+1' rather than just
+ '_mp_prec') helps when an 'mpf' routine might get a carry from its
+ operation. 'mpf_add' for instance will do an 'mpn_add' of
+ '_mp_prec' limbs. If there's no carry then that's the result, but
+ if there is a carry then it's stored in the extra limb of space and
+ '_mp_size' becomes '_mp_prec+1'.
+
+ Whenever '_mp_prec+1' limbs are held in a variable, the low limb is
+ not needed for the intended precision, only the '_mp_prec' high
+ limbs. But zeroing it out or moving the rest down is unnecessary.
+ Subsequent routines reading the value will simply take the high
+ limbs they need, and this will be '_mp_prec' if their target has
+ that same precision. This is no more than a pointer adjustment,
+ and must be checked anyway since the destination precision can be
+ different from the sources.
+
+ Copy functions like 'mpf_set' will retain a full '_mp_prec+1' limbs
+ if available. This ensures that a variable which has '_mp_size'
+ equal to '_mp_prec+1' will get its full exact value copied.
+ Strictly speaking this is unnecessary since only '_mp_prec' limbs
+ are needed for the application's requested precision, but it's
+ considered that an 'mpf_set' from one variable into another of the
+ same precision ought to produce an exact copy.
+
+Application Precisions
+ '__GMPF_BITS_TO_PREC' converts an application requested precision
+ to an '_mp_prec'. The value in bits is rounded up to a whole limb
+ then an extra limb is added since the most significant limb of
+ '_mp_d' is only non-zero and therefore might contain only one bit.
+
+ '__GMPF_PREC_TO_BITS' does the reverse conversion, and removes the
+ extra limb from '_mp_prec' before converting to bits. The net
+ effect of reading back with 'mpf_get_prec' is simply the precision
+ rounded up to a multiple of 'mp_bits_per_limb'.
+
+ Note that the extra limb added here for the high only being
+ non-zero is in addition to the extra limb allocated to '_mp_d'.
+ For example with a 32-bit limb, an application request for 250 bits
+ will be rounded up to 8 limbs, then an extra added for the high
+ being only non-zero, giving an '_mp_prec' of 9. '_mp_d' then gets
+ 10 limbs allocated. Reading back with 'mpf_get_prec' will take
+ '_mp_prec' subtract 1 limb and multiply by 32, giving 256 bits.
+
+ Strictly speaking, the fact that the high limb has at least one bit
+ means that a float with, say, 3 limbs of 32-bits each will be
+ holding at least 65 bits, but for the purposes of 'mpf_t' it's
+ considered simply to be 64 bits, a nice multiple of the limb size.
+
+\1f
+File: gmp.info, Node: Raw Output Internals, Next: C++ Interface Internals, Prev: Float Internals, Up: Internals
+
+16.4 Raw Output Internals
+=========================
+
+'mpz_out_raw' uses the following format.
+
+ +------+------------------------+
+ | size | data bytes |
+ +------+------------------------+
+
+ The size is 4 bytes written most significant byte first, being the
+number of subsequent data bytes, or the two's complement negative of
+that when a negative integer is represented. The data bytes are the
+absolute value of the integer, written most significant byte first.
+
+ The most significant data byte is always non-zero, so the output is
+the same on all systems, irrespective of limb size.
+
+ In GMP 1, leading zero bytes were written to pad the data bytes to a
+multiple of the limb size. 'mpz_inp_raw' will still accept this, for
+compatibility.
+
+ The use of "big endian" for both the size and data fields is
+deliberate, it makes the data easy to read in a hex dump of a file.
+Unfortunately it also means that the limb data must be reversed when
+reading or writing, so neither a big endian nor little endian system can
+just read and write '_mp_d'.
+
+\1f
+File: gmp.info, Node: C++ Interface Internals, Prev: Raw Output Internals, Up: Internals
+
+16.5 C++ Interface Internals
+============================
+
+A system of expression templates is used to ensure something like
+'a=b+c' turns into a simple call to 'mpz_add' etc. For 'mpf_class' the
+scheme also ensures the precision of the final destination is used for
+any temporaries within a statement like 'f=w*x+y*z'. These are
+important features which a naive implementation cannot provide.
+
+ A simplified description of the scheme follows. The true scheme is
+complicated by the fact that expressions have different return types.
+For detailed information, refer to the source code.
+
+ To perform an operation, say, addition, we first define a "function
+object" evaluating it,
+
+ struct __gmp_binary_plus
+ {
+ static void eval(mpf_t f, const mpf_t g, const mpf_t h)
+ {
+ mpf_add(f, g, h);
+ }
+ };
+
+And an "additive expression" object,
+
+ __gmp_expr<__gmp_binary_expr<mpf_class, mpf_class, __gmp_binary_plus> >
+ operator+(const mpf_class &f, const mpf_class &g)
+ {
+ return __gmp_expr
+ <__gmp_binary_expr<mpf_class, mpf_class, __gmp_binary_plus> >(f, g);
+ }
+
+ The seemingly redundant '__gmp_expr<__gmp_binary_expr<...>>' is used
+to encapsulate any possible kind of expression into a single template
+type. In fact even 'mpf_class' etc are 'typedef' specializations of
+'__gmp_expr'.
+
+ Next we define assignment of '__gmp_expr' to 'mpf_class'.
+
+ template <class T>
+ mpf_class & mpf_class::operator=(const __gmp_expr<T> &expr)
+ {
+ expr.eval(this->get_mpf_t(), this->precision());
+ return *this;
+ }
+
+ template <class Op>
+ void __gmp_expr<__gmp_binary_expr<mpf_class, mpf_class, Op> >::eval
+ (mpf_t f, mp_bitcnt_t precision)
+ {
+ Op::eval(f, expr.val1.get_mpf_t(), expr.val2.get_mpf_t());
+ }
+
+ where 'expr.val1' and 'expr.val2' are references to the expression's
+operands (here 'expr' is the '__gmp_binary_expr' stored within the
+'__gmp_expr').
+
+ This way, the expression is actually evaluated only at the time of
+assignment, when the required precision (that of 'f') is known.
+Furthermore the target 'mpf_t' is now available, thus we can call
+'mpf_add' directly with 'f' as the output argument.
+
+ Compound expressions are handled by defining operators taking
+subexpressions as their arguments, like this:
+
+ template <class T, class U>
+ __gmp_expr
+ <__gmp_binary_expr<__gmp_expr<T>, __gmp_expr<U>, __gmp_binary_plus> >
+ operator+(const __gmp_expr<T> &expr1, const __gmp_expr<U> &expr2)
+ {
+ return __gmp_expr
+ <__gmp_binary_expr<__gmp_expr<T>, __gmp_expr<U>, __gmp_binary_plus> >
+ (expr1, expr2);
+ }
+
+ And the corresponding specializations of '__gmp_expr::eval':
+
+ template <class T, class U, class Op>
+ void __gmp_expr
+ <__gmp_binary_expr<__gmp_expr<T>, __gmp_expr<U>, Op> >::eval
+ (mpf_t f, mp_bitcnt_t precision)
+ {
+ // declare two temporaries
+ mpf_class temp1(expr.val1, precision), temp2(expr.val2, precision);
+ Op::eval(f, temp1.get_mpf_t(), temp2.get_mpf_t());
+ }
+
+ The expression is thus recursively evaluated to any level of
+complexity and all subexpressions are evaluated to the precision of 'f'.
+
+\1f
+File: gmp.info, Node: Contributors, Next: References, Prev: Internals, Up: Top
+
+Appendix A Contributors
+***********************
+
+Torbjörn Granlund wrote the original GMP library and is still the main
+developer. Code not explicitly attributed to others was contributed by
+Torbjörn. Several other individuals and organizations have contributed
+GMP. Here is a list in chronological order on first contribution:
+
+ Gunnar Sjödin and Hans Riesel helped with mathematical problems in
+early versions of the library.
+
+ Richard Stallman helped with the interface design and revised the
+first version of this manual.
+
+ Brian Beuning and Doug Lea helped with testing of early versions of
+the library and made creative suggestions.
+
+ John Amanatides of York University in Canada contributed the function
+'mpz_probab_prime_p'.
+
+ Paul Zimmermann wrote the REDC-based mpz_powm code, the
+Schönhage-Strassen FFT multiply code, and the Karatsuba square root
+code. He also improved the Toom3 code for GMP 4.2. Paul sparked the
+development of GMP 2, with his comparisons between bignum packages. The
+ECMNET project Paul is organizing was a driving force behind many of the
+optimizations in GMP 3. Paul also wrote the new GMP 4.3 nth root code
+(with Torbjörn).
+
+ Ken Weber (Kent State University, Universidade Federal do Rio Grande
+do Sul) contributed now defunct versions of 'mpz_gcd', 'mpz_divexact',
+'mpn_gcd', and 'mpn_bdivmod', partially supported by CNPq (Brazil) grant
+301314194-2.
+
+ Per Bothner of Cygnus Support helped to set up GMP to use Cygnus'
+configure. He has also made valuable suggestions and tested numerous
+intermediary releases.
+
+ Joachim Hollman was involved in the design of the 'mpf' interface,
+and in the 'mpz' design revisions for version 2.
+
+ Bennet Yee contributed the initial versions of 'mpz_jacobi' and
+'mpz_legendre'.
+
+ Andreas Schwab contributed the files 'mpn/m68k/lshift.S' and
+'mpn/m68k/rshift.S' (now in '.asm' form).
+
+ Robert Harley of Inria, France and David Seal of ARM, England,
+suggested clever improvements for population count. Robert also wrote
+highly optimized Karatsuba and 3-way Toom multiplication functions for
+GMP 3, and contributed the ARM assembly code.
+
+ Torsten Ekedahl of the Mathematical Department of Stockholm
+University provided significant inspiration during several phases of the
+GMP development. His mathematical expertise helped improve several
+algorithms.
+
+ Linus Nordberg wrote the new configure system based on autoconf and
+implemented the new random functions.
+
+ Kevin Ryde worked on a large number of things: optimized x86 code, m4
+asm macros, parameter tuning, speed measuring, the configure system,
+function inlining, divisibility tests, bit scanning, Jacobi symbols,
+Fibonacci and Lucas number functions, printf and scanf functions, perl
+interface, demo expression parser, the algorithms chapter in the manual,
+'gmpasm-mode.el', and various miscellaneous improvements elsewhere.
+
+ Kent Boortz made the Mac OS 9 port.
+
+ Steve Root helped write the optimized alpha 21264 assembly code.
+
+ Gerardo Ballabio wrote the 'gmpxx.h' C++ class interface and the C++
+'istream' input routines.
+
+ Jason Moxham rewrote 'mpz_fac_ui'.
+
+ Pedro Gimeno implemented the Mersenne Twister and made other random
+number improvements.
+
+ Niels Möller wrote the sub-quadratic GCD, extended GCD and Jacobi
+code, the quadratic Hensel division code, and (with Torbjörn) the new
+divide and conquer division code for GMP 4.3. Niels also helped
+implement the new Toom multiply code for GMP 4.3 and implemented helper
+functions to simplify Toom evaluations for GMP 5.0. He wrote the
+original version of mpn_mulmod_bnm1, and he is the main author of the
+mini-gmp package used for gmp bootstrapping.
+
+ Alberto Zanoni and Marco Bodrato suggested the unbalanced multiply
+strategy, and found the optimal strategies for evaluation and
+interpolation in Toom multiplication.
+
+ Marco Bodrato helped implement the new Toom multiply code for GMP 4.3
+and implemented most of the new Toom multiply and squaring code for 5.0.
+He is the main author of the current mpn_mulmod_bnm1, mpn_mullo_n, and
+mpn_sqrlo. Marco also wrote the functions mpn_invert and
+mpn_invertappr, and improved the speed of integer root extraction. He
+is the author of mini-mpq, an additional layer to mini-gmp; of most of
+the combinatorial functions and the BPSW primality testing
+implementation, for both the main library and the mini-gmp package.
+
+ David Harvey suggested the internal function 'mpn_bdiv_dbm1',
+implementing division relevant to Toom multiplication. He also worked
+on fast assembly sequences, in particular on a fast AMD64
+'mpn_mul_basecase'. He wrote the internal middle product functions
+'mpn_mulmid_basecase', 'mpn_toom42_mulmid', 'mpn_mulmid_n' and related
+helper routines.
+
+ Martin Boij wrote 'mpn_perfect_power_p'.
+
+ Marc Glisse improved 'gmpxx.h': use fewer temporaries (faster),
+specializations of 'numeric_limits' and 'common_type', C++11 features
+(move constructors, explicit bool conversion, UDL), make the conversion
+from 'mpq_class' to 'mpz_class' explicit, optimize operations where one
+argument is a small compile-time constant, replace some heap allocations
+by stack allocations. He also fixed the eofbit handling of C++ streams,
+and removed one division from 'mpq/aors.c'.
+
+ David S Miller wrote assembly code for SPARC T3 and T4.
+
+ Mark Sofroniou cleaned up the types of mul_fft.c, letting it work for
+huge operands.
+
+ Ulrich Weigand ported GMP to the powerpc64le ABI.
+
+ (This list is chronological, not ordered after significance. If you
+have contributed to GMP but are not listed above, please tell
+<gmp-devel@gmplib.org> about the omission!)
+
+ The development of floating point functions of GNU MP 2 was supported
+in part by the ESPRIT-BRA (Basic Research Activities) 6846 project POSSO
+(POlynomial System SOlving).
+
+ The development of GMP 2, 3, and 4.0 was supported in part by the IDA
+Center for Computing Sciences.
+
+ The development of GMP 4.3, 5.0, and 5.1 was supported in part by the
+Swedish Foundation for Strategic Research.
+
+ Thanks go to Hans Thorsen for donating an SGI system for the GMP test
+system environment.
+
+\1f
+File: gmp.info, Node: References, Next: GNU Free Documentation License, Prev: Contributors, Up: Top
+
+Appendix B References
+*********************
+
+B.1 Books
+=========
+
+ * Jonathan M. Borwein and Peter B. Borwein, "Pi and the AGM: A Study
+ in Analytic Number Theory and Computational Complexity", Wiley,
+ 1998.
+
+ * Richard Crandall and Carl Pomerance, "Prime Numbers: A
+ Computational Perspective", 2nd edition, Springer-Verlag, 2005.
+ <https://www.math.dartmouth.edu/~carlp/>
+
+ * Henri Cohen, "A Course in Computational Algebraic Number Theory",
+ Graduate Texts in Mathematics number 138, Springer-Verlag, 1993.
+ <https://www.math.u-bordeaux.fr/~cohen/>
+
+ * Donald E. Knuth, "The Art of Computer Programming", volume 2,
+ "Seminumerical Algorithms", 3rd edition, Addison-Wesley, 1998.
+ <https://www-cs-faculty.stanford.edu/~knuth/taocp.html>
+
+ * John D. Lipson, "Elements of Algebra and Algebraic Computing", The
+ Benjamin Cummings Publishing Company Inc, 1981.
+
+ * Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone,
+ "Handbook of Applied Cryptography",
+ <http://www.cacr.math.uwaterloo.ca/hac/>
+
+ * Richard M. Stallman and the GCC Developer Community, "Using the GNU
+ Compiler Collection", Free Software Foundation, 2008, available
+ online <https://gcc.gnu.org/onlinedocs/>, and in the GCC package
+ <https://ftp.gnu.org/gnu/gcc/>
+
+B.2 Papers
+==========
+
+ * Yves Bertot, Nicolas Magaud and Paul Zimmermann, "A Proof of GMP
+ Square Root", Journal of Automated Reasoning, volume 29, 2002, pp.
+ 225-252. Also available online as INRIA Research Report 4475, June
+ 2002, <https://hal.inria.fr/docs/00/07/21/13/PDF/RR-4475.pdf>
+
+ * Christoph Burnikel and Joachim Ziegler, "Fast Recursive Division",
+ Max-Planck-Institut fuer Informatik Research Report MPI-I-98-1-022,
+ <https://www.mpi-inf.mpg.de/~ziegler/TechRep.ps.gz>
+
+ * Torbjörn Granlund and Peter L. Montgomery, "Division by Invariant
+ Integers using Multiplication", in Proceedings of the SIGPLAN
+ PLDI'94 Conference, June 1994. Also available
+ <https://gmplib.org/~tege/divcnst-pldi94.pdf>.
+
+ * Niels Möller and Torbjörn Granlund, "Improved division by invariant
+ integers", IEEE Transactions on Computers, 11 June 2010.
+ <https://gmplib.org/~tege/division-paper.pdf>
+
+ * Torbjörn Granlund and Niels Möller, "Division of integers large and
+ small", to appear.
+
+ * Tudor Jebelean, "An algorithm for exact division", Journal of
+ Symbolic Computation, volume 15, 1993, pp. 169-180. Research
+ report version available
+ <ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1992/92-35.ps.gz>
+
+ * Tudor Jebelean, "Exact Division with Karatsuba Complexity -
+ Extended Abstract", RISC-Linz technical report 96-31,
+ <ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1996/96-31.ps.gz>
+
+ * Tudor Jebelean, "Practical Integer Division with Karatsuba
+ Complexity", ISSAC 97, pp. 339-341. Technical report available
+ <ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1996/96-29.ps.gz>
+
+ * Tudor Jebelean, "A Generalization of the Binary GCD Algorithm",
+ ISSAC 93, pp. 111-116. Technical report version available
+ <ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1993/93-01.ps.gz>
+
+ * Tudor Jebelean, "A Double-Digit Lehmer-Euclid Algorithm for Finding
+ the GCD of Long Integers", Journal of Symbolic Computation, volume
+ 19, 1995, pp. 145-157. Technical report version also available
+ <ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1992/92-69.ps.gz>
+
+ * Werner Krandick and Tudor Jebelean, "Bidirectional Exact Integer
+ Division", Journal of Symbolic Computation, volume 21, 1996, pp.
+ 441-455. Early technical report version also available
+ <ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1994/94-50.ps.gz>
+
+ * Makoto Matsumoto and Takuji Nishimura, "Mersenne Twister: A
+ 623-dimensionally equidistributed uniform pseudorandom number
+ generator", ACM Transactions on Modelling and Computer Simulation,
+ volume 8, January 1998, pp. 3-30. Available online
+ <http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/ARTICLES/mt.pdf>
+
+ * R. Moenck and A. Borodin, "Fast Modular Transforms via Division",
+ Proceedings of the 13th Annual IEEE Symposium on Switching and
+ Automata Theory, October 1972, pp. 90-96. Reprinted as "Fast
+ Modular Transforms", Journal of Computer and System Sciences,
+ volume 8, number 3, June 1974, pp. 366-386.
+
+ * Niels Möller, "On Schönhage's algorithm and subquadratic integer
+ GCD computation", in Mathematics of Computation, volume 77, January
+ 2008, pp. 589-607,
+ <https://www.ams.org/journals/mcom/2008-77-261/S0025-5718-07-02017-0/home.html>
+
+ * Peter L. Montgomery, "Modular Multiplication Without Trial
+ Division", in Mathematics of Computation, volume 44, number 170,
+ April 1985.
+
+ * Arnold Schönhage and Volker Strassen, "Schnelle Multiplikation
+ grosser Zahlen", Computing 7, 1971, pp. 281-292.
+
+ * Kenneth Weber, "The accelerated integer GCD algorithm", ACM
+ Transactions on Mathematical Software, volume 21, number 1, March
+ 1995, pp. 111-122.
+
+ * Paul Zimmermann, "Karatsuba Square Root", INRIA Research Report
+ 3805, November 1999,
+ <https://hal.inria.fr/inria-00072854/PDF/RR-3805.pdf>
+
+ * Paul Zimmermann, "A Proof of GMP Fast Division and Square Root
+ Implementations",
+ <https://homepages.loria.fr/PZimmermann/papers/proof-div-sqrt.ps.gz>
+
+ * Dan Zuras, "On Squaring and Multiplying Large Integers", ARITH-11:
+ IEEE Symposium on Computer Arithmetic, 1993, pp. 260 to 271.
+ Reprinted as "More on Multiplying and Squaring Large Integers",
+ IEEE Transactions on Computers, volume 43, number 8, August 1994,
+ pp. 899-908.
+
+ * Niels Möller, "Efficient computation of the Jacobi symbol",
+ <https://arxiv.org/abs/1907.07795>
+
+\1f
+File: gmp.info, Node: GNU Free Documentation License, Next: Concept Index, Prev: References, Up: Top
+
+Appendix C GNU Free Documentation License
+*****************************************
+
+ Version 1.3, 3 November 2008
+
+ Copyright © 2000-2002, 2007, 2008 Free Software Foundation, Inc.
+ <http://fsf.org/>
+
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ 0. PREAMBLE
+
+ The purpose of this License is to make a manual, textbook, or other
+ functional and useful document "free" in the sense of freedom: to
+ assure everyone the effective freedom to copy and redistribute it,
+ with or without modifying it, either commercially or
+ noncommercially. Secondarily, this License preserves for the
+ author and publisher a way to get credit for their work, while not
+ being considered responsible for modifications made by others.
+
+ This License is a kind of "copyleft", which means that derivative
+ works of the document must themselves be free in the same sense.
+ It complements the GNU General Public License, which is a copyleft
+ license designed for free software.
+
+ We have designed this License in order to use it for manuals for
+ free software, because free software needs free documentation: a
+ free program should come with manuals providing the same freedoms
+ that the software does. But this License is not limited to
+ software manuals; it can be used for any textual work, regardless
+ of subject matter or whether it is published as a printed book. We
+ recommend this License principally for works whose purpose is
+ instruction or reference.
+
+ 1. APPLICABILITY AND DEFINITIONS
+
+ This License applies to any manual or other work, in any medium,
+ that contains a notice placed by the copyright holder saying it can
+ be distributed under the terms of this License. Such a notice
+ grants a world-wide, royalty-free license, unlimited in duration,
+ to use that work under the conditions stated herein. The
+ "Document", below, refers to any such manual or work. Any member
+ of the public is a licensee, and is addressed as "you". You accept
+ the license if you copy, modify or distribute the work in a way
+ requiring permission under copyright law.
+
+ A "Modified Version" of the Document means any work containing the
+ Document or a portion of it, either copied verbatim, or with
+ modifications and/or translated into another language.
+
+ A "Secondary Section" is a named appendix or a front-matter section
+ of the Document that deals exclusively with the relationship of the
+ publishers or authors of the Document to the Document's overall
+ subject (or to related matters) and contains nothing that could
+ fall directly within that overall subject. (Thus, if the Document
+ is in part a textbook of mathematics, a Secondary Section may not
+ explain any mathematics.) The relationship could be a matter of
+ historical connection with the subject or with related matters, or
+ of legal, commercial, philosophical, ethical or political position
+ regarding them.
+
+ The "Invariant Sections" are certain Secondary Sections whose
+ titles are designated, as being those of Invariant Sections, in the
+ notice that says that the Document is released under this License.
+ If a section does not fit the above definition of Secondary then it
+ is not allowed to be designated as Invariant. The Document may
+ contain zero Invariant Sections. If the Document does not identify
+ any Invariant Sections then there are none.
+
+ The "Cover Texts" are certain short passages of text that are
+ listed, as Front-Cover Texts or Back-Cover Texts, in the notice
+ that says that the Document is released under this License. A
+ Front-Cover Text may be at most 5 words, and a Back-Cover Text may
+ be at most 25 words.
+
+ A "Transparent" copy of the Document means a machine-readable copy,
+ represented in a format whose specification is available to the
+ general public, that is suitable for revising the document
+ straightforwardly with generic text editors or (for images composed
+ of pixels) generic paint programs or (for drawings) some widely
+ available drawing editor, and that is suitable for input to text
+ formatters or for automatic translation to a variety of formats
+ suitable for input to text formatters. A copy made in an otherwise
+ Transparent file format whose markup, or absence of markup, has
+ been arranged to thwart or discourage subsequent modification by
+ readers is not Transparent. An image format is not Transparent if
+ used for any substantial amount of text. A copy that is not
+ "Transparent" is called "Opaque".
+
+ Examples of suitable formats for Transparent copies include plain
+ ASCII without markup, Texinfo input format, LaTeX input format,
+ SGML or XML using a publicly available DTD, and standard-conforming
+ simple HTML, PostScript or PDF designed for human modification.
+ Examples of transparent image formats include PNG, XCF and JPG.
+ Opaque formats include proprietary formats that can be read and
+ edited only by proprietary word processors, SGML or XML for which
+ the DTD and/or processing tools are not generally available, and
+ the machine-generated HTML, PostScript or PDF produced by some word
+ processors for output purposes only.
+
+ The "Title Page" means, for a printed book, the title page itself,
+ plus such following pages as are needed to hold, legibly, the
+ material this License requires to appear in the title page. For
+ works in formats which do not have any title page as such, "Title
+ Page" means the text near the most prominent appearance of the
+ work's title, preceding the beginning of the body of the text.
+
+ The "publisher" means any person or entity that distributes copies
+ of the Document to the public.
+
+ A section "Entitled XYZ" means a named subunit of the Document
+ whose title either is precisely XYZ or contains XYZ in parentheses
+ following text that translates XYZ in another language. (Here XYZ
+ stands for a specific section name mentioned below, such as
+ "Acknowledgements", "Dedications", "Endorsements", or "History".)
+ To "Preserve the Title" of such a section when you modify the
+ Document means that it remains a section "Entitled XYZ" according
+ to this definition.
+
+ The Document may include Warranty Disclaimers next to the notice
+ which states that this License applies to the Document. These
+ Warranty Disclaimers are considered to be included by reference in
+ this License, but only as regards disclaiming warranties: any other
+ implication that these Warranty Disclaimers may have is void and
+ has no effect on the meaning of this License.
+
+ 2. VERBATIM COPYING
+
+ You may copy and distribute the Document in any medium, either
+ commercially or noncommercially, provided that this License, the
+ copyright notices, and the license notice saying this License
+ applies to the Document are reproduced in all copies, and that you
+ add no other conditions whatsoever to those of this License. You
+ may not use technical measures to obstruct or control the reading
+ or further copying of the copies you make or distribute. However,
+ you may accept compensation in exchange for copies. If you
+ distribute a large enough number of copies you must also follow the
+ conditions in section 3.
+
+ You may also lend copies, under the same conditions stated above,
+ and you may publicly display copies.
+
+ 3. COPYING IN QUANTITY
+
+ If you publish printed copies (or copies in media that commonly
+ have printed covers) of the Document, numbering more than 100, and
+ the Document's license notice requires Cover Texts, you must
+ enclose the copies in covers that carry, clearly and legibly, all
+ these Cover Texts: Front-Cover Texts on the front cover, and
+ Back-Cover Texts on the back cover. Both covers must also clearly
+ and legibly identify you as the publisher of these copies. The
+ front cover must present the full title with all words of the title
+ equally prominent and visible. You may add other material on the
+ covers in addition. Copying with changes limited to the covers, as
+ long as they preserve the title of the Document and satisfy these
+ conditions, can be treated as verbatim copying in other respects.
+
+ If the required texts for either cover are too voluminous to fit
+ legibly, you should put the first ones listed (as many as fit
+ reasonably) on the actual cover, and continue the rest onto
+ adjacent pages.
+
+ If you publish or distribute Opaque copies of the Document
+ numbering more than 100, you must either include a machine-readable
+ Transparent copy along with each Opaque copy, or state in or with
+ each Opaque copy a computer-network location from which the general
+ network-using public has access to download using public-standard
+ network protocols a complete Transparent copy of the Document, free
+ of added material. If you use the latter option, you must take
+ reasonably prudent steps, when you begin distribution of Opaque
+ copies in quantity, to ensure that this Transparent copy will
+ remain thus accessible at the stated location until at least one
+ year after the last time you distribute an Opaque copy (directly or
+ through your agents or retailers) of that edition to the public.
+
+ It is requested, but not required, that you contact the authors of
+ the Document well before redistributing any large number of copies,
+ to give them a chance to provide you with an updated version of the
+ Document.
+
+ 4. MODIFICATIONS
+
+ You may copy and distribute a Modified Version of the Document
+ under the conditions of sections 2 and 3 above, provided that you
+ release the Modified Version under precisely this License, with the
+ Modified Version filling the role of the Document, thus licensing
+ distribution and modification of the Modified Version to whoever
+ possesses a copy of it. In addition, you must do these things in
+ the Modified Version:
+
+ A. Use in the Title Page (and on the covers, if any) a title
+ distinct from that of the Document, and from those of previous
+ versions (which should, if there were any, be listed in the
+ History section of the Document). You may use the same title
+ as a previous version if the original publisher of that
+ version gives permission.
+
+ B. List on the Title Page, as authors, one or more persons or
+ entities responsible for authorship of the modifications in
+ the Modified Version, together with at least five of the
+ principal authors of the Document (all of its principal
+ authors, if it has fewer than five), unless they release you
+ from this requirement.
+
+ C. State on the Title page the name of the publisher of the
+ Modified Version, as the publisher.
+
+ D. Preserve all the copyright notices of the Document.
+
+ E. Add an appropriate copyright notice for your modifications
+ adjacent to the other copyright notices.
+
+ F. Include, immediately after the copyright notices, a license
+ notice giving the public permission to use the Modified
+ Version under the terms of this License, in the form shown in
+ the Addendum below.
+
+ G. Preserve in that license notice the full lists of Invariant
+ Sections and required Cover Texts given in the Document's
+ license notice.
+
+ H. Include an unaltered copy of this License.
+
+ I. Preserve the section Entitled "History", Preserve its Title,
+ and add to it an item stating at least the title, year, new
+ authors, and publisher of the Modified Version as given on the
+ Title Page. If there is no section Entitled "History" in the
+ Document, create one stating the title, year, authors, and
+ publisher of the Document as given on its Title Page, then add
+ an item describing the Modified Version as stated in the
+ previous sentence.
+
+ J. Preserve the network location, if any, given in the Document
+ for public access to a Transparent copy of the Document, and
+ likewise the network locations given in the Document for
+ previous versions it was based on. These may be placed in the
+ "History" section. You may omit a network location for a work
+ that was published at least four years before the Document
+ itself, or if the original publisher of the version it refers
+ to gives permission.
+
+ K. For any section Entitled "Acknowledgements" or "Dedications",
+ Preserve the Title of the section, and preserve in the section
+ all the substance and tone of each of the contributor
+ acknowledgements and/or dedications given therein.
+
+ L. Preserve all the Invariant Sections of the Document, unaltered
+ in their text and in their titles. Section numbers or the
+ equivalent are not considered part of the section titles.
+
+ M. Delete any section Entitled "Endorsements". Such a section
+ may not be included in the Modified Version.
+
+ N. Do not retitle any existing section to be Entitled
+ "Endorsements" or to conflict in title with any Invariant
+ Section.
+
+ O. Preserve any Warranty Disclaimers.
+
+ If the Modified Version includes new front-matter sections or
+ appendices that qualify as Secondary Sections and contain no
+ material copied from the Document, you may at your option designate
+ some or all of these sections as invariant. To do this, add their
+ titles to the list of Invariant Sections in the Modified Version's
+ license notice. These titles must be distinct from any other
+ section titles.
+
+ You may add a section Entitled "Endorsements", provided it contains
+ nothing but endorsements of your Modified Version by various
+ parties--for example, statements of peer review or that the text
+ has been approved by an organization as the authoritative
+ definition of a standard.
+
+ You may add a passage of up to five words as a Front-Cover Text,
+ and a passage of up to 25 words as a Back-Cover Text, to the end of
+ the list of Cover Texts in the Modified Version. Only one passage
+ of Front-Cover Text and one of Back-Cover Text may be added by (or
+ through arrangements made by) any one entity. If the Document
+ already includes a cover text for the same cover, previously added
+ by you or by arrangement made by the same entity you are acting on
+ behalf of, you may not add another; but you may replace the old
+ one, on explicit permission from the previous publisher that added
+ the old one.
+
+ The author(s) and publisher(s) of the Document do not by this
+ License give permission to use their names for publicity for or to
+ assert or imply endorsement of any Modified Version.
+
+ 5. COMBINING DOCUMENTS
+
+ You may combine the Document with other documents released under
+ this License, under the terms defined in section 4 above for
+ modified versions, provided that you include in the combination all
+ of the Invariant Sections of all of the original documents,
+ unmodified, and list them all as Invariant Sections of your
+ combined work in its license notice, and that you preserve all
+ their Warranty Disclaimers.
+
+ The combined work need only contain one copy of this License, and
+ multiple identical Invariant Sections may be replaced with a single
+ copy. If there are multiple Invariant Sections with the same name
+ but different contents, make the title of each such section unique
+ by adding at the end of it, in parentheses, the name of the
+ original author or publisher of that section if known, or else a
+ unique number. Make the same adjustment to the section titles in
+ the list of Invariant Sections in the license notice of the
+ combined work.
+
+ In the combination, you must combine any sections Entitled
+ "History" in the various original documents, forming one section
+ Entitled "History"; likewise combine any sections Entitled
+ "Acknowledgements", and any sections Entitled "Dedications". You
+ must delete all sections Entitled "Endorsements."
+
+ 6. COLLECTIONS OF DOCUMENTS
+
+ You may make a collection consisting of the Document and other
+ documents released under this License, and replace the individual
+ copies of this License in the various documents with a single copy
+ that is included in the collection, provided that you follow the
+ rules of this License for verbatim copying of each of the documents
+ in all other respects.
+
+ You may extract a single document from such a collection, and
+ distribute it individually under this License, provided you insert
+ a copy of this License into the extracted document, and follow this
+ License in all other respects regarding verbatim copying of that
+ document.
+
+ 7. AGGREGATION WITH INDEPENDENT WORKS
+
+ A compilation of the Document or its derivatives with other
+ separate and independent documents or works, in or on a volume of a
+ storage or distribution medium, is called an "aggregate" if the
+ copyright resulting from the compilation is not used to limit the
+ legal rights of the compilation's users beyond what the individual
+ works permit. When the Document is included in an aggregate, this
+ License does not apply to the other works in the aggregate which
+ are not themselves derivative works of the Document.
+
+ If the Cover Text requirement of section 3 is applicable to these
+ copies of the Document, then if the Document is less than one half
+ of the entire aggregate, the Document's Cover Texts may be placed
+ on covers that bracket the Document within the aggregate, or the
+ electronic equivalent of covers if the Document is in electronic
+ form. Otherwise they must appear on printed covers that bracket
+ the whole aggregate.
+
+ 8. TRANSLATION
+
+ Translation is considered a kind of modification, so you may
+ distribute translations of the Document under the terms of section
+ 4. Replacing Invariant Sections with translations requires special
+ permission from their copyright holders, but you may include
+ translations of some or all Invariant Sections in addition to the
+ original versions of these Invariant Sections. You may include a
+ translation of this License, and all the license notices in the
+ Document, and any Warranty Disclaimers, provided that you also
+ include the original English version of this License and the
+ original versions of those notices and disclaimers. In case of a
+ disagreement between the translation and the original version of
+ this License or a notice or disclaimer, the original version will
+ prevail.
+
+ If a section in the Document is Entitled "Acknowledgements",
+ "Dedications", or "History", the requirement (section 4) to
+ Preserve its Title (section 1) will typically require changing the
+ actual title.
+
+ 9. TERMINATION
+
+ You may not copy, modify, sublicense, or distribute the Document
+ except as expressly provided under this License. Any attempt
+ otherwise to copy, modify, sublicense, or distribute it is void,
+ and will automatically terminate your rights under this License.
+
+ However, if you cease all violation of this License, then your
+ license from a particular copyright holder is reinstated (a)
+ provisionally, unless and until the copyright holder explicitly and
+ finally terminates your license, and (b) permanently, if the
+ copyright holder fails to notify you of the violation by some
+ reasonable means prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+ reinstated permanently if the copyright holder notifies you of the
+ violation by some reasonable means, this is the first time you have
+ received notice of violation of this License (for any work) from
+ that copyright holder, and you cure the violation prior to 30 days
+ after your receipt of the notice.
+
+ Termination of your rights under this section does not terminate
+ the licenses of parties who have received copies or rights from you
+ under this License. If your rights have been terminated and not
+ permanently reinstated, receipt of a copy of some or all of the
+ same material does not give you any rights to use it.
+
+ 10. FUTURE REVISIONS OF THIS LICENSE
+
+ The Free Software Foundation may publish new, revised versions of
+ the GNU Free Documentation License from time to time. Such new
+ versions will be similar in spirit to the present version, but may
+ differ in detail to address new problems or concerns. See
+ <https://www.gnu.org/copyleft/>.
+
+ Each version of the License is given a distinguishing version
+ number. If the Document specifies that a particular numbered
+ version of this License "or any later version" applies to it, you
+ have the option of following the terms and conditions either of
+ that specified version or of any later version that has been
+ published (not as a draft) by the Free Software Foundation. If the
+ Document does not specify a version number of this License, you may
+ choose any version ever published (not as a draft) by the Free
+ Software Foundation. If the Document specifies that a proxy can
+ decide which future versions of this License can be used, that
+ proxy's public statement of acceptance of a version permanently
+ authorizes you to choose that version for the Document.
+
+ 11. RELICENSING
+
+ "Massive Multiauthor Collaboration Site" (or "MMC Site") means any
+ World Wide Web server that publishes copyrightable works and also
+ provides prominent facilities for anybody to edit those works. A
+ public wiki that anybody can edit is an example of such a server.
+ A "Massive Multiauthor Collaboration" (or "MMC") contained in the
+ site means any set of copyrightable works thus published on the MMC
+ site.
+
+ "CC-BY-SA" means the Creative Commons Attribution-Share Alike 3.0
+ license published by Creative Commons Corporation, a not-for-profit
+ corporation with a principal place of business in San Francisco,
+ California, as well as future copyleft versions of that license
+ published by that same organization.
+
+ "Incorporate" means to publish or republish a Document, in whole or
+ in part, as part of another Document.
+
+ An MMC is "eligible for relicensing" if it is licensed under this
+ License, and if all works that were first published under this
+ License somewhere other than this MMC, and subsequently
+ incorporated in whole or in part into the MMC, (1) had no cover
+ texts or invariant sections, and (2) were thus incorporated prior
+ to November 1, 2008.
+
+ The operator of an MMC Site may republish an MMC contained in the
+ site under CC-BY-SA on the same site at any time before August 1,
+ 2009, provided the MMC is eligible for relicensing.
+
+ADDENDUM: How to use this License for your documents
+====================================================
+
+To use this License in a document you have written, include a copy of
+the License in the document and put the following copyright and license
+notices just after the title page:
+
+ Copyright (C) YEAR YOUR NAME.
+ Permission is granted to copy, distribute and/or modify this document
+ under the terms of the GNU Free Documentation License, Version 1.3
+ or any later version published by the Free Software Foundation;
+ with no Invariant Sections, no Front-Cover Texts, and no Back-Cover
+ Texts. A copy of the license is included in the section entitled ``GNU
+ Free Documentation License''.
+
+ If you have Invariant Sections, Front-Cover Texts and Back-Cover
+Texts, replace the "with...Texts." line with this:
+
+ with the Invariant Sections being LIST THEIR TITLES, with
+ the Front-Cover Texts being LIST, and with the Back-Cover Texts
+ being LIST.
+
+ If you have Invariant Sections without Cover Texts, or some other
+combination of the three, merge those two alternatives to suit the
+situation.
+
+ If your document contains nontrivial examples of program code, we
+recommend releasing these examples in parallel under your choice of free
+software license, such as the GNU General Public License, to permit
+their use in free software.
+
+\1f
+File: gmp.info, Node: Concept Index, Next: Function Index, Prev: GNU Free Documentation License, Up: Top
+
+Concept Index
+*************
+
+\0\b[index\0\b]
+* Menu:
+
+* #include: Headers and Libraries.
+ (line 6)
+* --build: Build Options. (line 51)
+* --disable-fft: Build Options. (line 307)
+* --disable-shared: Build Options. (line 44)
+* --disable-static: Build Options. (line 44)
+* --enable-alloca: Build Options. (line 273)
+* --enable-assert: Build Options. (line 313)
+* --enable-cxx: Build Options. (line 225)
+* --enable-fat: Build Options. (line 160)
+* --enable-profiling: Build Options. (line 317)
+* --enable-profiling <1>: Profiling. (line 6)
+* --exec-prefix: Build Options. (line 32)
+* --host: Build Options. (line 65)
+* --prefix: Build Options. (line 32)
+* -finstrument-functions: Profiling. (line 66)
+* 2exp functions: Efficiency. (line 43)
+* 68000: Notes for Particular Systems.
+ (line 94)
+* 80x86: Notes for Particular Systems.
+ (line 150)
+* ABI: Build Options. (line 167)
+* ABI <1>: ABI and ISA. (line 6)
+* About this manual: Introduction to GMP. (line 57)
+* AC_CHECK_LIB: Autoconf. (line 11)
+* AIX: ABI and ISA. (line 174)
+* AIX <1>: Notes for Particular Systems.
+ (line 7)
+* Algorithms: Algorithms. (line 6)
+* alloca: Build Options. (line 273)
+* Allocation of memory: Custom Allocation. (line 6)
+* AMD64: ABI and ISA. (line 44)
+* Anonymous FTP of latest version: Introduction to GMP. (line 37)
+* Application Binary Interface: ABI and ISA. (line 6)
+* Arithmetic functions: Integer Arithmetic. (line 6)
+* Arithmetic functions <1>: Rational Arithmetic. (line 6)
+* Arithmetic functions <2>: Float Arithmetic. (line 6)
+* ARM: Notes for Particular Systems.
+ (line 20)
+* Assembly cache handling: Assembly Cache Handling.
+ (line 6)
+* Assembly carry propagation: Assembly Carry Propagation.
+ (line 6)
+* Assembly code organisation: Assembly Code Organisation.
+ (line 6)
+* Assembly coding: Assembly Coding. (line 6)
+* Assembly floating point: Assembly Floating Point.
+ (line 6)
+* Assembly loop unrolling: Assembly Loop Unrolling.
+ (line 6)
+* Assembly SIMD: Assembly SIMD Instructions.
+ (line 6)
+* Assembly software pipelining: Assembly Software Pipelining.
+ (line 6)
+* Assembly writing guide: Assembly Writing Guide.
+ (line 6)
+* Assertion checking: Build Options. (line 313)
+* Assertion checking <1>: Debugging. (line 74)
+* Assignment functions: Assigning Integers. (line 6)
+* Assignment functions <1>: Simultaneous Integer Init & Assign.
+ (line 6)
+* Assignment functions <2>: Initializing Rationals.
+ (line 6)
+* Assignment functions <3>: Assigning Floats. (line 6)
+* Assignment functions <4>: Simultaneous Float Init & Assign.
+ (line 6)
+* Autoconf: Autoconf. (line 6)
+* Basics: GMP Basics. (line 6)
+* Binomial coefficient algorithm: Binomial Coefficients Algorithm.
+ (line 6)
+* Binomial coefficient functions: Number Theoretic Functions.
+ (line 137)
+* Binutils strip: Known Build Problems.
+ (line 28)
+* Bit manipulation functions: Integer Logic and Bit Fiddling.
+ (line 6)
+* Bit scanning functions: Integer Logic and Bit Fiddling.
+ (line 39)
+* Bit shift left: Integer Arithmetic. (line 38)
+* Bit shift right: Integer Division. (line 74)
+* Bits per limb: Useful Macros and Constants.
+ (line 7)
+* Bug reporting: Reporting Bugs. (line 6)
+* Build directory: Build Options. (line 19)
+* Build notes for binary packaging: Notes for Package Builds.
+ (line 6)
+* Build notes for particular systems: Notes for Particular Systems.
+ (line 6)
+* Build options: Build Options. (line 6)
+* Build problems known: Known Build Problems.
+ (line 6)
+* Build system: Build Options. (line 51)
+* Building GMP: Installing GMP. (line 6)
+* Bus error: Debugging. (line 7)
+* C compiler: Build Options. (line 178)
+* C++ compiler: Build Options. (line 249)
+* C++ interface: C++ Class Interface. (line 6)
+* C++ interface internals: C++ Interface Internals.
+ (line 6)
+* C++ istream input: C++ Formatted Input. (line 6)
+* C++ ostream output: C++ Formatted Output.
+ (line 6)
+* C++ support: Build Options. (line 225)
+* CC: Build Options. (line 178)
+* CC_FOR_BUILD: Build Options. (line 212)
+* CFLAGS: Build Options. (line 178)
+* Checker: Debugging. (line 110)
+* checkergcc: Debugging. (line 117)
+* Code organisation: Assembly Code Organisation.
+ (line 6)
+* Compaq C++: Notes for Particular Systems.
+ (line 25)
+* Comparison functions: Integer Comparisons. (line 6)
+* Comparison functions <1>: Comparing Rationals. (line 6)
+* Comparison functions <2>: Float Comparison. (line 6)
+* Compatibility with older versions: Compatibility with older versions.
+ (line 6)
+* Conditions for copying GNU MP: Copying. (line 6)
+* Configuring GMP: Installing GMP. (line 6)
+* Congruence algorithm: Exact Remainder. (line 30)
+* Congruence functions: Integer Division. (line 150)
+* Constants: Useful Macros and Constants.
+ (line 6)
+* Contributors: Contributors. (line 6)
+* Conventions for parameters: Parameter Conventions.
+ (line 6)
+* Conventions for variables: Variable Conventions.
+ (line 6)
+* Conversion functions: Converting Integers. (line 6)
+* Conversion functions <1>: Rational Conversions.
+ (line 6)
+* Conversion functions <2>: Converting Floats. (line 6)
+* Copying conditions: Copying. (line 6)
+* CPPFLAGS: Build Options. (line 204)
+* CPU types: Introduction to GMP. (line 24)
+* CPU types <1>: Build Options. (line 107)
+* Cross compiling: Build Options. (line 65)
+* Cryptography functions, low-level: Low-level Functions. (line 507)
+* Custom allocation: Custom Allocation. (line 6)
+* CXX: Build Options. (line 249)
+* CXXFLAGS: Build Options. (line 249)
+* Cygwin: Notes for Particular Systems.
+ (line 57)
+* Darwin: Known Build Problems.
+ (line 51)
+* Debugging: Debugging. (line 6)
+* Demonstration programs: Demonstration Programs.
+ (line 6)
+* Digits in an integer: Miscellaneous Integer Functions.
+ (line 23)
+* Divisibility algorithm: Exact Remainder. (line 30)
+* Divisibility functions: Integer Division. (line 136)
+* Divisibility functions <1>: Integer Division. (line 150)
+* Divisibility testing: Efficiency. (line 91)
+* Division algorithms: Division Algorithms. (line 6)
+* Division functions: Integer Division. (line 6)
+* Division functions <1>: Rational Arithmetic. (line 24)
+* Division functions <2>: Float Arithmetic. (line 33)
+* DJGPP: Notes for Particular Systems.
+ (line 57)
+* DJGPP <1>: Known Build Problems.
+ (line 18)
+* DLLs: Notes for Particular Systems.
+ (line 70)
+* DocBook: Build Options. (line 340)
+* Documentation formats: Build Options. (line 333)
+* Documentation license: GNU Free Documentation License.
+ (line 6)
+* DVI: Build Options. (line 336)
+* Efficiency: Efficiency. (line 6)
+* Emacs: Emacs. (line 6)
+* Exact division functions: Integer Division. (line 125)
+* Exact remainder: Exact Remainder. (line 6)
+* Example programs: Demonstration Programs.
+ (line 6)
+* Exec prefix: Build Options. (line 32)
+* Execution profiling: Build Options. (line 317)
+* Execution profiling <1>: Profiling. (line 6)
+* Exponentiation functions: Integer Exponentiation.
+ (line 6)
+* Exponentiation functions <1>: Float Arithmetic. (line 41)
+* Export: Integer Import and Export.
+ (line 45)
+* Expression parsing demo: Demonstration Programs.
+ (line 15)
+* Expression parsing demo <1>: Demonstration Programs.
+ (line 17)
+* Expression parsing demo <2>: Demonstration Programs.
+ (line 19)
+* Extended GCD: Number Theoretic Functions.
+ (line 56)
+* Factor removal functions: Number Theoretic Functions.
+ (line 117)
+* Factorial algorithm: Factorial Algorithm. (line 6)
+* Factorial functions: Number Theoretic Functions.
+ (line 125)
+* Factorization demo: Demonstration Programs.
+ (line 22)
+* Fast Fourier Transform: FFT Multiplication. (line 6)
+* Fat binary: Build Options. (line 160)
+* FFT multiplication: Build Options. (line 307)
+* FFT multiplication <1>: FFT Multiplication. (line 6)
+* Fibonacci number algorithm: Fibonacci Numbers Algorithm.
+ (line 6)
+* Fibonacci sequence functions: Number Theoretic Functions.
+ (line 145)
+* Float arithmetic functions: Float Arithmetic. (line 6)
+* Float assignment functions: Assigning Floats. (line 6)
+* Float assignment functions <1>: Simultaneous Float Init & Assign.
+ (line 6)
+* Float comparison functions: Float Comparison. (line 6)
+* Float conversion functions: Converting Floats. (line 6)
+* Float functions: Floating-point Functions.
+ (line 6)
+* Float initialization functions: Initializing Floats. (line 6)
+* Float initialization functions <1>: Simultaneous Float Init & Assign.
+ (line 6)
+* Float input and output functions: I/O of Floats. (line 6)
+* Float internals: Float Internals. (line 6)
+* Float miscellaneous functions: Miscellaneous Float Functions.
+ (line 6)
+* Float random number functions: Miscellaneous Float Functions.
+ (line 27)
+* Float rounding functions: Miscellaneous Float Functions.
+ (line 9)
+* Float sign tests: Float Comparison. (line 34)
+* Floating point mode: Notes for Particular Systems.
+ (line 34)
+* Floating-point functions: Floating-point Functions.
+ (line 6)
+* Floating-point number: Nomenclature and Types.
+ (line 21)
+* fnccheck: Profiling. (line 77)
+* Formatted input: Formatted Input. (line 6)
+* Formatted output: Formatted Output. (line 6)
+* Free Documentation License: GNU Free Documentation License.
+ (line 6)
+* FreeBSD: Notes for Particular Systems.
+ (line 43)
+* FreeBSD <1>: Notes for Particular Systems.
+ (line 52)
+* frexp: Converting Integers. (line 43)
+* frexp <1>: Converting Floats. (line 24)
+* FTP of latest version: Introduction to GMP. (line 37)
+* Function classes: Function Classes. (line 6)
+* FunctionCheck: Profiling. (line 77)
+* GCC Checker: Debugging. (line 110)
+* GCD algorithms: Greatest Common Divisor Algorithms.
+ (line 6)
+* GCD extended: Number Theoretic Functions.
+ (line 56)
+* GCD functions: Number Theoretic Functions.
+ (line 39)
+* GDB: Debugging. (line 53)
+* Generic C: Build Options. (line 151)
+* GMP Perl module: Demonstration Programs.
+ (line 28)
+* GMP version number: Useful Macros and Constants.
+ (line 12)
+* gmp.h: Headers and Libraries.
+ (line 6)
+* gmpxx.h: C++ Interface General.
+ (line 8)
+* GNU Debugger: Debugging. (line 53)
+* GNU Free Documentation License: GNU Free Documentation License.
+ (line 6)
+* GNU strip: Known Build Problems.
+ (line 28)
+* gprof: Profiling. (line 41)
+* Greatest common divisor algorithms: Greatest Common Divisor Algorithms.
+ (line 6)
+* Greatest common divisor functions: Number Theoretic Functions.
+ (line 39)
+* Hardware floating point mode: Notes for Particular Systems.
+ (line 34)
+* Headers: Headers and Libraries.
+ (line 6)
+* Heap problems: Debugging. (line 23)
+* Home page: Introduction to GMP. (line 33)
+* Host system: Build Options. (line 65)
+* HP-UX: ABI and ISA. (line 76)
+* HP-UX <1>: ABI and ISA. (line 114)
+* HPPA: ABI and ISA. (line 76)
+* I/O functions: I/O of Integers. (line 6)
+* I/O functions <1>: I/O of Rationals. (line 6)
+* I/O functions <2>: I/O of Floats. (line 6)
+* i386: Notes for Particular Systems.
+ (line 150)
+* IA-64: ABI and ISA. (line 114)
+* Import: Integer Import and Export.
+ (line 11)
+* In-place operations: Efficiency. (line 57)
+* Include files: Headers and Libraries.
+ (line 6)
+* info-lookup-symbol: Emacs. (line 6)
+* Initialization functions: Initializing Integers.
+ (line 6)
+* Initialization functions <1>: Simultaneous Integer Init & Assign.
+ (line 6)
+* Initialization functions <2>: Initializing Rationals.
+ (line 6)
+* Initialization functions <3>: Initializing Floats. (line 6)
+* Initialization functions <4>: Simultaneous Float Init & Assign.
+ (line 6)
+* Initialization functions <5>: Random State Initialization.
+ (line 6)
+* Initializing and clearing: Efficiency. (line 21)
+* Input functions: I/O of Integers. (line 6)
+* Input functions <1>: I/O of Rationals. (line 6)
+* Input functions <2>: I/O of Floats. (line 6)
+* Input functions <3>: Formatted Input Functions.
+ (line 6)
+* Install prefix: Build Options. (line 32)
+* Installing GMP: Installing GMP. (line 6)
+* Instruction Set Architecture: ABI and ISA. (line 6)
+* instrument-functions: Profiling. (line 66)
+* Integer: Nomenclature and Types.
+ (line 6)
+* Integer arithmetic functions: Integer Arithmetic. (line 6)
+* Integer assignment functions: Assigning Integers. (line 6)
+* Integer assignment functions <1>: Simultaneous Integer Init & Assign.
+ (line 6)
+* Integer bit manipulation functions: Integer Logic and Bit Fiddling.
+ (line 6)
+* Integer comparison functions: Integer Comparisons. (line 6)
+* Integer conversion functions: Converting Integers. (line 6)
+* Integer division functions: Integer Division. (line 6)
+* Integer exponentiation functions: Integer Exponentiation.
+ (line 6)
+* Integer export: Integer Import and Export.
+ (line 45)
+* Integer functions: Integer Functions. (line 6)
+* Integer import: Integer Import and Export.
+ (line 11)
+* Integer initialization functions: Initializing Integers.
+ (line 6)
+* Integer initialization functions <1>: Simultaneous Integer Init & Assign.
+ (line 6)
+* Integer input and output functions: I/O of Integers. (line 6)
+* Integer internals: Integer Internals. (line 6)
+* Integer logical functions: Integer Logic and Bit Fiddling.
+ (line 6)
+* Integer miscellaneous functions: Miscellaneous Integer Functions.
+ (line 6)
+* Integer random number functions: Integer Random Numbers.
+ (line 6)
+* Integer root functions: Integer Roots. (line 6)
+* Integer sign tests: Integer Comparisons. (line 28)
+* Integer special functions: Integer Special Functions.
+ (line 6)
+* Interix: Notes for Particular Systems.
+ (line 65)
+* Internals: Internals. (line 6)
+* Introduction: Introduction to GMP. (line 6)
+* Inverse modulo functions: Number Theoretic Functions.
+ (line 83)
+* IRIX: ABI and ISA. (line 139)
+* IRIX <1>: Known Build Problems.
+ (line 38)
+* ISA: ABI and ISA. (line 6)
+* istream input: C++ Formatted Input. (line 6)
+* Jacobi symbol algorithm: Jacobi Symbol. (line 6)
+* Jacobi symbol functions: Number Theoretic Functions.
+ (line 92)
+* Karatsuba multiplication: Karatsuba Multiplication.
+ (line 6)
+* Karatsuba square root algorithm: Square Root Algorithm.
+ (line 6)
+* Kronecker symbol functions: Number Theoretic Functions.
+ (line 104)
+* Language bindings: Language Bindings. (line 6)
+* Latest version of GMP: Introduction to GMP. (line 37)
+* LCM functions: Number Theoretic Functions.
+ (line 77)
+* Least common multiple functions: Number Theoretic Functions.
+ (line 77)
+* Legendre symbol functions: Number Theoretic Functions.
+ (line 95)
+* libgmp: Headers and Libraries.
+ (line 24)
+* libgmpxx: Headers and Libraries.
+ (line 29)
+* Libraries: Headers and Libraries.
+ (line 24)
+* Libtool: Headers and Libraries.
+ (line 36)
+* Libtool versioning: Notes for Package Builds.
+ (line 9)
+* License conditions: Copying. (line 6)
+* Limb: Nomenclature and Types.
+ (line 31)
+* Limb size: Useful Macros and Constants.
+ (line 7)
+* Linear congruential algorithm: Random Number Algorithms.
+ (line 25)
+* Linear congruential random numbers: Random State Initialization.
+ (line 18)
+* Linear congruential random numbers <1>: Random State Initialization.
+ (line 32)
+* Linking: Headers and Libraries.
+ (line 24)
+* Logical functions: Integer Logic and Bit Fiddling.
+ (line 6)
+* Low-level functions: Low-level Functions. (line 6)
+* Low-level functions for cryptography: Low-level Functions. (line 507)
+* Lucas number algorithm: Lucas Numbers Algorithm.
+ (line 6)
+* Lucas number functions: Number Theoretic Functions.
+ (line 156)
+* MacOS X: Known Build Problems.
+ (line 51)
+* Mailing lists: Introduction to GMP. (line 44)
+* Malloc debugger: Debugging. (line 29)
+* Malloc problems: Debugging. (line 23)
+* Memory allocation: Custom Allocation. (line 6)
+* Memory management: Memory Management. (line 6)
+* Mersenne twister algorithm: Random Number Algorithms.
+ (line 17)
+* Mersenne twister random numbers: Random State Initialization.
+ (line 13)
+* MINGW: Notes for Particular Systems.
+ (line 57)
+* MIPS: ABI and ISA. (line 139)
+* Miscellaneous float functions: Miscellaneous Float Functions.
+ (line 6)
+* Miscellaneous integer functions: Miscellaneous Integer Functions.
+ (line 6)
+* MMX: Notes for Particular Systems.
+ (line 156)
+* Modular inverse functions: Number Theoretic Functions.
+ (line 83)
+* Most significant bit: Miscellaneous Integer Functions.
+ (line 34)
+* MPN_PATH: Build Options. (line 321)
+* MS Windows: Notes for Particular Systems.
+ (line 57)
+* MS Windows <1>: Notes for Particular Systems.
+ (line 70)
+* MS-DOS: Notes for Particular Systems.
+ (line 57)
+* Multi-threading: Reentrancy. (line 6)
+* Multiplication algorithms: Multiplication Algorithms.
+ (line 6)
+* Nails: Low-level Functions. (line 686)
+* Native compilation: Build Options. (line 51)
+* NetBSD: Notes for Particular Systems.
+ (line 100)
+* NeXT: Known Build Problems.
+ (line 57)
+* Next prime function: Number Theoretic Functions.
+ (line 23)
+* Nomenclature: Nomenclature and Types.
+ (line 6)
+* Non-Unix systems: Build Options. (line 11)
+* Nth root algorithm: Nth Root Algorithm. (line 6)
+* Number sequences: Efficiency. (line 145)
+* Number theoretic functions: Number Theoretic Functions.
+ (line 6)
+* Numerator and denominator: Applying Integer Functions.
+ (line 6)
+* obstack output: Formatted Output Functions.
+ (line 79)
+* OpenBSD: Notes for Particular Systems.
+ (line 109)
+* Optimizing performance: Performance optimization.
+ (line 6)
+* ostream output: C++ Formatted Output.
+ (line 6)
+* Other languages: Language Bindings. (line 6)
+* Output functions: I/O of Integers. (line 6)
+* Output functions <1>: I/O of Rationals. (line 6)
+* Output functions <2>: I/O of Floats. (line 6)
+* Output functions <3>: Formatted Output Functions.
+ (line 6)
+* Packaged builds: Notes for Package Builds.
+ (line 6)
+* Parameter conventions: Parameter Conventions.
+ (line 6)
+* Parsing expressions demo: Demonstration Programs.
+ (line 15)
+* Parsing expressions demo <1>: Demonstration Programs.
+ (line 17)
+* Parsing expressions demo <2>: Demonstration Programs.
+ (line 19)
+* Particular systems: Notes for Particular Systems.
+ (line 6)
+* Past GMP versions: Compatibility with older versions.
+ (line 6)
+* PDF: Build Options. (line 336)
+* Perfect power algorithm: Perfect Power Algorithm.
+ (line 6)
+* Perfect power functions: Integer Roots. (line 28)
+* Perfect square algorithm: Perfect Square Algorithm.
+ (line 6)
+* Perfect square functions: Integer Roots. (line 37)
+* perl: Demonstration Programs.
+ (line 28)
+* Perl module: Demonstration Programs.
+ (line 28)
+* Pointer types: Nomenclature and Types.
+ (line 55)
+* Postscript: Build Options. (line 336)
+* Power/PowerPC: Notes for Particular Systems.
+ (line 115)
+* Power/PowerPC <1>: Known Build Problems.
+ (line 63)
+* Powering algorithms: Powering Algorithms. (line 6)
+* Powering functions: Integer Exponentiation.
+ (line 6)
+* Powering functions <1>: Float Arithmetic. (line 41)
+* PowerPC: ABI and ISA. (line 173)
+* Precision of floats: Floating-point Functions.
+ (line 6)
+* Precision of hardware floating point: Notes for Particular Systems.
+ (line 34)
+* Prefix: Build Options. (line 32)
+* Previous prime function: Number Theoretic Functions.
+ (line 26)
+* Prime testing algorithms: Prime Testing Algorithm.
+ (line 6)
+* Prime testing functions: Number Theoretic Functions.
+ (line 7)
+* Primorial functions: Number Theoretic Functions.
+ (line 130)
+* printf formatted output: Formatted Output. (line 6)
+* Probable prime testing functions: Number Theoretic Functions.
+ (line 7)
+* prof: Profiling. (line 24)
+* Profiling: Profiling. (line 6)
+* Radix conversion algorithms: Radix Conversion Algorithms.
+ (line 6)
+* Random number algorithms: Random Number Algorithms.
+ (line 6)
+* Random number functions: Integer Random Numbers.
+ (line 6)
+* Random number functions <1>: Miscellaneous Float Functions.
+ (line 27)
+* Random number functions <2>: Random Number Functions.
+ (line 6)
+* Random number seeding: Random State Seeding.
+ (line 6)
+* Random number state: Random State Initialization.
+ (line 6)
+* Random state: Nomenclature and Types.
+ (line 46)
+* Rational arithmetic: Efficiency. (line 111)
+* Rational arithmetic functions: Rational Arithmetic. (line 6)
+* Rational assignment functions: Initializing Rationals.
+ (line 6)
+* Rational comparison functions: Comparing Rationals. (line 6)
+* Rational conversion functions: Rational Conversions.
+ (line 6)
+* Rational initialization functions: Initializing Rationals.
+ (line 6)
+* Rational input and output functions: I/O of Rationals. (line 6)
+* Rational internals: Rational Internals. (line 6)
+* Rational number: Nomenclature and Types.
+ (line 16)
+* Rational number functions: Rational Number Functions.
+ (line 6)
+* Rational numerator and denominator: Applying Integer Functions.
+ (line 6)
+* Rational sign tests: Comparing Rationals. (line 28)
+* Raw output internals: Raw Output Internals.
+ (line 6)
+* Reallocations: Efficiency. (line 30)
+* Reentrancy: Reentrancy. (line 6)
+* References: References. (line 5)
+* Remove factor functions: Number Theoretic Functions.
+ (line 117)
+* Reporting bugs: Reporting Bugs. (line 6)
+* Root extraction algorithm: Nth Root Algorithm. (line 6)
+* Root extraction algorithms: Root Extraction Algorithms.
+ (line 6)
+* Root extraction functions: Integer Roots. (line 6)
+* Root extraction functions <1>: Float Arithmetic. (line 37)
+* Root testing functions: Integer Roots. (line 28)
+* Root testing functions <1>: Integer Roots. (line 37)
+* Rounding functions: Miscellaneous Float Functions.
+ (line 9)
+* Sample programs: Demonstration Programs.
+ (line 6)
+* Scan bit functions: Integer Logic and Bit Fiddling.
+ (line 39)
+* scanf formatted input: Formatted Input. (line 6)
+* SCO: Known Build Problems.
+ (line 38)
+* Seeding random numbers: Random State Seeding.
+ (line 6)
+* Segmentation violation: Debugging. (line 7)
+* Sequent Symmetry: Known Build Problems.
+ (line 68)
+* Services for Unix: Notes for Particular Systems.
+ (line 65)
+* Shared library versioning: Notes for Package Builds.
+ (line 9)
+* Sign tests: Integer Comparisons. (line 28)
+* Sign tests <1>: Comparing Rationals. (line 28)
+* Sign tests <2>: Float Comparison. (line 34)
+* Size in digits: Miscellaneous Integer Functions.
+ (line 23)
+* Small operands: Efficiency. (line 7)
+* Solaris: ABI and ISA. (line 204)
+* Solaris <1>: Known Build Problems.
+ (line 72)
+* Solaris <2>: Known Build Problems.
+ (line 77)
+* Sparc: Notes for Particular Systems.
+ (line 127)
+* Sparc <1>: Notes for Particular Systems.
+ (line 132)
+* Sparc V9: ABI and ISA. (line 204)
+* Special integer functions: Integer Special Functions.
+ (line 6)
+* Square root algorithm: Square Root Algorithm.
+ (line 6)
+* SSE2: Notes for Particular Systems.
+ (line 156)
+* Stack backtrace: Debugging. (line 45)
+* Stack overflow: Build Options. (line 273)
+* Stack overflow <1>: Debugging. (line 7)
+* Static linking: Efficiency. (line 14)
+* stdarg.h: Headers and Libraries.
+ (line 19)
+* stdio.h: Headers and Libraries.
+ (line 13)
+* Stripped libraries: Known Build Problems.
+ (line 28)
+* Sun: ABI and ISA. (line 204)
+* SunOS: Notes for Particular Systems.
+ (line 144)
+* Systems: Notes for Particular Systems.
+ (line 6)
+* Temporary memory: Build Options. (line 273)
+* Texinfo: Build Options. (line 333)
+* Text input/output: Efficiency. (line 151)
+* Thread safety: Reentrancy. (line 6)
+* Toom multiplication: Toom 3-Way Multiplication.
+ (line 6)
+* Toom multiplication <1>: Toom 4-Way Multiplication.
+ (line 6)
+* Toom multiplication <2>: Higher degree Toom'n'half.
+ (line 6)
+* Toom multiplication <3>: Other Multiplication.
+ (line 6)
+* Types: Nomenclature and Types.
+ (line 6)
+* ui and si functions: Efficiency. (line 50)
+* Unbalanced multiplication: Unbalanced Multiplication.
+ (line 6)
+* Upward compatibility: Compatibility with older versions.
+ (line 6)
+* Useful macros and constants: Useful Macros and Constants.
+ (line 6)
+* User-defined precision: Floating-point Functions.
+ (line 6)
+* Valgrind: Debugging. (line 125)
+* Variable conventions: Variable Conventions.
+ (line 6)
+* Version number: Useful Macros and Constants.
+ (line 12)
+* Web page: Introduction to GMP. (line 33)
+* Windows: Notes for Particular Systems.
+ (line 57)
+* Windows <1>: Notes for Particular Systems.
+ (line 70)
+* x86: Notes for Particular Systems.
+ (line 150)
+* x87: Notes for Particular Systems.
+ (line 34)
+* XML: Build Options. (line 340)
+
+\1f
+File: gmp.info, Node: Function Index, Prev: Concept Index, Up: Top
+
+Function and Type Index
+***********************
+
+\0\b[index\0\b]
+* Menu:
+
+* _mpz_realloc: Integer Special Functions.
+ (line 13)
+* __GMP_CC: Useful Macros and Constants.
+ (line 22)
+* __GMP_CFLAGS: Useful Macros and Constants.
+ (line 23)
+* __GNU_MP_VERSION: Useful Macros and Constants.
+ (line 9)
+* __GNU_MP_VERSION_MINOR: Useful Macros and Constants.
+ (line 10)
+* __GNU_MP_VERSION_PATCHLEVEL: Useful Macros and Constants.
+ (line 11)
+* abs: C++ Interface Integers.
+ (line 46)
+* abs <1>: C++ Interface Rationals.
+ (line 47)
+* abs <2>: C++ Interface Floats.
+ (line 82)
+* ceil: C++ Interface Floats.
+ (line 83)
+* cmp: C++ Interface Integers.
+ (line 47)
+* cmp <1>: C++ Interface Integers.
+ (line 48)
+* cmp <2>: C++ Interface Rationals.
+ (line 48)
+* cmp <3>: C++ Interface Rationals.
+ (line 49)
+* cmp <4>: C++ Interface Floats.
+ (line 84)
+* cmp <5>: C++ Interface Floats.
+ (line 85)
+* factorial: C++ Interface Integers.
+ (line 71)
+* fibonacci: C++ Interface Integers.
+ (line 75)
+* floor: C++ Interface Floats.
+ (line 95)
+* gcd: C++ Interface Integers.
+ (line 68)
+* gmp_asprintf: Formatted Output Functions.
+ (line 63)
+* gmp_errno: Random State Initialization.
+ (line 56)
+* GMP_ERROR_INVALID_ARGUMENT: Random State Initialization.
+ (line 56)
+* GMP_ERROR_UNSUPPORTED_ARGUMENT: Random State Initialization.
+ (line 56)
+* gmp_fprintf: Formatted Output Functions.
+ (line 28)
+* gmp_fscanf: Formatted Input Functions.
+ (line 24)
+* GMP_LIMB_BITS: Low-level Functions. (line 714)
+* GMP_NAIL_BITS: Low-level Functions. (line 712)
+* GMP_NAIL_MASK: Low-level Functions. (line 722)
+* GMP_NUMB_BITS: Low-level Functions. (line 713)
+* GMP_NUMB_MASK: Low-level Functions. (line 723)
+* GMP_NUMB_MAX: Low-level Functions. (line 731)
+* gmp_obstack_printf: Formatted Output Functions.
+ (line 75)
+* gmp_obstack_vprintf: Formatted Output Functions.
+ (line 77)
+* gmp_printf: Formatted Output Functions.
+ (line 23)
+* gmp_randclass: C++ Interface Random Numbers.
+ (line 6)
+* gmp_randclass::get_f: C++ Interface Random Numbers.
+ (line 44)
+* gmp_randclass::get_f <1>: C++ Interface Random Numbers.
+ (line 45)
+* gmp_randclass::get_z_bits: C++ Interface Random Numbers.
+ (line 37)
+* gmp_randclass::get_z_bits <1>: C++ Interface Random Numbers.
+ (line 38)
+* gmp_randclass::get_z_range: C++ Interface Random Numbers.
+ (line 41)
+* gmp_randclass::gmp_randclass: C++ Interface Random Numbers.
+ (line 11)
+* gmp_randclass::gmp_randclass <1>: C++ Interface Random Numbers.
+ (line 26)
+* gmp_randclass::seed: C++ Interface Random Numbers.
+ (line 32)
+* gmp_randclass::seed <1>: C++ Interface Random Numbers.
+ (line 33)
+* gmp_randclear: Random State Initialization.
+ (line 62)
+* gmp_randinit: Random State Initialization.
+ (line 45)
+* gmp_randinit_default: Random State Initialization.
+ (line 6)
+* gmp_randinit_lc_2exp: Random State Initialization.
+ (line 16)
+* gmp_randinit_lc_2exp_size: Random State Initialization.
+ (line 30)
+* gmp_randinit_mt: Random State Initialization.
+ (line 12)
+* gmp_randinit_set: Random State Initialization.
+ (line 41)
+* gmp_randseed: Random State Seeding.
+ (line 6)
+* gmp_randseed_ui: Random State Seeding.
+ (line 8)
+* gmp_randstate_ptr: Nomenclature and Types.
+ (line 55)
+* gmp_randstate_srcptr: Nomenclature and Types.
+ (line 55)
+* gmp_randstate_t: Nomenclature and Types.
+ (line 46)
+* GMP_RAND_ALG_DEFAULT: Random State Initialization.
+ (line 50)
+* GMP_RAND_ALG_LC: Random State Initialization.
+ (line 50)
+* gmp_scanf: Formatted Input Functions.
+ (line 20)
+* gmp_snprintf: Formatted Output Functions.
+ (line 44)
+* gmp_sprintf: Formatted Output Functions.
+ (line 33)
+* gmp_sscanf: Formatted Input Functions.
+ (line 28)
+* gmp_urandomb_ui: Random State Miscellaneous.
+ (line 6)
+* gmp_urandomm_ui: Random State Miscellaneous.
+ (line 12)
+* gmp_vasprintf: Formatted Output Functions.
+ (line 64)
+* gmp_version: Useful Macros and Constants.
+ (line 18)
+* gmp_vfprintf: Formatted Output Functions.
+ (line 29)
+* gmp_vfscanf: Formatted Input Functions.
+ (line 25)
+* gmp_vprintf: Formatted Output Functions.
+ (line 24)
+* gmp_vscanf: Formatted Input Functions.
+ (line 21)
+* gmp_vsnprintf: Formatted Output Functions.
+ (line 46)
+* gmp_vsprintf: Formatted Output Functions.
+ (line 34)
+* gmp_vsscanf: Formatted Input Functions.
+ (line 29)
+* hypot: C++ Interface Floats.
+ (line 96)
+* lcm: C++ Interface Integers.
+ (line 69)
+* mpf_abs: Float Arithmetic. (line 46)
+* mpf_add: Float Arithmetic. (line 6)
+* mpf_add_ui: Float Arithmetic. (line 7)
+* mpf_ceil: Miscellaneous Float Functions.
+ (line 6)
+* mpf_class: C++ Interface General.
+ (line 19)
+* mpf_class::fits_sint_p: C++ Interface Floats.
+ (line 87)
+* mpf_class::fits_slong_p: C++ Interface Floats.
+ (line 88)
+* mpf_class::fits_sshort_p: C++ Interface Floats.
+ (line 89)
+* mpf_class::fits_uint_p: C++ Interface Floats.
+ (line 91)
+* mpf_class::fits_ulong_p: C++ Interface Floats.
+ (line 92)
+* mpf_class::fits_ushort_p: C++ Interface Floats.
+ (line 93)
+* mpf_class::get_d: C++ Interface Floats.
+ (line 98)
+* mpf_class::get_mpf_t: C++ Interface General.
+ (line 65)
+* mpf_class::get_prec: C++ Interface Floats.
+ (line 120)
+* mpf_class::get_si: C++ Interface Floats.
+ (line 99)
+* mpf_class::get_str: C++ Interface Floats.
+ (line 100)
+* mpf_class::get_ui: C++ Interface Floats.
+ (line 102)
+* mpf_class::mpf_class: C++ Interface Floats.
+ (line 11)
+* mpf_class::mpf_class <1>: C++ Interface Floats.
+ (line 12)
+* mpf_class::mpf_class <2>: C++ Interface Floats.
+ (line 32)
+* mpf_class::mpf_class <3>: C++ Interface Floats.
+ (line 33)
+* mpf_class::mpf_class <4>: C++ Interface Floats.
+ (line 41)
+* mpf_class::mpf_class <5>: C++ Interface Floats.
+ (line 42)
+* mpf_class::mpf_class <6>: C++ Interface Floats.
+ (line 44)
+* mpf_class::mpf_class <7>: C++ Interface Floats.
+ (line 45)
+* mpf_class::operator=: C++ Interface Floats.
+ (line 59)
+* mpf_class::set_prec: C++ Interface Floats.
+ (line 121)
+* mpf_class::set_prec_raw: C++ Interface Floats.
+ (line 122)
+* mpf_class::set_str: C++ Interface Floats.
+ (line 104)
+* mpf_class::set_str <1>: C++ Interface Floats.
+ (line 105)
+* mpf_class::swap: C++ Interface Floats.
+ (line 109)
+* mpf_clear: Initializing Floats. (line 36)
+* mpf_clears: Initializing Floats. (line 40)
+* mpf_cmp: Float Comparison. (line 6)
+* mpf_cmp_d: Float Comparison. (line 8)
+* mpf_cmp_si: Float Comparison. (line 10)
+* mpf_cmp_ui: Float Comparison. (line 9)
+* mpf_cmp_z: Float Comparison. (line 7)
+* mpf_div: Float Arithmetic. (line 28)
+* mpf_div_2exp: Float Arithmetic. (line 53)
+* mpf_div_ui: Float Arithmetic. (line 31)
+* mpf_eq: Float Comparison. (line 17)
+* mpf_fits_sint_p: Miscellaneous Float Functions.
+ (line 19)
+* mpf_fits_slong_p: Miscellaneous Float Functions.
+ (line 17)
+* mpf_fits_sshort_p: Miscellaneous Float Functions.
+ (line 21)
+* mpf_fits_uint_p: Miscellaneous Float Functions.
+ (line 18)
+* mpf_fits_ulong_p: Miscellaneous Float Functions.
+ (line 16)
+* mpf_fits_ushort_p: Miscellaneous Float Functions.
+ (line 20)
+* mpf_floor: Miscellaneous Float Functions.
+ (line 7)
+* mpf_get_d: Converting Floats. (line 6)
+* mpf_get_default_prec: Initializing Floats. (line 11)
+* mpf_get_d_2exp: Converting Floats. (line 15)
+* mpf_get_prec: Initializing Floats. (line 61)
+* mpf_get_si: Converting Floats. (line 27)
+* mpf_get_str: Converting Floats. (line 36)
+* mpf_get_ui: Converting Floats. (line 28)
+* mpf_init: Initializing Floats. (line 18)
+* mpf_init2: Initializing Floats. (line 25)
+* mpf_inits: Initializing Floats. (line 30)
+* mpf_init_set: Simultaneous Float Init & Assign.
+ (line 15)
+* mpf_init_set_d: Simultaneous Float Init & Assign.
+ (line 18)
+* mpf_init_set_si: Simultaneous Float Init & Assign.
+ (line 17)
+* mpf_init_set_str: Simultaneous Float Init & Assign.
+ (line 24)
+* mpf_init_set_ui: Simultaneous Float Init & Assign.
+ (line 16)
+* mpf_inp_str: I/O of Floats. (line 38)
+* mpf_integer_p: Miscellaneous Float Functions.
+ (line 13)
+* mpf_mul: Float Arithmetic. (line 18)
+* mpf_mul_2exp: Float Arithmetic. (line 49)
+* mpf_mul_ui: Float Arithmetic. (line 19)
+* mpf_neg: Float Arithmetic. (line 43)
+* mpf_out_str: I/O of Floats. (line 17)
+* mpf_pow_ui: Float Arithmetic. (line 39)
+* mpf_ptr: Nomenclature and Types.
+ (line 55)
+* mpf_random2: Miscellaneous Float Functions.
+ (line 35)
+* mpf_reldiff: Float Comparison. (line 28)
+* mpf_set: Assigning Floats. (line 9)
+* mpf_set_d: Assigning Floats. (line 12)
+* mpf_set_default_prec: Initializing Floats. (line 6)
+* mpf_set_prec: Initializing Floats. (line 64)
+* mpf_set_prec_raw: Initializing Floats. (line 71)
+* mpf_set_q: Assigning Floats. (line 14)
+* mpf_set_si: Assigning Floats. (line 11)
+* mpf_set_str: Assigning Floats. (line 17)
+* mpf_set_ui: Assigning Floats. (line 10)
+* mpf_set_z: Assigning Floats. (line 13)
+* mpf_sgn: Float Comparison. (line 33)
+* mpf_sqrt: Float Arithmetic. (line 35)
+* mpf_sqrt_ui: Float Arithmetic. (line 36)
+* mpf_srcptr: Nomenclature and Types.
+ (line 55)
+* mpf_sub: Float Arithmetic. (line 11)
+* mpf_sub_ui: Float Arithmetic. (line 14)
+* mpf_swap: Assigning Floats. (line 50)
+* mpf_t: Nomenclature and Types.
+ (line 21)
+* mpf_trunc: Miscellaneous Float Functions.
+ (line 8)
+* mpf_ui_div: Float Arithmetic. (line 29)
+* mpf_ui_sub: Float Arithmetic. (line 12)
+* mpf_urandomb: Miscellaneous Float Functions.
+ (line 25)
+* mpn_add: Low-level Functions. (line 67)
+* mpn_addmul_1: Low-level Functions. (line 148)
+* mpn_add_1: Low-level Functions. (line 62)
+* mpn_add_n: Low-level Functions. (line 52)
+* mpn_andn_n: Low-level Functions. (line 462)
+* mpn_and_n: Low-level Functions. (line 447)
+* mpn_cmp: Low-level Functions. (line 293)
+* mpn_cnd_add_n: Low-level Functions. (line 540)
+* mpn_cnd_sub_n: Low-level Functions. (line 542)
+* mpn_cnd_swap: Low-level Functions. (line 567)
+* mpn_com: Low-level Functions. (line 487)
+* mpn_copyd: Low-level Functions. (line 496)
+* mpn_copyi: Low-level Functions. (line 492)
+* mpn_divexact_1: Low-level Functions. (line 231)
+* mpn_divexact_by3: Low-level Functions. (line 238)
+* mpn_divexact_by3c: Low-level Functions. (line 240)
+* mpn_divmod: Low-level Functions. (line 226)
+* mpn_divmod_1: Low-level Functions. (line 210)
+* mpn_divrem: Low-level Functions. (line 183)
+* mpn_divrem_1: Low-level Functions. (line 208)
+* mpn_gcd: Low-level Functions. (line 301)
+* mpn_gcdext: Low-level Functions. (line 316)
+* mpn_gcd_1: Low-level Functions. (line 311)
+* mpn_get_str: Low-level Functions. (line 371)
+* mpn_hamdist: Low-level Functions. (line 436)
+* mpn_iorn_n: Low-level Functions. (line 467)
+* mpn_ior_n: Low-level Functions. (line 452)
+* mpn_lshift: Low-level Functions. (line 269)
+* mpn_mod_1: Low-level Functions. (line 264)
+* mpn_mul: Low-level Functions. (line 114)
+* mpn_mul_1: Low-level Functions. (line 133)
+* mpn_mul_n: Low-level Functions. (line 103)
+* mpn_nand_n: Low-level Functions. (line 472)
+* mpn_neg: Low-level Functions. (line 96)
+* mpn_nior_n: Low-level Functions. (line 477)
+* mpn_perfect_square_p: Low-level Functions. (line 442)
+* mpn_popcount: Low-level Functions. (line 432)
+* mpn_random: Low-level Functions. (line 422)
+* mpn_random2: Low-level Functions. (line 423)
+* mpn_rshift: Low-level Functions. (line 281)
+* mpn_scan0: Low-level Functions. (line 406)
+* mpn_scan1: Low-level Functions. (line 414)
+* mpn_sec_add_1: Low-level Functions. (line 553)
+* mpn_sec_div_qr: Low-level Functions. (line 630)
+* mpn_sec_div_qr_itch: Low-level Functions. (line 633)
+* mpn_sec_div_r: Low-level Functions. (line 649)
+* mpn_sec_div_r_itch: Low-level Functions. (line 651)
+* mpn_sec_invert: Low-level Functions. (line 665)
+* mpn_sec_invert_itch: Low-level Functions. (line 667)
+* mpn_sec_mul: Low-level Functions. (line 574)
+* mpn_sec_mul_itch: Low-level Functions. (line 577)
+* mpn_sec_powm: Low-level Functions. (line 604)
+* mpn_sec_powm_itch: Low-level Functions. (line 607)
+* mpn_sec_sqr: Low-level Functions. (line 590)
+* mpn_sec_sqr_itch: Low-level Functions. (line 592)
+* mpn_sec_sub_1: Low-level Functions. (line 555)
+* mpn_sec_tabselect: Low-level Functions. (line 622)
+* mpn_set_str: Low-level Functions. (line 386)
+* mpn_sizeinbase: Low-level Functions. (line 364)
+* mpn_sqr: Low-level Functions. (line 125)
+* mpn_sqrtrem: Low-level Functions. (line 346)
+* mpn_sub: Low-level Functions. (line 88)
+* mpn_submul_1: Low-level Functions. (line 160)
+* mpn_sub_1: Low-level Functions. (line 83)
+* mpn_sub_n: Low-level Functions. (line 74)
+* mpn_tdiv_qr: Low-level Functions. (line 172)
+* mpn_xnor_n: Low-level Functions. (line 482)
+* mpn_xor_n: Low-level Functions. (line 457)
+* mpn_zero: Low-level Functions. (line 500)
+* mpn_zero_p: Low-level Functions. (line 298)
+* mpq_abs: Rational Arithmetic. (line 33)
+* mpq_add: Rational Arithmetic. (line 6)
+* mpq_canonicalize: Rational Number Functions.
+ (line 21)
+* mpq_class: C++ Interface General.
+ (line 18)
+* mpq_class::canonicalize: C++ Interface Rationals.
+ (line 41)
+* mpq_class::get_d: C++ Interface Rationals.
+ (line 51)
+* mpq_class::get_den: C++ Interface Rationals.
+ (line 67)
+* mpq_class::get_den_mpz_t: C++ Interface Rationals.
+ (line 77)
+* mpq_class::get_mpq_t: C++ Interface General.
+ (line 64)
+* mpq_class::get_num: C++ Interface Rationals.
+ (line 66)
+* mpq_class::get_num_mpz_t: C++ Interface Rationals.
+ (line 76)
+* mpq_class::get_str: C++ Interface Rationals.
+ (line 52)
+* mpq_class::mpq_class: C++ Interface Rationals.
+ (line 9)
+* mpq_class::mpq_class <1>: C++ Interface Rationals.
+ (line 10)
+* mpq_class::mpq_class <2>: C++ Interface Rationals.
+ (line 21)
+* mpq_class::mpq_class <3>: C++ Interface Rationals.
+ (line 26)
+* mpq_class::mpq_class <4>: C++ Interface Rationals.
+ (line 28)
+* mpq_class::set_str: C++ Interface Rationals.
+ (line 54)
+* mpq_class::set_str <1>: C++ Interface Rationals.
+ (line 55)
+* mpq_class::swap: C++ Interface Rationals.
+ (line 58)
+* mpq_clear: Initializing Rationals.
+ (line 15)
+* mpq_clears: Initializing Rationals.
+ (line 19)
+* mpq_cmp: Comparing Rationals. (line 6)
+* mpq_cmp_si: Comparing Rationals. (line 16)
+* mpq_cmp_ui: Comparing Rationals. (line 14)
+* mpq_cmp_z: Comparing Rationals. (line 7)
+* mpq_denref: Applying Integer Functions.
+ (line 16)
+* mpq_div: Rational Arithmetic. (line 22)
+* mpq_div_2exp: Rational Arithmetic. (line 26)
+* mpq_equal: Comparing Rationals. (line 33)
+* mpq_get_d: Rational Conversions.
+ (line 6)
+* mpq_get_den: Applying Integer Functions.
+ (line 24)
+* mpq_get_num: Applying Integer Functions.
+ (line 23)
+* mpq_get_str: Rational Conversions.
+ (line 21)
+* mpq_init: Initializing Rationals.
+ (line 6)
+* mpq_inits: Initializing Rationals.
+ (line 11)
+* mpq_inp_str: I/O of Rationals. (line 32)
+* mpq_inv: Rational Arithmetic. (line 36)
+* mpq_mul: Rational Arithmetic. (line 14)
+* mpq_mul_2exp: Rational Arithmetic. (line 18)
+* mpq_neg: Rational Arithmetic. (line 30)
+* mpq_numref: Applying Integer Functions.
+ (line 15)
+* mpq_out_str: I/O of Rationals. (line 17)
+* mpq_ptr: Nomenclature and Types.
+ (line 55)
+* mpq_set: Initializing Rationals.
+ (line 23)
+* mpq_set_d: Rational Conversions.
+ (line 16)
+* mpq_set_den: Applying Integer Functions.
+ (line 26)
+* mpq_set_f: Rational Conversions.
+ (line 17)
+* mpq_set_num: Applying Integer Functions.
+ (line 25)
+* mpq_set_si: Initializing Rationals.
+ (line 29)
+* mpq_set_str: Initializing Rationals.
+ (line 35)
+* mpq_set_ui: Initializing Rationals.
+ (line 27)
+* mpq_set_z: Initializing Rationals.
+ (line 24)
+* mpq_sgn: Comparing Rationals. (line 27)
+* mpq_srcptr: Nomenclature and Types.
+ (line 55)
+* mpq_sub: Rational Arithmetic. (line 10)
+* mpq_swap: Initializing Rationals.
+ (line 54)
+* mpq_t: Nomenclature and Types.
+ (line 16)
+* mpz_2fac_ui: Number Theoretic Functions.
+ (line 122)
+* mpz_abs: Integer Arithmetic. (line 44)
+* mpz_add: Integer Arithmetic. (line 6)
+* mpz_addmul: Integer Arithmetic. (line 24)
+* mpz_addmul_ui: Integer Arithmetic. (line 26)
+* mpz_add_ui: Integer Arithmetic. (line 7)
+* mpz_and: Integer Logic and Bit Fiddling.
+ (line 10)
+* mpz_array_init: Integer Special Functions.
+ (line 9)
+* mpz_bin_ui: Number Theoretic Functions.
+ (line 133)
+* mpz_bin_uiui: Number Theoretic Functions.
+ (line 135)
+* mpz_cdiv_q: Integer Division. (line 12)
+* mpz_cdiv_qr: Integer Division. (line 14)
+* mpz_cdiv_qr_ui: Integer Division. (line 21)
+* mpz_cdiv_q_2exp: Integer Division. (line 26)
+* mpz_cdiv_q_ui: Integer Division. (line 17)
+* mpz_cdiv_r: Integer Division. (line 13)
+* mpz_cdiv_r_2exp: Integer Division. (line 29)
+* mpz_cdiv_r_ui: Integer Division. (line 19)
+* mpz_cdiv_ui: Integer Division. (line 23)
+* mpz_class: C++ Interface General.
+ (line 17)
+* mpz_class::factorial: C++ Interface Integers.
+ (line 70)
+* mpz_class::fibonacci: C++ Interface Integers.
+ (line 74)
+* mpz_class::fits_sint_p: C++ Interface Integers.
+ (line 50)
+* mpz_class::fits_slong_p: C++ Interface Integers.
+ (line 51)
+* mpz_class::fits_sshort_p: C++ Interface Integers.
+ (line 52)
+* mpz_class::fits_uint_p: C++ Interface Integers.
+ (line 54)
+* mpz_class::fits_ulong_p: C++ Interface Integers.
+ (line 55)
+* mpz_class::fits_ushort_p: C++ Interface Integers.
+ (line 56)
+* mpz_class::get_d: C++ Interface Integers.
+ (line 58)
+* mpz_class::get_mpz_t: C++ Interface General.
+ (line 63)
+* mpz_class::get_si: C++ Interface Integers.
+ (line 59)
+* mpz_class::get_str: C++ Interface Integers.
+ (line 60)
+* mpz_class::get_ui: C++ Interface Integers.
+ (line 61)
+* mpz_class::mpz_class: C++ Interface Integers.
+ (line 6)
+* mpz_class::mpz_class <1>: C++ Interface Integers.
+ (line 14)
+* mpz_class::mpz_class <2>: C++ Interface Integers.
+ (line 19)
+* mpz_class::mpz_class <3>: C++ Interface Integers.
+ (line 21)
+* mpz_class::primorial: C++ Interface Integers.
+ (line 72)
+* mpz_class::set_str: C++ Interface Integers.
+ (line 63)
+* mpz_class::set_str <1>: C++ Interface Integers.
+ (line 64)
+* mpz_class::swap: C++ Interface Integers.
+ (line 77)
+* mpz_clear: Initializing Integers.
+ (line 48)
+* mpz_clears: Initializing Integers.
+ (line 52)
+* mpz_clrbit: Integer Logic and Bit Fiddling.
+ (line 54)
+* mpz_cmp: Integer Comparisons. (line 6)
+* mpz_cmpabs: Integer Comparisons. (line 17)
+* mpz_cmpabs_d: Integer Comparisons. (line 18)
+* mpz_cmpabs_ui: Integer Comparisons. (line 19)
+* mpz_cmp_d: Integer Comparisons. (line 7)
+* mpz_cmp_si: Integer Comparisons. (line 8)
+* mpz_cmp_ui: Integer Comparisons. (line 9)
+* mpz_com: Integer Logic and Bit Fiddling.
+ (line 19)
+* mpz_combit: Integer Logic and Bit Fiddling.
+ (line 57)
+* mpz_congruent_2exp_p: Integer Division. (line 148)
+* mpz_congruent_p: Integer Division. (line 144)
+* mpz_congruent_ui_p: Integer Division. (line 146)
+* mpz_divexact: Integer Division. (line 122)
+* mpz_divexact_ui: Integer Division. (line 123)
+* mpz_divisible_2exp_p: Integer Division. (line 135)
+* mpz_divisible_p: Integer Division. (line 132)
+* mpz_divisible_ui_p: Integer Division. (line 133)
+* mpz_even_p: Miscellaneous Integer Functions.
+ (line 17)
+* mpz_export: Integer Import and Export.
+ (line 43)
+* mpz_fac_ui: Number Theoretic Functions.
+ (line 121)
+* mpz_fdiv_q: Integer Division. (line 33)
+* mpz_fdiv_qr: Integer Division. (line 35)
+* mpz_fdiv_qr_ui: Integer Division. (line 42)
+* mpz_fdiv_q_2exp: Integer Division. (line 47)
+* mpz_fdiv_q_ui: Integer Division. (line 38)
+* mpz_fdiv_r: Integer Division. (line 34)
+* mpz_fdiv_r_2exp: Integer Division. (line 50)
+* mpz_fdiv_r_ui: Integer Division. (line 40)
+* mpz_fdiv_ui: Integer Division. (line 44)
+* mpz_fib2_ui: Number Theoretic Functions.
+ (line 143)
+* mpz_fib_ui: Number Theoretic Functions.
+ (line 142)
+* mpz_fits_sint_p: Miscellaneous Integer Functions.
+ (line 9)
+* mpz_fits_slong_p: Miscellaneous Integer Functions.
+ (line 7)
+* mpz_fits_sshort_p: Miscellaneous Integer Functions.
+ (line 11)
+* mpz_fits_uint_p: Miscellaneous Integer Functions.
+ (line 8)
+* mpz_fits_ulong_p: Miscellaneous Integer Functions.
+ (line 6)
+* mpz_fits_ushort_p: Miscellaneous Integer Functions.
+ (line 10)
+* mpz_gcd: Number Theoretic Functions.
+ (line 38)
+* mpz_gcdext: Number Theoretic Functions.
+ (line 54)
+* mpz_gcd_ui: Number Theoretic Functions.
+ (line 44)
+* mpz_getlimbn: Integer Special Functions.
+ (line 22)
+* mpz_get_d: Converting Integers. (line 26)
+* mpz_get_d_2exp: Converting Integers. (line 34)
+* mpz_get_si: Converting Integers. (line 17)
+* mpz_get_str: Converting Integers. (line 46)
+* mpz_get_ui: Converting Integers. (line 10)
+* mpz_hamdist: Integer Logic and Bit Fiddling.
+ (line 28)
+* mpz_import: Integer Import and Export.
+ (line 9)
+* mpz_init: Initializing Integers.
+ (line 25)
+* mpz_init2: Initializing Integers.
+ (line 32)
+* mpz_inits: Initializing Integers.
+ (line 28)
+* mpz_init_set: Simultaneous Integer Init & Assign.
+ (line 26)
+* mpz_init_set_d: Simultaneous Integer Init & Assign.
+ (line 29)
+* mpz_init_set_si: Simultaneous Integer Init & Assign.
+ (line 28)
+* mpz_init_set_str: Simultaneous Integer Init & Assign.
+ (line 33)
+* mpz_init_set_ui: Simultaneous Integer Init & Assign.
+ (line 27)
+* mpz_inp_raw: I/O of Integers. (line 61)
+* mpz_inp_str: I/O of Integers. (line 30)
+* mpz_invert: Number Theoretic Functions.
+ (line 81)
+* mpz_ior: Integer Logic and Bit Fiddling.
+ (line 13)
+* mpz_jacobi: Number Theoretic Functions.
+ (line 91)
+* mpz_kronecker: Number Theoretic Functions.
+ (line 99)
+* mpz_kronecker_si: Number Theoretic Functions.
+ (line 100)
+* mpz_kronecker_ui: Number Theoretic Functions.
+ (line 101)
+* mpz_lcm: Number Theoretic Functions.
+ (line 74)
+* mpz_lcm_ui: Number Theoretic Functions.
+ (line 75)
+* mpz_legendre: Number Theoretic Functions.
+ (line 94)
+* mpz_limbs_finish: Integer Special Functions.
+ (line 47)
+* mpz_limbs_modify: Integer Special Functions.
+ (line 40)
+* mpz_limbs_read: Integer Special Functions.
+ (line 34)
+* mpz_limbs_write: Integer Special Functions.
+ (line 39)
+* mpz_lucnum2_ui: Number Theoretic Functions.
+ (line 154)
+* mpz_lucnum_ui: Number Theoretic Functions.
+ (line 153)
+* mpz_mfac_uiui: Number Theoretic Functions.
+ (line 123)
+* mpz_mod: Integer Division. (line 112)
+* mpz_mod_ui: Integer Division. (line 113)
+* mpz_mul: Integer Arithmetic. (line 18)
+* mpz_mul_2exp: Integer Arithmetic. (line 36)
+* mpz_mul_si: Integer Arithmetic. (line 19)
+* mpz_mul_ui: Integer Arithmetic. (line 20)
+* mpz_neg: Integer Arithmetic. (line 41)
+* mpz_nextprime: Number Theoretic Functions.
+ (line 22)
+* mpz_odd_p: Miscellaneous Integer Functions.
+ (line 16)
+* mpz_out_raw: I/O of Integers. (line 45)
+* mpz_out_str: I/O of Integers. (line 17)
+* mpz_perfect_power_p: Integer Roots. (line 27)
+* mpz_perfect_square_p: Integer Roots. (line 36)
+* mpz_popcount: Integer Logic and Bit Fiddling.
+ (line 22)
+* mpz_powm: Integer Exponentiation.
+ (line 6)
+* mpz_powm_sec: Integer Exponentiation.
+ (line 16)
+* mpz_powm_ui: Integer Exponentiation.
+ (line 8)
+* mpz_pow_ui: Integer Exponentiation.
+ (line 29)
+* mpz_prevprime: Number Theoretic Functions.
+ (line 25)
+* mpz_primorial_ui: Number Theoretic Functions.
+ (line 129)
+* mpz_probab_prime_p: Number Theoretic Functions.
+ (line 6)
+* mpz_ptr: Nomenclature and Types.
+ (line 55)
+* mpz_random: Integer Random Numbers.
+ (line 41)
+* mpz_random2: Integer Random Numbers.
+ (line 50)
+* mpz_realloc2: Initializing Integers.
+ (line 56)
+* mpz_remove: Number Theoretic Functions.
+ (line 115)
+* mpz_roinit_n: Integer Special Functions.
+ (line 67)
+* MPZ_ROINIT_N: Integer Special Functions.
+ (line 83)
+* mpz_root: Integer Roots. (line 6)
+* mpz_rootrem: Integer Roots. (line 12)
+* mpz_rrandomb: Integer Random Numbers.
+ (line 29)
+* mpz_scan0: Integer Logic and Bit Fiddling.
+ (line 35)
+* mpz_scan1: Integer Logic and Bit Fiddling.
+ (line 37)
+* mpz_set: Assigning Integers. (line 9)
+* mpz_setbit: Integer Logic and Bit Fiddling.
+ (line 51)
+* mpz_set_d: Assigning Integers. (line 12)
+* mpz_set_f: Assigning Integers. (line 14)
+* mpz_set_q: Assigning Integers. (line 13)
+* mpz_set_si: Assigning Integers. (line 11)
+* mpz_set_str: Assigning Integers. (line 20)
+* mpz_set_ui: Assigning Integers. (line 10)
+* mpz_sgn: Integer Comparisons. (line 27)
+* mpz_size: Integer Special Functions.
+ (line 30)
+* mpz_sizeinbase: Miscellaneous Integer Functions.
+ (line 22)
+* mpz_si_kronecker: Number Theoretic Functions.
+ (line 102)
+* mpz_sqrt: Integer Roots. (line 17)
+* mpz_sqrtrem: Integer Roots. (line 20)
+* mpz_srcptr: Nomenclature and Types.
+ (line 55)
+* mpz_sub: Integer Arithmetic. (line 11)
+* mpz_submul: Integer Arithmetic. (line 30)
+* mpz_submul_ui: Integer Arithmetic. (line 32)
+* mpz_sub_ui: Integer Arithmetic. (line 12)
+* mpz_swap: Assigning Integers. (line 36)
+* mpz_t: Nomenclature and Types.
+ (line 6)
+* mpz_tdiv_q: Integer Division. (line 54)
+* mpz_tdiv_qr: Integer Division. (line 56)
+* mpz_tdiv_qr_ui: Integer Division. (line 63)
+* mpz_tdiv_q_2exp: Integer Division. (line 68)
+* mpz_tdiv_q_ui: Integer Division. (line 59)
+* mpz_tdiv_r: Integer Division. (line 55)
+* mpz_tdiv_r_2exp: Integer Division. (line 71)
+* mpz_tdiv_r_ui: Integer Division. (line 61)
+* mpz_tdiv_ui: Integer Division. (line 65)
+* mpz_tstbit: Integer Logic and Bit Fiddling.
+ (line 60)
+* mpz_ui_kronecker: Number Theoretic Functions.
+ (line 103)
+* mpz_ui_pow_ui: Integer Exponentiation.
+ (line 31)
+* mpz_ui_sub: Integer Arithmetic. (line 14)
+* mpz_urandomb: Integer Random Numbers.
+ (line 12)
+* mpz_urandomm: Integer Random Numbers.
+ (line 21)
+* mpz_xor: Integer Logic and Bit Fiddling.
+ (line 16)
+* mp_bitcnt_t: Nomenclature and Types.
+ (line 42)
+* mp_bits_per_limb: Useful Macros and Constants.
+ (line 7)
+* mp_exp_t: Nomenclature and Types.
+ (line 27)
+* mp_get_memory_functions: Custom Allocation. (line 86)
+* mp_limb_t: Nomenclature and Types.
+ (line 31)
+* mp_set_memory_functions: Custom Allocation. (line 14)
+* mp_size_t: Nomenclature and Types.
+ (line 37)
+* operator"": C++ Interface Integers.
+ (line 29)
+* operator"" <1>: C++ Interface Rationals.
+ (line 36)
+* operator"" <2>: C++ Interface Floats.
+ (line 55)
+* operator%: C++ Interface Integers.
+ (line 34)
+* operator/: C++ Interface Integers.
+ (line 33)
+* operator<<: C++ Formatted Output.
+ (line 10)
+* operator<< <1>: C++ Formatted Output.
+ (line 19)
+* operator<< <2>: C++ Formatted Output.
+ (line 32)
+* operator>>: C++ Formatted Input. (line 10)
+* operator>> <1>: C++ Formatted Input. (line 13)
+* operator>> <2>: C++ Formatted Input. (line 24)
+* operator>> <3>: C++ Interface Rationals.
+ (line 86)
+* primorial: C++ Interface Integers.
+ (line 73)
+* sgn: C++ Interface Integers.
+ (line 65)
+* sgn <1>: C++ Interface Rationals.
+ (line 56)
+* sgn <2>: C++ Interface Floats.
+ (line 106)
+* sqrt: C++ Interface Integers.
+ (line 66)
+* sqrt <1>: C++ Interface Floats.
+ (line 107)
+* swap: C++ Interface Integers.
+ (line 78)
+* swap <1>: C++ Interface Rationals.
+ (line 59)
+* swap <2>: C++ Interface Floats.
+ (line 110)
+* trunc: C++ Interface Floats.
+ (line 111)
+
--- /dev/null
+#!/bin/sh
+
+prefix=/usr/local
+exec_prefix=${prefix}
+exec_prefix_set=no
+
+usage="\
+Usage: ode-config [--prefix[=DIR]] [--exec-prefix[=DIR]] [--version] [--cflags] [--libs]"
+
+if test $# -eq 0; then
+ echo "${usage}" 1>&2
+ exit 1
+fi
+
+while test $# -gt 0; do
+ case "$1" in
+ -*=*) optarg=`echo "$1" | sed 's/[-_a-zA-Z0-9]*=//'` ;;
+ *) optarg= ;;
+ esac
+
+ case $1 in
+ --prefix=*)
+ prefix=$optarg
+ if test $exec_prefix_set = no ; then
+ exec_prefix=$optarg
+ fi
+ ;;
+ --prefix)
+ echo $prefix
+ ;;
+ --exec-prefix=*)
+ exec_prefix=$optarg
+ exec_prefix_set=yes
+ ;;
+ --exec-prefix)
+ echo $exec_prefix
+ ;;
+ --version)
+ echo 0.12
+ ;;
+ --cflags)
+ echo -I${prefix}/include -DdDOUBLE
+ ;;
+ --libs)
+ echo -L${exec_prefix}/lib -lode
+ ;;
+ *)
+ echo "${usage}" 1>&2
+ exit 1
+ ;;
+ esac
+ shift
+done
--- /dev/null
+SUBDIRS = ode
\ No newline at end of file
--- /dev/null
+# Makefile.in generated by automake 1.9.6 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
+# 2003, 2004, 2005 Free Software Foundation, Inc.
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+@SET_MAKE@
+srcdir = @srcdir@
+top_srcdir = @top_srcdir@
+VPATH = @srcdir@
+pkgdatadir = $(datadir)/@PACKAGE@
+pkglibdir = $(libdir)/@PACKAGE@
+pkgincludedir = $(includedir)/@PACKAGE@
+top_builddir = ..
+am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
+INSTALL = @INSTALL@
+install_sh_DATA = $(install_sh) -c -m 644
+install_sh_PROGRAM = $(install_sh) -c
+install_sh_SCRIPT = $(install_sh) -c
+INSTALL_HEADER = $(INSTALL_DATA)
+transform = $(program_transform_name)
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+build_triplet = @build@
+host_triplet = @host@
+target_triplet = @target@
+LIBOBJDIR =
+subdir = include
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/configure.in
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+ $(ACLOCAL_M4)
+mkinstalldirs = $(install_sh) -d
+CONFIG_HEADER = $(top_builddir)/include/ode/config.h
+CONFIG_CLEAN_FILES =
+SOURCES =
+DIST_SOURCES =
+RECURSIVE_TARGETS = all-recursive check-recursive dvi-recursive \
+ html-recursive info-recursive install-data-recursive \
+ install-exec-recursive install-info-recursive \
+ install-recursive installcheck-recursive installdirs-recursive \
+ pdf-recursive ps-recursive uninstall-info-recursive \
+ uninstall-recursive
+ETAGS = etags
+CTAGS = ctags
+DIST_SUBDIRS = $(SUBDIRS)
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+ACLOCAL = @ACLOCAL@
+ALLOCA = @ALLOCA@
+AMDEP_FALSE = @AMDEP_FALSE@
+AMDEP_TRUE = @AMDEP_TRUE@
+AMTAR = @AMTAR@
+ARCHFLAGS = @ARCHFLAGS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CC = @CC@
+CCDEPMODE = @CCDEPMODE@
+CFLAGS = @CFLAGS@
+CPP = @CPP@
+CPPFLAGS = @CPPFLAGS@
+CXX = @CXX@
+CXXDEPMODE = @CXXDEPMODE@
+CXXFLAGS = @CXXFLAGS@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+DEPDIR = @DEPDIR@
+DRAWSTUFF = @DRAWSTUFF@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+EGREP = @EGREP@
+EXEEXT = @EXEEXT@
+GL_LIBS = @GL_LIBS@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LDFLAGS = @LDFLAGS@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LTLIBOBJS = @LTLIBOBJS@
+MAKEINFO = @MAKEINFO@
+OBJEXT = @OBJEXT@
+ODE_AGE = @ODE_AGE@
+ODE_CURRENT = @ODE_CURRENT@
+ODE_RELEASE = @ODE_RELEASE@
+ODE_REVISION = @ODE_REVISION@
+ODE_SONAME = @ODE_SONAME@
+OPCODE_FALSE = @OPCODE_FALSE@
+OPCODE_TRUE = @OPCODE_TRUE@
+OSX_FALSE = @OSX_FALSE@
+OSX_TRUE = @OSX_TRUE@
+PACKAGE = @PACKAGE@
+PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
+PACKAGE_NAME = @PACKAGE_NAME@
+PACKAGE_STRING = @PACKAGE_STRING@
+PACKAGE_TARNAME = @PACKAGE_TARNAME@
+PACKAGE_VERSION = @PACKAGE_VERSION@
+PATH_SEPARATOR = @PATH_SEPARATOR@
+RANLIB = @RANLIB@
+SET_MAKE = @SET_MAKE@
+SHARED_LDFLAGS = @SHARED_LDFLAGS@
+SHELL = @SHELL@
+STRIP = @STRIP@
+TOPDIR = @TOPDIR@
+USE_SONAME_FALSE = @USE_SONAME_FALSE@
+USE_SONAME_TRUE = @USE_SONAME_TRUE@
+VERSION = @VERSION@
+WIN32_FALSE = @WIN32_FALSE@
+WIN32_TRUE = @WIN32_TRUE@
+WINDRES = @WINDRES@
+X11_FALSE = @X11_FALSE@
+X11_TRUE = @X11_TRUE@
+X86_64_SYSTEM_FALSE = @X86_64_SYSTEM_FALSE@
+X86_64_SYSTEM_TRUE = @X86_64_SYSTEM_TRUE@
+X_CFLAGS = @X_CFLAGS@
+X_EXTRA_LIBS = @X_EXTRA_LIBS@
+X_LIBS = @X_LIBS@
+X_PRE_LIBS = @X_PRE_LIBS@
+ac_ct_CC = @ac_ct_CC@
+ac_ct_CXX = @ac_ct_CXX@
+ac_ct_RANLIB = @ac_ct_RANLIB@
+ac_ct_STRIP = @ac_ct_STRIP@
+ac_ct_WINDRES = @ac_ct_WINDRES@
+am__fastdepCC_FALSE = @am__fastdepCC_FALSE@
+am__fastdepCC_TRUE = @am__fastdepCC_TRUE@
+am__fastdepCXX_FALSE = @am__fastdepCXX_FALSE@
+am__fastdepCXX_TRUE = @am__fastdepCXX_TRUE@
+am__include = @am__include@
+am__leading_dot = @am__leading_dot@
+am__quote = @am__quote@
+am__tar = @am__tar@
+am__untar = @am__untar@
+bindir = @bindir@
+build = @build@
+build_alias = @build_alias@
+build_cpu = @build_cpu@
+build_os = @build_os@
+build_vendor = @build_vendor@
+datadir = @datadir@
+exec_prefix = @exec_prefix@
+host = @host@
+host_alias = @host_alias@
+host_cpu = @host_cpu@
+host_os = @host_os@
+host_vendor = @host_vendor@
+includedir = @includedir@
+infodir = @infodir@
+install_sh = @install_sh@
+libdir = @libdir@
+libexecdir = @libexecdir@
+localstatedir = @localstatedir@
+mandir = @mandir@
+mkdir_p = @mkdir_p@
+oldincludedir = @oldincludedir@
+prefix = @prefix@
+program_transform_name = @program_transform_name@
+sbindir = @sbindir@
+sharedstatedir = @sharedstatedir@
+so_ext = @so_ext@
+sysconfdir = @sysconfdir@
+target = @target@
+target_alias = @target_alias@
+target_cpu = @target_cpu@
+target_os = @target_os@
+target_vendor = @target_vendor@
+SUBDIRS = ode
+all: all-recursive
+
+.SUFFIXES:
+$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
+ @for dep in $?; do \
+ case '$(am__configure_deps)' in \
+ *$$dep*) \
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \
+ && exit 0; \
+ exit 1;; \
+ esac; \
+ done; \
+ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign include/Makefile'; \
+ cd $(top_srcdir) && \
+ $(AUTOMAKE) --foreign include/Makefile
+.PRECIOUS: Makefile
+Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
+ @case '$?' in \
+ *config.status*) \
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
+ *) \
+ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
+ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
+ esac;
+
+$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+
+$(top_srcdir)/configure: $(am__configure_deps)
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+$(ACLOCAL_M4): $(am__aclocal_m4_deps)
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+uninstall-info-am:
+
+# This directory's subdirectories are mostly independent; you can cd
+# into them and run `make' without going through this Makefile.
+# To change the values of `make' variables: instead of editing Makefiles,
+# (1) if the variable is set in `config.status', edit `config.status'
+# (which will cause the Makefiles to be regenerated when you run `make');
+# (2) otherwise, pass the desired values on the `make' command line.
+$(RECURSIVE_TARGETS):
+ @failcom='exit 1'; \
+ for f in x $$MAKEFLAGS; do \
+ case $$f in \
+ *=* | --[!k]*);; \
+ *k*) failcom='fail=yes';; \
+ esac; \
+ done; \
+ dot_seen=no; \
+ target=`echo $@ | sed s/-recursive//`; \
+ list='$(SUBDIRS)'; for subdir in $$list; do \
+ echo "Making $$target in $$subdir"; \
+ if test "$$subdir" = "."; then \
+ dot_seen=yes; \
+ local_target="$$target-am"; \
+ else \
+ local_target="$$target"; \
+ fi; \
+ (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
+ || eval $$failcom; \
+ done; \
+ if test "$$dot_seen" = "no"; then \
+ $(MAKE) $(AM_MAKEFLAGS) "$$target-am" || exit 1; \
+ fi; test -z "$$fail"
+
+mostlyclean-recursive clean-recursive distclean-recursive \
+maintainer-clean-recursive:
+ @failcom='exit 1'; \
+ for f in x $$MAKEFLAGS; do \
+ case $$f in \
+ *=* | --[!k]*);; \
+ *k*) failcom='fail=yes';; \
+ esac; \
+ done; \
+ dot_seen=no; \
+ case "$@" in \
+ distclean-* | maintainer-clean-*) list='$(DIST_SUBDIRS)' ;; \
+ *) list='$(SUBDIRS)' ;; \
+ esac; \
+ rev=''; for subdir in $$list; do \
+ if test "$$subdir" = "."; then :; else \
+ rev="$$subdir $$rev"; \
+ fi; \
+ done; \
+ rev="$$rev ."; \
+ target=`echo $@ | sed s/-recursive//`; \
+ for subdir in $$rev; do \
+ echo "Making $$target in $$subdir"; \
+ if test "$$subdir" = "."; then \
+ local_target="$$target-am"; \
+ else \
+ local_target="$$target"; \
+ fi; \
+ (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) $$local_target) \
+ || eval $$failcom; \
+ done && test -z "$$fail"
+tags-recursive:
+ list='$(SUBDIRS)'; for subdir in $$list; do \
+ test "$$subdir" = . || (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) tags); \
+ done
+ctags-recursive:
+ list='$(SUBDIRS)'; for subdir in $$list; do \
+ test "$$subdir" = . || (cd $$subdir && $(MAKE) $(AM_MAKEFLAGS) ctags); \
+ done
+
+ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
+ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
+ unique=`for i in $$list; do \
+ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+ done | \
+ $(AWK) ' { files[$$0] = 1; } \
+ END { for (i in files) print i; }'`; \
+ mkid -fID $$unique
+tags: TAGS
+
+TAGS: tags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
+ $(TAGS_FILES) $(LISP)
+ tags=; \
+ here=`pwd`; \
+ if ($(ETAGS) --etags-include --version) >/dev/null 2>&1; then \
+ include_option=--etags-include; \
+ empty_fix=.; \
+ else \
+ include_option=--include; \
+ empty_fix=; \
+ fi; \
+ list='$(SUBDIRS)'; for subdir in $$list; do \
+ if test "$$subdir" = .; then :; else \
+ test ! -f $$subdir/TAGS || \
+ tags="$$tags $$include_option=$$here/$$subdir/TAGS"; \
+ fi; \
+ done; \
+ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
+ unique=`for i in $$list; do \
+ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+ done | \
+ $(AWK) ' { files[$$0] = 1; } \
+ END { for (i in files) print i; }'`; \
+ if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \
+ test -n "$$unique" || unique=$$empty_fix; \
+ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
+ $$tags $$unique; \
+ fi
+ctags: CTAGS
+CTAGS: ctags-recursive $(HEADERS) $(SOURCES) $(TAGS_DEPENDENCIES) \
+ $(TAGS_FILES) $(LISP)
+ tags=; \
+ here=`pwd`; \
+ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
+ unique=`for i in $$list; do \
+ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+ done | \
+ $(AWK) ' { files[$$0] = 1; } \
+ END { for (i in files) print i; }'`; \
+ test -z "$(CTAGS_ARGS)$$tags$$unique" \
+ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
+ $$tags $$unique
+
+GTAGS:
+ here=`$(am__cd) $(top_builddir) && pwd` \
+ && cd $(top_srcdir) \
+ && gtags -i $(GTAGS_ARGS) $$here
+
+distclean-tags:
+ -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
+
+distdir: $(DISTFILES)
+ @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \
+ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \
+ list='$(DISTFILES)'; for file in $$list; do \
+ case $$file in \
+ $(srcdir)/*) file=`echo "$$file" | sed "s|^$$srcdirstrip/||"`;; \
+ $(top_srcdir)/*) file=`echo "$$file" | sed "s|^$$topsrcdirstrip/|$(top_builddir)/|"`;; \
+ esac; \
+ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
+ dir=`echo "$$file" | sed -e 's,/[^/]*$$,,'`; \
+ if test "$$dir" != "$$file" && test "$$dir" != "."; then \
+ dir="/$$dir"; \
+ $(mkdir_p) "$(distdir)$$dir"; \
+ else \
+ dir=''; \
+ fi; \
+ if test -d $$d/$$file; then \
+ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
+ cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \
+ fi; \
+ cp -pR $$d/$$file $(distdir)$$dir || exit 1; \
+ else \
+ test -f $(distdir)/$$file \
+ || cp -p $$d/$$file $(distdir)/$$file \
+ || exit 1; \
+ fi; \
+ done
+ list='$(DIST_SUBDIRS)'; for subdir in $$list; do \
+ if test "$$subdir" = .; then :; else \
+ test -d "$(distdir)/$$subdir" \
+ || $(mkdir_p) "$(distdir)/$$subdir" \
+ || exit 1; \
+ distdir=`$(am__cd) $(distdir) && pwd`; \
+ top_distdir=`$(am__cd) $(top_distdir) && pwd`; \
+ (cd $$subdir && \
+ $(MAKE) $(AM_MAKEFLAGS) \
+ top_distdir="$$top_distdir" \
+ distdir="$$distdir/$$subdir" \
+ distdir) \
+ || exit 1; \
+ fi; \
+ done
+check-am: all-am
+check: check-recursive
+all-am: Makefile
+installdirs: installdirs-recursive
+installdirs-am:
+install: install-recursive
+install-exec: install-exec-recursive
+install-data: install-data-recursive
+uninstall: uninstall-recursive
+
+install-am: all-am
+ @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-recursive
+install-strip:
+ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+ `test -z '$(STRIP)' || \
+ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install
+mostlyclean-generic:
+
+clean-generic:
+
+distclean-generic:
+ -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
+
+maintainer-clean-generic:
+ @echo "This command is intended for maintainers to use"
+ @echo "it deletes files that may require special tools to rebuild."
+clean: clean-recursive
+
+clean-am: clean-generic mostlyclean-am
+
+distclean: distclean-recursive
+ -rm -f Makefile
+distclean-am: clean-am distclean-generic distclean-tags
+
+dvi: dvi-recursive
+
+dvi-am:
+
+html: html-recursive
+
+info: info-recursive
+
+info-am:
+
+install-data-am:
+
+install-exec-am:
+
+install-info: install-info-recursive
+
+install-man:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-recursive
+ -rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-recursive
+
+mostlyclean-am: mostlyclean-generic
+
+pdf: pdf-recursive
+
+pdf-am:
+
+ps: ps-recursive
+
+ps-am:
+
+uninstall-am: uninstall-info-am
+
+uninstall-info: uninstall-info-recursive
+
+.PHONY: $(RECURSIVE_TARGETS) CTAGS GTAGS all all-am check check-am \
+ clean clean-generic clean-recursive ctags ctags-recursive \
+ distclean distclean-generic distclean-recursive distclean-tags \
+ distdir dvi dvi-am html html-am info info-am install \
+ install-am install-data install-data-am install-exec \
+ install-exec-am install-info install-info-am install-man \
+ install-strip installcheck installcheck-am installdirs \
+ installdirs-am maintainer-clean maintainer-clean-generic \
+ maintainer-clean-recursive mostlyclean mostlyclean-generic \
+ mostlyclean-recursive pdf pdf-am ps ps-am tags tags-recursive \
+ uninstall uninstall-am uninstall-info-am
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001-2003 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+/** @defgroup drawstuff DrawStuff
+
+DrawStuff is a library for rendering simple 3D objects in a virtual
+environment, for the purposes of demonstrating the features of ODE.
+It is provided for demonstration purposes and is not intended for
+production use.
+
+@section Notes
+
+In the virtual world, the z axis is "up" and z=0 is the floor.
+
+The user is able to click+drag in the main window to move the camera:
+ * left button - pan and tilt.
+ * right button - forward and sideways.
+ * left + right button (or middle button) - sideways and up.
+*/
+
+
+#ifndef __DRAWSTUFF_H__
+#define __DRAWSTUFF_H__
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+#include <drawstuff/version.h>
+
+
+/* texture numbers */
+#define DS_NONE 0 /* uses the current color instead of a texture */
+#define DS_WOOD 1
+
+
+/**
+ * @struct dsFunctions
+ * @brief Set of functions to be used as callbacks by the simulation loop.
+ * @ingroup drawstuff
+ */
+typedef struct dsFunctions {
+ int version; /* put DS_VERSION here */
+ /* version 1 data */
+ void (*start)(); /* called before sim loop starts */
+ void (*step) (int pause); /* called before every frame */
+ void (*command) (int cmd); /* called if a command key is pressed */
+ void (*stop)(); /* called after sim loop exits */
+ /* version 2 data */
+ char *path_to_textures; /* if nonzero, path to texture files */
+} dsFunctions;
+
+
+/**
+ * @brief Does the complete simulation.
+ * @ingroup drawstuff
+ * This function starts running the simulation, and only exits when the simulation is done.
+ * Function pointers should be provided for the callbacks.
+ * @param argv supports flags like '-notex' '-noshadow' '-pause'
+ * @param fn Callback functions.
+ */
+void dsSimulationLoop (int argc, char **argv,
+ int window_width, int window_height,
+ struct dsFunctions *fn);
+
+/**
+ * @brief exit with error message.
+ * @ingroup drawstuff
+ * This function displays an error message then exit.
+ * @param msg format strin, like printf, without the newline character.
+ */
+void dsError (char *msg, ...);
+
+/**
+ * @brief exit with error message and core dump.
+ * @ingroup drawstuff
+ * this functions tries to dump core or start the debugger.
+ * @param msg format strin, like printf, without the newline character.
+ */
+void dsDebug (char *msg, ...);
+
+/**
+ * @brief print log message
+ * @ingroup drawstuff
+ * @param msg format string, like printf, without the \n.
+ */
+void dsPrint (char *msg, ...);
+
+/**
+ * @brief Sets the viewpoint
+ * @ingroup drawstuff
+ * @param xyz camera position.
+ * @param hpr contains heading, pitch and roll numbers in degrees. heading=0
+ * points along the x axis, pitch=0 is looking towards the horizon, and
+ * roll 0 is "unrotated".
+ */
+void dsSetViewpoint (float xyz[3], float hpr[3]);
+
+
+/**
+ * @brief Gets the viewpoint
+ * @ingroup drawstuff
+ * @param xyz position
+ * @param hpr heading,pitch,roll.
+ */
+void dsGetViewpoint (float xyz[3], float hpr[3]);
+
+/**
+ * @brief Stop the simulation loop.
+ * @ingroup drawstuff
+ * Calling this from within dsSimulationLoop()
+ * will cause it to exit and return to the caller. it is the same as if the
+ * user used the exit command. using this outside the loop will have no
+ * effect.
+ */
+void dsStop();
+
+/**
+ * @brief Get the elapsed time (on wall-clock)
+ * @ingroup drawstuff
+ * It returns the nr of seconds since the last call to this function.
+ */
+double dsElapsedTime();
+
+/**
+ * @brief Toggle the rendering of textures.
+ * @ingroup drawstuff
+ * It changes the way objects are drawn. these changes will apply to all further
+ * dsDrawXXX() functions.
+ * @param the texture number must be a DS_xxx texture constant.
+ * The current texture is colored according to the current color.
+ * At the start of each frame, the texture is reset to none and the color is
+ * reset to white.
+ */
+void dsSetTexture (int texture_number);
+
+/**
+ * @brief Set the color with which geometry is drawn.
+ * @ingroup drawstuff
+ * @param red Red component from 0 to 1
+ * @param green Green component from 0 to 1
+ * @param blue Blue component from 0 to 1
+ */
+void dsSetColor (float red, float green, float blue);
+
+/**
+ * @brief Set the color and transparency with which geometry is drawn.
+ * @ingroup drawstuff
+ * @param alpha Note that alpha transparency is a misnomer: it is alpha opacity.
+ * 1.0 means fully opaque, and 0.0 means fully transparent.
+ */
+void dsSetColorAlpha (float red, float green, float blue, float alpha);
+
+/**
+ * @brief Draw a box.
+ * @ingroup drawstuff
+ * @param pos is the x,y,z of the center of the object.
+ * @param R is a 3x3 rotation matrix for the object, stored by row like this:
+ * [ R11 R12 R13 0 ]
+ * [ R21 R22 R23 0 ]
+ * [ R31 R32 R33 0 ]
+ * @param sides[] is an array of x,y,z side lengths.
+ */
+void dsDrawBox (const float pos[3], const float R[12], const float sides[3]);
+
+/**
+ * @brief Draw a sphere.
+ * @ingroup drawstuff
+ * @param pos Position of center.
+ * @param R orientation.
+ * @param radius
+ */
+void dsDrawSphere (const float pos[3], const float R[12], float radius);
+
+/**
+ * @brief Draw a triangle.
+ * @ingroup drawstuff
+ * @param pos Position of center
+ * @param R orientation
+ * @param v0 first vertex
+ * @param v1 second
+ * @param v2 third vertex
+ * @param solid set to 0 for wireframe
+ */
+void dsDrawTriangle (const float pos[3], const float R[12],
+ const float *v0, const float *v1, const float *v2, int solid);
+
+/**
+ * @brief Draw a z-aligned cylinder
+ * @ingroup drawstuff
+ */
+void dsDrawCylinder (const float pos[3], const float R[12],
+ float length, float radius);
+
+/**
+ * @brief Draw a z-aligned capsule
+ * @ingroup drawstuff
+ */
+void dsDrawCapsule (const float pos[3], const float R[12],
+ float length, float radius);
+
+/**
+ * @brief Draw a line.
+ * @ingroup drawstuff
+ */
+void dsDrawLine (const float pos1[3], const float pos2[3]);
+
+/**
+ * @brief Draw a convex shape.
+ * @ingroup drawstuff
+ */
+void dsDrawConvex(const float pos[3], const float R[12],
+ float *_planes,
+ unsigned int _planecount,
+ float *_points,
+ unsigned int _pointcount,
+ unsigned int *_polygons);
+
+ /* these drawing functions are identical to the ones above, except they take
+ * double arrays for `pos' and `R'.
+ */
+void dsDrawBoxD (const double pos[3], const double R[12],
+ const double sides[3]);
+void dsDrawSphereD (const double pos[3], const double R[12],
+ const float radius);
+void dsDrawTriangleD (const double pos[3], const double R[12],
+ const double *v0, const double *v1, const double *v2, int solid);
+void dsDrawCylinderD (const double pos[3], const double R[12],
+ float length, float radius);
+void dsDrawCapsuleD (const double pos[3], const double R[12],
+ float length, float radius);
+void dsDrawLineD (const double pos1[3], const double pos2[3]);
+void dsDrawConvexD(const double pos[3], const double R[12],
+ double *_planes,
+ unsigned int _planecount,
+ double *_points,
+ unsigned int _pointcount,
+ unsigned int *_polygons);
+
+/**
+ * @brief Set the quality with which curved objects are rendered.
+ * @ingroup drawstuff
+ * Higher numbers are higher quality, but slower to draw.
+ * This must be set before the first objects are drawn to be effective.
+ * Default sphere quality is 1, default capsule quality is 3.
+ */
+void dsSetSphereQuality (int n); /* default = 1 */
+void dsSetCapsuleQuality (int n); /* default = 3 */
+
+// Backwards compatible API
+#define dsDrawCappedCylinder dsDrawCapsule
+#define dsDrawCappedCylinderD dsDrawCapsuleD
+#define dsSetCappedCylinderQuality dsSetCapsuleQuality
+
+/* closing bracket for extern "C" */
+#ifdef __cplusplus
+}
+#endif
+
+#endif
+
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef __VERSION_H
+#define __VERSION_H
+
+/* high byte is major version, low byte is minor version */
+#define DS_VERSION 0x0002
+
+#endif
--- /dev/null
+libglitch_includedir = $(includedir)/ode
+libglitch_include_HEADERS = collision_trimesh.h \
+ mass.h \
+ odecpp.h \
+ common.h \
+ matrix.h \
+ odecpp_collision.h \
+ compatibility.h \
+ memory.h \
+ odecpp_old.h \
+ contact.h \
+ misc.h \
+ odemath.h \
+ collision.h \
+ error.h \
+ objects.h \
+ rotation.h \
+ collision_space.h \
+ export-dif.h \
+ ode.h \
+ timer.h \
+ config.h
+
+EXTRA_DIST = config.h.in
--- /dev/null
+# Makefile.in generated by automake 1.9.6 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
+# 2003, 2004, 2005 Free Software Foundation, Inc.
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+@SET_MAKE@
+
+srcdir = @srcdir@
+top_srcdir = @top_srcdir@
+VPATH = @srcdir@
+pkgdatadir = $(datadir)/@PACKAGE@
+pkglibdir = $(libdir)/@PACKAGE@
+pkgincludedir = $(includedir)/@PACKAGE@
+top_builddir = ../..
+am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
+INSTALL = @INSTALL@
+install_sh_DATA = $(install_sh) -c -m 644
+install_sh_PROGRAM = $(install_sh) -c
+install_sh_SCRIPT = $(install_sh) -c
+INSTALL_HEADER = $(INSTALL_DATA)
+transform = $(program_transform_name)
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+build_triplet = @build@
+host_triplet = @host@
+target_triplet = @target@
+LIBOBJDIR =
+subdir = include/ode
+DIST_COMMON = README $(libglitch_include_HEADERS) \
+ $(srcdir)/Makefile.am $(srcdir)/Makefile.in \
+ $(srcdir)/config.h.in
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/configure.in
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+ $(ACLOCAL_M4)
+mkinstalldirs = $(install_sh) -d
+CONFIG_HEADER = config.h
+CONFIG_CLEAN_FILES =
+SOURCES =
+DIST_SOURCES =
+am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
+am__vpath_adj = case $$p in \
+ $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
+ *) f=$$p;; \
+ esac;
+am__strip_dir = `echo $$p | sed -e 's|^.*/||'`;
+am__installdirs = "$(DESTDIR)$(libglitch_includedir)"
+libglitch_includeHEADERS_INSTALL = $(INSTALL_HEADER)
+HEADERS = $(libglitch_include_HEADERS)
+ETAGS = etags
+CTAGS = ctags
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+ACLOCAL = @ACLOCAL@
+ALLOCA = @ALLOCA@
+AMDEP_FALSE = @AMDEP_FALSE@
+AMDEP_TRUE = @AMDEP_TRUE@
+AMTAR = @AMTAR@
+ARCHFLAGS = @ARCHFLAGS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CC = @CC@
+CCDEPMODE = @CCDEPMODE@
+CFLAGS = @CFLAGS@
+CPP = @CPP@
+CPPFLAGS = @CPPFLAGS@
+CXX = @CXX@
+CXXDEPMODE = @CXXDEPMODE@
+CXXFLAGS = @CXXFLAGS@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+DEPDIR = @DEPDIR@
+DRAWSTUFF = @DRAWSTUFF@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+EGREP = @EGREP@
+EXEEXT = @EXEEXT@
+GL_LIBS = @GL_LIBS@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LDFLAGS = @LDFLAGS@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LTLIBOBJS = @LTLIBOBJS@
+MAKEINFO = @MAKEINFO@
+OBJEXT = @OBJEXT@
+ODE_AGE = @ODE_AGE@
+ODE_CURRENT = @ODE_CURRENT@
+ODE_RELEASE = @ODE_RELEASE@
+ODE_REVISION = @ODE_REVISION@
+ODE_SONAME = @ODE_SONAME@
+OPCODE_FALSE = @OPCODE_FALSE@
+OPCODE_TRUE = @OPCODE_TRUE@
+OSX_FALSE = @OSX_FALSE@
+OSX_TRUE = @OSX_TRUE@
+PACKAGE = @PACKAGE@
+PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
+PACKAGE_NAME = @PACKAGE_NAME@
+PACKAGE_STRING = @PACKAGE_STRING@
+PACKAGE_TARNAME = @PACKAGE_TARNAME@
+PACKAGE_VERSION = @PACKAGE_VERSION@
+PATH_SEPARATOR = @PATH_SEPARATOR@
+RANLIB = @RANLIB@
+SET_MAKE = @SET_MAKE@
+SHARED_LDFLAGS = @SHARED_LDFLAGS@
+SHELL = @SHELL@
+STRIP = @STRIP@
+TOPDIR = @TOPDIR@
+USE_SONAME_FALSE = @USE_SONAME_FALSE@
+USE_SONAME_TRUE = @USE_SONAME_TRUE@
+VERSION = @VERSION@
+WIN32_FALSE = @WIN32_FALSE@
+WIN32_TRUE = @WIN32_TRUE@
+WINDRES = @WINDRES@
+X11_FALSE = @X11_FALSE@
+X11_TRUE = @X11_TRUE@
+X86_64_SYSTEM_FALSE = @X86_64_SYSTEM_FALSE@
+X86_64_SYSTEM_TRUE = @X86_64_SYSTEM_TRUE@
+X_CFLAGS = @X_CFLAGS@
+X_EXTRA_LIBS = @X_EXTRA_LIBS@
+X_LIBS = @X_LIBS@
+X_PRE_LIBS = @X_PRE_LIBS@
+ac_ct_CC = @ac_ct_CC@
+ac_ct_CXX = @ac_ct_CXX@
+ac_ct_RANLIB = @ac_ct_RANLIB@
+ac_ct_STRIP = @ac_ct_STRIP@
+ac_ct_WINDRES = @ac_ct_WINDRES@
+am__fastdepCC_FALSE = @am__fastdepCC_FALSE@
+am__fastdepCC_TRUE = @am__fastdepCC_TRUE@
+am__fastdepCXX_FALSE = @am__fastdepCXX_FALSE@
+am__fastdepCXX_TRUE = @am__fastdepCXX_TRUE@
+am__include = @am__include@
+am__leading_dot = @am__leading_dot@
+am__quote = @am__quote@
+am__tar = @am__tar@
+am__untar = @am__untar@
+bindir = @bindir@
+build = @build@
+build_alias = @build_alias@
+build_cpu = @build_cpu@
+build_os = @build_os@
+build_vendor = @build_vendor@
+datadir = @datadir@
+exec_prefix = @exec_prefix@
+host = @host@
+host_alias = @host_alias@
+host_cpu = @host_cpu@
+host_os = @host_os@
+host_vendor = @host_vendor@
+includedir = @includedir@
+infodir = @infodir@
+install_sh = @install_sh@
+libdir = @libdir@
+libexecdir = @libexecdir@
+localstatedir = @localstatedir@
+mandir = @mandir@
+mkdir_p = @mkdir_p@
+oldincludedir = @oldincludedir@
+prefix = @prefix@
+program_transform_name = @program_transform_name@
+sbindir = @sbindir@
+sharedstatedir = @sharedstatedir@
+so_ext = @so_ext@
+sysconfdir = @sysconfdir@
+target = @target@
+target_alias = @target_alias@
+target_cpu = @target_cpu@
+target_os = @target_os@
+target_vendor = @target_vendor@
+libglitch_includedir = $(includedir)/ode
+libglitch_include_HEADERS = collision_trimesh.h \
+ mass.h \
+ odecpp.h \
+ common.h \
+ matrix.h \
+ odecpp_collision.h \
+ compatibility.h \
+ memory.h \
+ odecpp_old.h \
+ contact.h \
+ misc.h \
+ odemath.h \
+ collision.h \
+ error.h \
+ objects.h \
+ rotation.h \
+ collision_space.h \
+ export-dif.h \
+ ode.h \
+ timer.h \
+ config.h
+
+EXTRA_DIST = config.h.in
+all: config.h
+ $(MAKE) $(AM_MAKEFLAGS) all-am
+
+.SUFFIXES:
+$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(am__configure_deps)
+ @for dep in $?; do \
+ case '$(am__configure_deps)' in \
+ *$$dep*) \
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh \
+ && exit 0; \
+ exit 1;; \
+ esac; \
+ done; \
+ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign include/ode/Makefile'; \
+ cd $(top_srcdir) && \
+ $(AUTOMAKE) --foreign include/ode/Makefile
+.PRECIOUS: Makefile
+Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
+ @case '$?' in \
+ *config.status*) \
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
+ *) \
+ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
+ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
+ esac;
+
+$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+
+$(top_srcdir)/configure: $(am__configure_deps)
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+$(ACLOCAL_M4): $(am__aclocal_m4_deps)
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+
+config.h: stamp-h1
+ @if test ! -f $@; then \
+ rm -f stamp-h1; \
+ $(MAKE) stamp-h1; \
+ else :; fi
+
+stamp-h1: $(srcdir)/config.h.in $(top_builddir)/config.status
+ @rm -f stamp-h1
+ cd $(top_builddir) && $(SHELL) ./config.status include/ode/config.h
+$(srcdir)/config.h.in: $(am__configure_deps)
+ cd $(top_srcdir) && $(AUTOHEADER)
+ rm -f stamp-h1
+ touch $@
+
+distclean-hdr:
+ -rm -f config.h stamp-h1
+uninstall-info-am:
+install-libglitch_includeHEADERS: $(libglitch_include_HEADERS)
+ @$(NORMAL_INSTALL)
+ test -z "$(libglitch_includedir)" || $(mkdir_p) "$(DESTDIR)$(libglitch_includedir)"
+ @list='$(libglitch_include_HEADERS)'; for p in $$list; do \
+ if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+ f=$(am__strip_dir) \
+ echo " $(libglitch_includeHEADERS_INSTALL) '$$d$$p' '$(DESTDIR)$(libglitch_includedir)/$$f'"; \
+ $(libglitch_includeHEADERS_INSTALL) "$$d$$p" "$(DESTDIR)$(libglitch_includedir)/$$f"; \
+ done
+
+uninstall-libglitch_includeHEADERS:
+ @$(NORMAL_UNINSTALL)
+ @list='$(libglitch_include_HEADERS)'; for p in $$list; do \
+ f=$(am__strip_dir) \
+ echo " rm -f '$(DESTDIR)$(libglitch_includedir)/$$f'"; \
+ rm -f "$(DESTDIR)$(libglitch_includedir)/$$f"; \
+ done
+
+ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
+ list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
+ unique=`for i in $$list; do \
+ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+ done | \
+ $(AWK) ' { files[$$0] = 1; } \
+ END { for (i in files) print i; }'`; \
+ mkid -fID $$unique
+tags: TAGS
+
+TAGS: $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \
+ $(TAGS_FILES) $(LISP)
+ tags=; \
+ here=`pwd`; \
+ list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \
+ unique=`for i in $$list; do \
+ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+ done | \
+ $(AWK) ' { files[$$0] = 1; } \
+ END { for (i in files) print i; }'`; \
+ if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \
+ test -n "$$unique" || unique=$$empty_fix; \
+ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
+ $$tags $$unique; \
+ fi
+ctags: CTAGS
+CTAGS: $(HEADERS) $(SOURCES) config.h.in $(TAGS_DEPENDENCIES) \
+ $(TAGS_FILES) $(LISP)
+ tags=; \
+ here=`pwd`; \
+ list='$(SOURCES) $(HEADERS) config.h.in $(LISP) $(TAGS_FILES)'; \
+ unique=`for i in $$list; do \
+ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+ done | \
+ $(AWK) ' { files[$$0] = 1; } \
+ END { for (i in files) print i; }'`; \
+ test -z "$(CTAGS_ARGS)$$tags$$unique" \
+ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
+ $$tags $$unique
+
+GTAGS:
+ here=`$(am__cd) $(top_builddir) && pwd` \
+ && cd $(top_srcdir) \
+ && gtags -i $(GTAGS_ARGS) $$here
+
+distclean-tags:
+ -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
+
+distdir: $(DISTFILES)
+ @srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \
+ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \
+ list='$(DISTFILES)'; for file in $$list; do \
+ case $$file in \
+ $(srcdir)/*) file=`echo "$$file" | sed "s|^$$srcdirstrip/||"`;; \
+ $(top_srcdir)/*) file=`echo "$$file" | sed "s|^$$topsrcdirstrip/|$(top_builddir)/|"`;; \
+ esac; \
+ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
+ dir=`echo "$$file" | sed -e 's,/[^/]*$$,,'`; \
+ if test "$$dir" != "$$file" && test "$$dir" != "."; then \
+ dir="/$$dir"; \
+ $(mkdir_p) "$(distdir)$$dir"; \
+ else \
+ dir=''; \
+ fi; \
+ if test -d $$d/$$file; then \
+ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
+ cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \
+ fi; \
+ cp -pR $$d/$$file $(distdir)$$dir || exit 1; \
+ else \
+ test -f $(distdir)/$$file \
+ || cp -p $$d/$$file $(distdir)/$$file \
+ || exit 1; \
+ fi; \
+ done
+check-am: all-am
+check: check-am
+all-am: Makefile $(HEADERS) config.h
+installdirs:
+ for dir in "$(DESTDIR)$(libglitch_includedir)"; do \
+ test -z "$$dir" || $(mkdir_p) "$$dir"; \
+ done
+install: install-am
+install-exec: install-exec-am
+install-data: install-data-am
+uninstall: uninstall-am
+
+install-am: all-am
+ @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-am
+install-strip:
+ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+ `test -z '$(STRIP)' || \
+ echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install
+mostlyclean-generic:
+
+clean-generic:
+
+distclean-generic:
+ -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
+
+maintainer-clean-generic:
+ @echo "This command is intended for maintainers to use"
+ @echo "it deletes files that may require special tools to rebuild."
+clean: clean-am
+
+clean-am: clean-generic mostlyclean-am
+
+distclean: distclean-am
+ -rm -f Makefile
+distclean-am: clean-am distclean-generic distclean-hdr distclean-tags
+
+dvi: dvi-am
+
+dvi-am:
+
+html: html-am
+
+info: info-am
+
+info-am:
+
+install-data-am: install-libglitch_includeHEADERS
+
+install-exec-am:
+
+install-info: install-info-am
+
+install-man:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-am
+ -rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am: uninstall-info-am uninstall-libglitch_includeHEADERS
+
+.PHONY: CTAGS GTAGS all all-am check check-am clean clean-generic \
+ ctags distclean distclean-generic distclean-hdr distclean-tags \
+ distdir dvi dvi-am html html-am info info-am install \
+ install-am install-data install-data-am install-exec \
+ install-exec-am install-info install-info-am \
+ install-libglitch_includeHEADERS install-man install-strip \
+ installcheck installcheck-am installdirs maintainer-clean \
+ maintainer-clean-generic mostlyclean mostlyclean-generic pdf \
+ pdf-am ps ps-am tags uninstall uninstall-am uninstall-info-am \
+ uninstall-libglitch_includeHEADERS
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
--- /dev/null
+
+this is the public C interface to the ODE library.
+
+all these files should be includable from C, i.e. they should not use any
+C++ features. everything should be protected with
+
+ #ifdef __cplusplus
+ extern "C" {
+ #endif
+
+ ...
+
+ #ifdef __cplusplus
+ }
+ #endif
+
+the only exceptions are the odecpp.h and odecpp_collisioh.h files, which define a C++ wrapper for
+the C interface. remember to keep this in sync!
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001-2003 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_COLLISION_H_
+#define _ODE_COLLISION_H_
+
+#include <ode/common.h>
+#include <ode/collision_space.h>
+#include <ode/contact.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * @defgroup collide Collision Detection
+ *
+ * ODE has two main components: a dynamics simulation engine and a collision
+ * detection engine. The collision engine is given information about the
+ * shape of each body. At each time step it figures out which bodies touch
+ * each other and passes the resulting contact point information to the user.
+ * The user in turn creates contact joints between bodies.
+ *
+ * Using ODE's collision detection is optional - an alternative collision
+ * detection system can be used as long as it can supply the right kinds of
+ * contact information.
+ */
+
+
+/* ************************************************************************ */
+/* general functions */
+
+/**
+ * @brief Destroy a geom, removing it from any space.
+ *
+ * Destroy a geom, removing it from any space it is in first. This one
+ * function destroys a geom of any type, but to create a geom you must call
+ * a creation function for that type.
+ *
+ * When a space is destroyed, if its cleanup mode is 1 (the default) then all
+ * the geoms in that space are automatically destroyed as well.
+ *
+ * @param geom the geom to be destroyed.
+ * @ingroup collide
+ */
+ODE_API void dGeomDestroy (dGeomID geom);
+
+
+/**
+ * @brief Set the user-defined data pointer stored in the geom.
+ *
+ * @param geom the geom to hold the data
+ * @param data the data pointer to be stored
+ * @ingroup collide
+ */
+ODE_API void dGeomSetData (dGeomID geom, void* data);
+
+
+/**
+ * @brief Get the user-defined data pointer stored in the geom.
+ *
+ * @param geom the geom containing the data
+ * @ingroup collide
+ */
+ODE_API void *dGeomGetData (dGeomID geom);
+
+
+/**
+ * @brief Set the body associated with a placeable geom.
+ *
+ * Setting a body on a geom automatically combines the position vector and
+ * rotation matrix of the body and geom, so that setting the position or
+ * orientation of one will set the value for both objects. Setting a body
+ * ID of zero gives the geom its own position and rotation, independent
+ * from any body. If the geom was previously connected to a body then its
+ * new independent position/rotation is set to the current position/rotation
+ * of the body.
+ *
+ * Calling these functions on a non-placeable geom results in a runtime
+ * error in the debug build of ODE.
+ *
+ * @param geom the geom to connect
+ * @param body the body to attach to the geom
+ * @ingroup collide
+ */
+ODE_API void dGeomSetBody (dGeomID geom, dBodyID body);
+
+
+/**
+ * @brief Get the body associated with a placeable geom.
+ * @param geom the geom to query.
+ * @sa dGeomSetBody
+ * @ingroup collide
+ */
+ODE_API dBodyID dGeomGetBody (dGeomID geom);
+
+
+/**
+ * @brief Set the position vector of a placeable geom.
+ *
+ * If the geom is attached to a body, the body's position will also be changed.
+ * Calling this function on a non-placeable geom results in a runtime error in
+ * the debug build of ODE.
+ *
+ * @param geom the geom to set.
+ * @param x the new X coordinate.
+ * @param y the new Y coordinate.
+ * @param z the new Z coordinate.
+ * @sa dBodySetPosition
+ * @ingroup collide
+ */
+ODE_API void dGeomSetPosition (dGeomID geom, dReal x, dReal y, dReal z);
+
+
+/**
+ * @brief Set the rotation matrix of a placeable geom.
+ *
+ * If the geom is attached to a body, the body's rotation will also be changed.
+ * Calling this function on a non-placeable geom results in a runtime error in
+ * the debug build of ODE.
+ *
+ * @param geom the geom to set.
+ * @param R the new rotation matrix.
+ * @sa dBodySetRotation
+ * @ingroup collide
+ */
+ODE_API void dGeomSetRotation (dGeomID geom, const dMatrix3 R);
+
+
+/**
+ * @brief Set the rotation of a placeable geom.
+ *
+ * If the geom is attached to a body, the body's rotation will also be changed.
+ *
+ * Calling this function on a non-placeable geom results in a runtime error in
+ * the debug build of ODE.
+ *
+ * @param geom the geom to set.
+ * @param Q the new rotation.
+ * @sa dBodySetQuaternion
+ * @ingroup collide
+ */
+ODE_API void dGeomSetQuaternion (dGeomID geom, const dQuaternion Q);
+
+
+/**
+ * @brief Get the position vector of a placeable geom.
+ *
+ * If the geom is attached to a body, the body's position will be returned.
+ *
+ * Calling this function on a non-placeable geom results in a runtime error in
+ * the debug build of ODE.
+ *
+ * @param geom the geom to query.
+ * @returns A pointer to the geom's position vector.
+ * @remarks The returned value is a pointer to the geom's internal
+ * data structure. It is valid until any changes are made
+ * to the geom.
+ * @sa dBodyGetPosition
+ * @ingroup collide
+ */
+ODE_API const dReal * dGeomGetPosition (dGeomID geom);
+
+
+/**
+ * @brief Get the rotation matrix of a placeable geom.
+ *
+ * If the geom is attached to a body, the body's rotation will be returned.
+ *
+ * Calling this function on a non-placeable geom results in a runtime error in
+ * the debug build of ODE.
+ *
+ * @param geom the geom to query.
+ * @returns A pointer to the geom's rotation matrix.
+ * @remarks The returned value is a pointer to the geom's internal
+ * data structure. It is valid until any changes are made
+ * to the geom.
+ * @sa dBodyGetRotation
+ * @ingroup collide
+ */
+ODE_API const dReal * dGeomGetRotation (dGeomID geom);
+
+
+/**
+ * @brief Get the rotation quaternion of a placeable geom.
+ *
+ * If the geom is attached to a body, the body's quaternion will be returned.
+ *
+ * Calling this function on a non-placeable geom results in a runtime error in
+ * the debug build of ODE.
+ *
+ * @param geom the geom to query.
+ * @param result a copy of the rotation quaternion.
+ * @sa dBodyGetQuaternion
+ * @ingroup collide
+ */
+ODE_API void dGeomGetQuaternion (dGeomID geom, dQuaternion result);
+
+
+/**
+ * @brief Return the axis-aligned bounding box.
+ *
+ * Return in aabb an axis aligned bounding box that surrounds the given geom.
+ * The aabb array has elements (minx, maxx, miny, maxy, minz, maxz). If the
+ * geom is a space, a bounding box that surrounds all contained geoms is
+ * returned.
+ *
+ * This function may return a pre-computed cached bounding box, if it can
+ * determine that the geom has not moved since the last time the bounding
+ * box was computed.
+ *
+ * @param geom the geom to query
+ * @param aabb the returned bounding box
+ * @ingroup collide
+ */
+ODE_API void dGeomGetAABB (dGeomID geom, dReal aabb[6]);
+
+
+/**
+ * @brief Determing if a geom is a space.
+ * @param geom the geom to query
+ * @returns Non-zero if the geom is a space, zero otherwise.
+ * @ingroup collide
+ */
+ODE_API int dGeomIsSpace (dGeomID geom);
+
+
+/**
+ * @brief Query for the space containing a particular geom.
+ * @param geom the geom to query
+ * @returns The space that contains the geom, or NULL if the geom is
+ * not contained by a space.
+ * @ingroup collide
+ */
+ODE_API dSpaceID dGeomGetSpace (dGeomID);
+
+
+/**
+ * @brief Given a geom, this returns its class.
+ *
+ * The ODE classes are:
+ * @li dSphereClass
+ * @li dBoxClass
+ * @li dCylinderClass
+ * @li dPlaneClass
+ * @li dRayClass
+ * @li dConvexClass
+ * @li dGeomTransformClass
+ * @li dTriMeshClass
+ * @li dSimpleSpaceClass
+ * @li dHashSpaceClass
+ * @li dQuadTreeSpaceClass
+ * @li dFirstUserClass
+ * @li dLastUserClass
+ *
+ * User-defined class will return their own number.
+ *
+ * @param geom the geom to query
+ * @returns The geom class ID.
+ * @ingroup collide
+ */
+ODE_API int dGeomGetClass (dGeomID geom);
+
+
+/**
+ * @brief Set the "category" bitfield for the given geom.
+ *
+ * The category bitfield is used by spaces to govern which geoms will
+ * interact with each other. The bitfield is guaranteed to be at least
+ * 32 bits wide. The default category values for newly created geoms
+ * have all bits set.
+ *
+ * @param geom the geom to set
+ * @param bits the new bitfield value
+ * @ingroup collide
+ */
+ODE_API void dGeomSetCategoryBits (dGeomID geom, unsigned long bits);
+
+
+/**
+ * @brief Set the "collide" bitfield for the given geom.
+ *
+ * The collide bitfield is used by spaces to govern which geoms will
+ * interact with each other. The bitfield is guaranteed to be at least
+ * 32 bits wide. The default category values for newly created geoms
+ * have all bits set.
+ *
+ * @param geom the geom to set
+ * @param bits the new bitfield value
+ * @ingroup collide
+ */
+ODE_API void dGeomSetCollideBits (dGeomID geom, unsigned long bits);
+
+
+/**
+ * @brief Get the "category" bitfield for the given geom.
+ *
+ * @param geom the geom to set
+ * @param bits the new bitfield value
+ * @sa dGeomSetCategoryBits
+ * @ingroup collide
+ */
+ODE_API unsigned long dGeomGetCategoryBits (dGeomID);
+
+
+/**
+ * @brief Get the "collide" bitfield for the given geom.
+ *
+ * @param geom the geom to set
+ * @param bits the new bitfield value
+ * @sa dGeomSetCollideBits
+ * @ingroup collide
+ */
+ODE_API unsigned long dGeomGetCollideBits (dGeomID);
+
+
+/**
+ * @brief Enable a geom.
+ *
+ * Disabled geoms are completely ignored by dSpaceCollide and dSpaceCollide2,
+ * although they can still be members of a space. New geoms are created in
+ * the enabled state.
+ *
+ * @param geom the geom to enable
+ * @sa dGeomDisable
+ * @sa dGeomIsEnabled
+ * @ingroup collide
+ */
+ODE_API void dGeomEnable (dGeomID geom);
+
+
+/**
+ * @brief Disable a geom.
+ *
+ * Disabled geoms are completely ignored by dSpaceCollide and dSpaceCollide2,
+ * although they can still be members of a space. New geoms are created in
+ * the enabled state.
+ *
+ * @param geom the geom to disable
+ * @sa dGeomDisable
+ * @sa dGeomIsEnabled
+ * @ingroup collide
+ */
+ODE_API void dGeomDisable (dGeomID geom);
+
+
+/**
+ * @brief Check to see if a geom is enabled.
+ *
+ * Disabled geoms are completely ignored by dSpaceCollide and dSpaceCollide2,
+ * although they can still be members of a space. New geoms are created in
+ * the enabled state.
+ *
+ * @param geom the geom to query
+ * @returns Non-zero if the geom is enabled, zero otherwise.
+ * @sa dGeomDisable
+ * @sa dGeomIsEnabled
+ * @ingroup collide
+ */
+ODE_API int dGeomIsEnabled (dGeomID geom);
+
+/* ************************************************************************ */
+/* geom offset from body */
+
+/**
+ * @brief Set the local offset position of a geom from its body.
+ *
+ * Sets the geom's positional offset in local coordinates.
+ * After this call, the geom will be at a new position determined from the
+ * body's position and the offset.
+ * The geom must be attached to a body.
+ * If the geom did not have an offset, it is automatically created.
+ *
+ * @param geom the geom to set.
+ * @param x the new X coordinate.
+ * @param y the new Y coordinate.
+ * @param z the new Z coordinate.
+ * @ingroup collide
+ */
+ODE_API void dGeomSetOffsetPosition (dGeomID geom, dReal x, dReal y, dReal z);
+
+
+/**
+ * @brief Set the local offset rotation matrix of a geom from its body.
+ *
+ * Sets the geom's rotational offset in local coordinates.
+ * After this call, the geom will be at a new position determined from the
+ * body's position and the offset.
+ * The geom must be attached to a body.
+ * If the geom did not have an offset, it is automatically created.
+ *
+ * @param geom the geom to set.
+ * @param R the new rotation matrix.
+ * @ingroup collide
+ */
+ODE_API void dGeomSetOffsetRotation (dGeomID geom, const dMatrix3 R);
+
+
+/**
+ * @brief Set the local offset rotation of a geom from its body.
+ *
+ * Sets the geom's rotational offset in local coordinates.
+ * After this call, the geom will be at a new position determined from the
+ * body's position and the offset.
+ * The geom must be attached to a body.
+ * If the geom did not have an offset, it is automatically created.
+ *
+ * @param geom the geom to set.
+ * @param Q the new rotation.
+ * @ingroup collide
+ */
+ODE_API void dGeomSetOffsetQuaternion (dGeomID geom, const dQuaternion Q);
+
+
+/**
+ * @brief Set the offset position of a geom from its body.
+ *
+ * Sets the geom's positional offset to move it to the new world
+ * coordinates.
+ * After this call, the geom will be at the world position passed in,
+ * and the offset will be the difference from the current body position.
+ * The geom must be attached to a body.
+ * If the geom did not have an offset, it is automatically created.
+ *
+ * @param geom the geom to set.
+ * @param x the new X coordinate.
+ * @param y the new Y coordinate.
+ * @param z the new Z coordinate.
+ * @ingroup collide
+ */
+ODE_API void dGeomSetOffsetWorldPosition (dGeomID geom, dReal x, dReal y, dReal z);
+
+
+/**
+ * @brief Set the offset rotation of a geom from its body.
+ *
+ * Sets the geom's rotational offset to orient it to the new world
+ * rotation matrix.
+ * After this call, the geom will be at the world orientation passed in,
+ * and the offset will be the difference from the current body orientation.
+ * The geom must be attached to a body.
+ * If the geom did not have an offset, it is automatically created.
+ *
+ * @param geom the geom to set.
+ * @param R the new rotation matrix.
+ * @ingroup collide
+ */
+ODE_API void dGeomSetOffsetWorldRotation (dGeomID geom, const dMatrix3 R);
+
+
+/**
+ * @brief Set the offset rotation of a geom from its body.
+ *
+ * Sets the geom's rotational offset to orient it to the new world
+ * rotation matrix.
+ * After this call, the geom will be at the world orientation passed in,
+ * and the offset will be the difference from the current body orientation.
+ * The geom must be attached to a body.
+ * If the geom did not have an offset, it is automatically created.
+ *
+ * @param geom the geom to set.
+ * @param Q the new rotation.
+ * @ingroup collide
+ */
+ODE_API void dGeomSetOffsetWorldQuaternion (dGeomID geom, const dQuaternion);
+
+
+/**
+ * @brief Clear any offset from the geom.
+ *
+ * If the geom has an offset, it is eliminated and the geom is
+ * repositioned at the body's position. If the geom has no offset,
+ * this function does nothing.
+ * This is more efficient than calling dGeomSetOffsetPosition(zero)
+ * and dGeomSetOffsetRotation(identiy), because this function actually
+ * eliminates the offset, rather than leaving it as the identity transform.
+ *
+ * @param geom the geom to have its offset destroyed.
+ * @ingroup collide
+ */
+ODE_API void dGeomClearOffset(dGeomID geom);
+
+
+/**
+ * @brief Check to see whether the geom has an offset.
+ *
+ * This function will return non-zero if the offset has been created.
+ * Note that there is a difference between a geom with no offset,
+ * and a geom with an offset that is the identity transform.
+ * In the latter case, although the observed behaviour is identical,
+ * there is a unnecessary computation involved because the geom will
+ * be applying the transform whenever it needs to recalculate its world
+ * position.
+ *
+ * @param geom the geom to query.
+ * @returns Non-zero if the geom has an offset, zero otherwise.
+ * @ingroup collide
+ */
+ODE_API int dGeomIsOffset(dGeomID geom);
+
+
+/**
+ * @brief Get the offset position vector of a geom.
+ *
+ * Returns the positional offset of the geom in local coordinates.
+ * If the geom has no offset, this function returns the zero vector.
+ *
+ * @param geom the geom to query.
+ * @returns A pointer to the geom's offset vector.
+ * @remarks The returned value is a pointer to the geom's internal
+ * data structure. It is valid until any changes are made
+ * to the geom.
+ * @ingroup collide
+ */
+ODE_API const dReal * dGeomGetOffsetPosition (dGeomID geom);
+
+
+/**
+ * @brief Get the offset position vector of a geom.
+ *
+ * Returns the positional offset of the geom in local coordinates.
+ * If the geom has no offset, this function returns the zero vector.
+ *
+ * @param geom the geom to query.
+ * @returns A pointer to the geom's offset vector.
+ * @remarks The returned value is a pointer to the geom's internal
+ * data structure. It is valid until any changes are made
+ * to the geom.
+ * @ingroup collide
+ */
+ODE_API const dReal * dGeomGetOffsetRotation (dGeomID geom);
+
+
+/**
+ * @brief Get the offset rotation quaternion of a geom.
+ *
+ * Returns the rotation offset of the geom as a quaternion.
+ * If the geom has no offset, the identity quaternion is returned.
+ *
+ * @param geom the geom to query.
+ * @param result a copy of the rotation quaternion.
+ * @ingroup collide
+ */
+ODE_API void dGeomGetOffsetQuaternion (dGeomID geom, dQuaternion result);
+
+/* ************************************************************************ */
+/* collision detection */
+
+/**
+ *
+ * @brief Given two geoms o1 and o2 that potentially intersect,
+ * generate contact information for them.
+ *
+ * Internally, this just calls the correct class-specific collision
+ * functions for o1 and o2.
+ *
+ * @param o1 The first geom to test.
+ * @param o2 The second geom to test.
+ *
+ * @param flags The flags specify how contacts should be generated if
+ * the geoms touch. The lower 16 bits of flags is an integer that
+ * specifies the maximum number of contact points to generate. Note
+ * that if this number is zero, this function just pretends that it is
+ * one -- in other words you can not ask for zero contacts. All other bits
+ * in flags must be zero. In the future the other bits may be used to
+ * select from different contact generation strategies.
+ *
+ * @param contact Points to an array of dContactGeom structures. The array
+ * must be able to hold at least the maximum number of contacts. These
+ * dContactGeom structures may be embedded within larger structures in the
+ * array -- the skip parameter is the byte offset from one dContactGeom to
+ * the next in the array. If skip is sizeof(dContactGeom) then contact
+ * points to a normal (C-style) array. It is an error for skip to be smaller
+ * than sizeof(dContactGeom).
+ *
+ * @returns If the geoms intersect, this function returns the number of contact
+ * points generated (and updates the contact array), otherwise it returns 0
+ * (and the contact array is not touched).
+ *
+ * @remarks If a space is passed as o1 or o2 then this function will collide
+ * all objects contained in o1 with all objects contained in o2, and return
+ * the resulting contact points. This method for colliding spaces with geoms
+ * (or spaces with spaces) provides no user control over the individual
+ * collisions. To get that control, use dSpaceCollide or dSpaceCollide2 instead.
+ *
+ * @remarks If o1 and o2 are the same geom then this function will do nothing
+ * and return 0. Technically speaking an object intersects with itself, but it
+ * is not useful to find contact points in this case.
+ *
+ * @remarks This function does not care if o1 and o2 are in the same space or not
+ * (or indeed if they are in any space at all).
+ *
+ * @ingroup collide
+ */
+ODE_API int dCollide (dGeomID o1, dGeomID o2, int flags, dContactGeom *contact,
+ int skip);
+
+/**
+ * @brief Determines which pairs of geoms in a space may potentially intersect,
+ * and calls the callback function for each candidate pair.
+ *
+ * @param space The space to test.
+ *
+ * @param data Passed from dSpaceCollide directly to the callback
+ * function. Its meaning is user defined. The o1 and o2 arguments are the
+ * geoms that may be near each other.
+ *
+ * @param callback A callback function is of type @ref dNearCallback.
+ *
+ * @remarks Other spaces that are contained within the colliding space are
+ * not treated specially, i.e. they are not recursed into. The callback
+ * function may be passed these contained spaces as one or both geom
+ * arguments.
+ *
+ * @remarks dSpaceCollide() is guaranteed to pass all intersecting geom
+ * pairs to the callback function, but may also pass close but
+ * non-intersecting pairs. The number of these calls depends on the
+ * internal algorithms used by the space. Thus you should not expect
+ * that dCollide will return contacts for every pair passed to the
+ * callback.
+ *
+ * @sa dSpaceCollide2
+ * @ingroup collide
+ */
+ODE_API void dSpaceCollide (dSpaceID space, void *data, dNearCallback *callback);
+
+
+/**
+ * @brief Determines which geoms from one space may potentially intersect with
+ * geoms from another space, and calls the callback function for each candidate
+ * pair.
+ *
+ * @param space1 The first space to test.
+ *
+ * @param space2 The second space to test.
+ *
+ * @param data Passed from dSpaceCollide directly to the callback
+ * function. Its meaning is user defined. The o1 and o2 arguments are the
+ * geoms that may be near each other.
+ *
+ * @param callback A callback function is of type @ref dNearCallback.
+ *
+ * @remarks This function can also test a single non-space geom against a
+ * space. This function is useful when there is a collision hierarchy, i.e.
+ * when there are spaces that contain other spaces.
+ *
+ * @remarks Other spaces that are contained within the colliding space are
+ * not treated specially, i.e. they are not recursed into. The callback
+ * function may be passed these contained spaces as one or both geom
+ * arguments.
+ *
+ * @remarks dSpaceCollide2() is guaranteed to pass all intersecting geom
+ * pairs to the callback function, but may also pass close but
+ * non-intersecting pairs. The number of these calls depends on the
+ * internal algorithms used by the space. Thus you should not expect
+ * that dCollide will return contacts for every pair passed to the
+ * callback.
+ *
+ * @sa dSpaceCollide
+ * @ingroup collide
+ */
+ODE_API void dSpaceCollide2 (dGeomID space1, dGeomID space2, void *data, dNearCallback *callback);
+
+
+/* ************************************************************************ */
+/* standard classes */
+
+/* the maximum number of user classes that are supported */
+enum {
+ dMaxUserClasses = 4
+};
+
+/* class numbers - each geometry object needs a unique number */
+enum {
+ dSphereClass = 0,
+ dBoxClass,
+ dCapsuleClass,
+ dCylinderClass,
+ dPlaneClass,
+ dRayClass,
+ dConvexClass,
+ dGeomTransformClass,
+ dTriMeshClass,
+ dHeightfieldClass,
+
+ dFirstSpaceClass,
+ dSimpleSpaceClass = dFirstSpaceClass,
+ dHashSpaceClass,
+ dQuadTreeSpaceClass,
+ dLastSpaceClass = dQuadTreeSpaceClass,
+
+ dFirstUserClass,
+ dLastUserClass = dFirstUserClass + dMaxUserClasses - 1,
+ dGeomNumClasses
+};
+
+
+/**
+ * @defgroup collide_sphere Sphere Class
+ * @ingroup collide
+ */
+
+/**
+ * @brief Create a sphere geom of the given radius, and return its ID.
+ *
+ * @param space a space to contain the new geom. May be null.
+ * @param radius the radius of the sphere.
+ *
+ * @returns A new sphere geom.
+ *
+ * @remarks The point of reference for a sphere is its center.
+ *
+ * @sa dGeomDestroy
+ * @sa dGeomSphereSetRadius
+ * @ingroup collide_sphere
+ */
+ODE_API dGeomID dCreateSphere (dSpaceID space, dReal radius);
+
+
+/**
+ * @brief Set the radius of a sphere geom.
+ *
+ * @param sphere the sphere to set.
+ * @param radius the new radius.
+ *
+ * @sa dGeomSphereGetRadius
+ * @ingroup collide_sphere
+ */
+ODE_API void dGeomSphereSetRadius (dGeomID sphere, dReal radius);
+
+
+/**
+ * @brief Retrieves the radius of a sphere geom.
+ *
+ * @param sphere the sphere to query.
+ *
+ * @sa dGeomSphereSetRadius
+ * @ingroup collide_sphere
+ */
+ODE_API dReal dGeomSphereGetRadius (dGeomID sphere);
+
+
+/**
+ * @brief Calculate the depth of the a given point within a sphere.
+ *
+ * @param sphere the sphere to query.
+ * @param x the X coordinate of the point.
+ * @param y the Y coordinate of the point.
+ * @param z the Z coordinate of the point.
+ *
+ * @returns The depth of the point. Points inside the sphere will have a
+ * positive depth, points outside it will have a negative depth, and points
+ * on the surface will have a depth of zero.
+ *
+ * @ingroup collide_sphere
+ */
+ODE_API dReal dGeomSpherePointDepth (dGeomID sphere, dReal x, dReal y, dReal z);
+
+
+//--> Convex Functions
+ODE_API dGeomID dCreateConvex (dSpaceID space,
+ dReal *_planes,
+ unsigned int _planecount,
+ dReal *_points,
+ unsigned int _pointcount,unsigned int *_polygons);
+
+ODE_API void dGeomSetConvex (dGeomID g,
+ dReal *_planes,
+ unsigned int _count,
+ dReal *_points,
+ unsigned int _pointcount,unsigned int *_polygons);
+//<-- Convex Functions
+
+/**
+ * @defgroup collide_box Box Class
+ * @ingroup collide
+ */
+
+/**
+ * @brief Create a box geom with the provided side lengths.
+ *
+ * @param space a space to contain the new geom. May be null.
+ * @param lx the length of the box along the X axis
+ * @param ly the length of the box along the Y axis
+ * @param lz the length of the box along the Z axis
+ *
+ * @returns A new box geom.
+ *
+ * @remarks The point of reference for a box is its center.
+ *
+ * @sa dGeomDestroy
+ * @sa dGeomBoxSetLengths
+ * @ingroup collide_box
+ */
+ODE_API dGeomID dCreateBox (dSpaceID space, dReal lx, dReal ly, dReal lz);
+
+
+/**
+ * @brief Set the side lengths of the given box.
+ *
+ * @param box the box to set
+ * @param lx the length of the box along the X axis
+ * @param ly the length of the box along the Y axis
+ * @param lz the length of the box along the Z axis
+ *
+ * @sa dGeomBoxGetLengths
+ * @ingroup collide_box
+ */
+ODE_API void dGeomBoxSetLengths (dGeomID box, dReal lx, dReal ly, dReal lz);
+
+
+/**
+ * @brief Get the side lengths of a box.
+ *
+ * @param box the box to query
+ * @param result the returned side lengths
+ *
+ * @sa dGeomBoxSetLengths
+ * @ingroup collide_box
+ */
+ODE_API void dGeomBoxGetLengths (dGeomID box, dVector3 result);
+
+
+/**
+ * @brief Return the depth of a point in a box.
+ *
+ * @param box the box to query
+ * @param x the X coordinate of the point to test.
+ * @param y the Y coordinate of the point to test.
+ * @param z the Z coordinate of the point to test.
+ *
+ * @returns The depth of the point. Points inside the box will have a
+ * positive depth, points outside it will have a negative depth, and points
+ * on the surface will have a depth of zero.
+ */
+ODE_API dReal dGeomBoxPointDepth (dGeomID box, dReal x, dReal y, dReal z);
+
+
+ODE_API dGeomID dCreatePlane (dSpaceID space, dReal a, dReal b, dReal c, dReal d);
+ODE_API void dGeomPlaneSetParams (dGeomID plane, dReal a, dReal b, dReal c, dReal d);
+ODE_API void dGeomPlaneGetParams (dGeomID plane, dVector4 result);
+ODE_API dReal dGeomPlanePointDepth (dGeomID plane, dReal x, dReal y, dReal z);
+
+ODE_API dGeomID dCreateCapsule (dSpaceID space, dReal radius, dReal length);
+ODE_API void dGeomCapsuleSetParams (dGeomID ccylinder, dReal radius, dReal length);
+ODE_API void dGeomCapsuleGetParams (dGeomID ccylinder, dReal *radius, dReal *length);
+ODE_API dReal dGeomCapsulePointDepth (dGeomID ccylinder, dReal x, dReal y, dReal z);
+
+// For now we want to have a backwards compatible C-API, note: C++ API is not.
+#define dCreateCCylinder dCreateCapsule
+#define dGeomCCylinderSetParams dGeomCapsuleSetParams
+#define dGeomCCylinderGetParams dGeomCapsuleGetParams
+#define dGeomCCylinderPointDepth dGeomCapsulePointDepth
+#define dCCylinderClass dCapsuleClass
+
+ODE_API dGeomID dCreateCylinder (dSpaceID space, dReal radius, dReal length);
+ODE_API void dGeomCylinderSetParams (dGeomID cylinder, dReal radius, dReal length);
+ODE_API void dGeomCylinderGetParams (dGeomID cylinder, dReal *radius, dReal *length);
+
+ODE_API dGeomID dCreateRay (dSpaceID space, dReal length);
+ODE_API void dGeomRaySetLength (dGeomID ray, dReal length);
+ODE_API dReal dGeomRayGetLength (dGeomID ray);
+ODE_API void dGeomRaySet (dGeomID ray, dReal px, dReal py, dReal pz,
+ dReal dx, dReal dy, dReal dz);
+ODE_API void dGeomRayGet (dGeomID ray, dVector3 start, dVector3 dir);
+
+/*
+ * Set/get ray flags that influence ray collision detection.
+ * These flags are currently only noticed by the trimesh collider, because
+ * they can make a major differences there.
+ */
+ODE_API void dGeomRaySetParams (dGeomID g, int FirstContact, int BackfaceCull);
+ODE_API void dGeomRayGetParams (dGeomID g, int *FirstContact, int *BackfaceCull);
+ODE_API void dGeomRaySetClosestHit (dGeomID g, int closestHit);
+ODE_API int dGeomRayGetClosestHit (dGeomID g);
+
+#include "collision_trimesh.h"
+
+ODE_API dGeomID dCreateGeomTransform (dSpaceID space);
+ODE_API void dGeomTransformSetGeom (dGeomID g, dGeomID obj);
+ODE_API dGeomID dGeomTransformGetGeom (dGeomID g);
+ODE_API void dGeomTransformSetCleanup (dGeomID g, int mode);
+ODE_API int dGeomTransformGetCleanup (dGeomID g);
+ODE_API void dGeomTransformSetInfo (dGeomID g, int mode);
+ODE_API int dGeomTransformGetInfo (dGeomID g);
+
+
+/* ************************************************************************ */
+/* heightfield functions */
+
+
+// Data storage for heightfield data.
+struct dxHeightfieldData;
+typedef struct dxHeightfieldData* dHeightfieldDataID;
+
+
+/**
+ * @brief Callback prototype
+ *
+ * Used by the callback heightfield data type to sample a height for a
+ * given cell position.
+ *
+ * @param p_user_data User data specified when creating the dHeightfieldDataID
+ * @param x The index of a sample in the local x axis. It is a value
+ * in the range zero to ( nWidthSamples - 1 ).
+ * @param x The index of a sample in the local z axis. It is a value
+ * in the range zero to ( nDepthSamples - 1 ).
+ *
+ * @return The sample height which is then scaled and offset using the
+ * values specified when the heightfield data was created.
+ *
+ * @ingroup collide
+ */
+typedef dReal dHeightfieldGetHeight( void* p_user_data, int x, int z );
+
+
+
+/**
+ * @brief Creates a heightfield geom.
+ *
+ * Uses the information in the given dHeightfieldDataID to construct
+ * a geom representing a heightfield in a collision space.
+ *
+ * @param space The space to add the geom to.
+ * @param data The dHeightfieldDataID created by dGeomHeightfieldDataCreate and
+ * setup by dGeomHeightfieldDataBuildCallback, dGeomHeightfieldDataBuildByte,
+ * dGeomHeightfieldDataBuildShort or dGeomHeightfieldDataBuildFloat.
+ * @param bPlaceable If non-zero this geom can be transformed in the world using the
+ * usual functions such as dGeomSetPosition and dGeomSetRotation. If the geom is
+ * not set as placeable, then it uses a fixed orientation where the global y axis
+ * represents the dynamic 'height' of the heightfield.
+ *
+ * @return A geom id to reference this geom in other calls.
+ *
+ * @ingroup collide
+ */
+ODE_API dGeomID dCreateHeightfield( dSpaceID space,
+ dHeightfieldDataID data, int bPlaceable );
+
+
+/**
+ * @brief Creates a new empty dHeightfieldDataID.
+ *
+ * Allocates a new dHeightfieldDataID and returns it. You must call
+ * dGeomHeightfieldDataDestroy to destroy it after the geom has been removed.
+ * The dHeightfieldDataID value is used when specifying a data format type.
+ *
+ * @return A dHeightfieldDataID for use with dGeomHeightfieldDataBuildCallback,
+ * dGeomHeightfieldDataBuildByte, dGeomHeightfieldDataBuildShort or
+ * dGeomHeightfieldDataBuildFloat.
+ * @ingroup collide
+ */
+ODE_API dHeightfieldDataID dGeomHeightfieldDataCreate();
+
+
+/**
+ * @brief Destroys a dHeightfieldDataID.
+ *
+ * Deallocates a given dHeightfieldDataID and all managed resources.
+ *
+ * @param d A dHeightfieldDataID created by dGeomHeightfieldDataCreate
+ * @ingroup collide
+ */
+ODE_API void dGeomHeightfieldDataDestroy( dHeightfieldDataID d );
+
+
+
+/**
+ * @brief Configures a dHeightfieldDataID to use a callback to
+ * retrieve height data.
+ *
+ * Before a dHeightfieldDataID can be used by a geom it must be
+ * configured to specify the format of the height data.
+ * This call specifies that the heightfield data is computed by
+ * the user and it should use the given callback when determining
+ * the height of a given element of it's shape.
+ *
+ * @param d A new dHeightfieldDataID created by dGeomHeightfieldDataCreate
+ *
+ * @param width Specifies the total 'width' of the heightfield along
+ * the geom's local x axis.
+ * @param depth Specifies the total 'depth' of the heightfield along
+ * the geom's local z axis.
+ *
+ * @param widthSamples Specifies the number of vertices to sample
+ * along the width of the heightfield. Each vertex has a corresponding
+ * height value which forms the overall shape.
+ * Naturally this value must be at least two or more.
+ * @param depthSamples Specifies the number of vertices to sample
+ * along the depth of the heightfield.
+ *
+ * @param scale A uniform scale applied to all raw height data.
+ * @param offset An offset applied to the scaled height data.
+ *
+ * @param thickness A value subtracted from the lowest height
+ * value which in effect adds an additional cuboid to the base of the
+ * heightfield. This is used to prevent geoms from looping under the
+ * desired terrain and not registering as a collision. Note that the
+ * thickness is not affected by the scale or offset parameters.
+ *
+ * @param bWrap If non-zero the heightfield will infinitely tile in both
+ * directions along the local x and z axes. If zero the heightfield is
+ * bounded from zero to width in the local x axis, and zero to depth in
+ * the local z axis.
+ *
+ * @ingroup collide
+ */
+ODE_API void dGeomHeightfieldDataBuildCallback( dHeightfieldDataID d,
+ void* pUserData, dHeightfieldGetHeight* pCallback,
+ dReal width, dReal depth, int widthSamples, int depthSamples,
+ dReal scale, dReal offset, dReal thickness, int bWrap );
+
+/**
+ * @brief Configures a dHeightfieldDataID to use height data in byte format.
+ *
+ * Before a dHeightfieldDataID can be used by a geom it must be
+ * configured to specify the format of the height data.
+ * This call specifies that the heightfield data is stored as a rectangular
+ * array of bytes (8 bit unsigned) representing the height at each sample point.
+ *
+ * @param d A new dHeightfieldDataID created by dGeomHeightfieldDataCreate
+ *
+ * @param pHeightData A pointer to the height data.
+ * @param bCopyHeightData When non-zero the height data is copied to an
+ * internal store. When zero the height data is accessed by reference and
+ * so must persist throughout the lifetime of the heightfield.
+ *
+ * @param width Specifies the total 'width' of the heightfield along
+ * the geom's local x axis.
+ * @param depth Specifies the total 'depth' of the heightfield along
+ * the geom's local z axis.
+ *
+ * @param widthSamples Specifies the number of vertices to sample
+ * along the width of the heightfield. Each vertex has a corresponding
+ * height value which forms the overall shape.
+ * Naturally this value must be at least two or more.
+ * @param depthSamples Specifies the number of vertices to sample
+ * along the depth of the heightfield.
+ *
+ * @param scale A uniform scale applied to all raw height data.
+ * @param offset An offset applied to the scaled height data.
+ *
+ * @param thickness A value subtracted from the lowest height
+ * value which in effect adds an additional cuboid to the base of the
+ * heightfield. This is used to prevent geoms from looping under the
+ * desired terrain and not registering as a collision. Note that the
+ * thickness is not affected by the scale or offset parameters.
+ *
+ * @param bWrap If non-zero the heightfield will infinitely tile in both
+ * directions along the local x and z axes. If zero the heightfield is
+ * bounded from zero to width in the local x axis, and zero to depth in
+ * the local z axis.
+ *
+ * @ingroup collide
+ */
+ODE_API void dGeomHeightfieldDataBuildByte( dHeightfieldDataID d,
+ const unsigned char* pHeightData, int bCopyHeightData,
+ dReal width, dReal depth, int widthSamples, int depthSamples,
+ dReal scale, dReal offset, dReal thickness, int bWrap );
+
+/**
+ * @brief Configures a dHeightfieldDataID to use height data in short format.
+ *
+ * Before a dHeightfieldDataID can be used by a geom it must be
+ * configured to specify the format of the height data.
+ * This call specifies that the heightfield data is stored as a rectangular
+ * array of shorts (16 bit signed) representing the height at each sample point.
+ *
+ * @param d A new dHeightfieldDataID created by dGeomHeightfieldDataCreate
+ *
+ * @param pHeightData A pointer to the height data.
+ * @param bCopyHeightData When non-zero the height data is copied to an
+ * internal store. When zero the height data is accessed by reference and
+ * so must persist throughout the lifetime of the heightfield.
+ *
+ * @param width Specifies the total 'width' of the heightfield along
+ * the geom's local x axis.
+ * @param depth Specifies the total 'depth' of the heightfield along
+ * the geom's local z axis.
+ *
+ * @param widthSamples Specifies the number of vertices to sample
+ * along the width of the heightfield. Each vertex has a corresponding
+ * height value which forms the overall shape.
+ * Naturally this value must be at least two or more.
+ * @param depthSamples Specifies the number of vertices to sample
+ * along the depth of the heightfield.
+ *
+ * @param scale A uniform scale applied to all raw height data.
+ * @param offset An offset applied to the scaled height data.
+ *
+ * @param thickness A value subtracted from the lowest height
+ * value which in effect adds an additional cuboid to the base of the
+ * heightfield. This is used to prevent geoms from looping under the
+ * desired terrain and not registering as a collision. Note that the
+ * thickness is not affected by the scale or offset parameters.
+ *
+ * @param bWrap If non-zero the heightfield will infinitely tile in both
+ * directions along the local x and z axes. If zero the heightfield is
+ * bounded from zero to width in the local x axis, and zero to depth in
+ * the local z axis.
+ *
+ * @ingroup collide
+ */
+ODE_API void dGeomHeightfieldDataBuildShort( dHeightfieldDataID d,
+ const short* pHeightData, int bCopyHeightData,
+ dReal width, dReal depth, int widthSamples, int depthSamples,
+ dReal scale, dReal offset, dReal thickness, int bWrap );
+
+/**
+ * @brief Configures a dHeightfieldDataID to use height data in
+ * single precision floating point format.
+ *
+ * Before a dHeightfieldDataID can be used by a geom it must be
+ * configured to specify the format of the height data.
+ * This call specifies that the heightfield data is stored as a rectangular
+ * array of single precision floats representing the height at each
+ * sample point.
+ *
+ * @param d A new dHeightfieldDataID created by dGeomHeightfieldDataCreate
+ *
+ * @param pHeightData A pointer to the height data.
+ * @param bCopyHeightData When non-zero the height data is copied to an
+ * internal store. When zero the height data is accessed by reference and
+ * so must persist throughout the lifetime of the heightfield.
+ *
+ * @param width Specifies the total 'width' of the heightfield along
+ * the geom's local x axis.
+ * @param depth Specifies the total 'depth' of the heightfield along
+ * the geom's local z axis.
+ *
+ * @param widthSamples Specifies the number of vertices to sample
+ * along the width of the heightfield. Each vertex has a corresponding
+ * height value which forms the overall shape.
+ * Naturally this value must be at least two or more.
+ * @param depthSamples Specifies the number of vertices to sample
+ * along the depth of the heightfield.
+ *
+ * @param scale A uniform scale applied to all raw height data.
+ * @param offset An offset applied to the scaled height data.
+ *
+ * @param thickness A value subtracted from the lowest height
+ * value which in effect adds an additional cuboid to the base of the
+ * heightfield. This is used to prevent geoms from looping under the
+ * desired terrain and not registering as a collision. Note that the
+ * thickness is not affected by the scale or offset parameters.
+ *
+ * @param bWrap If non-zero the heightfield will infinitely tile in both
+ * directions along the local x and z axes. If zero the heightfield is
+ * bounded from zero to width in the local x axis, and zero to depth in
+ * the local z axis.
+ *
+ * @ingroup collide
+ */
+ODE_API void dGeomHeightfieldDataBuildSingle( dHeightfieldDataID d,
+ const float* pHeightData, int bCopyHeightData,
+ dReal width, dReal depth, int widthSamples, int depthSamples,
+ dReal scale, dReal offset, dReal thickness, int bWrap );
+
+/**
+ * @brief Configures a dHeightfieldDataID to use height data in
+ * double precision floating point format.
+ *
+ * Before a dHeightfieldDataID can be used by a geom it must be
+ * configured to specify the format of the height data.
+ * This call specifies that the heightfield data is stored as a rectangular
+ * array of double precision floats representing the height at each
+ * sample point.
+ *
+ * @param d A new dHeightfieldDataID created by dGeomHeightfieldDataCreate
+ *
+ * @param pHeightData A pointer to the height data.
+ * @param bCopyHeightData When non-zero the height data is copied to an
+ * internal store. When zero the height data is accessed by reference and
+ * so must persist throughout the lifetime of the heightfield.
+ *
+ * @param width Specifies the total 'width' of the heightfield along
+ * the geom's local x axis.
+ * @param depth Specifies the total 'depth' of the heightfield along
+ * the geom's local z axis.
+ *
+ * @param widthSamples Specifies the number of vertices to sample
+ * along the width of the heightfield. Each vertex has a corresponding
+ * height value which forms the overall shape.
+ * Naturally this value must be at least two or more.
+ * @param depthSamples Specifies the number of vertices to sample
+ * along the depth of the heightfield.
+ *
+ * @param scale A uniform scale applied to all raw height data.
+ * @param offset An offset applied to the scaled height data.
+ *
+ * @param thickness A value subtracted from the lowest height
+ * value which in effect adds an additional cuboid to the base of the
+ * heightfield. This is used to prevent geoms from looping under the
+ * desired terrain and not registering as a collision. Note that the
+ * thickness is not affected by the scale or offset parameters.
+ *
+ * @param bWrap If non-zero the heightfield will infinitely tile in both
+ * directions along the local x and z axes. If zero the heightfield is
+ * bounded from zero to width in the local x axis, and zero to depth in
+ * the local z axis.
+ *
+ * @ingroup collide
+ */
+ODE_API void dGeomHeightfieldDataBuildDouble( dHeightfieldDataID d,
+ const double* pHeightData, int bCopyHeightData,
+ dReal width, dReal depth, int widthSamples, int depthSamples,
+ dReal scale, dReal offset, dReal thickness, int bWrap );
+
+/**
+ * @brief Manually set the minimum and maximum height bounds.
+ *
+ * This call allows you to set explicit min / max values after initial
+ * creation typically for callback heightfields which default to +/- infinity,
+ * or those whose data has changed. This must be set prior to binding with a
+ * geom, as the the AABB is not recomputed after it's first generation.
+ *
+ * @remarks The minimum and maximum values are used to compute the AABB
+ * for the heightfield which is used for early rejection of collisions.
+ * A close fit will yield a more efficient collision check.
+ *
+ * @param d A dHeightfieldDataID created by dGeomHeightfieldDataCreate
+ * @param min_height The new minimum height value. Scale, offset and thickness is then applied.
+ * @param max_height The new maximum height value. Scale and offset is then applied.
+ * @ingroup collide
+ */
+ODE_API void dGeomHeightfieldDataSetBounds( dHeightfieldDataID d,
+ dReal minHeight, dReal maxHeight );
+
+
+/**
+ * @brief Assigns a dHeightfieldDataID to a heightfield geom.
+ *
+ * Associates the given dHeightfieldDataID with a heightfield geom.
+ * This is done without affecting the GEOM_PLACEABLE flag.
+ *
+ * @param g A geom created by dCreateHeightfield
+ * @param d A dHeightfieldDataID created by dGeomHeightfieldDataCreate
+ * @ingroup collide
+ */
+ODE_API void dGeomHeightfieldSetHeightfieldData( dGeomID g, dHeightfieldDataID d );
+
+
+/**
+ * @brief Gets the dHeightfieldDataID bound to a heightfield geom.
+ *
+ * Returns the dHeightfieldDataID associated with a heightfield geom.
+ *
+ * @param g A geom created by dCreateHeightfield
+ * @return The dHeightfieldDataID which may be NULL if none was assigned.
+ * @ingroup collide
+ */
+ODE_API dHeightfieldDataID dGeomHeightfieldGetHeightfieldData( dGeomID g );
+
+
+
+/* ************************************************************************ */
+/* utility functions */
+
+ODE_API void dClosestLineSegmentPoints (const dVector3 a1, const dVector3 a2,
+ const dVector3 b1, const dVector3 b2,
+ dVector3 cp1, dVector3 cp2);
+
+ODE_API int dBoxTouchesBox (const dVector3 _p1, const dMatrix3 R1,
+ const dVector3 side1, const dVector3 _p2,
+ const dMatrix3 R2, const dVector3 side2);
+
+ODE_API int dBoxBox (const dVector3 p1, const dMatrix3 R1,
+ const dVector3 side1, const dVector3 p2,
+ const dMatrix3 R2, const dVector3 side2,
+ dVector3 normal, dReal *depth, int *return_code,
+ int maxc, dContactGeom *contact, int skip);
+
+ODE_API void dInfiniteAABB (dGeomID geom, dReal aabb[6]);
+ODE_API void dCloseODE(void);
+
+/* ************************************************************************ */
+/* custom classes */
+
+typedef void dGetAABBFn (dGeomID, dReal aabb[6]);
+typedef int dColliderFn (dGeomID o1, dGeomID o2,
+ int flags, dContactGeom *contact, int skip);
+typedef dColliderFn * dGetColliderFnFn (int num);
+typedef void dGeomDtorFn (dGeomID o);
+typedef int dAABBTestFn (dGeomID o1, dGeomID o2, dReal aabb[6]);
+
+typedef struct dGeomClass {
+ int bytes;
+ dGetColliderFnFn *collider;
+ dGetAABBFn *aabb;
+ dAABBTestFn *aabb_test;
+ dGeomDtorFn *dtor;
+} dGeomClass;
+
+ODE_API int dCreateGeomClass (const dGeomClass *classptr);
+ODE_API void * dGeomGetClassData (dGeomID);
+ODE_API dGeomID dCreateGeom (int classnum);
+
+/* ************************************************************************ */
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001-2003 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_COLLISION_SPACE_H_
+#define _ODE_COLLISION_SPACE_H_
+
+#include <ode/common.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+struct dContactGeom;
+
+/**
+ * @brief User callback for geom-geom collision testing.
+ *
+ * @param data The user data object, as passed to dSpaceCollide.
+ * @param o1 The first geom being tested.
+ * @param o2 The second geom being test.
+ *
+ * @remarks The callback function can call dCollide on o1 and o2 to generate
+ * contact points between each pair. Then these contact points may be added
+ * to the simulation as contact joints. The user's callback function can of
+ * course chose not to call dCollide for any pair, e.g. if the user decides
+ * that those pairs should not interact.
+ *
+ * @ingroup collide
+ */
+typedef void dNearCallback (void *data, dGeomID o1, dGeomID o2);
+
+
+ODE_API dSpaceID dSimpleSpaceCreate (dSpaceID space);
+ODE_API dSpaceID dHashSpaceCreate (dSpaceID space);
+ODE_API dSpaceID dQuadTreeSpaceCreate (dSpaceID space, dVector3 Center, dVector3 Extents, int Depth);
+
+ODE_API void dSpaceDestroy (dSpaceID);
+
+ODE_API void dHashSpaceSetLevels (dSpaceID space, int minlevel, int maxlevel);
+ODE_API void dHashSpaceGetLevels (dSpaceID space, int *minlevel, int *maxlevel);
+
+ODE_API void dSpaceSetCleanup (dSpaceID space, int mode);
+ODE_API int dSpaceGetCleanup (dSpaceID space);
+
+ODE_API void dSpaceAdd (dSpaceID, dGeomID);
+ODE_API void dSpaceRemove (dSpaceID, dGeomID);
+ODE_API int dSpaceQuery (dSpaceID, dGeomID);
+ODE_API void dSpaceClean (dSpaceID);
+ODE_API int dSpaceGetNumGeoms (dSpaceID);
+ODE_API dGeomID dSpaceGetGeom (dSpaceID, int i);
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001-2003 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+/*
+ * TriMesh code by Erwin de Vries.
+ *
+ * Trimesh data.
+ * This is where the actual vertexdata (pointers), and BV tree is stored.
+ * Vertices should be single precision!
+ * This should be more sophisticated, so that the user can easyly implement
+ * another collision library, but this is a lot of work, and also costs some
+ * performance because some data has to be copied.
+ */
+
+#ifndef _ODE_COLLISION_TRIMESH_H_
+#define _ODE_COLLISION_TRIMESH_H_
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*
+ * Data storage for triangle meshes.
+ */
+struct dxTriMeshData;
+typedef struct dxTriMeshData* dTriMeshDataID;
+
+/*
+ * These dont make much sense now, but they will later when we add more
+ * features.
+ */
+ODE_API dTriMeshDataID dGeomTriMeshDataCreate(void);
+ODE_API void dGeomTriMeshDataDestroy(dTriMeshDataID g);
+
+enum { TRIMESH_FACE_NORMALS, TRIMESH_LAST_TRANSFORMATION };
+ODE_API void dGeomTriMeshDataSet(dTriMeshDataID g, int data_id, void* in_data);
+ODE_API void* dGeomTriMeshDataGet(dTriMeshDataID g, int data_id);
+
+/*
+ * Build TriMesh data with single pricision used in vertex data .
+ */
+ODE_API void dGeomTriMeshDataBuildSingle(dTriMeshDataID g,
+ const void* Vertices, int VertexStride, int VertexCount,
+ const void* Indices, int IndexCount, int TriStride);
+/* same again with a normals array (used as trimesh-trimesh optimization) */
+ODE_API void dGeomTriMeshDataBuildSingle1(dTriMeshDataID g,
+ const void* Vertices, int VertexStride, int VertexCount,
+ const void* Indices, int IndexCount, int TriStride,
+ const void* Normals);
+/*
+* Build TriMesh data with double pricision used in vertex data .
+*/
+ODE_API void dGeomTriMeshDataBuildDouble(dTriMeshDataID g,
+ const void* Vertices, int VertexStride, int VertexCount,
+ const void* Indices, int IndexCount, int TriStride);
+/* same again with a normals array (used as trimesh-trimesh optimization) */
+ODE_API void dGeomTriMeshDataBuildDouble1(dTriMeshDataID g,
+ const void* Vertices, int VertexStride, int VertexCount,
+ const void* Indices, int IndexCount, int TriStride,
+ const void* Normals);
+
+/*
+ * Simple build. Single/double precision based on dSINGLE/dDOUBLE!
+ */
+ODE_API void dGeomTriMeshDataBuildSimple(dTriMeshDataID g,
+ const dReal* Vertices, int VertexCount,
+ const int* Indices, int IndexCount);
+/* same again with a normals array (used as trimesh-trimesh optimization) */
+ODE_API void dGeomTriMeshDataBuildSimple1(dTriMeshDataID g,
+ const dReal* Vertices, int VertexCount,
+ const int* Indices, int IndexCount,
+ const int* Normals);
+
+/* Preprocess the trimesh data to remove mark unnecessary edges and vertices */
+ODE_API void dGeomTriMeshDataPreprocess(dTriMeshDataID g);
+/* Get and set the internal preprocessed trimesh data buffer, for loading and saving */
+ODE_API void dGeomTriMeshDataGetBuffer(dTriMeshDataID g, unsigned char** buf, int* bufLen);
+ODE_API void dGeomTriMeshDataSetBuffer(dTriMeshDataID g, unsigned char* buf);
+
+
+/*
+ * Per triangle callback. Allows the user to say if he wants a collision with
+ * a particular triangle.
+ */
+typedef int dTriCallback(dGeomID TriMesh, dGeomID RefObject, int TriangleIndex);
+ODE_API void dGeomTriMeshSetCallback(dGeomID g, dTriCallback* Callback);
+ODE_API dTriCallback* dGeomTriMeshGetCallback(dGeomID g);
+
+/*
+ * Per object callback. Allows the user to get the list of triangles in 1
+ * shot. Maybe we should remove this one.
+ */
+typedef void dTriArrayCallback(dGeomID TriMesh, dGeomID RefObject, const int* TriIndices, int TriCount);
+ODE_API void dGeomTriMeshSetArrayCallback(dGeomID g, dTriArrayCallback* ArrayCallback);
+ODE_API dTriArrayCallback* dGeomTriMeshGetArrayCallback(dGeomID g);
+
+/*
+ * Ray callback.
+ * Allows the user to say if a ray collides with a triangle on barycentric
+ * coords. The user can for example sample a texture with alpha transparency
+ * to determine if a collision should occur.
+ */
+typedef int dTriRayCallback(dGeomID TriMesh, dGeomID Ray, int TriangleIndex, dReal u, dReal v);
+ODE_API void dGeomTriMeshSetRayCallback(dGeomID g, dTriRayCallback* Callback);
+ODE_API dTriRayCallback* dGeomTriMeshGetRayCallback(dGeomID g);
+
+/*
+ * Trimesh class
+ * Construction. Callbacks are optional.
+ */
+ODE_API dGeomID dCreateTriMesh(dSpaceID space, dTriMeshDataID Data, dTriCallback* Callback, dTriArrayCallback* ArrayCallback, dTriRayCallback* RayCallback);
+
+ODE_API void dGeomTriMeshSetData(dGeomID g, dTriMeshDataID Data);
+ODE_API dTriMeshDataID dGeomTriMeshGetData(dGeomID g);
+
+
+// enable/disable/check temporal coherence
+ODE_API void dGeomTriMeshEnableTC(dGeomID g, int geomClass, int enable);
+ODE_API int dGeomTriMeshIsTCEnabled(dGeomID g, int geomClass);
+
+/*
+ * Clears the internal temporal coherence caches. When a geom has its
+ * collision checked with a trimesh once, data is stored inside the trimesh.
+ * With large worlds with lots of seperate objects this list could get huge.
+ * We should be able to do this automagically.
+ */
+ODE_API void dGeomTriMeshClearTCCache(dGeomID g);
+
+
+/*
+ * returns the TriMeshDataID
+ */
+ODE_API dTriMeshDataID dGeomTriMeshGetTriMeshDataID(dGeomID g);
+
+/*
+ * Gets a triangle.
+ */
+ODE_API void dGeomTriMeshGetTriangle(dGeomID g, int Index, dVector3* v0, dVector3* v1, dVector3* v2);
+
+/*
+ * Gets the point on the requested triangle and the given barycentric
+ * coordinates.
+ */
+ODE_API void dGeomTriMeshGetPoint(dGeomID g, int Index, dReal u, dReal v, dVector3 Out);
+
+/*
+
+This is how the strided data works:
+
+struct StridedVertex{
+ dVector3 Vertex;
+ // Userdata
+};
+int VertexStride = sizeof(StridedVertex);
+
+struct StridedTri{
+ int Indices[3];
+ // Userdata
+};
+int TriStride = sizeof(StridedTri);
+
+*/
+
+
+ODE_API int dGeomTriMeshGetTriangleCount (dGeomID g);
+
+ODE_API void dGeomTriMeshDataUpdate(dTriMeshDataID g);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* _ODE_COLLISION_TRIMESH_H_ */
+
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_COMMON_H_
+#define _ODE_COMMON_H_
+#include <ode/config.h>
+#include <ode/error.h>
+#include <math.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+/* configuration stuff */
+
+/* the efficient alignment. most platforms align data structures to some
+ * number of bytes, but this is not always the most efficient alignment.
+ * for example, many x86 compilers align to 4 bytes, but on a pentium it
+ * is important to align doubles to 8 byte boundaries (for speed), and
+ * the 4 floats in a SIMD register to 16 byte boundaries. many other
+ * platforms have similar behavior. setting a larger alignment can waste
+ * a (very) small amount of memory. NOTE: this number must be a power of
+ * two. this is set to 16 by default.
+ */
+#define EFFICIENT_ALIGNMENT 16
+
+
+/* constants */
+
+/* pi and 1/sqrt(2) are defined here if necessary because they don't get
+ * defined in <math.h> on some platforms (like MS-Windows)
+ */
+
+#ifndef M_PI
+#define M_PI REAL(3.1415926535897932384626433832795029)
+#endif
+#ifndef M_SQRT1_2
+#define M_SQRT1_2 REAL(0.7071067811865475244008443621048490)
+#endif
+
+
+/* debugging:
+ * IASSERT is an internal assertion, i.e. a consistency check. if it fails
+ * we want to know where.
+ * UASSERT is a user assertion, i.e. if it fails a nice error message
+ * should be printed for the user.
+ * AASSERT is an arguments assertion, i.e. if it fails "bad argument(s)"
+ * is printed.
+ * DEBUGMSG just prints out a message
+ */
+
+#ifndef dNODEBUG
+#ifdef __GNUC__
+#define dIASSERT(a) if (!(a)) dDebug (d_ERR_IASSERT, \
+ "assertion \"" #a "\" failed in %s() [%s]",__FUNCTION__,__FILE__);
+#define dUASSERT(a,msg) if (!(a)) dDebug (d_ERR_UASSERT, \
+ msg " in %s()", __FUNCTION__);
+#define dDEBUGMSG(msg) dMessage (d_ERR_UASSERT, \
+msg " in %s() File %s Line %d", __FUNCTION__, __FILE__,__LINE__);
+#else
+#define dIASSERT(a) if (!(a)) dDebug (d_ERR_IASSERT, \
+ "assertion \"" #a "\" failed in %s:%d",__FILE__,__LINE__);
+#define dUASSERT(a,msg) if (!(a)) dDebug (d_ERR_UASSERT, \
+ msg " (%s:%d)", __FILE__,__LINE__);
+#define dDEBUGMSG(msg) dMessage (d_ERR_UASSERT, \
+ msg " (%s:%d)", __FILE__,__LINE__);
+#endif
+#else
+#define dIASSERT(a) ;
+#define dUASSERT(a,msg) ;
+#define dDEBUGMSG(msg) ;
+#endif
+#define dAASSERT(a) dUASSERT(a,"Bad argument(s)")
+
+/* floating point data type, vector, matrix and quaternion types */
+
+#if defined(dSINGLE)
+typedef float dReal;
+#elif defined(dDOUBLE)
+typedef double dReal;
+#else
+#error You must #define dSINGLE or dDOUBLE
+#endif
+
+
+/* round an integer up to a multiple of 4, except that 0 and 1 are unmodified
+ * (used to compute matrix leading dimensions)
+ */
+#define dPAD(a) (((a) > 1) ? ((((a)-1)|3)+1) : (a))
+
+/* these types are mainly just used in headers */
+typedef dReal dVector3[4];
+typedef dReal dVector4[4];
+typedef dReal dMatrix3[4*3];
+typedef dReal dMatrix4[4*4];
+typedef dReal dMatrix6[8*6];
+typedef dReal dQuaternion[4];
+
+
+/* precision dependent scalar math functions */
+
+#if defined(dSINGLE)
+
+#define REAL(x) (x ## f) /* form a constant */
+#define dRecip(x) ((1.0f/(x))) /* reciprocal */
+#define dSqrt(x) (sqrtf(x)) /* square root */
+#define dRecipSqrt(x) ((1.0f/sqrtf(x))) /* reciprocal square root */
+#define dSin(x) (sinf(x)) /* sine */
+#define dCos(x) (cosf(x)) /* cosine */
+#define dFabs(x) (fabsf(x)) /* absolute value */
+#define dAtan2(y,x) (atan2f(y,x)) /* arc tangent with 2 args */
+#define dFMod(a,b) (fmodf(a,b)) /* modulo */
+
+#ifdef HAVE___ISNANF
+#define dIsNan(x) (__isnanf(x))
+#elif defined(HAVE__ISNANF)
+#define dIsNan(x) (_isnanf(x))
+#elif defined(HAVE_ISNANF)
+#define dIsNan(x) (isnanf(x))
+#else
+ /*
+ fall back to _isnan which is the VC way,
+ this may seem redundant since we already checked
+ for _isnan before, but if isnan is detected by
+ configure but is not found during compilation
+ we should always make sure we check for __isnanf,
+ _isnanf and isnanf in that order before falling
+ back to a default
+ */
+#define dIsNan(x) (_isnan(x))
+#endif
+
+#define dCopySign(a,b) ((dReal)copysignf(a,b))
+
+#elif defined(dDOUBLE)
+
+#define REAL(x) (x)
+#define dRecip(x) (1.0/(x))
+#define dSqrt(x) sqrt(x)
+#define dRecipSqrt(x) (1.0/sqrt(x))
+#define dSin(x) sin(x)
+#define dCos(x) cos(x)
+#define dFabs(x) fabs(x)
+#define dAtan2(y,x) atan2((y),(x))
+#define dFMod(a,b) (fmod((a),(b)))
+#ifdef HAVE___ISNAN
+#define dIsNan(x) (__isnan(x))
+#elif defined(HAVE__ISNAN)
+#define dIsNan(x) (_isnan(x))
+#elif defined(HAVE_ISNAN)
+#define dIsNan(x) (isnan(x))
+#else
+#define dIsNan(x) (_isnan(x))
+#endif
+
+#define dCopySign(a,b) (copysign((a),(b)))
+
+#else
+#error You must #define dSINGLE or dDOUBLE
+#endif
+
+
+/* utility */
+
+
+/* round something up to be a multiple of the EFFICIENT_ALIGNMENT */
+
+#define dEFFICIENT_SIZE(x) ((((x)-1)|(EFFICIENT_ALIGNMENT-1))+1)
+
+
+/* alloca aligned to the EFFICIENT_ALIGNMENT. note that this can waste
+ * up to 15 bytes per allocation, depending on what alloca() returns.
+ */
+
+#define dALLOCA16(n) \
+ ((char*)dEFFICIENT_SIZE(((size_t)(alloca((n)+(EFFICIENT_ALIGNMENT-1))))))
+
+
+// Use the error-checking memory allocation system. Because this system uses heap
+// (malloc) instead of stack (alloca), it is slower. However, it allows you to
+// simulate larger scenes, as well as handle out-of-memory errors in a somewhat
+// graceful manner
+
+// #define dUSE_MALLOC_FOR_ALLOCA
+
+#ifdef dUSE_MALLOC_FOR_ALLOCA
+enum {
+ d_MEMORY_OK = 0, /* no memory errors */
+ d_MEMORY_OUT_OF_MEMORY /* malloc failed due to out of memory error */
+};
+
+#endif
+
+
+
+/* internal object types (all prefixed with `dx') */
+
+struct dxWorld; /* dynamics world */
+struct dxSpace; /* collision space */
+struct dxBody; /* rigid body (dynamics object) */
+struct dxGeom; /* geometry (collision object) */
+struct dxJoint;
+struct dxJointNode;
+struct dxJointGroup;
+
+typedef struct dxWorld *dWorldID;
+typedef struct dxSpace *dSpaceID;
+typedef struct dxBody *dBodyID;
+typedef struct dxGeom *dGeomID;
+typedef struct dxJoint *dJointID;
+typedef struct dxJointGroup *dJointGroupID;
+
+
+/* error numbers */
+
+enum {
+ d_ERR_UNKNOWN = 0, /* unknown error */
+ d_ERR_IASSERT, /* internal assertion failed */
+ d_ERR_UASSERT, /* user assertion failed */
+ d_ERR_LCP /* user assertion failed */
+};
+
+
+/* joint type numbers */
+
+enum {
+ dJointTypeNone = 0, /* or "unknown" */
+ dJointTypeBall,
+ dJointTypeHinge,
+ dJointTypeSlider,
+ dJointTypeContact,
+ dJointTypeUniversal,
+ dJointTypeHinge2,
+ dJointTypeFixed,
+ dJointTypeNull,
+ dJointTypeAMotor,
+ dJointTypeLMotor,
+ dJointTypePlane2D
+};
+
+
+/* an alternative way of setting joint parameters, using joint parameter
+ * structures and member constants. we don't actually do this yet.
+ */
+
+/*
+typedef struct dLimot {
+ int mode;
+ dReal lostop, histop;
+ dReal vel, fmax;
+ dReal fudge_factor;
+ dReal bounce, soft;
+ dReal suspension_erp, suspension_cfm;
+} dLimot;
+
+enum {
+ dLimotLoStop = 0x0001,
+ dLimotHiStop = 0x0002,
+ dLimotVel = 0x0004,
+ dLimotFMax = 0x0008,
+ dLimotFudgeFactor = 0x0010,
+ dLimotBounce = 0x0020,
+ dLimotSoft = 0x0040
+};
+*/
+
+
+/* standard joint parameter names. why are these here? - because we don't want
+ * to include all the joint function definitions in joint.cpp. hmmmm.
+ * MSVC complains if we call D_ALL_PARAM_NAMES_X with a blank second argument,
+ * which is why we have the D_ALL_PARAM_NAMES macro as well. please copy and
+ * paste between these two.
+ */
+
+#define D_ALL_PARAM_NAMES(start) \
+ /* parameters for limits and motors */ \
+ dParamLoStop = start, \
+ dParamHiStop, \
+ dParamVel, \
+ dParamFMax, \
+ dParamFudgeFactor, \
+ dParamBounce, \
+ dParamCFM, \
+ dParamStopERP, \
+ dParamStopCFM, \
+ /* parameters for suspension */ \
+ dParamSuspensionERP, \
+ dParamSuspensionCFM,
+
+#define D_ALL_PARAM_NAMES_X(start,x) \
+ /* parameters for limits and motors */ \
+ dParamLoStop ## x = start, \
+ dParamHiStop ## x, \
+ dParamVel ## x, \
+ dParamFMax ## x, \
+ dParamFudgeFactor ## x, \
+ dParamBounce ## x, \
+ dParamCFM ## x, \
+ dParamStopERP ## x, \
+ dParamStopCFM ## x, \
+ /* parameters for suspension */ \
+ dParamSuspensionERP ## x, \
+ dParamSuspensionCFM ## x,
+
+enum {
+ D_ALL_PARAM_NAMES(0)
+ D_ALL_PARAM_NAMES_X(0x100,2)
+ D_ALL_PARAM_NAMES_X(0x200,3)
+
+ /* add a multiple of this constant to the basic parameter numbers to get
+ * the parameters for the second, third etc axes.
+ */
+ dParamGroup=0x100
+};
+
+
+/* angular motor mode numbers */
+
+enum{
+ dAMotorUser = 0,
+ dAMotorEuler = 1
+};
+
+
+/* joint force feedback information */
+
+typedef struct dJointFeedback {
+ dVector3 f1; /* force applied to body 1 */
+ dVector3 t1; /* torque applied to body 1 */
+ dVector3 f2; /* force applied to body 2 */
+ dVector3 t2; /* torque applied to body 2 */
+} dJointFeedback;
+
+
+/* private functions that must be implemented by the collision library:
+ * (1) indicate that a geom has moved, (2) get the next geom in a body list.
+ * these functions are called whenever the position of geoms connected to a
+ * body have changed, e.g. with dBodySetPosition(), dBodySetRotation(), or
+ * when the ODE step function updates the body state.
+ */
+
+void dGeomMoved (dGeomID);
+dGeomID dGeomGetBodyNext (dGeomID);
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_COMPATIBILITY_H_
+#define _ODE_COMPATIBILITY_H_
+
+/*
+ * ODE's backward compatibility system ensures that as ODE's API
+ * evolves, user code will not break.
+ */
+
+/*
+ * These new rotation function names are more consistent with the
+ * rest of the API.
+ */
+#define dQtoR(q,R) dRfromQ((R),(q))
+#define dRtoQ(R,q) dQfromR((q),(R))
+#define dWtoDQ(w,q,dq) dDQfromW((dq),(w),(q))
+
+
+#endif
--- /dev/null
+/* This file was autogenerated by Premake */
+#ifndef _ODE_CONFIG_H_
+#define _ODE_CONFIG_H_
+
+
+/******************************************************************
+ * CONFIGURATON SETTINGS - you can change these, and then rebuild
+ * ODE to modify the behavior of the library.
+ *
+ * dSINGLE/dDOUBLE - force ODE to use single-precision (float)
+ * or double-precision (double) for numbers
+ *
+ * dTRIMESH_ENABLED - enable/disable trimesh support
+ *
+ ******************************************************************/
+
+#define dSINGLE 1
+
+#define dTRIMESH_ENABLED 1
+
+
+
+/******************************************************************
+ * SYSTEM SETTINGS - you shouldn't need to change these. If you
+ * run into an issue with these settings, please report it to
+ * the ODE bug tracker at:
+ * http://sf.net/tracker/?group_id=24884&atid=382799
+ ******************************************************************/
+
+/* Try to identify the platform */
+#if defined(_MSC_VER) || defined(__CYGWIN32__) || defined(__MINGW32__)
+ #define ODE_PLATFORM_WINDOWS
+#elif defined(__linux__)
+ #define ODE_PLATFORM_LINUX
+#elif defined(__APPLE__) && defined(__MACH__)
+ #define ODE_PLATFORM_OSX
+#else
+ #error "Need some help identifying the platform!"
+#endif
+
+/* Additional platform defines used in the code */
+#if defined(ODE_PLATFORM_WINDOWS) && !defined(WIN32)
+ #define WIN32
+#endif
+
+#if defined(__CYGWIN32__) || defined(__MINGW32__)
+ #define CYGWIN
+#endif
+
+#if defined(ODE_PLATFORM_OSX)
+ #define macintosh
+#endif
+
+
+/* Define a DLL export symbol for those platforms that need it */
+#if defined(ODE_PLATFORM_WINDOWS)
+ #if defined(ODE_DLL)
+ #define ODE_API __declspec(dllexport)
+ #elif !defined(ODE_LIB)
+ #define ODE_DLL_API __declspec(dllimport)
+ #endif
+#endif
+
+#if !defined(ODE_API)
+ #define ODE_API
+#endif
+
+
+/* Pull in the standard headers */
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdarg.h>
+#include <malloc.h>
+#include <math.h>
+#include <string.h>
+#include <float.h>
+
+#if !defined(ODE_PLATFORM_WINDOWS)
+ #include <alloca.h>
+#endif
+
+
+/* Visual C does not define these functions */
+#if defined(_MSC_VER)
+ #define copysignf _copysign
+ #define copysign _copysign
+#endif
+
+
+/* Define a value for infinity */
+#if defined(HUGE_VALF)
+ #define ODE_INFINITY4 HUGE_VALF
+ #define ODE_INFINITY8 HUGE_VAL
+#elif defined(FLT_MAX)
+ #define ODE_INFINITY4 FLT_MAX
+ #define ODE_INFINITY8 DBL_MAX
+#else
+ static union { unsigned char __c[4]; float __f; } __ode_huge_valf = {{0,0,0x80,0x7f}};
+ static union { unsigned char __c[8]; double __d; } __ode_huge_val = {{0,0,0,0,0,0,0xf0,0x7f}};
+ #define ODE_INFINITY4 (__ode_huge_valf.__f)
+ #define ODE_INFINITY8 (__ode_huge_val.__d)
+#endif
+
+#if dSINGLE
+ #define dInfinity ODE_INFINITY4
+ #define dEpsilon FLT_EPSILON
+#else
+ #define dInfinity ODE_INFINITY8
+ #define dEpsilon DBL_EPSILON
+#endif
+
+
+/* Well-defined common data types...need to define for 64 bit systems */
+#if defined(_M_IA64) || defined(__ia64__) || defined(_M_AMD64) || defined(__x86_64__)
+ #define X86_64_SYSTEM 1
+ typedef int int32;
+ typedef unsigned int uint32;
+ typedef short int16;
+ typedef unsigned short uint16;
+ typedef char int8;
+ typedef unsigned char uint8;
+#else
+ typedef int int32;
+ typedef unsigned int uint32;
+ typedef short int16;
+ typedef unsigned short uint16;
+ typedef char int8;
+ typedef unsigned char uint8;
+#endif
+
+/* An integer type that can be safely cast to a pointer. This definition
+ * should be safe even on 64-bit systems */
+typedef size_t intP;
+
+
+/* The efficient alignment. most platforms align data structures to some
+ * number of bytes, but this is not always the most efficient alignment.
+ * for example, many x86 compilers align to 4 bytes, but on a pentium it is
+ * important to align doubles to 8 byte boundaries (for speed), and the 4
+ * floats in a SIMD register to 16 byte boundaries. many other platforms have
+ * similar behavior. setting a larger alignment can waste a (very) small
+ * amount of memory. NOTE: this number must be a power of two. */
+#define EFFICIENT_ALIGNMENT 16
+
+
+/* Define this if your system supports anonymous memory maps (linux does) */
+#define MMAP_ANONYMOUS
+
+#endif
--- /dev/null
+/* include/ode/config.h.in. Generated from configure.in by autoheader. */
+
+
+#ifndef ODE_CONFIG_H
+#define ODE_CONFIG_H
+
+
+/* Define to one of `_getb67', `GETB67', `getb67' for Cray-2 and Cray-YMP
+ systems. This function is required for `alloca.c' support on those systems.
+ */
+#undef CRAY_STACKSEG_END
+
+/* Define to 1 if using `alloca.c'. */
+#undef C_ALLOCA
+
+/* Define to 1 if you have `alloca', as a function or macro. */
+#undef HAVE_ALLOCA
+
+/* Define to 1 if you have <alloca.h> and it should be used (not on Ultrix).
+ */
+#undef HAVE_ALLOCA_H
+
+/* Use the Apple OpenGL framework. */
+#undef HAVE_APPLE_OPENGL_FRAMEWORK
+
+/* Define to 1 if you have the `atan2f' function. */
+#undef HAVE_ATAN2F
+
+/* Define to 1 if you have the `copysign' function. */
+#undef HAVE_COPYSIGN
+
+/* Define to 1 if you have the `copysignf' function. */
+#undef HAVE_COPYSIGNF
+
+/* Define to 1 if you have the `cosf' function. */
+#undef HAVE_COSF
+
+/* Define to 1 if you don't have `vprintf' but do have `_doprnt.' */
+#undef HAVE_DOPRNT
+
+/* Define to 1 if you have the `fabsf' function. */
+#undef HAVE_FABSF
+
+/* Define to 1 if you have the <float.h> header file. */
+#undef HAVE_FLOAT_H
+
+/* Define to 1 if you have the `floor' function. */
+#undef HAVE_FLOOR
+
+/* Define to 1 if you have the `fmodf' function. */
+#undef HAVE_FMODF
+
+/* Define to 1 if you have the `gettimeofday' function. */
+#undef HAVE_GETTIMEOFDAY
+
+/* Define to 1 if you have the <GL/glext.h> header file. */
+#undef HAVE_GL_GLEXT_H
+
+/* Define to 1 if you have the <GL/glu.h> header file. */
+#undef HAVE_GL_GLU_H
+
+/* Define to 1 if you have the <GL/gl.h> header file. */
+#undef HAVE_GL_GL_H
+
+/* Define to 1 if you have the <ieeefp.h> header file. */
+#undef HAVE_IEEEFP_H
+
+/* Define to 1 if you have the <inttypes.h> header file. */
+#undef HAVE_INTTYPES_H
+
+/* Define to 1 if you have the `isnan' function. */
+#undef HAVE_ISNAN
+
+/* Define to 1 if you have the `isnanf' function. */
+#undef HAVE_ISNANF
+
+/* Define to 1 if your system has a GNU libc compatible `malloc' function, and
+ to 0 otherwise. */
+#undef HAVE_MALLOC
+
+/* Define to 1 if you have the <malloc.h> header file. */
+#undef HAVE_MALLOC_H
+
+/* Define to 1 if you have the <math.h> header file. */
+#undef HAVE_MATH_H
+
+/* Define to 1 if you have the `memmove' function. */
+#undef HAVE_MEMMOVE
+
+/* Define to 1 if you have the <memory.h> header file. */
+#undef HAVE_MEMORY_H
+
+/* Define to 1 if you have the `memset' function. */
+#undef HAVE_MEMSET
+
+/* Define to 1 if libc includes obstacks. */
+#undef HAVE_OBSTACK
+
+/* Define to 1 if your system has a GNU libc compatible `realloc' function,
+ and to 0 otherwise. */
+#undef HAVE_REALLOC
+
+/* Define to 1 if you have the `select' function. */
+#undef HAVE_SELECT
+
+/* Define to 1 if you have the `sinf' function. */
+#undef HAVE_SINF
+
+/* Define to 1 if you have the `snprintf' function. */
+#undef HAVE_SNPRINTF
+
+/* Define to 1 if you have the `sqrt' function. */
+#undef HAVE_SQRT
+
+/* Define to 1 if you have the `sqrtf' function. */
+#undef HAVE_SQRTF
+
+/* Use SSE Optimizations */
+#undef HAVE_SSE
+
+/* Define to 1 if you have the <stdarg.h> header file. */
+#undef HAVE_STDARG_H
+
+/* Define to 1 if stdbool.h conforms to C99. */
+#undef HAVE_STDBOOL_H
+
+/* Define to 1 if you have the <stdint.h> header file. */
+#undef HAVE_STDINT_H
+
+/* Define to 1 if you have the <stdio.h> header file. */
+#undef HAVE_STDIO_H
+
+/* Define to 1 if you have the <stdlib.h> header file. */
+#undef HAVE_STDLIB_H
+
+/* Define to 1 if you have the <strings.h> header file. */
+#undef HAVE_STRINGS_H
+
+/* Define to 1 if you have the <string.h> header file. */
+#undef HAVE_STRING_H
+
+/* Define to 1 if you have the <sys/select.h> header file. */
+#undef HAVE_SYS_SELECT_H
+
+/* Define to 1 if you have the <sys/socket.h> header file. */
+#undef HAVE_SYS_SOCKET_H
+
+/* Define to 1 if you have the <sys/stat.h> header file. */
+#undef HAVE_SYS_STAT_H
+
+/* Define to 1 if you have the <sys/time.h> header file. */
+#undef HAVE_SYS_TIME_H
+
+/* Define to 1 if you have the <sys/types.h> header file. */
+#undef HAVE_SYS_TYPES_H
+
+/* Define to 1 if you have the <time.h> header file. */
+#undef HAVE_TIME_H
+
+/* Define to 1 if you have the <unistd.h> header file. */
+#undef HAVE_UNISTD_H
+
+/* Define to 1 if you have the <values.h> header file. */
+#undef HAVE_VALUES_H
+
+/* Define to 1 if you have the `vprintf' function. */
+#undef HAVE_VPRINTF
+
+/* Define to 1 if you have the `vsnprintf' function. */
+#undef HAVE_VSNPRINTF
+
+/* Define to 1 if the system has the type `_Bool'. */
+#undef HAVE__BOOL
+
+/* Define to 1 if you have the `_isnan' function. */
+#undef HAVE__ISNAN
+
+/* Define to 1 if you have the `_isnanf' function. */
+#undef HAVE__ISNANF
+
+/* Define to 1 if you have the `__isnan' function. */
+#undef HAVE___ISNAN
+
+/* Define to 1 if you have the `__isnanf' function. */
+#undef HAVE___ISNANF
+
+/* Name of package */
+#undef PACKAGE
+
+/* Define to the address where bug reports for this package should be sent. */
+#undef PACKAGE_BUGREPORT
+
+/* Define to the full name of this package. */
+#undef PACKAGE_NAME
+
+/* Define to the full name and version of this package. */
+#undef PACKAGE_STRING
+
+/* Define to the one symbol short name of this package. */
+#undef PACKAGE_TARNAME
+
+/* Define to the version of this package. */
+#undef PACKAGE_VERSION
+
+/* is this a pentium on a gcc-based platform? */
+#undef PENTIUM
+
+/* Define to the type of arg 1 for `select'. */
+#undef SELECT_TYPE_ARG1
+
+/* Define to the type of args 2, 3 and 4 for `select'. */
+#undef SELECT_TYPE_ARG234
+
+/* Define to the type of arg 5 for `select'. */
+#undef SELECT_TYPE_ARG5
+
+/* The size of a `char', as computed by sizeof. */
+#undef SIZEOF_CHAR
+
+/* The size of a `int', as computed by sizeof. */
+#undef SIZEOF_INT
+
+/* The size of a `long int', as computed by sizeof. */
+#undef SIZEOF_LONG_INT
+
+/* The size of a `short', as computed by sizeof. */
+#undef SIZEOF_SHORT
+
+/* The size of a `void*', as computed by sizeof. */
+#undef SIZEOF_VOIDP
+
+/* The extension for shared libraries. */
+#undef SO_EXT
+
+/* If using the C implementation of alloca, define if you know the
+ direction of stack growth for your system; otherwise it will be
+ automatically deduced at run-time.
+ STACK_DIRECTION > 0 => grows toward higher addresses
+ STACK_DIRECTION < 0 => grows toward lower addresses
+ STACK_DIRECTION = 0 => direction of growth unknown */
+#undef STACK_DIRECTION
+
+/* Define to 1 if you have the ANSI C header files. */
+#undef STDC_HEADERS
+
+/* Version number of package */
+#undef VERSION
+
+/* Define to 1 if your processor stores words with the most significant byte
+ first (like Motorola and SPARC, unlike Intel and VAX). */
+#undef WORDS_BIGENDIAN
+
+/* is this a X86_64 system on a gcc-based platform? */
+#undef X86_64_SYSTEM
+
+/* Define to 1 if the X Window System is missing or not being used. */
+#undef X_DISPLAY_MISSING
+
+/* Define to empty if `const' does not conform to ANSI C. */
+#undef const
+
+/* Use double precision */
+#undef dDOUBLE
+
+/* dEpsilon Constant */
+#undef dEpsilon
+
+/* Use gyroscopic terms */
+#undef dGYROSCOPIC
+
+/* dInfinity Constant */
+#undef dInfinity
+
+/* Disable debug output */
+#undef dNODEBUG
+
+/* Use single precision */
+#undef dSINGLE
+
+/* Define to `__inline__' or `__inline' if that's what the C compiler
+ calls it, or to nothing if 'inline' is not supported under any name. */
+#ifndef __cplusplus
+#undef inline
+#endif
+
+/* Define to rpl_malloc if the replacement function should be used. */
+#undef malloc
+
+/* Define to rpl_realloc if the replacement function should be used. */
+#undef realloc
+
+/* Define to `unsigned' if <sys/types.h> does not define. */
+#undef size_t
+
+/* Define to empty if the keyword `volatile' does not work. Warning: valid
+ code using `volatile' can become incorrect without. Disable with care. */
+#undef volatile
+
+
+
+#ifdef HAVE_ALLOCA_H
+#include <alloca.h>
+#endif
+#if defined(HAVE_IEEEFP_H) && !defined(__CYGWIN__)
+// This header creates conflicts with math.h in Cygwin.
+#include <ieeefp.h>
+#endif
+#ifdef HAVE_STDIO_H
+#include <stdio.h>
+#endif
+#ifdef HAVE_STDLIB_H
+#include <stdlib.h>
+#endif
+#ifdef HAVE_MATH_H
+#include <math.h>
+#endif
+#ifdef HAVE_STRING_H
+#include <string.h>
+#endif
+#ifdef HAVE_STDARG_H
+#include <stdarg.h>
+#endif
+#ifdef HAVE_MALLOC_H
+#include <malloc.h>
+#endif
+#ifdef HAVE_VALUES_H
+#include <values.h>
+#endif
+#ifdef HAVE_FLOAT_H
+#include <float.h>
+#endif
+#if SIZEOF_CHAR == 1
+typedef char int8;
+typedef unsigned char uint8;
+#else
+#error "expecting sizeof(char) == 1"
+#endif
+#if SIZEOF_SHORT == 2
+typedef short int16;
+typedef unsigned short uint16;;
+#else
+#error "can not find 2 byte integer type"
+#endif
+/* integer types (we assume int >= 32 bits) */
+#if SIZEOF_INT == 4
+typedef short int32;
+typedef unsigned short uint32;
+#else
+#error "can not find 4 byte integer type"
+#endif
+/* an integer type that we can safely cast a pointer to and
+ * from without loss of bits.
+ */
+#if SIZEOF_SHORT == SIZEOF_VOIDP
+typedef unsigned short intP;
+#elif SIZEOF_INT == SIZEOF_VOIDP
+typedef unsigned int intP;
+#elif SIZEOF_LONG_INT == SIZEOF_VOIDP
+typedef unsigned long int intP;
+#endif
+
+/*
+Handle Windows DLL odities
+Its easier to export all symbols using the -shared flag
+for MinGW than differentiating with declspec,
+so only do it for MSVC
+*/
+#if defined(ODE_DLL) && defined(WIN32) && defined(_MSC_VER)
+#define ODE_API __declspec( dllexport )
+#elif !defined(ODE_DLL) && defined(WIN32) && defined(MSC_VER)
+#define ODE_API __declspec( dllimport )
+#else
+#define ODE_API
+#endif
+
+#endif /* #define ODE_CONFIG_H */
+
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_CONTACT_H_
+#define _ODE_CONTACT_H_
+
+#include <ode/common.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+enum {
+ dContactMu2 = 0x001,
+ dContactFDir1 = 0x002,
+ dContactBounce = 0x004,
+ dContactSoftERP = 0x008,
+ dContactSoftCFM = 0x010,
+ dContactMotion1 = 0x020,
+ dContactMotion2 = 0x040,
+ dContactSlip1 = 0x080,
+ dContactSlip2 = 0x100,
+
+ dContactApprox0 = 0x0000,
+ dContactApprox1_1 = 0x1000,
+ dContactApprox1_2 = 0x2000,
+ dContactApprox1 = 0x3000
+};
+
+
+typedef struct dSurfaceParameters {
+ /* must always be defined */
+ int mode;
+ dReal mu;
+
+ /* only defined if the corresponding flag is set in mode */
+ dReal mu2;
+ dReal bounce;
+ dReal bounce_vel;
+ dReal soft_erp;
+ dReal soft_cfm;
+ dReal motion1,motion2;
+ dReal slip1,slip2;
+} dSurfaceParameters;
+
+
+/**
+ * @brief Describe the contact point between two geoms.
+ *
+ * If two bodies touch, or if a body touches a static feature in its
+ * environment, the contact is represented by one or more "contact
+ * points", described by dContactGeom.
+ *
+ * The convention is that if body 1 is moved along the normal vector by
+ * a distance depth (or equivalently if body 2 is moved the same distance
+ * in the opposite direction) then the contact depth will be reduced to
+ * zero. This means that the normal vector points "in" to body 1.
+ *
+ * @ingroup collide
+ */
+typedef struct dContactGeom {
+ dVector3 pos; ///< contact position
+ dVector3 normal; ///< normal vector
+ dReal depth; ///< penetration depth
+ dGeomID g1,g2; ///< the colliding geoms
+ int side1,side2; ///< (to be documented)
+} dContactGeom;
+
+
+/* contact info used by contact joint */
+
+typedef struct dContact {
+ dSurfaceParameters surface;
+ dContactGeom geom;
+ dVector3 fdir1;
+} dContact;
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+/* this comes from the `reuse' library. copy any changes back to the source */
+
+#ifndef _ODE_ERROR_H_
+#define _ODE_ERROR_H_
+
+#include <ode/config.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* all user defined error functions have this type. error and debug functions
+ * should not return.
+ */
+typedef void dMessageFunction (int errnum, const char *msg, va_list ap);
+
+/* set a new error, debug or warning handler. if fn is 0, the default handlers
+ * are used.
+ */
+ODE_API void dSetErrorHandler (dMessageFunction *fn);
+ODE_API void dSetDebugHandler (dMessageFunction *fn);
+ODE_API void dSetMessageHandler (dMessageFunction *fn);
+
+/* return the current error, debug or warning handler. if the return value is
+ * 0, the default handlers are in place.
+ */
+ODE_API dMessageFunction *dGetErrorHandler(void);
+ODE_API dMessageFunction *dGetDebugHandler(void);
+ODE_API dMessageFunction *dGetMessageHandler(void);
+
+/* generate a fatal error, debug trap or a message. */
+ODE_API void dError (int num, const char *msg, ...);
+ODE_API void dDebug (int num, const char *msg, ...);
+ODE_API void dMessage (int num, const char *msg, ...);
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_EXPORT_DIF_
+#define _ODE_EXPORT_DIF_
+
+#include <ode/common.h>
+
+
+ODE_API void dWorldExportDIF (dWorldID w, FILE *file, const char *world_name);
+
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_MASS_H_
+#define _ODE_MASS_H_
+
+#include <ode/common.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+struct dMass;
+typedef struct dMass dMass;
+
+/**
+ * Check if a mass structure has valid value.
+ * The function check if the mass and innertia matrix are positive definits
+ *
+ * @param m A mass structure to check
+ *
+ * @return 1 if both codition are met
+ */
+ODE_API int dMassCheck(const dMass *m);
+
+ODE_API void dMassSetZero (dMass *);
+
+ODE_API void dMassSetParameters (dMass *, dReal themass,
+ dReal cgx, dReal cgy, dReal cgz,
+ dReal I11, dReal I22, dReal I33,
+ dReal I12, dReal I13, dReal I23);
+
+ODE_API void dMassSetSphere (dMass *, dReal density, dReal radius);
+ODE_API void dMassSetSphereTotal (dMass *, dReal total_mass, dReal radius);
+
+ODE_API void dMassSetCapsule (dMass *, dReal density, int direction,
+ dReal radius, dReal length);
+ODE_API void dMassSetCapsuleTotal (dMass *, dReal total_mass, int direction,
+ dReal radius, dReal length);
+
+ODE_API void dMassSetCylinder (dMass *, dReal density, int direction,
+ dReal radius, dReal length);
+ODE_API void dMassSetCylinderTotal (dMass *, dReal total_mass, int direction,
+ dReal radius, dReal length);
+
+ODE_API void dMassSetBox (dMass *, dReal density,
+ dReal lx, dReal ly, dReal lz);
+ODE_API void dMassSetBoxTotal (dMass *, dReal total_mass,
+ dReal lx, dReal ly, dReal lz);
+
+ODE_API void dMassAdjust (dMass *, dReal newmass);
+
+ODE_API void dMassTranslate (dMass *, dReal x, dReal y, dReal z);
+
+ODE_API void dMassRotate (dMass *, const dMatrix3 R);
+
+ODE_API void dMassAdd (dMass *a, const dMass *b);
+
+// Backwards compatible API
+#define dMassSetCappedCylinder dMassSetCapsule
+#define dMassSetCappedCylinderTotal dMassSetCapsuleTotal
+
+
+struct dMass {
+ dReal mass;
+ dVector4 c;
+ dMatrix3 I;
+
+#ifdef __cplusplus
+ dMass()
+ { dMassSetZero (this); }
+ void setZero()
+ { dMassSetZero (this); }
+ void setParameters (dReal themass, dReal cgx, dReal cgy, dReal cgz,
+ dReal I11, dReal I22, dReal I33,
+ dReal I12, dReal I13, dReal I23)
+ { dMassSetParameters (this,themass,cgx,cgy,cgz,I11,I22,I33,I12,I13,I23); }
+ void setSphere (dReal density, dReal radius)
+ { dMassSetSphere (this,density,radius); }
+ void setCapsule (dReal density, int direction, dReal a, dReal b)
+ { dMassSetCappedCylinder (this,density,direction,a,b); }
+ void setCappedCylinder (dReal density, int direction, dReal a, dReal b)
+ { setCapsule(density, direction, a, b); }
+ void setBox (dReal density, dReal lx, dReal ly, dReal lz)
+ { dMassSetBox (this,density,lx,ly,lz); }
+ void adjust (dReal newmass)
+ { dMassAdjust (this,newmass); }
+ void translate (dReal x, dReal y, dReal z)
+ { dMassTranslate (this,x,y,z); }
+ void rotate (const dMatrix3 R)
+ { dMassRotate (this,R); }
+ void add (const dMass *b)
+ { dMassAdd (this,b); }
+#endif
+};
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+/* optimized and unoptimized vector and matrix functions */
+
+#ifndef _ODE_MATRIX_H_
+#define _ODE_MATRIX_H_
+
+#include <ode/common.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+/* set a vector/matrix of size n to all zeros, or to a specific value. */
+
+ODE_API void dSetZero (dReal *a, int n);
+ODE_API void dSetValue (dReal *a, int n, dReal value);
+
+
+/* get the dot product of two n*1 vectors. if n <= 0 then
+ * zero will be returned (in which case a and b need not be valid).
+ */
+
+ODE_API dReal dDot (const dReal *a, const dReal *b, int n);
+
+
+/* get the dot products of (a0,b), (a1,b), etc and return them in outsum.
+ * all vectors are n*1. if n <= 0 then zeroes will be returned (in which case
+ * the input vectors need not be valid). this function is somewhat faster
+ * than calling dDot() for all of the combinations separately.
+ */
+
+/* NOT INCLUDED in the library for now.
+void dMultidot2 (const dReal *a0, const dReal *a1,
+ const dReal *b, dReal *outsum, int n);
+*/
+
+
+/* matrix multiplication. all matrices are stored in standard row format.
+ * the digit refers to the argument that is transposed:
+ * 0: A = B * C (sizes: A:p*r B:p*q C:q*r)
+ * 1: A = B' * C (sizes: A:p*r B:q*p C:q*r)
+ * 2: A = B * C' (sizes: A:p*r B:p*q C:r*q)
+ * case 1,2 are equivalent to saying that the operation is A=B*C but
+ * B or C are stored in standard column format.
+ */
+
+ODE_API void dMultiply0 (dReal *A, const dReal *B, const dReal *C, int p,int q,int r);
+ODE_API void dMultiply1 (dReal *A, const dReal *B, const dReal *C, int p,int q,int r);
+ODE_API void dMultiply2 (dReal *A, const dReal *B, const dReal *C, int p,int q,int r);
+
+
+/* do an in-place cholesky decomposition on the lower triangle of the n*n
+ * symmetric matrix A (which is stored by rows). the resulting lower triangle
+ * will be such that L*L'=A. return 1 on success and 0 on failure (on failure
+ * the matrix is not positive definite).
+ */
+
+ODE_API int dFactorCholesky (dReal *A, int n);
+
+
+/* solve for x: L*L'*x = b, and put the result back into x.
+ * L is size n*n, b is size n*1. only the lower triangle of L is considered.
+ */
+
+ODE_API void dSolveCholesky (const dReal *L, dReal *b, int n);
+
+
+/* compute the inverse of the n*n positive definite matrix A and put it in
+ * Ainv. this is not especially fast. this returns 1 on success (A was
+ * positive definite) or 0 on failure (not PD).
+ */
+
+ODE_API int dInvertPDMatrix (const dReal *A, dReal *Ainv, int n);
+
+
+/* check whether an n*n matrix A is positive definite, return 1/0 (yes/no).
+ * positive definite means that x'*A*x > 0 for any x. this performs a
+ * cholesky decomposition of A. if the decomposition fails then the matrix
+ * is not positive definite. A is stored by rows. A is not altered.
+ */
+
+ODE_API int dIsPositiveDefinite (const dReal *A, int n);
+
+
+/* factorize a matrix A into L*D*L', where L is lower triangular with ones on
+ * the diagonal, and D is diagonal.
+ * A is an n*n matrix stored by rows, with a leading dimension of n rounded
+ * up to 4. L is written into the strict lower triangle of A (the ones are not
+ * written) and the reciprocal of the diagonal elements of D are written into
+ * d.
+ */
+ODE_API void dFactorLDLT (dReal *A, dReal *d, int n, int nskip);
+
+
+/* solve L*x=b, where L is n*n lower triangular with ones on the diagonal,
+ * and x,b are n*1. b is overwritten with x.
+ * the leading dimension of L is `nskip'.
+ */
+ODE_API void dSolveL1 (const dReal *L, dReal *b, int n, int nskip);
+
+
+/* solve L'*x=b, where L is n*n lower triangular with ones on the diagonal,
+ * and x,b are n*1. b is overwritten with x.
+ * the leading dimension of L is `nskip'.
+ */
+ODE_API void dSolveL1T (const dReal *L, dReal *b, int n, int nskip);
+
+
+/* in matlab syntax: a(1:n) = a(1:n) .* d(1:n) */
+
+ODE_API void dVectorScale (dReal *a, const dReal *d, int n);
+
+
+/* given `L', a n*n lower triangular matrix with ones on the diagonal,
+ * and `d', a n*1 vector of the reciprocal diagonal elements of an n*n matrix
+ * D, solve L*D*L'*x=b where x,b are n*1. x overwrites b.
+ * the leading dimension of L is `nskip'.
+ */
+
+ODE_API void dSolveLDLT (const dReal *L, const dReal *d, dReal *b, int n, int nskip);
+
+
+/* given an L*D*L' factorization of an n*n matrix A, return the updated
+ * factorization L2*D2*L2' of A plus the following "top left" matrix:
+ *
+ * [ b a' ] <-- b is a[0]
+ * [ a 0 ] <-- a is a[1..n-1]
+ *
+ * - L has size n*n, its leading dimension is nskip. L is lower triangular
+ * with ones on the diagonal. only the lower triangle of L is referenced.
+ * - d has size n. d contains the reciprocal diagonal elements of D.
+ * - a has size n.
+ * the result is written into L, except that the left column of L and d[0]
+ * are not actually modified. see ldltaddTL.m for further comments.
+ */
+ODE_API void dLDLTAddTL (dReal *L, dReal *d, const dReal *a, int n, int nskip);
+
+
+/* given an L*D*L' factorization of a permuted matrix A, produce a new
+ * factorization for row and column `r' removed.
+ * - A has size n1*n1, its leading dimension in nskip. A is symmetric and
+ * positive definite. only the lower triangle of A is referenced.
+ * A itself may actually be an array of row pointers.
+ * - L has size n2*n2, its leading dimension in nskip. L is lower triangular
+ * with ones on the diagonal. only the lower triangle of L is referenced.
+ * - d has size n2. d contains the reciprocal diagonal elements of D.
+ * - p is a permutation vector. it contains n2 indexes into A. each index
+ * must be in the range 0..n1-1.
+ * - r is the row/column of L to remove.
+ * the new L will be written within the old L, i.e. will have the same leading
+ * dimension. the last row and column of L, and the last element of d, are
+ * undefined on exit.
+ *
+ * a fast O(n^2) algorithm is used. see ldltremove.m for further comments.
+ */
+ODE_API void dLDLTRemove (dReal **A, const int *p, dReal *L, dReal *d,
+ int n1, int n2, int r, int nskip);
+
+
+/* given an n*n matrix A (with leading dimension nskip), remove the r'th row
+ * and column by moving elements. the new matrix will have the same leading
+ * dimension. the last row and column of A are untouched on exit.
+ */
+ODE_API void dRemoveRowCol (dReal *A, int n, int nskip, int r);
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+/* this comes from the `reuse' library. copy any changes back to the source */
+
+#ifndef _ODE_MEMORY_H_
+#define _ODE_MEMORY_H_
+
+#include "ode/config.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* function types to allocate and free memory */
+typedef void * dAllocFunction (size_t size);
+typedef void * dReallocFunction (void *ptr, size_t oldsize, size_t newsize);
+typedef void dFreeFunction (void *ptr, size_t size);
+
+/* set new memory management functions. if fn is 0, the default handlers are
+ * used. */
+ODE_API void dSetAllocHandler (dAllocFunction *fn);
+ODE_API void dSetReallocHandler (dReallocFunction *fn);
+ODE_API void dSetFreeHandler (dFreeFunction *fn);
+
+/* get current memory management functions */
+ODE_API dAllocFunction *dGetAllocHandler (void);
+ODE_API dReallocFunction *dGetReallocHandler (void);
+ODE_API dFreeFunction *dGetFreeHandler (void);
+
+/* allocate and free memory. */
+ODE_API void * dAlloc (size_t size);
+ODE_API void * dRealloc (void *ptr, size_t oldsize, size_t newsize);
+ODE_API void dFree (void *ptr, size_t size);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+/* miscellaneous math functions. these are mostly useful for testing */
+
+#ifndef _ODE_MISC_H_
+#define _ODE_MISC_H_
+
+#include <ode/common.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+/* return 1 if the random number generator is working. */
+ODE_API int dTestRand(void);
+
+/* return next 32 bit random number. this uses a not-very-random linear
+ * congruential method.
+ */
+ODE_API unsigned long dRand(void);
+
+/* get and set the current random number seed. */
+ODE_API unsigned long dRandGetSeed(void);
+ODE_API void dRandSetSeed (unsigned long s);
+
+/* return a random integer between 0..n-1. the distribution will get worse
+ * as n approaches 2^32.
+ */
+ODE_API int dRandInt (int n);
+
+/* return a random real number between 0..1 */
+ODE_API dReal dRandReal(void);
+
+/* print out a matrix */
+#ifdef __cplusplus
+ODE_API void dPrintMatrix (const dReal *A, int n, int m, char *fmt = "%10.4f ",
+ FILE *f=stdout);
+#else
+ODE_API void dPrintMatrix (const dReal *A, int n, int m, char *fmt, FILE *f);
+#endif
+
+/* make a random vector with entries between +/- range. A has n elements. */
+ODE_API void dMakeRandomVector (dReal *A, int n, dReal range);
+
+/* make a random matrix with entries between +/- range. A has size n*m. */
+ODE_API void dMakeRandomMatrix (dReal *A, int n, int m, dReal range);
+
+/* clear the upper triangle of a square matrix */
+ODE_API void dClearUpperTriangle (dReal *A, int n);
+
+/* return the maximum element difference between the two n*m matrices */
+ODE_API dReal dMaxDifference (const dReal *A, const dReal *B, int n, int m);
+
+/* return the maximum element difference between the lower triangle of two
+ * n*n matrices */
+ODE_API dReal dMaxDifferenceLowerTriangle (const dReal *A, const dReal *B, int n);
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_OBJECTS_H_
+#define _ODE_OBJECTS_H_
+
+#include <ode/common.h>
+#include <ode/mass.h>
+#include <ode/contact.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * @defgroup world World
+ *
+ * The world object is a container for rigid bodies and joints. Objects in
+ * different worlds can not interact, for example rigid bodies from two
+ * different worlds can not collide.
+ *
+ * All the objects in a world exist at the same point in time, thus one
+ * reason to use separate worlds is to simulate systems at different rates.
+ * Most applications will only need one world.
+ */
+
+
+/**
+ * @brief Create a new, empty world and return its ID number.
+ * @return an identifier
+ * @ingroup world
+ */
+ODE_API dWorldID dWorldCreate(void);
+
+
+/**
+ * @brief Destroy a world and everything in it.
+ *
+ * This includes all bodies, and all joints that are not part of a joint
+ * group. Joints that are part of a joint group will be deactivated, and
+ * can be destroyed by calling, for example, dJointGroupEmpty().
+ * @ingroup world
+ * @param world the identifier for the world the be destroyed.
+ */
+ODE_API void dWorldDestroy (dWorldID world);
+
+
+/**
+ * @brief Set the world's global gravity vector.
+ *
+ * The units are m/s^2, so Earth's gravity vector would be (0,0,-9.81),
+ * assuming that +z is up. The default is no gravity, i.e. (0,0,0).
+ *
+ * @ingroup world
+ */
+ODE_API void dWorldSetGravity (dWorldID, dReal x, dReal y, dReal z);
+
+
+/**
+ * @brief Get the gravity vector for a given world.
+ * @ingroup world
+ */
+ODE_API void dWorldGetGravity (dWorldID, dVector3 gravity);
+
+
+/**
+ * @brief Set the global ERP value, that controls how much error
+ * correction is performed in each time step.
+ * @ingroup world
+ * @param dWorldID the identifier of the world.
+ * @param erp Typical values are in the range 0.1--0.8. The default is 0.2.
+ */
+ODE_API void dWorldSetERP (dWorldID, dReal erp);
+
+/**
+ * @brief Get the error reduction parameter.
+ * @ingroup world
+ * @return ERP value
+ */
+ODE_API dReal dWorldGetERP (dWorldID);
+
+
+/**
+ * @brief Set the global CFM (constraint force mixing) value.
+ * @ingroup world
+ * @param cfm Typical values are in the range @m{10^{-9}} -- 1.
+ * The default is 10^-5 if single precision is being used, or 10^-10
+ * if double precision is being used.
+ */
+ODE_API void dWorldSetCFM (dWorldID, dReal cfm);
+
+/**
+ * @brief Get the constraint force mixing value.
+ * @ingroup world
+ * @return CFM value
+ */
+ODE_API dReal dWorldGetCFM (dWorldID);
+
+
+/**
+ * @brief Step the world.
+ *
+ * This uses a "big matrix" method that takes time on the order of m^3
+ * and memory on the order of m^2, where m is the total number of constraint
+ * rows. For large systems this will use a lot of memory and can be very slow,
+ * but this is currently the most accurate method.
+ * @ingroup world
+ * @param stepsize The number of seconds that the simulation has to advance.
+ */
+ODE_API void dWorldStep (dWorldID, dReal stepsize);
+
+
+/**
+ * @brief Converts an impulse to a force.
+ * @ingroup world
+ * @remarks
+ * If you want to apply a linear or angular impulse to a rigid body,
+ * instead of a force or a torque, then you can use this function to convert
+ * the desired impulse into a force/torque vector before calling the
+ * BodyAdd... function.
+ * The current algorithm simply scales the impulse by 1/stepsize,
+ * where stepsize is the step size for the next step that will be taken.
+ * This function is given a dWorldID because, in the future, the force
+ * computation may depend on integrator parameters that are set as
+ * properties of the world.
+ */
+ODE_API void dWorldImpulseToForce
+(
+ dWorldID, dReal stepsize,
+ dReal ix, dReal iy, dReal iz, dVector3 force
+);
+
+
+/**
+ * @brief Step the world.
+ * @ingroup world
+ * @remarks
+ * This uses an iterative method that takes time on the order of m*N
+ * and memory on the order of m, where m is the total number of constraint
+ * rows N is the number of iterations.
+ * For large systems this is a lot faster than dWorldStep(),
+ * but it is less accurate.
+ * @remarks
+ * QuickStep is great for stacks of objects especially when the
+ * auto-disable feature is used as well.
+ * However, it has poor accuracy for near-singular systems.
+ * Near-singular systems can occur when using high-friction contacts, motors,
+ * or certain articulated structures. For example, a robot with multiple legs
+ * sitting on the ground may be near-singular.
+ * @remarks
+ * There are ways to help overcome QuickStep's inaccuracy problems:
+ * \li Increase CFM.
+ * \li Reduce the number of contacts in your system (e.g. use the minimum
+ * number of contacts for the feet of a robot or creature).
+ * \li Don't use excessive friction in the contacts.
+ * \li Use contact slip if appropriate
+ * \li Avoid kinematic loops (however, kinematic loops are inevitable in
+ * legged creatures).
+ * \li Don't use excessive motor strength.
+ * \liUse force-based motors instead of velocity-based motors.
+ *
+ * Increasing the number of QuickStep iterations may help a little bit, but
+ * it is not going to help much if your system is really near singular.
+ */
+ODE_API void dWorldQuickStep (dWorldID w, dReal stepsize);
+
+
+/**
+ * @brief Set the number of iterations that the QuickStep method performs per
+ * step.
+ * @ingroup world
+ * @remarks
+ * More iterations will give a more accurate solution, but will take
+ * longer to compute.
+ * @param num The default is 20 iterations.
+ */
+ODE_API void dWorldSetQuickStepNumIterations (dWorldID, int num);
+
+
+/**
+ * @brief Get the number of iterations that the QuickStep method performs per
+ * step.
+ * @ingroup world
+ * @return nr of iterations
+ */
+ODE_API int dWorldGetQuickStepNumIterations (dWorldID);
+
+/**
+ * @brief Set the SOR over-relaxation parameter
+ * @ingroup world
+ * @param over_relaxation value to use by SOR
+ */
+ODE_API void dWorldSetQuickStepW (dWorldID, dReal over_relaxation);
+
+/**
+ * @brief Get the SOR over-relaxation parameter
+ * @ingroup world
+ * @returns the over-relaxation setting
+ */
+ODE_API dReal dWorldGetQuickStepW (dWorldID);
+
+/* World contact parameter functions */
+
+/**
+ * @brief Set the maximum correcting velocity that contacts are allowed
+ * to generate.
+ * @ingroup world
+ * @param vel The default value is infinity (i.e. no limit).
+ * @remarks
+ * Reducing this value can help prevent "popping" of deeply embedded objects.
+ */
+ODE_API void dWorldSetContactMaxCorrectingVel (dWorldID, dReal vel);
+
+/**
+ * @brief Get the maximum correcting velocity that contacts are allowed
+ * to generated.
+ * @ingroup world
+ */
+ODE_API dReal dWorldGetContactMaxCorrectingVel (dWorldID);
+
+/**
+ * @brief Set the depth of the surface layer around all geometry objects.
+ * @ingroup world
+ * @remarks
+ * Contacts are allowed to sink into the surface layer up to the given
+ * depth before coming to rest.
+ * @param depth The default value is zero.
+ * @remarks
+ * Increasing this to some small value (e.g. 0.001) can help prevent
+ * jittering problems due to contacts being repeatedly made and broken.
+ */
+ODE_API void dWorldSetContactSurfaceLayer (dWorldID, dReal depth);
+
+/**
+ * @brief Get the depth of the surface layer around all geometry objects.
+ * @ingroup world
+ * @returns the depth
+ */
+ODE_API dReal dWorldGetContactSurfaceLayer (dWorldID);
+
+/* StepFast1 functions */
+
+/**
+ * @brief Step the world using the StepFast1 algorithm.
+ * @param stepsize the nr of seconds to advance the simulation.
+ * @param maxiterations The number of iterations to perform.
+ * @ingroup world
+ */
+ODE_API void dWorldStepFast1(dWorldID, dReal stepsize, int maxiterations);
+
+
+/**
+ * @defgroup disable Automatic Enabling and Disabling
+ *
+ * Every body can be enabled or disabled. Enabled bodies participate in the
+ * simulation, while disabled bodies are turned off and do not get updated
+ * during a simulation step. New bodies are always created in the enabled state.
+ *
+ * A disabled body that is connected through a joint to an enabled body will be
+ * automatically re-enabled at the next simulation step.
+ *
+ * Disabled bodies do not consume CPU time, therefore to speed up the simulation
+ * bodies should be disabled when they come to rest. This can be done automatically
+ * with the auto-disable feature.
+ *
+ * If a body has its auto-disable flag turned on, it will automatically disable
+ * itself when
+ * @li It has been idle for a given number of simulation steps.
+ * @li It has also been idle for a given amount of simulation time.
+ *
+ * A body is considered to be idle when the magnitudes of both its linear velocity
+ * and angular velocity are below given thresholds.
+ *
+ * Thus, every body has five auto-disable parameters: an enabled flag, a idle step
+ * count, an idle time, and linear/angular velocity thresholds. Newly created bodies
+ * get these parameters from world.
+ */
+
+/**
+ * @brief Set the AutoEnableDepth parameter used by the StepFast1 algorithm.
+ * @ingroup disable
+ */
+ODE_API void dWorldSetAutoEnableDepthSF1(dWorldID, int autoEnableDepth);
+
+/**
+ * @brief Get the AutoEnableDepth parameter used by the StepFast1 algorithm.
+ * @ingroup disable
+ */
+ODE_API int dWorldGetAutoEnableDepthSF1(dWorldID);
+
+/**
+ * @brief Get auto disable linear threshold for newly created bodies.
+ * @ingroup disable
+ * @return the threshold
+ */
+ODE_API dReal dWorldGetAutoDisableLinearThreshold (dWorldID);
+
+/**
+ * @brief Set auto disable linear threshold for newly created bodies.
+ * @param linear_threshold default is 0.01
+ * @ingroup disable
+ */
+ODE_API void dWorldSetAutoDisableLinearThreshold (dWorldID, dReal linear_threshold);
+
+/**
+ * @brief Get auto disable angular threshold for newly created bodies.
+ * @ingroup disable
+ * @return the threshold
+ */
+ODE_API dReal dWorldGetAutoDisableAngularThreshold (dWorldID);
+
+/**
+ * @brief Set auto disable angular threshold for newly created bodies.
+ * @param linear_threshold default is 0.01
+ * @ingroup disable
+ */
+ODE_API void dWorldSetAutoDisableAngularThreshold (dWorldID, dReal angular_threshold);
+
+/**
+ * @brief Get auto disable steps for newly created bodies.
+ * @ingroup disable
+ * @return nr of steps
+ */
+ODE_API int dWorldGetAutoDisableSteps (dWorldID);
+
+/**
+ * @brief Set auto disable steps for newly created bodies.
+ * @ingroup disable
+ * @param steps default is 10
+ */
+ODE_API void dWorldSetAutoDisableSteps (dWorldID, int steps);
+
+/**
+ * @brief Get auto disable time for newly created bodies.
+ * @ingroup disable
+ * @return nr of seconds
+ */
+ODE_API dReal dWorldGetAutoDisableTime (dWorldID);
+
+/**
+ * @brief Set auto disable time for newly created bodies.
+ * @ingroup disable
+ * @param time default is 0 seconds
+ */
+ODE_API void dWorldSetAutoDisableTime (dWorldID, dReal time);
+
+/**
+ * @brief Get auto disable flag for newly created bodies.
+ * @ingroup disable
+ * @return 0 or 1
+ */
+ODE_API int dWorldGetAutoDisableFlag (dWorldID);
+
+/**
+ * @brief Set auto disable flag for newly created bodies.
+ * @ingroup disable
+ * @param do_auto_disable default is false.
+ */
+ODE_API void dWorldSetAutoDisableFlag (dWorldID, int do_auto_disable);
+
+
+
+/**
+ * @defgroup bodies Rigid Bodies
+ *
+ * A rigid body has various properties from the point of view of the
+ * simulation. Some properties change over time:
+ *
+ * @li Position vector (x,y,z) of the body's point of reference.
+ * Currently the point of reference must correspond to the body's center of mass.
+ * @li Linear velocity of the point of reference, a vector (vx,vy,vz).
+ * @li Orientation of a body, represented by a quaternion (qs,qx,qy,qz) or
+ * a 3x3 rotation matrix.
+ * @li Angular velocity vector (wx,wy,wz) which describes how the orientation
+ * changes over time.
+ *
+ * Other body properties are usually constant over time:
+ *
+ * @li Mass of the body.
+ * @li Position of the center of mass with respect to the point of reference.
+ * In the current implementation the center of mass and the point of
+ * reference must coincide.
+ * @li Inertia matrix. This is a 3x3 matrix that describes how the body's mass
+ * is distributed around the center of mass. Conceptually each body has an
+ * x-y-z coordinate frame embedded in it that moves and rotates with the body.
+ *
+ * The origin of this coordinate frame is the body's point of reference. Some values
+ * in ODE (vectors, matrices etc) are relative to the body coordinate frame, and others
+ * are relative to the global coordinate frame.
+ *
+ * Note that the shape of a rigid body is not a dynamical property (except insofar as
+ * it influences the various mass properties). It is only collision detection that cares
+ * about the detailed shape of the body.
+ */
+
+
+/**
+ * @brief Get auto disable linear threshold.
+ * @ingroup bodies
+ * @return the threshold
+ */
+ODE_API dReal dBodyGetAutoDisableLinearThreshold (dBodyID);
+
+/**
+ * @brief Set auto disable linear threshold.
+ * @ingroup bodies
+ * @return the threshold
+ */
+ODE_API void dBodySetAutoDisableLinearThreshold (dBodyID, dReal linear_threshold);
+
+/**
+ * @brief Get auto disable angular threshold.
+ * @ingroup bodies
+ * @return the threshold
+ */
+ODE_API dReal dBodyGetAutoDisableAngularThreshold (dBodyID);
+
+/**
+ * @brief Set auto disable angular threshold.
+ * @ingroup bodies
+ * @return the threshold
+ */
+ODE_API void dBodySetAutoDisableAngularThreshold (dBodyID, dReal angular_threshold);
+
+/**
+ * @brief Get auto disable steps.
+ * @ingroup bodies
+ * @return the nr of steps
+ */
+ODE_API int dBodyGetAutoDisableSteps (dBodyID);
+
+/**
+ * @brief Set auto disable steps.
+ * @ingroup bodies
+ * @param steps the nr of steps.
+ */
+ODE_API void dBodySetAutoDisableSteps (dBodyID, int steps);
+
+/**
+ * @brief Get auto disable time.
+ * @ingroup bodies
+ * @return nr of seconds
+ */
+ODE_API dReal dBodyGetAutoDisableTime (dBodyID);
+
+/**
+ * @brief Set auto disable time.
+ * @ingroup bodies
+ * @param time nr of seconds.
+ */
+ODE_API void dBodySetAutoDisableTime (dBodyID, dReal time);
+
+/**
+ * @brief Get auto disable flag.
+ * @ingroup bodies
+ * @return 0 or 1
+ */
+ODE_API int dBodyGetAutoDisableFlag (dBodyID);
+
+/**
+ * @brief Set auto disable flag.
+ * @ingroup bodies
+ * @param do_auto_disable 0 or 1
+ */
+ODE_API void dBodySetAutoDisableFlag (dBodyID, int do_auto_disable);
+
+/**
+ * @brief Set auto disable defaults.
+ * @remarks
+ * Set the values for the body to those set as default for the world.
+ * @ingroup bodies
+ */
+ODE_API void dBodySetAutoDisableDefaults (dBodyID);
+
+
+
+/**
+ * @brief Create a body in given world.
+ * @remarks
+ * Default mass parameters are at position (0,0,0).
+ * @ingroup bodies
+ */
+ODE_API dBodyID dBodyCreate (dWorldID);
+
+/**
+ * @brief Destroy a body.
+ * @remarks
+ * All joints that are attached to this body will be put into limbo:
+ * i.e. unattached and not affecting the simulation, but they will NOT be
+ * deleted.
+ * @ingroup bodies
+ */
+ODE_API void dBodyDestroy (dBodyID);
+
+/**
+ * @brief Set the body's user-data pointer.
+ * @ingroup bodies
+ * @param data arbitraty pointer
+ */
+ODE_API void dBodySetData (dBodyID, void *data);
+
+/**
+ * @brief Get the body's user-data pointer.
+ * @ingroup bodies
+ * @return a pointer to the user's data.
+ */
+ODE_API void *dBodyGetData (dBodyID);
+
+/**
+ * @brief Set position of a body.
+ * @remarks
+ * After setting, the outcome of the simulation is undefined
+ * if the new configuration is inconsistent with the joints/constraints
+ * that are present.
+ * @ingroup bodies
+ */
+ODE_API void dBodySetPosition (dBodyID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief Set the orientation of a body.
+ * @ingroup bodies
+ * @remarks
+ * After setting, the outcome of the simulation is undefined
+ * if the new configuration is inconsistent with the joints/constraints
+ * that are present.
+ */
+ODE_API void dBodySetRotation (dBodyID, const dMatrix3 R);
+
+/**
+ * @brief Set the orientation of a body.
+ * @ingroup bodies
+ * @remarks
+ * After setting, the outcome of the simulation is undefined
+ * if the new configuration is inconsistent with the joints/constraints
+ * that are present.
+ */
+ODE_API void dBodySetQuaternion (dBodyID, const dQuaternion q);
+
+/**
+ * @brief Set the linear velocity of a body.
+ * @ingroup bodies
+ */
+ODE_API void dBodySetLinearVel (dBodyID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief Set the angular velocity of a body.
+ * @ingroup bodies
+ */
+ODE_API void dBodySetAngularVel (dBodyID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief Get the position of a body.
+ * @ingroup bodies
+ * @remarks
+ * When getting, the returned values are pointers to internal data structures,
+ * so the vectors are valid until any changes are made to the rigid body
+ * system structure.
+ * @sa dBodyCopyPosition
+ */
+ODE_API const dReal * dBodyGetPosition (dBodyID);
+
+
+/**
+ * @brief Copy the position of a body into a vector.
+ * @ingroup bodies
+ * @param body the body to query
+ * @param pos a copy of the body position
+ * @sa dBodyGetPosition
+ */
+ODE_API void dBodyCopyPosition (dBodyID body, dVector3 pos);
+
+
+/**
+ * @brief Get the rotation of a body.
+ * @ingroup bodies
+ * @return pointer to a 4x3 rotation matrix.
+ */
+ODE_API const dReal * dBodyGetRotation (dBodyID);
+
+/**
+ * @brief Get the rotation of a body.
+ * @ingroup bodies
+ * @return pointer to 4 scalars that represent the quaternion.
+ */
+ODE_API const dReal * dBodyGetQuaternion (dBodyID);
+
+
+/**
+ * @brief Copy the orientation of a body into a quaternion.
+ * @ingroup bodies
+ * @param body the body to query
+ * @param quat a copy of the orientation quaternion
+ * @sa dBodyGetQuaternion
+ */
+ODE_API void dBodyCopyQuaternion(dBodyID body, dQuaternion quat);
+
+
+/**
+ * @brief Get the linear velocity of a body.
+ * @ingroup bodies
+ */
+ODE_API const dReal * dBodyGetLinearVel (dBodyID);
+
+/**
+ * @brief Get the angular velocity of a body.
+ * @ingroup bodies
+ */
+ODE_API const dReal * dBodyGetAngularVel (dBodyID);
+
+/**
+ * @brief Set the mass of a body.
+ * @ingroup bodies
+ */
+ODE_API void dBodySetMass (dBodyID, const dMass *mass);
+
+/**
+ * @brief Get the mass of a body.
+ * @ingroup bodies
+ */
+ODE_API void dBodyGetMass (dBodyID, dMass *mass);
+
+/**
+ * @brief Add force at centre of mass of body in absolute coordinates.
+ * @ingroup bodies
+ */
+ODE_API void dBodyAddForce (dBodyID, dReal fx, dReal fy, dReal fz);
+
+/**
+ * @brief Add torque at centre of mass of body in absolute coordinates.
+ * @ingroup bodies
+ */
+ODE_API void dBodyAddTorque (dBodyID, dReal fx, dReal fy, dReal fz);
+
+/**
+ * @brief Add force at centre of mass of body in coordinates relative to body.
+ * @ingroup bodies
+ */
+ODE_API void dBodyAddRelForce (dBodyID, dReal fx, dReal fy, dReal fz);
+
+/**
+ * @brief Add torque at centre of mass of body in coordinates relative to body.
+ * @ingroup bodies
+ */
+ODE_API void dBodyAddRelTorque (dBodyID, dReal fx, dReal fy, dReal fz);
+
+/**
+ * @brief Add force at specified point in body in global coordinates.
+ * @ingroup bodies
+ */
+ODE_API void dBodyAddForceAtPos (dBodyID, dReal fx, dReal fy, dReal fz,
+ dReal px, dReal py, dReal pz);
+/**
+ * @brief Add force at specified point in body in local coordinates.
+ * @ingroup bodies
+ */
+ODE_API void dBodyAddForceAtRelPos (dBodyID, dReal fx, dReal fy, dReal fz,
+ dReal px, dReal py, dReal pz);
+/**
+ * @brief Add force at specified point in body in global coordinates.
+ * @ingroup bodies
+ */
+ODE_API void dBodyAddRelForceAtPos (dBodyID, dReal fx, dReal fy, dReal fz,
+ dReal px, dReal py, dReal pz);
+/**
+ * @brief Add force at specified point in body in local coordinates.
+ * @ingroup bodies
+ */
+ODE_API void dBodyAddRelForceAtRelPos (dBodyID, dReal fx, dReal fy, dReal fz,
+ dReal px, dReal py, dReal pz);
+
+/**
+ * @brief Return the current accumulated force vector.
+ * @return points to an array of 3 reals.
+ * @remarks
+ * The returned values are pointers to internal data structures, so
+ * the vectors are only valid until any changes are made to the rigid
+ * body system.
+ * @ingroup bodies
+ */
+ODE_API const dReal * dBodyGetForce (dBodyID);
+
+/**
+ * @brief Return the current accumulated torque vector.
+ * @return points to an array of 3 reals.
+ * @remarks
+ * The returned values are pointers to internal data structures, so
+ * the vectors are only valid until any changes are made to the rigid
+ * body system.
+ * @ingroup bodies
+ */
+ODE_API const dReal * dBodyGetTorque (dBodyID);
+
+/**
+ * @brief Set the body force accumulation vector.
+ * @remarks
+ * This is mostly useful to zero the force and torque for deactivated bodies
+ * before they are reactivated, in the case where the force-adding functions
+ * were called on them while they were deactivated.
+ * @ingroup bodies
+ */
+ODE_API void dBodySetForce (dBodyID b, dReal x, dReal y, dReal z);
+
+/**
+ * @brief Set the body torque accumulation vector.
+ * @remarks
+ * This is mostly useful to zero the force and torque for deactivated bodies
+ * before they are reactivated, in the case where the force-adding functions
+ * were called on them while they were deactivated.
+ * @ingroup bodies
+ */
+ODE_API void dBodySetTorque (dBodyID b, dReal x, dReal y, dReal z);
+
+/**
+ * @brief Get world position of a relative point on body.
+ * @ingroup bodies
+ * @param result will contain the result.
+ */
+ODE_API void dBodyGetRelPointPos
+(
+ dBodyID, dReal px, dReal py, dReal pz,
+ dVector3 result
+);
+
+/**
+ * @brief Get velocity vector in global coords of a relative point on body.
+ * @ingroup bodies
+ * @param result will contain the result.
+ */
+ODE_API void dBodyGetRelPointVel
+(
+ dBodyID, dReal px, dReal py, dReal pz,
+ dVector3 result
+);
+
+/**
+ * @brief Get velocity vector in global coords of a globally
+ * specified point on a body.
+ * @ingroup bodies
+ * @param result will contain the result.
+ */
+ODE_API void dBodyGetPointVel
+(
+ dBodyID, dReal px, dReal py, dReal pz,
+ dVector3 result
+);
+
+/**
+ * @brief takes a point in global coordinates and returns
+ * the point's position in body-relative coordinates.
+ * @remarks
+ * This is the inverse of dBodyGetRelPointPos()
+ * @ingroup bodies
+ * @param result will contain the result.
+ */
+ODE_API void dBodyGetPosRelPoint
+(
+ dBodyID, dReal px, dReal py, dReal pz,
+ dVector3 result
+);
+
+/**
+ * @brief Convert from local to world coordinates.
+ * @ingroup bodies
+ * @param result will contain the result.
+ */
+ODE_API void dBodyVectorToWorld
+(
+ dBodyID, dReal px, dReal py, dReal pz,
+ dVector3 result
+);
+
+/**
+ * @brief Convert from world to local coordinates.
+ * @ingroup bodies
+ * @param result will contain the result.
+ */
+ODE_API void dBodyVectorFromWorld
+(
+ dBodyID, dReal px, dReal py, dReal pz,
+ dVector3 result
+);
+
+/**
+ * @brief controls the way a body's orientation is updated at each timestep.
+ * @ingroup bodies
+ * @param mode can be 0 or 1:
+ * \li 0: An ``infinitesimal'' orientation update is used.
+ * This is fast to compute, but it can occasionally cause inaccuracies
+ * for bodies that are rotating at high speed, especially when those
+ * bodies are joined to other bodies.
+ * This is the default for every new body that is created.
+ * \li 1: A ``finite'' orientation update is used.
+ * This is more costly to compute, but will be more accurate for high
+ * speed rotations.
+ * @remarks
+ * Note however that high speed rotations can result in many types of
+ * error in a simulation, and the finite mode will only fix one of those
+ * sources of error.
+ */
+ODE_API void dBodySetFiniteRotationMode (dBodyID, int mode);
+
+/**
+ * @brief sets the finite rotation axis for a body.
+ * @ingroup bodies
+ * @remarks
+ * This is axis only has meaning when the finite rotation mode is set
+ * If this axis is zero (0,0,0), full finite rotations are performed on
+ * the body.
+ * If this axis is nonzero, the body is rotated by performing a partial finite
+ * rotation along the axis direction followed by an infinitesimal rotation
+ * along an orthogonal direction.
+ * @remarks
+ * This can be useful to alleviate certain sources of error caused by quickly
+ * spinning bodies. For example, if a car wheel is rotating at high speed
+ * you can call this function with the wheel's hinge axis as the argument to
+ * try and improve its behavior.
+ */
+ODE_API void dBodySetFiniteRotationAxis (dBodyID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief Get the way a body's orientation is updated each timestep.
+ * @ingroup bodies
+ * @return the mode 0 (infitesimal) or 1 (finite).
+ */
+ODE_API int dBodyGetFiniteRotationMode (dBodyID);
+
+/**
+ * @brief Get the finite rotation axis.
+ * @param result will contain the axis.
+ * @ingroup bodies
+ */
+ODE_API void dBodyGetFiniteRotationAxis (dBodyID, dVector3 result);
+
+/**
+ * @brief Get the number of joints that are attached to this body.
+ * @ingroup bodies
+ * @return nr of joints
+ */
+ODE_API int dBodyGetNumJoints (dBodyID b);
+
+/**
+ * @brief Return a joint attached to this body, given by index.
+ * @ingroup bodies
+ * @param index valid range is 0 to n-1 where n is the value returned by
+ * dBodyGetNumJoints().
+ */
+ODE_API dJointID dBodyGetJoint (dBodyID, int index);
+
+/**
+ * @brief Manually enable a body.
+ * @param dBodyID identification of body.
+ * @ingroup bodies
+ */
+ODE_API void dBodyEnable (dBodyID);
+
+/**
+ * @brief Manually disable a body.
+ * @ingroup bodies
+ * @remarks
+ * A disabled body that is connected through a joint to an enabled body will
+ * be automatically re-enabled at the next simulation step.
+ */
+ODE_API void dBodyDisable (dBodyID);
+
+/**
+ * @brief Check wether a body is enabled.
+ * @ingroup bodies
+ * @return 1 if a body is currently enabled or 0 if it is disabled.
+ */
+ODE_API int dBodyIsEnabled (dBodyID);
+
+/**
+ * @brief Set whether the body is influenced by the world's gravity or not.
+ * @ingroup bodies
+ * @param mode when nonzero gravity affects this body.
+ * @remarks
+ * Newly created bodies are always influenced by the world's gravity.
+ */
+ODE_API void dBodySetGravityMode (dBodyID b, int mode);
+
+/**
+ * @brief Get whether the body is influenced by the world's gravity or not.
+ * @ingroup bodies
+ * @return nonzero means gravity affects this body.
+ */
+ODE_API int dBodyGetGravityMode (dBodyID b);
+
+
+
+/**
+ * @defgroup joints Joints
+ *
+ * In real life a joint is something like a hinge, that is used to connect two
+ * objects.
+ * In ODE a joint is very similar: It is a relationship that is enforced between
+ * two bodies so that they can only have certain positions and orientations
+ * relative to each other.
+ * This relationship is called a constraint -- the words joint and
+ * constraint are often used interchangeably.
+ *
+ * A joint has a set of parameters that can be set. These include:
+ *
+ *
+ * \li dParamLoStop Low stop angle or position. Setting this to
+ * -dInfinity (the default value) turns off the low stop.
+ * For rotational joints, this stop must be greater than -pi to be
+ * effective.
+ * \li dParamHiStop High stop angle or position. Setting this to
+ * dInfinity (the default value) turns off the high stop.
+ * For rotational joints, this stop must be less than pi to be
+ * effective.
+ * If the high stop is less than the low stop then both stops will
+ * be ineffective.
+ * \li dParamVel Desired motor velocity (this will be an angular or
+ * linear velocity).
+ * \li dParamFMax The maximum force or torque that the motor will use to
+ * achieve the desired velocity.
+ * This must always be greater than or equal to zero.
+ * Setting this to zero (the default value) turns off the motor.
+ * \li dParamFudgeFactor The current joint stop/motor implementation has
+ * a small problem:
+ * when the joint is at one stop and the motor is set to move it away
+ * from the stop, too much force may be applied for one time step,
+ * causing a ``jumping'' motion.
+ * This fudge factor is used to scale this excess force.
+ * It should have a value between zero and one (the default value).
+ * If the jumping motion is too visible in a joint, the value can be
+ * reduced.
+ * Making this value too small can prevent the motor from being able to
+ * move the joint away from a stop.
+ * \li dParamBounce The bouncyness of the stops.
+ * This is a restitution parameter in the range 0..1.
+ * 0 means the stops are not bouncy at all, 1 means maximum bouncyness.
+ * \li dParamCFM The constraint force mixing (CFM) value used when not
+ * at a stop.
+ * \li dParamStopERP The error reduction parameter (ERP) used by the
+ * stops.
+ * \li dParamStopCFM The constraint force mixing (CFM) value used by the
+ * stops. Together with the ERP value this can be used to get spongy or
+ * soft stops.
+ * Note that this is intended for unpowered joints, it does not really
+ * work as expected when a powered joint reaches its limit.
+ * \li dParamSuspensionERP Suspension error reduction parameter (ERP).
+ * Currently this is only implemented on the hinge-2 joint.
+ * \li dParamSuspensionCFM Suspension constraint force mixing (CFM) value.
+ * Currently this is only implemented on the hinge-2 joint.
+ *
+ * If a particular parameter is not implemented by a given joint, setting it
+ * will have no effect.
+ * These parameter names can be optionally followed by a digit (2 or 3)
+ * to indicate the second or third set of parameters, e.g. for the second axis
+ * in a hinge-2 joint, or the third axis in an AMotor joint.
+ */
+
+
+/**
+ * @brief Create a new joint of the ball type.
+ * @ingroup joints
+ * @remarks
+ * The joint is initially in "limbo" (i.e. it has no effect on the simulation)
+ * because it does not connect to any bodies.
+ * @param dJointGroupID set to 0 to allocate the joint normally.
+ * If it is nonzero the joint is allocated in the given joint group.
+ */
+ODE_API dJointID dJointCreateBall (dWorldID, dJointGroupID);
+
+/**
+ * @brief Create a new joint of the hinge type.
+ * @ingroup joints
+ * @param dJointGroupID set to 0 to allocate the joint normally.
+ * If it is nonzero the joint is allocated in the given joint group.
+ */
+ODE_API dJointID dJointCreateHinge (dWorldID, dJointGroupID);
+
+/**
+ * @brief Create a new joint of the slider type.
+ * @ingroup joints
+ * @param dJointGroupID set to 0 to allocate the joint normally.
+ * If it is nonzero the joint is allocated in the given joint group.
+ */
+ODE_API dJointID dJointCreateSlider (dWorldID, dJointGroupID);
+
+/**
+ * @brief Create a new joint of the contact type.
+ * @ingroup joints
+ * @param dJointGroupID set to 0 to allocate the joint normally.
+ * If it is nonzero the joint is allocated in the given joint group.
+ */
+ODE_API dJointID dJointCreateContact (dWorldID, dJointGroupID, const dContact *);
+
+/**
+ * @brief Create a new joint of the hinge2 type.
+ * @ingroup joints
+ * @param dJointGroupID set to 0 to allocate the joint normally.
+ * If it is nonzero the joint is allocated in the given joint group.
+ */
+ODE_API dJointID dJointCreateHinge2 (dWorldID, dJointGroupID);
+
+/**
+ * @brief Create a new joint of the universal type.
+ * @ingroup joints
+ * @param dJointGroupID set to 0 to allocate the joint normally.
+ * If it is nonzero the joint is allocated in the given joint group.
+ */
+ODE_API dJointID dJointCreateUniversal (dWorldID, dJointGroupID);
+
+/**
+ * @brief Create a new joint of the fixed type.
+ * @ingroup joints
+ * @param dJointGroupID set to 0 to allocate the joint normally.
+ * If it is nonzero the joint is allocated in the given joint group.
+ */
+ODE_API dJointID dJointCreateFixed (dWorldID, dJointGroupID);
+
+ODE_API dJointID dJointCreateNull (dWorldID, dJointGroupID);
+
+/**
+ * @brief Create a new joint of the A-motor type.
+ * @ingroup joints
+ * @param dJointGroupID set to 0 to allocate the joint normally.
+ * If it is nonzero the joint is allocated in the given joint group.
+ */
+ODE_API dJointID dJointCreateAMotor (dWorldID, dJointGroupID);
+
+/**
+ * @brief Create a new joint of the L-motor type.
+ * @ingroup joints
+ * @param dJointGroupID set to 0 to allocate the joint normally.
+ * If it is nonzero the joint is allocated in the given joint group.
+ */
+ODE_API dJointID dJointCreateLMotor (dWorldID, dJointGroupID);
+
+/**
+ * @brief Create a new joint of the plane-2d type.
+ * @ingroup joints
+ * @param dJointGroupID set to 0 to allocate the joint normally.
+ * If it is nonzero the joint is allocated in the given joint group.
+ */
+ODE_API dJointID dJointCreatePlane2D (dWorldID, dJointGroupID);
+
+/**
+ * @brief Destroy a joint.
+ * @ingroup joints
+ *
+ * disconnects it from its attached bodies and removing it from the world.
+ * However, if the joint is a member of a group then this function has no
+ * effect - to destroy that joint the group must be emptied or destroyed.
+ */
+ODE_API void dJointDestroy (dJointID);
+
+
+/**
+ * @brief Create a joint group
+ * @ingroup joints
+ * @param max_size deprecated. Set to 0.
+ */
+ODE_API dJointGroupID dJointGroupCreate (int max_size);
+
+/**
+ * @brief Destroy a joint group.
+ * @ingroup joints
+ *
+ * All joints in the joint group will be destroyed.
+ */
+ODE_API void dJointGroupDestroy (dJointGroupID);
+
+/**
+ * @brief Empty a joint group.
+ * @ingroup joints
+ *
+ * All joints in the joint group will be destroyed,
+ * but the joint group itself will not be destroyed.
+ */
+ODE_API void dJointGroupEmpty (dJointGroupID);
+
+/**
+ * @brief Attach the joint to some new bodies.
+ * @ingroup joints
+ *
+ * If the joint is already attached, it will be detached from the old bodies
+ * first.
+ * To attach this joint to only one body, set body1 or body2 to zero - a zero
+ * body refers to the static environment.
+ * Setting both bodies to zero puts the joint into "limbo", i.e. it will
+ * have no effect on the simulation.
+ * @remarks
+ * Some joints, like hinge-2 need to be attached to two bodies to work.
+ */
+ODE_API void dJointAttach (dJointID, dBodyID body1, dBodyID body2);
+
+/**
+ * @brief Set the user-data pointer
+ * @ingroup joints
+ */
+ODE_API void dJointSetData (dJointID, void *data);
+
+/**
+ * @brief Get the user-data pointer
+ * @ingroup joints
+ */
+ODE_API void *dJointGetData (dJointID);
+
+/**
+ * @brief Get the type of the joint
+ * @ingroup joints
+ * @return the type, being one of these:
+ * \li JointTypeBall
+ * \li JointTypeHinge
+ * \li JointTypeSlider
+ * \li JointTypeContact
+ * \li JointTypeUniversal
+ * \li JointTypeHinge2
+ * \li JointTypeFixed
+ * \li JointTypeAMotor
+ * \li JointTypeLMotor
+ */
+ODE_API int dJointGetType (dJointID);
+
+/**
+ * @brief Return the bodies that this joint connects.
+ * @ingroup joints
+ * @param index return the first (0) or second (1) body.
+ * @remarks
+ * If one of these returned body IDs is zero, the joint connects the other body
+ * to the static environment.
+ * If both body IDs are zero, the joint is in ``limbo'' and has no effect on
+ * the simulation.
+ */
+ODE_API dBodyID dJointGetBody (dJointID, int index);
+
+/**
+ * @brief Sets the datastructure that is to receive the feedback.
+ *
+ * The feedback can be used by the user, so that it is known how
+ * much force an individual joint exerts.
+ * @ingroup joints
+ */
+ODE_API void dJointSetFeedback (dJointID, dJointFeedback *);
+
+/**
+ * @brief Gets the datastructure that is to receive the feedback.
+ * @ingroup joints
+ */
+ODE_API dJointFeedback *dJointGetFeedback (dJointID);
+
+/**
+ * @brief Set the joint anchor point.
+ * @ingroup joints
+ *
+ * The joint will try to keep this point on each body
+ * together. The input is specified in world coordinates.
+ */
+ODE_API void dJointSetBallAnchor (dJointID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief Set the joint anchor point.
+ * @ingroup joints
+ */
+ODE_API void dJointSetBallAnchor2 (dJointID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief Set hinge anchor parameter.
+ * @ingroup joints
+ */
+ODE_API void dJointSetHingeAnchor (dJointID, dReal x, dReal y, dReal z);
+
+ODE_API void dJointSetHingeAnchorDelta (dJointID, dReal x, dReal y, dReal z, dReal ax, dReal ay, dReal az);
+
+/**
+ * @brief Set hinge axis.
+ * @ingroup joints
+ */
+ODE_API void dJointSetHingeAxis (dJointID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief set joint parameter
+ * @ingroup joints
+ */
+ODE_API void dJointSetHingeParam (dJointID, int parameter, dReal value);
+
+/**
+ * @brief Applies the torque about the hinge axis.
+ *
+ * That is, it applies a torque with specified magnitude in the direction
+ * of the hinge axis, to body 1, and with the same magnitude but in opposite
+ * direction to body 2. This function is just a wrapper for dBodyAddTorque()}
+ * @ingroup joints
+ */
+ODE_API void dJointAddHingeTorque(dJointID joint, dReal torque);
+
+/**
+ * @brief set the joint axis
+ * @ingroup joints
+ */
+ODE_API void dJointSetSliderAxis (dJointID, dReal x, dReal y, dReal z);
+
+/**
+ * @ingroup joints
+ */
+ODE_API void dJointSetSliderAxisDelta (dJointID, dReal x, dReal y, dReal z, dReal ax, dReal ay, dReal az);
+
+/**
+ * @brief set joint parameter
+ * @ingroup joints
+ */
+ODE_API void dJointSetSliderParam (dJointID, int parameter, dReal value);
+
+/**
+ * @brief Applies the given force in the slider's direction.
+ *
+ * That is, it applies a force with specified magnitude, in the direction of
+ * slider's axis, to body1, and with the same magnitude but opposite
+ * direction to body2. This function is just a wrapper for dBodyAddForce().
+ * @ingroup joints
+ */
+ODE_API void dJointAddSliderForce(dJointID joint, dReal force);
+
+/**
+ * @brief set anchor
+ * @ingroup joints
+ */
+ODE_API void dJointSetHinge2Anchor (dJointID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief set axis
+ * @ingroup joints
+ */
+ODE_API void dJointSetHinge2Axis1 (dJointID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief set axis
+ * @ingroup joints
+ */
+ODE_API void dJointSetHinge2Axis2 (dJointID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief set joint parameter
+ * @ingroup joints
+ */
+ODE_API void dJointSetHinge2Param (dJointID, int parameter, dReal value);
+
+/**
+ * @brief Applies torque1 about the hinge2's axis 1, torque2 about the
+ * hinge2's axis 2.
+ * @remarks This function is just a wrapper for dBodyAddTorque().
+ * @ingroup joints
+ */
+ODE_API void dJointAddHinge2Torques(dJointID joint, dReal torque1, dReal torque2);
+
+/**
+ * @brief set anchor
+ * @ingroup joints
+ */
+ODE_API void dJointSetUniversalAnchor (dJointID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief set axis
+ * @ingroup joints
+ */
+ODE_API void dJointSetUniversalAxis1 (dJointID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief set axis
+ * @ingroup joints
+ */
+ODE_API void dJointSetUniversalAxis2 (dJointID, dReal x, dReal y, dReal z);
+
+/**
+ * @brief set joint parameter
+ * @ingroup joints
+ */
+ODE_API void dJointSetUniversalParam (dJointID, int parameter, dReal value);
+
+/**
+ * @brief Applies torque1 about the universal's axis 1, torque2 about the
+ * universal's axis 2.
+ * @remarks This function is just a wrapper for dBodyAddTorque().
+ * @ingroup joints
+ */
+ODE_API void dJointAddUniversalTorques(dJointID joint, dReal torque1, dReal torque2);
+
+/**
+ * @brief Call this on the fixed joint after it has been attached to
+ * remember the current desired relative offset and desired relative
+ * rotation between the bodies.
+ * @ingroup joints
+ */
+ODE_API void dJointSetFixed (dJointID);
+
+/**
+ * @brief set the nr of axes
+ * @param num 0..3
+ * @ingroup joints
+ */
+ODE_API void dJointSetAMotorNumAxes (dJointID, int num);
+
+/**
+ * @brief set axis
+ * @ingroup joints
+ */
+ODE_API void dJointSetAMotorAxis (dJointID, int anum, int rel,
+ dReal x, dReal y, dReal z);
+
+/**
+ * @brief Tell the AMotor what the current angle is along axis anum.
+ *
+ * This function should only be called in dAMotorUser mode, because in this
+ * mode the AMotor has no other way of knowing the joint angles.
+ * The angle information is needed if stops have been set along the axis,
+ * but it is not needed for axis motors.
+ * @ingroup joints
+ */
+ODE_API void dJointSetAMotorAngle (dJointID, int anum, dReal angle);
+
+/**
+ * @brief set joint parameter
+ * @ingroup joints
+ */
+ODE_API void dJointSetAMotorParam (dJointID, int parameter, dReal value);
+
+/**
+ * @brief set mode
+ * @ingroup joints
+ */
+ODE_API void dJointSetAMotorMode (dJointID, int mode);
+
+/**
+ * @brief Applies torque0 about the AMotor's axis 0, torque1 about the
+ * AMotor's axis 1, and torque2 about the AMotor's axis 2.
+ * @remarks
+ * If the motor has fewer than three axes, the higher torques are ignored.
+ * This function is just a wrapper for dBodyAddTorque().
+ * @ingroup joints
+ */
+ODE_API void dJointAddAMotorTorques (dJointID, dReal torque1, dReal torque2, dReal torque3);
+
+/**
+ * @brief Set the number of axes that will be controlled by the LMotor.
+ * @param num can range from 0 (which effectively deactivates the joint) to 3.
+ * @ingroup joints
+ */
+ODE_API void dJointSetLMotorNumAxes (dJointID, int num);
+
+/**
+ * @brief Set the AMotor axes.
+ * @param anum selects the axis to change (0,1 or 2).
+ * @param rel Each axis can have one of three ``relative orientation'' modes
+ * \li 0: The axis is anchored to the global frame.
+ * \li 1: The axis is anchored to the first body.
+ * \li 2: The axis is anchored to the second body.
+ * @remarks The axis vector is always specified in global coordinates
+ * regardless of the setting of rel.
+ * @ingroup joints
+ */
+ODE_API void dJointSetLMotorAxis (dJointID, int anum, int rel, dReal x, dReal y, dReal z);
+
+/**
+ * @brief set joint parameter
+ * @ingroup joints
+ */
+ODE_API void dJointSetLMotorParam (dJointID, int parameter, dReal value);
+
+/**
+ * @ingroup joints
+ */
+ODE_API void dJointSetPlane2DXParam (dJointID, int parameter, dReal value);
+
+/**
+ * @ingroup joints
+ */
+
+ODE_API void dJointSetPlane2DYParam (dJointID, int parameter, dReal value);
+
+/**
+ * @ingroup joints
+ */
+ODE_API void dJointSetPlane2DAngleParam (dJointID, int parameter, dReal value);
+
+/**
+ * @brief Get the joint anchor point, in world coordinates.
+ *
+ * This returns the point on body 1. If the joint is perfectly satisfied,
+ * this will be the same as the point on body 2.
+ */
+ODE_API void dJointGetBallAnchor (dJointID, dVector3 result);
+
+/**
+ * @brief Get the joint anchor point, in world coordinates.
+ *
+ * This returns the point on body 2. You can think of a ball and socket
+ * joint as trying to keep the result of dJointGetBallAnchor() and
+ * dJointGetBallAnchor2() the same. If the joint is perfectly satisfied,
+ * this function will return the same value as dJointGetBallAnchor() to
+ * within roundoff errors. dJointGetBallAnchor2() can be used, along with
+ * dJointGetBallAnchor(), to see how far the joint has come apart.
+ */
+ODE_API void dJointGetBallAnchor2 (dJointID, dVector3 result);
+
+/**
+ * @brief Get the hinge anchor point, in world coordinates.
+ *
+ * This returns the point on body 1. If the joint is perfectly satisfied,
+ * this will be the same as the point on body 2.
+ * @ingroup joints
+ */
+ODE_API void dJointGetHingeAnchor (dJointID, dVector3 result);
+
+/**
+ * @brief Get the joint anchor point, in world coordinates.
+ * @return The point on body 2. If the joint is perfectly satisfied,
+ * this will return the same value as dJointGetHingeAnchor().
+ * If not, this value will be slightly different.
+ * This can be used, for example, to see how far the joint has come apart.
+ * @ingroup joints
+ */
+ODE_API void dJointGetHingeAnchor2 (dJointID, dVector3 result);
+
+/**
+ * @brief get axis
+ * @ingroup joints
+ */
+ODE_API void dJointGetHingeAxis (dJointID, dVector3 result);
+
+/**
+ * @brief get joint parameter
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetHingeParam (dJointID, int parameter);
+
+/**
+ * @brief Get the hinge angle.
+ *
+ * The angle is measured between the two bodies, or between the body and
+ * the static environment.
+ * The angle will be between -pi..pi.
+ * When the hinge anchor or axis is set, the current position of the attached
+ * bodies is examined and that position will be the zero angle.
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetHingeAngle (dJointID);
+
+/**
+ * @brief Get the hinge angle time derivative.
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetHingeAngleRate (dJointID);
+
+/**
+ * @brief Get the slider linear position (i.e. the slider's extension)
+ *
+ * When the axis is set, the current position of the attached bodies is
+ * examined and that position will be the zero position.
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetSliderPosition (dJointID);
+
+/**
+ * @brief Get the slider linear position's time derivative.
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetSliderPositionRate (dJointID);
+
+/**
+ * @brief Get the slider axis
+ * @ingroup joints
+ */
+ODE_API void dJointGetSliderAxis (dJointID, dVector3 result);
+
+/**
+ * @brief get joint parameter
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetSliderParam (dJointID, int parameter);
+
+/**
+ * @brief Get the joint anchor point, in world coordinates.
+ * @return the point on body 1. If the joint is perfectly satisfied,
+ * this will be the same as the point on body 2.
+ * @ingroup joints
+ */
+ODE_API void dJointGetHinge2Anchor (dJointID, dVector3 result);
+
+/**
+ * @brief Get the joint anchor point, in world coordinates.
+ * This returns the point on body 2. If the joint is perfectly satisfied,
+ * this will return the same value as dJointGetHinge2Anchor.
+ * If not, this value will be slightly different.
+ * This can be used, for example, to see how far the joint has come apart.
+ * @ingroup joints
+ */
+ODE_API void dJointGetHinge2Anchor2 (dJointID, dVector3 result);
+
+/**
+ * @brief Get joint axis
+ * @ingroup joints
+ */
+ODE_API void dJointGetHinge2Axis1 (dJointID, dVector3 result);
+
+/**
+ * @brief Get joint axis
+ * @ingroup joints
+ */
+ODE_API void dJointGetHinge2Axis2 (dJointID, dVector3 result);
+
+/**
+ * @brief get joint parameter
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetHinge2Param (dJointID, int parameter);
+
+/**
+ * @brief Get angle
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetHinge2Angle1 (dJointID);
+
+/**
+ * @brief Get time derivative of angle
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetHinge2Angle1Rate (dJointID);
+
+/**
+ * @brief Get time derivative of angle
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetHinge2Angle2Rate (dJointID);
+
+/**
+ * @brief Get the joint anchor point, in world coordinates.
+ * @return the point on body 1. If the joint is perfectly satisfied,
+ * this will be the same as the point on body 2.
+ * @ingroup joints
+ */
+ODE_API void dJointGetUniversalAnchor (dJointID, dVector3 result);
+
+/**
+ * @brief Get the joint anchor point, in world coordinates.
+ * @return This returns the point on body 2.
+ * @remarks
+ * You can think of the ball and socket part of a universal joint as
+ * trying to keep the result of dJointGetBallAnchor() and
+ * dJointGetBallAnchor2() the same. If the joint is
+ * perfectly satisfied, this function will return the same value
+ * as dJointGetUniversalAnchor() to within roundoff errors.
+ * dJointGetUniversalAnchor2() can be used, along with
+ * dJointGetUniversalAnchor(), to see how far the joint has come apart.
+ * @ingroup joints
+ */
+ODE_API void dJointGetUniversalAnchor2 (dJointID, dVector3 result);
+
+/**
+ * @brief Get axis
+ * @ingroup joints
+ */
+ODE_API void dJointGetUniversalAxis1 (dJointID, dVector3 result);
+
+/**
+ * @brief Get axis
+ * @ingroup joints
+ */
+ODE_API void dJointGetUniversalAxis2 (dJointID, dVector3 result);
+
+
+/**
+ * @brief get joint parameter
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetUniversalParam (dJointID, int parameter);
+
+/**
+ * @brief Get angle
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetUniversalAngle1 (dJointID);
+
+/**
+ * @brief Get angle
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetUniversalAngle2 (dJointID);
+
+/**
+ * @brief Get time derivative of angle
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetUniversalAngle1Rate (dJointID);
+
+/**
+ * @brief Get time derivative of angle
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetUniversalAngle2Rate (dJointID);
+
+/**
+ * @brief Get the number of angular axes that will be controlled by the
+ * AMotor.
+ * @param num can range from 0 (which effectively deactivates the
+ * joint) to 3.
+ * This is automatically set to 3 in dAMotorEuler mode.
+ * @ingroup joints
+ */
+ODE_API int dJointGetAMotorNumAxes (dJointID);
+
+/**
+ * @brief Get the AMotor axes.
+ * @param anum selects the axis to change (0,1 or 2).
+ * @param rel Each axis can have one of three ``relative orientation'' modes.
+ * \li 0: The axis is anchored to the global frame.
+ * \li 1: The axis is anchored to the first body.
+ * \li 2: The axis is anchored to the second body.
+ * @ingroup joints
+ */
+ODE_API void dJointGetAMotorAxis (dJointID, int anum, dVector3 result);
+
+/**
+ * @brief Get axis
+ * @remarks
+ * The axis vector is always specified in global coordinates regardless
+ * of the setting of rel.
+ * There are two GetAMotorAxis functions, one to return the axis and one to
+ * return the relative mode.
+ *
+ * For dAMotorEuler mode:
+ * \li Only axes 0 and 2 need to be set. Axis 1 will be determined
+ automatically at each time step.
+ * \li Axes 0 and 2 must be perpendicular to each other.
+ * \li Axis 0 must be anchored to the first body, axis 2 must be anchored
+ to the second body.
+ * @ingroup joints
+ */
+ODE_API int dJointGetAMotorAxisRel (dJointID, int anum);
+
+/**
+ * @brief Get the current angle for axis.
+ * @remarks
+ * In dAMotorUser mode this is simply the value that was set with
+ * dJointSetAMotorAngle().
+ * In dAMotorEuler mode this is the corresponding euler angle.
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetAMotorAngle (dJointID, int anum);
+
+/**
+ * @brief Get the current angle rate for axis anum.
+ * @remarks
+ * In dAMotorUser mode this is always zero, as not enough information is
+ * available.
+ * In dAMotorEuler mode this is the corresponding euler angle rate.
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetAMotorAngleRate (dJointID, int anum);
+
+/**
+ * @brief get joint parameter
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetAMotorParam (dJointID, int parameter);
+
+/**
+ * @brief Get the angular motor mode.
+ * @param mode must be one of the following constants:
+ * \li dAMotorUser The AMotor axes and joint angle settings are entirely
+ * controlled by the user. This is the default mode.
+ * \li dAMotorEuler Euler angles are automatically computed.
+ * The axis a1 is also automatically computed.
+ * The AMotor axes must be set correctly when in this mode,
+ * as described below.
+ * When this mode is initially set the current relative orientations
+ * of the bodies will correspond to all euler angles at zero.
+ * @ingroup joints
+ */
+ODE_API int dJointGetAMotorMode (dJointID);
+
+/**
+ * @brief Get nr of axes.
+ * @ingroup joints
+ */
+ODE_API int dJointGetLMotorNumAxes (dJointID);
+
+/**
+ * @brief Get axis.
+ * @ingroup joints
+ */
+ODE_API void dJointGetLMotorAxis (dJointID, int anum, dVector3 result);
+
+/**
+ * @brief get joint parameter
+ * @ingroup joints
+ */
+ODE_API dReal dJointGetLMotorParam (dJointID, int parameter);
+
+
+/**
+ * @ingroup joints
+ */
+ODE_API dJointID dConnectingJoint (dBodyID, dBodyID);
+
+/**
+ * @ingroup joints
+ */
+ODE_API int dConnectingJointList (dBodyID, dBodyID, dJointID*);
+
+/**
+ * @brief Utility function
+ * @return 1 if the two bodies are connected together by
+ * a joint, otherwise return 0.
+ * @ingroup joints
+ */
+ODE_API int dAreConnected (dBodyID, dBodyID);
+
+/**
+ * @brief Utility function
+ * @return 1 if the two bodies are connected together by
+ * a joint that does not have type @arg{joint_type}, otherwise return 0.
+ * @param joint_type is a dJointTypeXXX constant.
+ * This is useful for deciding whether to add contact joints between two bodies:
+ * if they are already connected by non-contact joints then it may not be
+ * appropriate to add contacts, however it is okay to add more contact between-
+ * bodies that already have contacts.
+ * @ingroup joints
+ */
+ODE_API int dAreConnectedExcluding (dBodyID, dBodyID, int joint_type);
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_ODE_H_
+#define _ODE_ODE_H_
+
+/* include *everything* here */
+
+#include <ode/config.h>
+#include <ode/compatibility.h>
+#include <ode/common.h>
+#include <ode/contact.h>
+#include <ode/error.h>
+#include <ode/memory.h>
+#include <ode/odemath.h>
+#include <ode/matrix.h>
+#include <ode/timer.h>
+#include <ode/rotation.h>
+#include <ode/mass.h>
+#include <ode/misc.h>
+#include <ode/objects.h>
+#include <ode/odecpp.h>
+#include <ode/collision_space.h>
+#include <ode/collision.h>
+#include <ode/odecpp_collision.h>
+#include <ode/export-dif.h>
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+/* C++ interface for non-collision stuff */
+
+
+#ifndef _ODE_ODECPP_H_
+#define _ODE_ODECPP_H_
+#ifdef __cplusplus
+
+#include <ode/error.h>
+
+
+class dWorld {
+ dWorldID _id;
+
+ // intentionally undefined, don't use these
+ dWorld (const dWorld &);
+ void operator= (const dWorld &);
+
+public:
+ dWorld()
+ { _id = dWorldCreate(); }
+ ~dWorld()
+ { dWorldDestroy (_id); }
+
+ dWorldID id() const
+ { return _id; }
+ operator dWorldID() const
+ { return _id; }
+
+ void setGravity (dReal x, dReal y, dReal z)
+ { dWorldSetGravity (_id,x,y,z); }
+ void getGravity (dVector3 g) const
+ { dWorldGetGravity (_id,g); }
+
+ void setERP (dReal erp)
+ { dWorldSetERP(_id, erp); }
+ dReal getERP() const
+ { return dWorldGetERP(_id); }
+
+ void setCFM (dReal cfm)
+ { dWorldSetCFM(_id, cfm); }
+ dReal getCFM() const
+ { return dWorldGetCFM(_id); }
+
+ void step (dReal stepsize)
+ { dWorldStep (_id,stepsize); }
+
+ void stepFast1 (dReal stepsize, int maxiterations)
+ { dWorldStepFast1 (_id,stepsize,maxiterations); }
+ void setAutoEnableDepthSF1(dWorldID, int depth)
+ { dWorldSetAutoEnableDepthSF1 (_id, depth); }
+ int getAutoEnableDepthSF1(dWorldID)
+ { return dWorldGetAutoEnableDepthSF1 (_id); }
+
+ void setAutoDisableLinearThreshold (dReal threshold)
+ { dWorldSetAutoDisableLinearThreshold (_id,threshold); }
+ dReal getAutoDisableLinearThreshold()
+ { return dWorldGetAutoDisableLinearThreshold (_id); }
+ void setAutoDisableAngularThreshold (dReal threshold)
+ { dWorldSetAutoDisableAngularThreshold (_id,threshold); }
+ dReal getAutoDisableAngularThreshold()
+ { return dWorldGetAutoDisableAngularThreshold (_id); }
+ void setAutoDisableSteps (int steps)
+ { dWorldSetAutoDisableSteps (_id,steps); }
+ int getAutoDisableSteps()
+ { return dWorldGetAutoDisableSteps (_id); }
+ void setAutoDisableTime (dReal time)
+ { dWorldSetAutoDisableTime (_id,time); }
+ dReal getAutoDisableTime()
+ { return dWorldGetAutoDisableTime (_id); }
+ void setAutoDisableFlag (int do_auto_disable)
+ { dWorldSetAutoDisableFlag (_id,do_auto_disable); }
+ int getAutoDisableFlag()
+ { return dWorldGetAutoDisableFlag (_id); }
+
+ void impulseToForce (dReal stepsize, dReal ix, dReal iy, dReal iz,
+ dVector3 force)
+ { dWorldImpulseToForce (_id,stepsize,ix,iy,iz,force); }
+};
+
+
+class dBody {
+ dBodyID _id;
+
+ // intentionally undefined, don't use these
+ dBody (const dBody &);
+ void operator= (const dBody &);
+
+public:
+ dBody()
+ { _id = 0; }
+ dBody (dWorldID world)
+ { _id = dBodyCreate (world); }
+ ~dBody()
+ { if (_id) dBodyDestroy (_id); }
+
+ void create (dWorldID world) {
+ if (_id) dBodyDestroy (_id);
+ _id = dBodyCreate (world);
+ }
+
+ dBodyID id() const
+ { return _id; }
+ operator dBodyID() const
+ { return _id; }
+
+ void setData (void *data)
+ { dBodySetData (_id,data); }
+ void *getData() const
+ { return dBodyGetData (_id); }
+
+ void setPosition (dReal x, dReal y, dReal z)
+ { dBodySetPosition (_id,x,y,z); }
+ void setRotation (const dMatrix3 R)
+ { dBodySetRotation (_id,R); }
+ void setQuaternion (const dQuaternion q)
+ { dBodySetQuaternion (_id,q); }
+ void setLinearVel (dReal x, dReal y, dReal z)
+ { dBodySetLinearVel (_id,x,y,z); }
+ void setAngularVel (dReal x, dReal y, dReal z)
+ { dBodySetAngularVel (_id,x,y,z); }
+
+ const dReal * getPosition() const
+ { return dBodyGetPosition (_id); }
+ const dReal * getRotation() const
+ { return dBodyGetRotation (_id); }
+ const dReal * getQuaternion() const
+ { return dBodyGetQuaternion (_id); }
+ const dReal * getLinearVel() const
+ { return dBodyGetLinearVel (_id); }
+ const dReal * getAngularVel() const
+ { return dBodyGetAngularVel (_id); }
+
+ void setMass (const dMass *mass)
+ { dBodySetMass (_id,mass); }
+ void getMass (dMass *mass) const
+ { dBodyGetMass (_id,mass); }
+
+ void addForce (dReal fx, dReal fy, dReal fz)
+ { dBodyAddForce (_id, fx, fy, fz); }
+ void addTorque (dReal fx, dReal fy, dReal fz)
+ { dBodyAddTorque (_id, fx, fy, fz); }
+ void addRelForce (dReal fx, dReal fy, dReal fz)
+ { dBodyAddRelForce (_id, fx, fy, fz); }
+ void addRelTorque (dReal fx, dReal fy, dReal fz)
+ { dBodyAddRelTorque (_id, fx, fy, fz); }
+ void addForceAtPos (dReal fx, dReal fy, dReal fz,
+ dReal px, dReal py, dReal pz)
+ { dBodyAddForceAtPos (_id, fx, fy, fz, px, py, pz); }
+ void addForceAtRelPos (dReal fx, dReal fy, dReal fz,
+ dReal px, dReal py, dReal pz)
+ { dBodyAddForceAtRelPos (_id, fx, fy, fz, px, py, pz); }
+ void addRelForceAtPos (dReal fx, dReal fy, dReal fz,
+ dReal px, dReal py, dReal pz)
+ { dBodyAddRelForceAtPos (_id, fx, fy, fz, px, py, pz); }
+ void addRelForceAtRelPos (dReal fx, dReal fy, dReal fz,
+ dReal px, dReal py, dReal pz)
+ { dBodyAddRelForceAtRelPos (_id, fx, fy, fz, px, py, pz); }
+
+ const dReal * getForce() const
+ { return dBodyGetForce(_id); }
+ const dReal * getTorque() const
+ { return dBodyGetTorque(_id); }
+ void setForce (dReal x, dReal y, dReal z)
+ { dBodySetForce (_id,x,y,z); }
+ void setTorque (dReal x, dReal y, dReal z)
+ { dBodySetTorque (_id,x,y,z); }
+
+ void enable()
+ { dBodyEnable (_id); }
+ void disable()
+ { dBodyDisable (_id); }
+ int isEnabled() const
+ { return dBodyIsEnabled (_id); }
+
+ void getRelPointPos (dReal px, dReal py, dReal pz, dVector3 result) const
+ { dBodyGetRelPointPos (_id, px, py, pz, result); }
+ void getRelPointVel (dReal px, dReal py, dReal pz, dVector3 result) const
+ { dBodyGetRelPointVel (_id, px, py, pz, result); }
+ void getPointVel (dReal px, dReal py, dReal pz, dVector3 result) const
+ { dBodyGetPointVel (_id,px,py,pz,result); }
+ void getPosRelPoint (dReal px, dReal py, dReal pz, dVector3 result) const
+ { dBodyGetPosRelPoint (_id,px,py,pz,result); }
+ void vectorToWorld (dReal px, dReal py, dReal pz, dVector3 result) const
+ { dBodyVectorToWorld (_id,px,py,pz,result); }
+ void vectorFromWorld (dReal px, dReal py, dReal pz, dVector3 result) const
+ { dBodyVectorFromWorld (_id,px,py,pz,result); }
+
+ void setFiniteRotationMode (int mode)
+ { dBodySetFiniteRotationMode (_id, mode); }
+ void setFiniteRotationAxis (dReal x, dReal y, dReal z)
+ { dBodySetFiniteRotationAxis (_id, x, y, z); }
+
+ int getFiniteRotationMode() const
+ { return dBodyGetFiniteRotationMode (_id); }
+ void getFiniteRotationAxis (dVector3 result) const
+ { dBodyGetFiniteRotationAxis (_id, result); }
+
+ int getNumJoints() const
+ { return dBodyGetNumJoints (_id); }
+ dJointID getJoint (int index) const
+ { return dBodyGetJoint (_id, index); }
+
+ void setGravityMode (int mode)
+ { dBodySetGravityMode (_id,mode); }
+ int getGravityMode() const
+ { return dBodyGetGravityMode (_id); }
+
+ int isConnectedTo (dBodyID body) const
+ { return dAreConnected (_id, body); }
+
+ void setAutoDisableLinearThreshold (dReal threshold)
+ { dBodySetAutoDisableLinearThreshold (_id,threshold); }
+ dReal getAutoDisableLinearThreshold()
+ { return dBodyGetAutoDisableLinearThreshold (_id); }
+ void setAutoDisableAngularThreshold (dReal threshold)
+ { dBodySetAutoDisableAngularThreshold (_id,threshold); }
+ dReal getAutoDisableAngularThreshold()
+ { return dBodyGetAutoDisableAngularThreshold (_id); }
+ void setAutoDisableSteps (int steps)
+ { dBodySetAutoDisableSteps (_id,steps); }
+ int getAutoDisableSteps()
+ { return dBodyGetAutoDisableSteps (_id); }
+ void setAutoDisableTime (dReal time)
+ { dBodySetAutoDisableTime (_id,time); }
+ dReal getAutoDisableTime()
+ { return dBodyGetAutoDisableTime (_id); }
+ void setAutoDisableFlag (int do_auto_disable)
+ { dBodySetAutoDisableFlag (_id,do_auto_disable); }
+ int getAutoDisableFlag()
+ { return dBodyGetAutoDisableFlag (_id); }
+};
+
+
+class dJointGroup {
+ dJointGroupID _id;
+
+ // intentionally undefined, don't use these
+ dJointGroup (const dJointGroup &);
+ void operator= (const dJointGroup &);
+
+public:
+ dJointGroup (int dummy_arg=0)
+ { _id = dJointGroupCreate (0); }
+ ~dJointGroup()
+ { dJointGroupDestroy (_id); }
+ void create (int dummy_arg=0) {
+ if (_id) dJointGroupDestroy (_id);
+ _id = dJointGroupCreate (0);
+ }
+
+ dJointGroupID id() const
+ { return _id; }
+ operator dJointGroupID() const
+ { return _id; }
+
+ void empty()
+ { dJointGroupEmpty (_id); }
+};
+
+
+class dJoint {
+private:
+ // intentionally undefined, don't use these
+ dJoint (const dJoint &) ;
+ void operator= (const dJoint &);
+
+protected:
+ dJointID _id;
+
+public:
+ dJoint()
+ { _id = 0; }
+ ~dJoint()
+ { if (_id) dJointDestroy (_id); }
+
+ dJointID id() const
+ { return _id; }
+ operator dJointID() const
+ { return _id; }
+
+ void attach (dBodyID body1, dBodyID body2)
+ { dJointAttach (_id, body1, body2); }
+
+ void setData (void *data)
+ { dJointSetData (_id, data); }
+ void *getData() const
+ { return dJointGetData (_id); }
+
+ int getType() const
+ { return dJointGetType (_id); }
+
+ dBodyID getBody (int index) const
+ { return dJointGetBody (_id, index); }
+
+ void setFeedback(dJointFeedback *fb)
+ { dJointSetFeedback(_id, fb); }
+ dJointFeedback *getFeedback() const
+ { return dJointGetFeedback(_id); }
+};
+
+
+class dBallJoint : public dJoint {
+private:
+ // intentionally undefined, don't use these
+ dBallJoint (const dBallJoint &);
+ void operator= (const dBallJoint &);
+
+public:
+ dBallJoint() { }
+ dBallJoint (dWorldID world, dJointGroupID group=0)
+ { _id = dJointCreateBall (world, group); }
+
+ void create (dWorldID world, dJointGroupID group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateBall (world, group);
+ }
+
+ void setAnchor (dReal x, dReal y, dReal z)
+ { dJointSetBallAnchor (_id, x, y, z); }
+ void getAnchor (dVector3 result) const
+ { dJointGetBallAnchor (_id, result); }
+ void getAnchor2 (dVector3 result) const
+ { dJointGetBallAnchor2 (_id, result); }
+} ;
+
+
+class dHingeJoint : public dJoint {
+ // intentionally undefined, don't use these
+ dHingeJoint (const dHingeJoint &);
+ void operator = (const dHingeJoint &);
+
+public:
+ dHingeJoint() { }
+ dHingeJoint (dWorldID world, dJointGroupID group=0)
+ { _id = dJointCreateHinge (world, group); }
+
+ void create (dWorldID world, dJointGroupID group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateHinge (world, group);
+ }
+
+ void setAnchor (dReal x, dReal y, dReal z)
+ { dJointSetHingeAnchor (_id, x, y, z); }
+ void getAnchor (dVector3 result) const
+ { dJointGetHingeAnchor (_id, result); }
+ void getAnchor2 (dVector3 result) const
+ { dJointGetHingeAnchor2 (_id, result); }
+
+ void setAxis (dReal x, dReal y, dReal z)
+ { dJointSetHingeAxis (_id, x, y, z); }
+ void getAxis (dVector3 result) const
+ { dJointGetHingeAxis (_id, result); }
+
+ dReal getAngle() const
+ { return dJointGetHingeAngle (_id); }
+ dReal getAngleRate() const
+ { return dJointGetHingeAngleRate (_id); }
+
+ void setParam (int parameter, dReal value)
+ { dJointSetHingeParam (_id, parameter, value); }
+ dReal getParam (int parameter) const
+ { return dJointGetHingeParam (_id, parameter); }
+
+ void addTorque (dReal torque)
+ { dJointAddHingeTorque(_id, torque); }
+};
+
+
+class dSliderJoint : public dJoint {
+ // intentionally undefined, don't use these
+ dSliderJoint (const dSliderJoint &);
+ void operator = (const dSliderJoint &);
+
+public:
+ dSliderJoint() { }
+ dSliderJoint (dWorldID world, dJointGroupID group=0)
+ { _id = dJointCreateSlider (world, group); }
+
+ void create (dWorldID world, dJointGroupID group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateSlider (world, group);
+ }
+
+ void setAxis (dReal x, dReal y, dReal z)
+ { dJointSetSliderAxis (_id, x, y, z); }
+ void getAxis (dVector3 result) const
+ { dJointGetSliderAxis (_id, result); }
+
+ dReal getPosition() const
+ { return dJointGetSliderPosition (_id); }
+ dReal getPositionRate() const
+ { return dJointGetSliderPositionRate (_id); }
+
+ void setParam (int parameter, dReal value)
+ { dJointSetSliderParam (_id, parameter, value); }
+ dReal getParam (int parameter) const
+ { return dJointGetSliderParam (_id, parameter); }
+
+ void addForce (dReal force)
+ { dJointAddSliderForce(_id, force); }
+};
+
+
+class dUniversalJoint : public dJoint {
+ // intentionally undefined, don't use these
+ dUniversalJoint (const dUniversalJoint &);
+ void operator = (const dUniversalJoint &);
+
+public:
+ dUniversalJoint() { }
+ dUniversalJoint (dWorldID world, dJointGroupID group=0)
+ { _id = dJointCreateUniversal (world, group); }
+
+ void create (dWorldID world, dJointGroupID group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateUniversal (world, group);
+ }
+
+ void setAnchor (dReal x, dReal y, dReal z)
+ { dJointSetUniversalAnchor (_id, x, y, z); }
+ void setAxis1 (dReal x, dReal y, dReal z)
+ { dJointSetUniversalAxis1 (_id, x, y, z); }
+ void setAxis2 (dReal x, dReal y, dReal z)
+ { dJointSetUniversalAxis2 (_id, x, y, z); }
+ void setParam (int parameter, dReal value)
+ { dJointSetUniversalParam (_id, parameter, value); }
+
+ void getAnchor (dVector3 result) const
+ { dJointGetUniversalAnchor (_id, result); }
+ void getAnchor2 (dVector3 result) const
+ { dJointGetUniversalAnchor2 (_id, result); }
+ void getAxis1 (dVector3 result) const
+ { dJointGetUniversalAxis1 (_id, result); }
+ void getAxis2 (dVector3 result) const
+ { dJointGetUniversalAxis2 (_id, result); }
+ dReal getParam (int parameter) const
+ { return dJointGetUniversalParam (_id, parameter); }
+ dReal getAngle1() const
+ { return dJointGetUniversalAngle1 (_id); }
+ dReal getAngle1Rate() const
+ { return dJointGetUniversalAngle1Rate (_id); }
+ dReal getAngle2() const
+ { return dJointGetUniversalAngle2 (_id); }
+ dReal getAngle2Rate() const
+ { return dJointGetUniversalAngle2Rate (_id); }
+
+ void addTorques (dReal torque1, dReal torque2)
+ { dJointAddUniversalTorques(_id, torque1, torque2); }
+};
+
+
+class dHinge2Joint : public dJoint {
+ // intentionally undefined, don't use these
+ dHinge2Joint (const dHinge2Joint &);
+ void operator = (const dHinge2Joint &);
+
+public:
+ dHinge2Joint() { }
+ dHinge2Joint (dWorldID world, dJointGroupID group=0)
+ { _id = dJointCreateHinge2 (world, group); }
+
+ void create (dWorldID world, dJointGroupID group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateHinge2 (world, group);
+ }
+
+ void setAnchor (dReal x, dReal y, dReal z)
+ { dJointSetHinge2Anchor (_id, x, y, z); }
+ void setAxis1 (dReal x, dReal y, dReal z)
+ { dJointSetHinge2Axis1 (_id, x, y, z); }
+ void setAxis2 (dReal x, dReal y, dReal z)
+ { dJointSetHinge2Axis2 (_id, x, y, z); }
+
+ void getAnchor (dVector3 result) const
+ { dJointGetHinge2Anchor (_id, result); }
+ void getAnchor2 (dVector3 result) const
+ { dJointGetHinge2Anchor2 (_id, result); }
+ void getAxis1 (dVector3 result) const
+ { dJointGetHinge2Axis1 (_id, result); }
+ void getAxis2 (dVector3 result) const
+ { dJointGetHinge2Axis2 (_id, result); }
+
+ dReal getAngle1() const
+ { return dJointGetHinge2Angle1 (_id); }
+ dReal getAngle1Rate() const
+ { return dJointGetHinge2Angle1Rate (_id); }
+ dReal getAngle2Rate() const
+ { return dJointGetHinge2Angle2Rate (_id); }
+
+ void setParam (int parameter, dReal value)
+ { dJointSetHinge2Param (_id, parameter, value); }
+ dReal getParam (int parameter) const
+ { return dJointGetHinge2Param (_id, parameter); }
+
+ void addTorques(dReal torque1, dReal torque2)
+ { dJointAddHinge2Torques(_id, torque1, torque2); }
+};
+
+
+class dFixedJoint : public dJoint {
+ // intentionally undefined, don't use these
+ dFixedJoint (const dFixedJoint &);
+ void operator = (const dFixedJoint &);
+
+public:
+ dFixedJoint() { }
+ dFixedJoint (dWorldID world, dJointGroupID group=0)
+ { _id = dJointCreateFixed (world, group); }
+
+ void create (dWorldID world, dJointGroupID group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateFixed (world, group);
+ }
+
+ void set()
+ { dJointSetFixed (_id); }
+};
+
+
+class dContactJoint : public dJoint {
+ // intentionally undefined, don't use these
+ dContactJoint (const dContactJoint &);
+ void operator = (const dContactJoint &);
+
+public:
+ dContactJoint() { }
+ dContactJoint (dWorldID world, dJointGroupID group, dContact *contact)
+ { _id = dJointCreateContact (world, group, contact); }
+
+ void create (dWorldID world, dJointGroupID group, dContact *contact) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateContact (world, group, contact);
+ }
+};
+
+
+class dNullJoint : public dJoint {
+ // intentionally undefined, don't use these
+ dNullJoint (const dNullJoint &);
+ void operator = (const dNullJoint &);
+
+public:
+ dNullJoint() { }
+ dNullJoint (dWorldID world, dJointGroupID group=0)
+ { _id = dJointCreateNull (world, group); }
+
+ void create (dWorldID world, dJointGroupID group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateNull (world, group);
+ }
+};
+
+
+class dAMotorJoint : public dJoint {
+ // intentionally undefined, don't use these
+ dAMotorJoint (const dAMotorJoint &);
+ void operator = (const dAMotorJoint &);
+
+public:
+ dAMotorJoint() { }
+ dAMotorJoint (dWorldID world, dJointGroupID group=0)
+ { _id = dJointCreateAMotor (world, group); }
+
+ void create (dWorldID world, dJointGroupID group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateAMotor (world, group);
+ }
+
+ void setMode (int mode)
+ { dJointSetAMotorMode (_id, mode); }
+ int getMode() const
+ { return dJointGetAMotorMode (_id); }
+
+ void setNumAxes (int num)
+ { dJointSetAMotorNumAxes (_id, num); }
+ int getNumAxes() const
+ { return dJointGetAMotorNumAxes (_id); }
+
+ void setAxis (int anum, int rel, dReal x, dReal y, dReal z)
+ { dJointSetAMotorAxis (_id, anum, rel, x, y, z); }
+ void getAxis (int anum, dVector3 result) const
+ { dJointGetAMotorAxis (_id, anum, result); }
+ int getAxisRel (int anum) const
+ { return dJointGetAMotorAxisRel (_id, anum); }
+
+ void setAngle (int anum, dReal angle)
+ { dJointSetAMotorAngle (_id, anum, angle); }
+ dReal getAngle (int anum) const
+ { return dJointGetAMotorAngle (_id, anum); }
+ dReal getAngleRate (int anum)
+ { return dJointGetAMotorAngleRate (_id,anum); }
+
+ void setParam (int parameter, dReal value)
+ { dJointSetAMotorParam (_id, parameter, value); }
+ dReal getParam (int parameter) const
+ { return dJointGetAMotorParam (_id, parameter); }
+
+ void addTorques(dReal torque1, dReal torque2, dReal torque3)
+ { dJointAddAMotorTorques(_id, torque1, torque2, torque3); }
+};
+
+
+class dLMotorJoint : public dJoint {
+ // intentionally undefined, don't use these
+ dLMotorJoint (const dLMotorJoint &);
+ void operator = (const dLMotorJoint &);
+
+public:
+ dLMotorJoint() { }
+ dLMotorJoint (dWorldID world, dJointGroupID group=0)
+ { _id = dJointCreateLMotor (world, group); }
+
+ void create (dWorldID world, dJointGroupID group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateLMotor (world, group);
+ }
+
+ void setNumAxes (int num)
+ { dJointSetLMotorNumAxes (_id, num); }
+ int getNumAxes() const
+ { return dJointGetLMotorNumAxes (_id); }
+
+ void setAxis (int anum, int rel, dReal x, dReal y, dReal z)
+ { dJointSetLMotorAxis (_id, anum, rel, x, y, z); }
+ void getAxis (int anum, dVector3 result) const
+ { dJointGetLMotorAxis (_id, anum, result); }
+
+ void setParam (int parameter, dReal value)
+ { dJointSetLMotorParam (_id, parameter, value); }
+ dReal getParam (int parameter) const
+ { return dJointGetLMotorParam (_id, parameter); }
+};
+
+
+
+#endif
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+/* C++ interface for new collision API */
+
+
+#ifndef _ODE_ODECPP_COLLISION_H_
+#define _ODE_ODECPP_COLLISION_H_
+#ifdef __cplusplus
+
+#include <ode/error.h>
+
+
+class dGeom {
+ // intentionally undefined, don't use these
+ dGeom (dGeom &);
+ void operator= (dGeom &);
+
+protected:
+ dGeomID _id;
+
+public:
+ dGeom()
+ { _id = 0; }
+ ~dGeom()
+ { if (_id) dGeomDestroy (_id); }
+
+ dGeomID id() const
+ { return _id; }
+ operator dGeomID() const
+ { return _id; }
+
+ void destroy() {
+ if (_id) dGeomDestroy (_id);
+ _id = 0;
+ }
+
+ int getClass() const
+ { return dGeomGetClass (_id); }
+
+ dSpaceID getSpace() const
+ { return dGeomGetSpace (_id); }
+
+ void setData (void *data)
+ { dGeomSetData (_id,data); }
+ void *getData() const
+ { return dGeomGetData (_id); }
+
+ void setBody (dBodyID b)
+ { dGeomSetBody (_id,b); }
+ dBodyID getBody() const
+ { return dGeomGetBody (_id); }
+
+ void setPosition (dReal x, dReal y, dReal z)
+ { dGeomSetPosition (_id,x,y,z); }
+ const dReal * getPosition() const
+ { return dGeomGetPosition (_id); }
+
+ void setRotation (const dMatrix3 R)
+ { dGeomSetRotation (_id,R); }
+ const dReal * getRotation() const
+ { return dGeomGetRotation (_id); }
+
+ void setQuaternion (const dQuaternion quat)
+ { dGeomSetQuaternion (_id,quat); }
+ void getQuaternion (dQuaternion quat) const
+ { dGeomGetQuaternion (_id,quat); }
+
+ void getAABB (dReal aabb[6]) const
+ { dGeomGetAABB (_id, aabb); }
+
+ int isSpace()
+ { return dGeomIsSpace (_id); }
+
+ void setCategoryBits (unsigned long bits)
+ { dGeomSetCategoryBits (_id, bits); }
+ void setCollideBits (unsigned long bits)
+ { dGeomSetCollideBits (_id, bits); }
+ unsigned long getCategoryBits()
+ { return dGeomGetCategoryBits (_id); }
+ unsigned long getCollideBits()
+ { return dGeomGetCollideBits (_id); }
+
+ void enable()
+ { dGeomEnable (_id); }
+ void disable()
+ { dGeomDisable (_id); }
+ int isEnabled()
+ { return dGeomIsEnabled (_id); }
+
+ void collide2 (dGeomID g, void *data, dNearCallback *callback)
+ { dSpaceCollide2 (_id,g,data,callback); }
+};
+
+
+class dSpace : public dGeom {
+ // intentionally undefined, don't use these
+ dSpace (dSpace &);
+ void operator= (dSpace &);
+
+protected:
+ // the default constructor is protected so that you
+ // can't instance this class. you must instance one
+ // of its subclasses instead.
+ dSpace () { _id = 0; }
+
+public:
+ dSpaceID id() const
+ { return (dSpaceID) _id; }
+ operator dSpaceID() const
+ { return (dSpaceID) _id; }
+
+ void setCleanup (int mode)
+ { dSpaceSetCleanup (id(), mode); }
+ int getCleanup()
+ { return dSpaceGetCleanup (id()); }
+
+ void add (dGeomID x)
+ { dSpaceAdd (id(), x); }
+ void remove (dGeomID x)
+ { dSpaceRemove (id(), x); }
+ int query (dGeomID x)
+ { return dSpaceQuery (id(),x); }
+
+ int getNumGeoms()
+ { return dSpaceGetNumGeoms (id()); }
+ dGeomID getGeom (int i)
+ { return dSpaceGetGeom (id(),i); }
+
+ void collide (void *data, dNearCallback *callback)
+ { dSpaceCollide (id(),data,callback); }
+};
+
+
+class dSimpleSpace : public dSpace {
+ // intentionally undefined, don't use these
+ dSimpleSpace (dSimpleSpace &);
+ void operator= (dSimpleSpace &);
+
+public:
+ dSimpleSpace (dSpaceID space)
+ { _id = (dGeomID) dSimpleSpaceCreate (space); }
+};
+
+
+class dHashSpace : public dSpace {
+ // intentionally undefined, don't use these
+ dHashSpace (dHashSpace &);
+ void operator= (dHashSpace &);
+
+public:
+ dHashSpace (dSpaceID space)
+ { _id = (dGeomID) dHashSpaceCreate (space); }
+ void setLevels (int minlevel, int maxlevel)
+ { dHashSpaceSetLevels (id(),minlevel,maxlevel); }
+};
+
+
+class dQuadTreeSpace : public dSpace {
+ // intentionally undefined, don't use these
+ dQuadTreeSpace (dQuadTreeSpace &);
+ void operator= (dQuadTreeSpace &);
+
+public:
+ dQuadTreeSpace (dSpaceID space, dVector3 center, dVector3 extents, int depth)
+ { _id = (dGeomID) dQuadTreeSpaceCreate (space,center,extents,depth); }
+};
+
+
+class dSphere : public dGeom {
+ // intentionally undefined, don't use these
+ dSphere (dSphere &);
+ void operator= (dSphere &);
+
+public:
+ dSphere () { }
+ dSphere (dSpaceID space, dReal radius)
+ { _id = dCreateSphere (space, radius); }
+
+ void create (dSpaceID space, dReal radius) {
+ if (_id) dGeomDestroy (_id);
+ _id = dCreateSphere (space, radius);
+ }
+
+ void setRadius (dReal radius)
+ { dGeomSphereSetRadius (_id, radius); }
+ dReal getRadius() const
+ { return dGeomSphereGetRadius (_id); }
+};
+
+
+class dBox : public dGeom {
+ // intentionally undefined, don't use these
+ dBox (dBox &);
+ void operator= (dBox &);
+
+public:
+ dBox () { }
+ dBox (dSpaceID space, dReal lx, dReal ly, dReal lz)
+ { _id = dCreateBox (space,lx,ly,lz); }
+
+ void create (dSpaceID space, dReal lx, dReal ly, dReal lz) {
+ if (_id) dGeomDestroy (_id);
+ _id = dCreateBox (space,lx,ly,lz);
+ }
+
+ void setLengths (dReal lx, dReal ly, dReal lz)
+ { dGeomBoxSetLengths (_id, lx, ly, lz); }
+ void getLengths (dVector3 result) const
+ { dGeomBoxGetLengths (_id,result); }
+};
+
+
+class dPlane : public dGeom {
+ // intentionally undefined, don't use these
+ dPlane (dPlane &);
+ void operator= (dPlane &);
+
+public:
+ dPlane() { }
+ dPlane (dSpaceID space, dReal a, dReal b, dReal c, dReal d)
+ { _id = dCreatePlane (space,a,b,c,d); }
+
+ void create (dSpaceID space, dReal a, dReal b, dReal c, dReal d) {
+ if (_id) dGeomDestroy (_id);
+ _id = dCreatePlane (space,a,b,c,d);
+ }
+
+ void setParams (dReal a, dReal b, dReal c, dReal d)
+ { dGeomPlaneSetParams (_id, a, b, c, d); }
+ void getParams (dVector4 result) const
+ { dGeomPlaneGetParams (_id,result); }
+};
+
+
+class dCapsule : public dGeom {
+ // intentionally undefined, don't use these
+ dCapsule (dCapsule &);
+ void operator= (dCapsule &);
+
+public:
+ dCapsule() { }
+ dCapsule (dSpaceID space, dReal radius, dReal length)
+ { _id = dCreateCapsule (space,radius,length); }
+
+ void create (dSpaceID space, dReal radius, dReal length) {
+ if (_id) dGeomDestroy (_id);
+ _id = dCreateCapsule (space,radius,length);
+ }
+
+ void setParams (dReal radius, dReal length)
+ { dGeomCapsuleSetParams (_id, radius, length); }
+ void getParams (dReal *radius, dReal *length) const
+ { dGeomCapsuleGetParams (_id,radius,length); }
+};
+
+
+class dRay : public dGeom {
+ // intentionally undefined, don't use these
+ dRay (dRay &);
+ void operator= (dRay &);
+
+public:
+ dRay() { }
+ dRay (dSpaceID space, dReal length)
+ { _id = dCreateRay (space,length); }
+
+ void create (dSpaceID space, dReal length) {
+ if (_id) dGeomDestroy (_id);
+ _id = dCreateRay (space,length);
+ }
+
+ void setLength (dReal length)
+ { dGeomRaySetLength (_id, length); }
+ dReal getLength()
+ { return dGeomRayGetLength (_id); }
+
+ void set (dReal px, dReal py, dReal pz, dReal dx, dReal dy, dReal dz)
+ { dGeomRaySet (_id, px, py, pz, dx, dy, dz); }
+ void get (dVector3 start, dVector3 dir)
+ { dGeomRayGet (_id, start, dir); }
+
+ void setParams (int firstContact, int backfaceCull)
+ { dGeomRaySetParams (_id, firstContact, backfaceCull); }
+ void getParams (int *firstContact, int *backfaceCull)
+ { dGeomRayGetParams (_id, firstContact, backfaceCull); }
+ void setClosestHit (int closestHit)
+ { dGeomRaySetClosestHit (_id, closestHit); }
+ int getClosestHit()
+ { return dGeomRayGetClosestHit (_id); }
+};
+
+
+class dGeomTransform : public dGeom {
+ // intentionally undefined, don't use these
+ dGeomTransform (dGeomTransform &);
+ void operator= (dGeomTransform &);
+
+public:
+ dGeomTransform() { }
+ dGeomTransform (dSpaceID space)
+ { _id = dCreateGeomTransform (space); }
+
+ void create (dSpaceID space=0) {
+ if (_id) dGeomDestroy (_id);
+ _id = dCreateGeomTransform (space);
+ }
+
+ void setGeom (dGeomID geom)
+ { dGeomTransformSetGeom (_id, geom); }
+ dGeomID getGeom() const
+ { return dGeomTransformGetGeom (_id); }
+
+ void setCleanup (int mode)
+ { dGeomTransformSetCleanup (_id,mode); }
+ int getCleanup ()
+ { return dGeomTransformGetCleanup (_id); }
+
+ void setInfo (int mode)
+ { dGeomTransformSetInfo (_id,mode); }
+ int getInfo()
+ { return dGeomTransformGetInfo (_id); }
+};
+
+
+#endif
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+/* this is the old C++ interface, the new C++ interface is not quite
+ * compatible with this. but this file is kept around in case you were
+ * using the old interface.
+ */
+
+#ifndef _ODE_ODECPP_H_
+#define _ODE_ODECPP_H_
+#ifdef __cplusplus
+
+#include <ode/error.h>
+
+
+class dWorld {
+ dWorldID _id;
+
+ dWorld (dWorld &) { dDebug (0,"bad"); }
+ void operator= (dWorld &) { dDebug (0,"bad"); }
+
+public:
+ dWorld()
+ { _id = dWorldCreate(); }
+ ~dWorld()
+ { dWorldDestroy (_id); }
+ dWorldID id()
+ { return _id; }
+
+ void setGravity (dReal x, dReal y, dReal z)
+ { dWorldSetGravity (_id,x,y,z); }
+ void getGravity (dVector3 g)
+ { dWorldGetGravity (_id,g); }
+ void step (dReal stepsize)
+ { dWorldStep (_id,stepsize); }
+};
+
+
+class dBody {
+ dBodyID _id;
+
+ dBody (dBody &) { dDebug (0,"bad"); }
+ void operator= (dBody &) { dDebug (0,"bad"); }
+
+public:
+ dBody()
+ { _id = 0; }
+ dBody (dWorld &world)
+ { _id = dBodyCreate (world.id()); }
+ ~dBody()
+ { dBodyDestroy (_id); }
+ void create (dWorld &world)
+ { if (_id) dBodyDestroy (_id); _id = dBodyCreate (world.id()); }
+ dBodyID id()
+ { return _id; }
+
+ void setData (void *data)
+ { dBodySetData (_id,data); }
+ void *getData()
+ { return dBodyGetData (_id); }
+
+ void setPosition (dReal x, dReal y, dReal z)
+ { dBodySetPosition (_id,x,y,z); }
+ void setRotation (const dMatrix3 R)
+ { dBodySetRotation (_id,R); }
+ void setQuaternion (const dQuaternion q)
+ { dBodySetQuaternion (_id,q); }
+ void setLinearVel (dReal x, dReal y, dReal z)
+ { dBodySetLinearVel (_id,x,y,z); }
+ void setAngularVel (dReal x, dReal y, dReal z)
+ { dBodySetAngularVel (_id,x,y,z); }
+
+ const dReal * getPosition()
+ { return dBodyGetPosition (_id); }
+ const dReal * getRotation()
+ { return dBodyGetRotation (_id); }
+ const dReal * getQuaternion()
+ { return dBodyGetQuaternion (_id); }
+ const dReal * getLinearVel()
+ { return dBodyGetLinearVel (_id); }
+ const dReal * getAngularVel()
+ { return dBodyGetAngularVel (_id); }
+
+ void setMass (const dMass *mass)
+ { dBodySetMass (_id,mass); }
+ void getMass (dMass *mass)
+ { dBodyGetMass (_id,mass); }
+
+ void addForce (dReal fx, dReal fy, dReal fz)
+ { dBodyAddForce (_id, fx, fy, fz); }
+ void addTorque (dReal fx, dReal fy, dReal fz)
+ { dBodyAddTorque (_id, fx, fy, fz); }
+ void addRelForce (dReal fx, dReal fy, dReal fz)
+ { dBodyAddRelForce (_id, fx, fy, fz); }
+ void addRelTorque (dReal fx, dReal fy, dReal fz)
+ { dBodyAddRelTorque (_id, fx, fy, fz); }
+ void addForceAtPos (dReal fx, dReal fy, dReal fz,
+ dReal px, dReal py, dReal pz)
+ { dBodyAddForceAtPos (_id, fx, fy, fz, px, py, pz); }
+ void addRelForceAtPos (dReal fx, dReal fy, dReal fz,
+ dReal px, dReal py, dReal pz)
+ { dBodyAddRelForceAtPos (_id, fx, fy, fz, px, py, pz); }
+ void addRelForceAtRelPos (dReal fx, dReal fy, dReal fz,
+ dReal px, dReal py, dReal pz)
+ { dBodyAddRelForceAtRelPos (_id, fx, fy, fz, px, py, pz); }
+
+ void getRelPointPos (dReal px, dReal py, dReal pz, dVector3 result)
+ { dBodyGetRelPointPos (_id, px, py, pz, result); }
+ void getRelPointVel (dReal px, dReal py, dReal pz, dVector3 result)
+ { dBodyGetRelPointVel (_id, px, py, pz, result); }
+
+ int isConnectedTo (const dBody &b)
+ { return dAreConnected (_id,b._id); }
+};
+
+
+class dJointGroup {
+ dJointGroupID _id;
+
+ dJointGroup (dJointGroup &) { dDebug (0,"bad"); }
+ void operator= (dJointGroup &) { dDebug (0,"bad"); }
+
+public:
+ dJointGroup()
+ { _id = 0; }
+ dJointGroup (int max_size)
+ { _id = dJointGroupCreate (max_size); }
+ ~dJointGroup()
+ { dJointGroupDestroy (_id); }
+ void create (int max_size)
+ { if (_id) dJointGroupDestroy (_id); _id = dJointGroupCreate (max_size); }
+ dJointGroupID id()
+ { return _id; }
+
+ void empty()
+ { dJointGroupEmpty (_id); }
+};
+
+
+class dJoint {
+ dJointID _id;
+
+ dJoint (dJoint &) { dDebug (0,"bad"); }
+ void operator= (dJoint &) { dDebug (0,"bad"); }
+
+public:
+ dJoint()
+ { _id = 0; }
+ ~dJoint()
+ { dJointDestroy (_id); }
+ dJointID id()
+ { return _id; }
+
+ void createBall (dWorld &world, dJointGroup *group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateBall (world.id(), group ? group->id() : 0);
+ }
+ void createHinge (dWorld &world, dJointGroup *group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateHinge (world.id(), group ? group->id() : 0);
+ }
+ void createSlider (dWorld &world, dJointGroup *group=0) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateSlider (world.id(), group ? group->id() : 0);
+ }
+ void createContact (dWorld &world, dJointGroup *group, dContact *contact) {
+ if (_id) dJointDestroy (_id);
+ _id = dJointCreateContact (world.id(), group ? group->id() : 0, contact);
+ }
+
+ void attach (dBody &body1, dBody &body2)
+ { dJointAttach (_id, body1.id(), body2.id()); }
+
+ void setBallAnchor (dReal x, dReal y, dReal z)
+ { dJointSetBallAnchor (_id, x, y, z); }
+ void setHingeAnchor (dReal x, dReal y, dReal z)
+ { dJointSetHingeAnchor (_id, x, y, z); }
+
+ void setHingeAxis (dReal x, dReal y, dReal z)
+ { dJointSetHingeAxis (_id, x, y, z); }
+ void setSliderAxis (dReal x, dReal y, dReal z)
+ { dJointSetSliderAxis (_id, x, y, z); }
+
+ void getBallAnchor (dVector3 result)
+ { dJointGetBallAnchor (_id, result); }
+ void getHingeAnchor (dVector3 result)
+ { dJointGetHingeAnchor (_id, result); }
+
+ void getHingeAxis (dVector3 result)
+ { dJointGetHingeAxis (_id, result); }
+ void getSliderAxis (dVector3 result)
+ { dJointGetSliderAxis (_id, result); }
+};
+
+
+class dSpace {
+ dSpaceID _id;
+
+ dSpace (dSpace &) { dDebug (0,"bad"); }
+ void operator= (dSpace &) { dDebug (0,"bad"); }
+
+public:
+ dSpace ()
+ { _id = dHashSpaceCreate(); }
+ ~dSpace()
+ { dSpaceDestroy (_id); }
+ dSpaceID id()
+ { return _id; }
+ void collide (void *data, dNearCallback *callback)
+ { dSpaceCollide (_id,data,callback); }
+};
+
+
+class dGeom {
+ dGeomID _id;
+
+ dGeom (dGeom &) { dDebug (0,"bad"); }
+ void operator= (dGeom &) { dDebug (0,"bad"); }
+
+public:
+ dGeom()
+ { _id = 0; }
+ ~dGeom()
+ { dGeomDestroy (_id); }
+ dGeomID id()
+ { return _id; }
+
+ void createSphere (dSpace &space, dReal radius) {
+ if (_id) dGeomDestroy (_id);
+ _id = dCreateSphere (space.id(),radius);
+ }
+
+ void createBox (dSpace &space, dReal lx, dReal ly, dReal lz) {
+ if (_id) dGeomDestroy (_id);
+ _id = dCreateBox (space.id(),lx,ly,lz);
+ }
+
+ void createPlane (dSpace &space, dReal a, dReal b, dReal c, dReal d) {
+ if (_id) dGeomDestroy (_id);
+ _id = dCreatePlane (space.id(),a,b,c,d);
+ }
+
+ void createCCylinder (dSpace &space, dReal radius, dReal length) {
+ if (_id) dGeomDestroy (_id);
+ _id = dCreateCCylinder (space.id(),radius,length);
+ }
+
+ void destroy() {
+ if (_id) dGeomDestroy (_id);
+ _id = 0;
+ }
+
+ int getClass()
+ { return dGeomGetClass (_id); }
+
+ dReal sphereGetRadius()
+ { return dGeomSphereGetRadius (_id); }
+
+ void boxGetLengths (dVector3 result)
+ { dGeomBoxGetLengths (_id,result); }
+
+ void planeGetParams (dVector4 result)
+ { dGeomPlaneGetParams (_id,result); }
+
+ void CCylinderGetParams (dReal *radius, dReal *length)
+ { dGeomCCylinderGetParams (_id,radius,length); }
+
+ void setData (void *data)
+ { dGeomSetData (_id,data); }
+
+ void *getData()
+ { return dGeomGetData (_id); }
+
+ void setBody (dBody &b)
+ { dGeomSetBody (_id,b.id()); }
+ void setBody (dBodyID b)
+ { dGeomSetBody (_id,b); }
+
+ dBodyID getBody()
+ { return dGeomGetBody (_id); }
+
+ void setPosition (dReal x, dReal y, dReal z)
+ { dGeomSetPosition (_id,x,y,z); }
+
+ void setRotation (const dMatrix3 R)
+ { dGeomSetRotation (_id,R); }
+
+ const dReal * getPosition()
+ { return dGeomGetPosition (_id); }
+
+ const dReal * getRotation()
+ { return dGeomGetRotation (_id); }
+};
+
+
+#endif
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_ODEMATH_H_
+#define _ODE_ODEMATH_H_
+
+#include <ode/common.h>
+
+#ifdef __GNUC__
+#define PURE_INLINE extern inline
+#else
+#define PURE_INLINE inline
+#endif
+
+/*
+ * macro to access elements i,j in an NxM matrix A, independent of the
+ * matrix storage convention.
+ */
+#define dACCESS33(A,i,j) ((A)[(i)*4+(j)])
+
+/*
+ * Macro to test for valid floating point values
+ */
+#define dVALIDVEC3(v) (!(dIsNan(v[0]) || dIsNan(v[1]) || dIsNan(v[2])))
+#define dVALIDVEC4(v) (!(dIsNan(v[0]) || dIsNan(v[2]) || dIsNan(v[2]) || dIsNan(v[3])))
+#define dVALIDMAT3(m) (!(dIsNan(m[0]) || dIsNan(m[1]) || dIsNan(m[2]) || dIsNan(m[3]) || dIsNan(m[4]) || dIsNan(m[5]) || dIsNan(m[6]) || dIsNan(m[7]) || dIsNan(m[8]) || dIsNan(m[9]) || dIsNan(m[10]) || dIsNan(m[11])))
+#define dVALIDMAT4(m) (!(dIsNan(m[0]) || dIsNan(m[1]) || dIsNan(m[2]) || dIsNan(m[3]) || dIsNan(m[4]) || dIsNan(m[5]) || dIsNan(m[6]) || dIsNan(m[7]) || dIsNan(m[8]) || dIsNan(m[9]) || dIsNan(m[10]) || dIsNan(m[11]) || dIsNan(m[12]) || dIsNan(m[13]) || dIsNan(m[14]) || dIsNan(m[15]) ))
+
+
+
+/*
+ * General purpose vector operations with other vectors or constants.
+ */
+
+#define dOP(a,op,b,c) \
+ (a)[0] = ((b)[0]) op ((c)[0]); \
+ (a)[1] = ((b)[1]) op ((c)[1]); \
+ (a)[2] = ((b)[2]) op ((c)[2]);
+#define dOPC(a,op,b,c) \
+ (a)[0] = ((b)[0]) op (c); \
+ (a)[1] = ((b)[1]) op (c); \
+ (a)[2] = ((b)[2]) op (c);
+#define dOPE(a,op,b) \
+ (a)[0] op ((b)[0]); \
+ (a)[1] op ((b)[1]); \
+ (a)[2] op ((b)[2]);
+#define dOPEC(a,op,c) \
+ (a)[0] op (c); \
+ (a)[1] op (c); \
+ (a)[2] op (c);
+
+
+/*
+ * Length, and squared length helpers. dLENGTH returns the length of a dVector3.
+ * dLENGTHSQUARED return the squared length of a dVector3.
+ */
+
+#define dLENGTHSQUARED(a) (((a)[0])*((a)[0]) + ((a)[1])*((a)[1]) + ((a)[2])*((a)[2]))
+
+#ifdef __cplusplus
+
+PURE_INLINE dReal dLENGTH (const dReal *a) { return dSqrt(dLENGTHSQUARED(a)); }
+
+#else
+
+#define dLENGTH(a) ( dSqrt( ((a)[0])*((a)[0]) + ((a)[1])*((a)[1]) + ((a)[2])*((a)[2]) ) )
+
+#endif /* __cplusplus */
+
+
+
+
+
+/*
+ * 3-way dot product. dDOTpq means that elements of `a' and `b' are spaced
+ * p and q indexes apart respectively. dDOT() means dDOT11.
+ * in C++ we could use function templates to get all the versions of these
+ * functions - but on some compilers this will result in sub-optimal code.
+ */
+
+#define dDOTpq(a,b,p,q) ((a)[0]*(b)[0] + (a)[p]*(b)[q] + (a)[2*(p)]*(b)[2*(q)])
+
+#ifdef __cplusplus
+
+PURE_INLINE dReal dDOT (const dReal *a, const dReal *b) { return dDOTpq(a,b,1,1); }
+PURE_INLINE dReal dDOT13 (const dReal *a, const dReal *b) { return dDOTpq(a,b,1,3); }
+PURE_INLINE dReal dDOT31 (const dReal *a, const dReal *b) { return dDOTpq(a,b,3,1); }
+PURE_INLINE dReal dDOT33 (const dReal *a, const dReal *b) { return dDOTpq(a,b,3,3); }
+PURE_INLINE dReal dDOT14 (const dReal *a, const dReal *b) { return dDOTpq(a,b,1,4); }
+PURE_INLINE dReal dDOT41 (const dReal *a, const dReal *b) { return dDOTpq(a,b,4,1); }
+PURE_INLINE dReal dDOT44 (const dReal *a, const dReal *b) { return dDOTpq(a,b,4,4); }
+
+#else
+
+#define dDOT(a,b) dDOTpq(a,b,1,1)
+#define dDOT13(a,b) dDOTpq(a,b,1,3)
+#define dDOT31(a,b) dDOTpq(a,b,3,1)
+#define dDOT33(a,b) dDOTpq(a,b,3,3)
+#define dDOT14(a,b) dDOTpq(a,b,1,4)
+#define dDOT41(a,b) dDOTpq(a,b,4,1)
+#define dDOT44(a,b) dDOTpq(a,b,4,4)
+
+#endif /* __cplusplus */
+
+
+/*
+ * cross product, set a = b x c. dCROSSpqr means that elements of `a', `b'
+ * and `c' are spaced p, q and r indexes apart respectively.
+ * dCROSS() means dCROSS111. `op' is normally `=', but you can set it to
+ * +=, -= etc to get other effects.
+ */
+
+#define dCROSS(a,op,b,c) \
+do { \
+ (a)[0] op ((b)[1]*(c)[2] - (b)[2]*(c)[1]); \
+ (a)[1] op ((b)[2]*(c)[0] - (b)[0]*(c)[2]); \
+ (a)[2] op ((b)[0]*(c)[1] - (b)[1]*(c)[0]); \
+} while(0)
+#define dCROSSpqr(a,op,b,c,p,q,r) \
+do { \
+ (a)[ 0] op ((b)[ q]*(c)[2*r] - (b)[2*q]*(c)[ r]); \
+ (a)[ p] op ((b)[2*q]*(c)[ 0] - (b)[ 0]*(c)[2*r]); \
+ (a)[2*p] op ((b)[ 0]*(c)[ r] - (b)[ q]*(c)[ 0]); \
+} while(0)
+#define dCROSS114(a,op,b,c) dCROSSpqr(a,op,b,c,1,1,4)
+#define dCROSS141(a,op,b,c) dCROSSpqr(a,op,b,c,1,4,1)
+#define dCROSS144(a,op,b,c) dCROSSpqr(a,op,b,c,1,4,4)
+#define dCROSS411(a,op,b,c) dCROSSpqr(a,op,b,c,4,1,1)
+#define dCROSS414(a,op,b,c) dCROSSpqr(a,op,b,c,4,1,4)
+#define dCROSS441(a,op,b,c) dCROSSpqr(a,op,b,c,4,4,1)
+#define dCROSS444(a,op,b,c) dCROSSpqr(a,op,b,c,4,4,4)
+
+
+/*
+ * set a 3x3 submatrix of A to a matrix such that submatrix(A)*b = a x b.
+ * A is stored by rows, and has `skip' elements per row. the matrix is
+ * assumed to be already zero, so this does not write zero elements!
+ * if (plus,minus) is (+,-) then a positive version will be written.
+ * if (plus,minus) is (-,+) then a negative version will be written.
+ */
+
+#define dCROSSMAT(A,a,skip,plus,minus) \
+do { \
+ (A)[1] = minus (a)[2]; \
+ (A)[2] = plus (a)[1]; \
+ (A)[(skip)+0] = plus (a)[2]; \
+ (A)[(skip)+2] = minus (a)[0]; \
+ (A)[2*(skip)+0] = minus (a)[1]; \
+ (A)[2*(skip)+1] = plus (a)[0]; \
+} while(0)
+
+
+/*
+ * compute the distance between two 3D-vectors
+ */
+
+#ifdef __cplusplus
+PURE_INLINE dReal dDISTANCE (const dVector3 a, const dVector3 b)
+ { return dSqrt( (a[0]-b[0])*(a[0]-b[0]) + (a[1]-b[1])*(a[1]-b[1]) + (a[2]-b[2])*(a[2]-b[2]) ); }
+#else
+#define dDISTANCE(a,b) \
+ (dSqrt( ((a)[0]-(b)[0])*((a)[0]-(b)[0]) + ((a)[1]-(b)[1])*((a)[1]-(b)[1]) + ((a)[2]-(b)[2])*((a)[2]-(b)[2]) ))
+#endif
+
+
+/*
+ * special case matrix multipication, with operator selection
+ */
+
+#define dMULTIPLYOP0_331(A,op,B,C) \
+do { \
+ (A)[0] op dDOT((B),(C)); \
+ (A)[1] op dDOT((B+4),(C)); \
+ (A)[2] op dDOT((B+8),(C)); \
+} while(0)
+#define dMULTIPLYOP1_331(A,op,B,C) \
+do { \
+ (A)[0] op dDOT41((B),(C)); \
+ (A)[1] op dDOT41((B+1),(C)); \
+ (A)[2] op dDOT41((B+2),(C)); \
+} while(0)
+#define dMULTIPLYOP0_133(A,op,B,C) \
+do { \
+ (A)[0] op dDOT14((B),(C)); \
+ (A)[1] op dDOT14((B),(C+1)); \
+ (A)[2] op dDOT14((B),(C+2)); \
+} while(0)
+#define dMULTIPLYOP0_333(A,op,B,C) \
+do { \
+ (A)[0] op dDOT14((B),(C)); \
+ (A)[1] op dDOT14((B),(C+1)); \
+ (A)[2] op dDOT14((B),(C+2)); \
+ (A)[4] op dDOT14((B+4),(C)); \
+ (A)[5] op dDOT14((B+4),(C+1)); \
+ (A)[6] op dDOT14((B+4),(C+2)); \
+ (A)[8] op dDOT14((B+8),(C)); \
+ (A)[9] op dDOT14((B+8),(C+1)); \
+ (A)[10] op dDOT14((B+8),(C+2)); \
+} while(0)
+#define dMULTIPLYOP1_333(A,op,B,C) \
+do { \
+ (A)[0] op dDOT44((B),(C)); \
+ (A)[1] op dDOT44((B),(C+1)); \
+ (A)[2] op dDOT44((B),(C+2)); \
+ (A)[4] op dDOT44((B+1),(C)); \
+ (A)[5] op dDOT44((B+1),(C+1)); \
+ (A)[6] op dDOT44((B+1),(C+2)); \
+ (A)[8] op dDOT44((B+2),(C)); \
+ (A)[9] op dDOT44((B+2),(C+1)); \
+ (A)[10] op dDOT44((B+2),(C+2)); \
+} while(0)
+#define dMULTIPLYOP2_333(A,op,B,C) \
+do { \
+ (A)[0] op dDOT((B),(C)); \
+ (A)[1] op dDOT((B),(C+4)); \
+ (A)[2] op dDOT((B),(C+8)); \
+ (A)[4] op dDOT((B+4),(C)); \
+ (A)[5] op dDOT((B+4),(C+4)); \
+ (A)[6] op dDOT((B+4),(C+8)); \
+ (A)[8] op dDOT((B+8),(C)); \
+ (A)[9] op dDOT((B+8),(C+4)); \
+ (A)[10] op dDOT((B+8),(C+8)); \
+} while(0)
+
+#ifdef __cplusplus
+
+#define DECL template <class TA, class TB, class TC> PURE_INLINE void
+
+DECL dMULTIPLY0_331(TA *A, const TB *B, const TC *C) { dMULTIPLYOP0_331(A,=,B,C); }
+DECL dMULTIPLY1_331(TA *A, const TB *B, const TC *C) { dMULTIPLYOP1_331(A,=,B,C); }
+DECL dMULTIPLY0_133(TA *A, const TB *B, const TC *C) { dMULTIPLYOP0_133(A,=,B,C); }
+DECL dMULTIPLY0_333(TA *A, const TB *B, const TC *C) { dMULTIPLYOP0_333(A,=,B,C); }
+DECL dMULTIPLY1_333(TA *A, const TB *B, const TC *C) { dMULTIPLYOP1_333(A,=,B,C); }
+DECL dMULTIPLY2_333(TA *A, const TB *B, const TC *C) { dMULTIPLYOP2_333(A,=,B,C); }
+
+DECL dMULTIPLYADD0_331(TA *A, const TB *B, const TC *C) { dMULTIPLYOP0_331(A,+=,B,C); }
+DECL dMULTIPLYADD1_331(TA *A, const TB *B, const TC *C) { dMULTIPLYOP1_331(A,+=,B,C); }
+DECL dMULTIPLYADD0_133(TA *A, const TB *B, const TC *C) { dMULTIPLYOP0_133(A,+=,B,C); }
+DECL dMULTIPLYADD0_333(TA *A, const TB *B, const TC *C) { dMULTIPLYOP0_333(A,+=,B,C); }
+DECL dMULTIPLYADD1_333(TA *A, const TB *B, const TC *C) { dMULTIPLYOP1_333(A,+=,B,C); }
+DECL dMULTIPLYADD2_333(TA *A, const TB *B, const TC *C) { dMULTIPLYOP2_333(A,+=,B,C); }
+
+#undef DECL
+
+#else
+
+#define dMULTIPLY0_331(A,B,C) dMULTIPLYOP0_331(A,=,B,C)
+#define dMULTIPLY1_331(A,B,C) dMULTIPLYOP1_331(A,=,B,C)
+#define dMULTIPLY0_133(A,B,C) dMULTIPLYOP0_133(A,=,B,C)
+#define dMULTIPLY0_333(A,B,C) dMULTIPLYOP0_333(A,=,B,C)
+#define dMULTIPLY1_333(A,B,C) dMULTIPLYOP1_333(A,=,B,C)
+#define dMULTIPLY2_333(A,B,C) dMULTIPLYOP2_333(A,=,B,C)
+
+#define dMULTIPLYADD0_331(A,B,C) dMULTIPLYOP0_331(A,+=,B,C)
+#define dMULTIPLYADD1_331(A,B,C) dMULTIPLYOP1_331(A,+=,B,C)
+#define dMULTIPLYADD0_133(A,B,C) dMULTIPLYOP0_133(A,+=,B,C)
+#define dMULTIPLYADD0_333(A,B,C) dMULTIPLYOP0_333(A,+=,B,C)
+#define dMULTIPLYADD1_333(A,B,C) dMULTIPLYOP1_333(A,+=,B,C)
+#define dMULTIPLYADD2_333(A,B,C) dMULTIPLYOP2_333(A,+=,B,C)
+
+#endif
+
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*
+ * normalize 3x1 and 4x1 vectors (i.e. scale them to unit length)
+ */
+ODE_API void dNormalize3 (dVector3 a);
+ODE_API void dNormalize4 (dVector4 a);
+
+
+/*
+ * given a unit length "normal" vector n, generate vectors p and q vectors
+ * that are an orthonormal basis for the plane space perpendicular to n.
+ * i.e. this makes p,q such that n,p,q are all perpendicular to each other.
+ * q will equal n x p. if n is not unit length then p will be unit length but
+ * q wont be.
+ */
+
+ODE_API void dPlaneSpace (const dVector3 n, dVector3 p, dVector3 q);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_ROTATION_H_
+#define _ODE_ROTATION_H_
+
+#include <ode/common.h>
+#include <ode/compatibility.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+ODE_API void dRSetIdentity (dMatrix3 R);
+
+ODE_API void dRFromAxisAndAngle (dMatrix3 R, dReal ax, dReal ay, dReal az,
+ dReal angle);
+
+ODE_API void dRFromEulerAngles (dMatrix3 R, dReal phi, dReal theta, dReal psi);
+
+ODE_API void dRFrom2Axes (dMatrix3 R, dReal ax, dReal ay, dReal az,
+ dReal bx, dReal by, dReal bz);
+
+ODE_API void dRFromZAxis (dMatrix3 R, dReal ax, dReal ay, dReal az);
+
+ODE_API void dQSetIdentity (dQuaternion q);
+
+ODE_API void dQFromAxisAndAngle (dQuaternion q, dReal ax, dReal ay, dReal az,
+ dReal angle);
+
+/* Quaternion multiplication, analogous to the matrix multiplication routines. */
+/* qa = rotate by qc, then qb */
+ODE_API void dQMultiply0 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc);
+/* qa = rotate by qc, then by inverse of qb */
+ODE_API void dQMultiply1 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc);
+/* qa = rotate by inverse of qc, then by qb */
+ODE_API void dQMultiply2 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc);
+/* qa = rotate by inverse of qc, then by inverse of qb */
+ODE_API void dQMultiply3 (dQuaternion qa, const dQuaternion qb, const dQuaternion qc);
+
+ODE_API void dRfromQ (dMatrix3 R, const dQuaternion q);
+ODE_API void dQfromR (dQuaternion q, const dMatrix3 R);
+ODE_API void dDQfromW (dReal dq[4], const dVector3 w, const dQuaternion q);
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+/*************************************************************************
+ * *
+ * Open Dynamics Engine, Copyright (C) 2001,2002 Russell L. Smith. *
+ * All rights reserved. Email: russ@q12.org Web: www.q12.org *
+ * *
+ * This library is free software; you can redistribute it and/or *
+ * modify it under the terms of EITHER: *
+ * (1) The GNU Lesser General Public License as published by the Free *
+ * Software Foundation; either version 2.1 of the License, or (at *
+ * your option) any later version. The text of the GNU Lesser *
+ * General Public License is included with this library in the *
+ * file LICENSE.TXT. *
+ * (2) The BSD-style license that is included with this library in *
+ * the file LICENSE-BSD.TXT. *
+ * *
+ * This library is distributed in the hope that it will be useful, *
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of *
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the files *
+ * LICENSE.TXT and LICENSE-BSD.TXT for more details. *
+ * *
+ *************************************************************************/
+
+#ifndef _ODE_TIMER_H_
+#define _ODE_TIMER_H_
+
+#include <ode/config.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+
+/* stop watch objects */
+
+typedef struct dStopwatch {
+ double time; /* total clock count */
+ unsigned long cc[2]; /* clock count since last `start' */
+} dStopwatch;
+
+ODE_API void dStopwatchReset (dStopwatch *);
+ODE_API void dStopwatchStart (dStopwatch *);
+ODE_API void dStopwatchStop (dStopwatch *);
+ODE_API double dStopwatchTime (dStopwatch *); /* returns total time in secs */
+
+
+/* code timers */
+
+ODE_API void dTimerStart (const char *description); /* pass a static string here */
+ODE_API void dTimerNow (const char *description); /* pass a static string here */
+ODE_API void dTimerEnd(void);
+
+/* print out a timer report. if `average' is nonzero, print out the average
+ * time for each slot (this is only meaningful if the same start-now-end
+ * calls are being made repeatedly.
+ */
+ODE_API void dTimerReport (FILE *fout, int average);
+
+
+/* resolution */
+
+/* returns the timer ticks per second implied by the timing hardware or API.
+ * the actual timer resolution may not be this great.
+ */
+ODE_API double dTimerTicksPerSecond(void);
+
+/* returns an estimate of the actual timer resolution, in seconds. this may
+ * be greater than 1/ticks_per_second.
+ */
+ODE_API double dTimerResolution(void);
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
--- /dev/null
+var Module=typeof Module!="undefined"?Module:{};var ODE=function(){var moduleOverrides=Object.assign({},Module);var arguments_=[];var thisProgram="./this.program";var quit_=(status,toThrow)=>{throw toThrow};var ENVIRONMENT_IS_WEB=typeof window=="object";var ENVIRONMENT_IS_WORKER=typeof importScripts=="function";var ENVIRONMENT_IS_NODE=typeof process=="object"&&typeof process.versions=="object"&&typeof process.versions.node=="string";var scriptDirectory="";function locateFile(path){if(Module["locateFile"]){return Module["locateFile"](path,scriptDirectory)}return scriptDirectory+path}var read_,readAsync,readBinary;if(ENVIRONMENT_IS_NODE){var fs=require("fs");var nodePath=require("path");if(ENVIRONMENT_IS_WORKER){scriptDirectory=nodePath.dirname(scriptDirectory)+"/"}else{scriptDirectory=__dirname+"/"}read_=(filename,binary)=>{filename=isFileURI(filename)?new URL(filename):nodePath.normalize(filename);return fs.readFileSync(filename,binary?undefined:"utf8")};readBinary=filename=>{var ret=read_(filename,true);if(!ret.buffer){ret=new Uint8Array(ret)}return ret};readAsync=(filename,onload,onerror,binary=true)=>{filename=isFileURI(filename)?new URL(filename):nodePath.normalize(filename);fs.readFile(filename,binary?undefined:"utf8",(err,data)=>{if(err)onerror(err);else onload(binary?data.buffer:data)})};if(!Module["thisProgram"]&&process.argv.length>1){thisProgram=process.argv[1].replace(/\\/g,"/")}arguments_=process.argv.slice(2);if(typeof module!="undefined"){module["exports"]=Module}process.on("uncaughtException",ex=>{if(ex!=="unwind"&&!(ex instanceof ExitStatus)&&!(ex.context instanceof ExitStatus)){throw ex}});quit_=(status,toThrow)=>{process.exitCode=status;throw toThrow};Module["inspect"]=()=>"[Emscripten Module object]"}else if(ENVIRONMENT_IS_WEB||ENVIRONMENT_IS_WORKER){if(ENVIRONMENT_IS_WORKER){scriptDirectory=self.location.href}else if(typeof document!="undefined"&&document.currentScript){scriptDirectory=document.currentScript.src}if(scriptDirectory.indexOf("blob:")!==0){scriptDirectory=scriptDirectory.substr(0,scriptDirectory.replace(/[?#].*/,"").lastIndexOf("/")+1)}else{scriptDirectory=""}{read_=url=>{var xhr=new XMLHttpRequest;xhr.open("GET",url,false);xhr.send(null);return xhr.responseText};if(ENVIRONMENT_IS_WORKER){readBinary=url=>{var xhr=new XMLHttpRequest;xhr.open("GET",url,false);xhr.responseType="arraybuffer";xhr.send(null);return new Uint8Array(xhr.response)}}readAsync=(url,onload,onerror)=>{var xhr=new XMLHttpRequest;xhr.open("GET",url,true);xhr.responseType="arraybuffer";xhr.onload=()=>{if(xhr.status==200||xhr.status==0&&xhr.response){onload(xhr.response);return}onerror()};xhr.onerror=onerror;xhr.send(null)}}}else{}var out=Module["print"]||console.log.bind(console);var err=Module["printErr"]||console.error.bind(console);Object.assign(Module,moduleOverrides);moduleOverrides=null;if(Module["arguments"])arguments_=Module["arguments"];if(Module["thisProgram"])thisProgram=Module["thisProgram"];if(Module["quit"])quit_=Module["quit"];var wasmBinary;if(Module["wasmBinary"])wasmBinary=Module["wasmBinary"];var noExitRuntime=Module["noExitRuntime"]||true;if(typeof WebAssembly!="object"){abort("no native wasm support detected")}var wasmMemory;var ABORT=false;var EXITSTATUS;var HEAP8,HEAPU8,HEAP16,HEAPU16,HEAP32,HEAPU32,HEAPF32,HEAPF64;function updateMemoryViews(){var b=wasmMemory.buffer;Module["HEAP8"]=HEAP8=new Int8Array(b);Module["HEAP16"]=HEAP16=new Int16Array(b);Module["HEAPU8"]=HEAPU8=new Uint8Array(b);Module["HEAPU16"]=HEAPU16=new Uint16Array(b);Module["HEAP32"]=HEAP32=new Int32Array(b);Module["HEAPU32"]=HEAPU32=new Uint32Array(b);Module["HEAPF32"]=HEAPF32=new Float32Array(b);Module["HEAPF64"]=HEAPF64=new Float64Array(b)}var __ATPRERUN__=[];var __ATINIT__=[];var __ATPOSTRUN__=[];var runtimeInitialized=false;var runtimeKeepaliveCounter=0;function preRun(){if(Module["preRun"]){if(typeof Module["preRun"]=="function")Module["preRun"]=[Module["preRun"]];while(Module["preRun"].length){addOnPreRun(Module["preRun"].shift())}}callRuntimeCallbacks(__ATPRERUN__)}function initRuntime(){runtimeInitialized=true;callRuntimeCallbacks(__ATINIT__)}function postRun(){if(Module["postRun"]){if(typeof Module["postRun"]=="function")Module["postRun"]=[Module["postRun"]];while(Module["postRun"].length){addOnPostRun(Module["postRun"].shift())}}callRuntimeCallbacks(__ATPOSTRUN__)}function addOnPreRun(cb){__ATPRERUN__.unshift(cb)}function addOnInit(cb){__ATINIT__.unshift(cb)}function addOnPostRun(cb){__ATPOSTRUN__.unshift(cb)}var runDependencies=0;var runDependencyWatcher=null;var dependenciesFulfilled=null;function addRunDependency(id){runDependencies++;if(Module["monitorRunDependencies"]){Module["monitorRunDependencies"](runDependencies)}}function removeRunDependency(id){runDependencies--;if(Module["monitorRunDependencies"]){Module["monitorRunDependencies"](runDependencies)}if(runDependencies==0){if(runDependencyWatcher!==null){clearInterval(runDependencyWatcher);runDependencyWatcher=null}if(dependenciesFulfilled){var callback=dependenciesFulfilled;dependenciesFulfilled=null;callback()}}}function abort(what){if(Module["onAbort"]){Module["onAbort"](what)}what="Aborted("+what+")";err(what);ABORT=true;EXITSTATUS=1;what+=". Build with -sASSERTIONS for more info.";var e=new WebAssembly.RuntimeError(what);throw e}var dataURIPrefix="data:application/octet-stream;base64,";function isDataURI(filename){return filename.startsWith(dataURIPrefix)}function isFileURI(filename){return filename.startsWith("file://")}var wasmBinaryFile;wasmBinaryFile="data:application/octet-stream;base64,AGFzbQEAAAAB7QM8YAJ/fwBgAX8AYAF/AX9gBX9/f39/AX9gA39/fwBgA39/fwF/YAR/f39/AGACf38Bf2AEf319fQBgAX8BfWADf39/AX1gBX9/f39/AGACf30AYAV/f39/fwF9YAR/f39/AX9gA39/fQBgAn9/AX1gBH99fX0BfWAHf319fX19fQBgAAF/YAV/fX19fQBgBn9/f39/fwBgAABgA399fQBgBX99f319AGADf35/AX5gB39/f39/f38Bf2AGf39/f399AGABfQF9YAN/fX0Bf2AIf39/f39/f38AYAd/f39/f39/AGAFf319fX8AYAJ/fQF/YAF8AX1gAnx/AXxgBn98f39/fwF/YAR/fX19AX9gCH9/f399f39/AX9gCX9/f39/f39/fwF/YAd/f39/f399AGAFf39/fX0Bf2APf39/fX19fX19fX1/f39/AX9gCX9/f39/f399fwBgBX99f31/AX9gC39/f319f399fX1/AGAGf39/f39/AX9gBn99fX1/fwBgBH9/f38BfWAGf39/fX19AGAOf39/f39/f39/f39/f38AYAt/fX19fX19fX19fQBgBn9/fX19fQF/YAV/fX19fQF/YAV/f31/fwF/YAN/fX8AYAJ9fQF9YAJ9fwF/YAJ9fwF9YAJ+fwF/AqoBBgNlbnYFYWJvcnQAFgNlbnYUZW1zY3JpcHRlbl9tZW1jcHlfanMABBZ3YXNpX3NuYXBzaG90X3ByZXZpZXcxCGZkX2Nsb3NlAAIWd2FzaV9zbmFwc2hvdF9wcmV2aWV3MQhmZF93cml0ZQAOA2VudhZlbXNjcmlwdGVuX3Jlc2l6ZV9oZWFwAAIWd2FzaV9zbmFwc2hvdF9wcmV2aWV3MQdmZF9zZWVrAAMDmgSYBBYKBgYGAAQBJQgAEQMDAQEdFwQRAwMDAwEFAwADAyYDGicDCwMBBQMCAQUBAAIIAAICAAACAgQBAQcAAAABBAYGBAYCAgQEAQACAAAEAQIBAgEBAQMCAAIAAh4TAR4fAQEBAQEBAQEBAQIBAQMDCygDBQMDAwMAKhorBQQsBQMDAwMDAwEdBAYEBAIKAQIBEy0XAQUDAy4ILwABAAALCAgAAA8QCTAJAQAACQkIAA8QAQAABgAACAEICA8AAAAQCQkJAQAACAEICAAAAAAPEAkJCQkJCQEAAAAxAQ8PAAIEBxAQEAIAAQAAAQEAAAAAMgACATMXFxgYDBgYFBQIAAAADwQEAgILCwIAAgEIAAAICAICAgICAAAICAgIEhISEgICICACBwEBAgcFBwcFBwcHBwcBAgEBBAIHBxMBCAAMCQwJDAwADAkMCQEBBDQBNRQAGwYhARIDNgMDAwMBARQUAAgSAQQEBAAEASEMCREDAwMGBhsMNwEBAQAAAgIBAgIBAgECAQcCAgYAAAAAAAAAAAIBBwYHBQQCAQcGBwUEAgEHBQQCAQcFBAICAgICAQECAAAAAAAAAAAOBgAAAAAAAAAADgoNDgIBAAQEBAQfAAAAAAICAgAAAAACAQEAADgcIiI5HAUEBRMCBAIBOiMcAgUZGQIjCxoEAgY7CyQAAgcCAgEAAAIWBQUEBgYGBAsLFRUTAQIDBAUBcADDAQUGAQGABIAEBg0CfwFBkMEFC38BQQALB9ogwQEGbWVtb3J5AgARX193YXNtX2NhbGxfY3RvcnMABgpkQ3JlYXRlQm94AA4SZEdlb21Cb3hTZXRMZW5ndGhzAA8SZEdlb21Cb3hHZXRMZW5ndGhzABAZX19pbmRpcmVjdF9mdW5jdGlvbl90YWJsZQEADmRDcmVhdGVDYXBzdWxlABYVZEdlb21DYXBzdWxlU2V0UGFyYW1zABcVZEdlb21DYXBzdWxlR2V0UGFyYW1zABgQZEdlb21HZXRSb3RhdGlvbgA3EGRHZW9tR2V0UG9zaXRpb24ANg1kUlNldElkZW50aXR5AOQCE2RHZW9tUGxhbmVHZXRQYXJhbXMA1wIUZEdlb21TcGhlcmVHZXRSYWRpdXMA8wIMZEdlb21HZXRCb2R5ADMRZEJvZHlHZXRMaW5lYXJWZWwAmgIIZENvbGxpZGUAKglkU3BhY2VBZGQAUAxkU3BhY2VSZW1vdmUAUQxkR2VvbURlc3Ryb3kAMQxkR2VvbVNldEJvZHkAMhBkR2VvbVNldFBvc2l0aW9uADQQZEJvZHlTZXRQb3NpdGlvbgCSAhBkR2VvbVNldFJvdGF0aW9uADUQZEJvZHlTZXRSb3RhdGlvbgCTAhJkQm9keVNldFF1YXRlcm5pb24AlAISZEJvZHlHZXRRdWF0ZXJuaW9uAJkCDGRHZW9tR2V0QUFCQgA5DWRHZW9tR2V0Q2xhc3MAOxJkU2ltcGxlU3BhY2VDcmVhdGUASRBkSGFzaFNwYWNlQ3JlYXRlAEoTZEhhc2hTcGFjZVNldExldmVscwBLE2RIYXNoU3BhY2VHZXRMZXZlbHMATA1kU3BhY2VEZXN0cm95AE0QZFNwYWNlU2V0Q2xlYW51cABOEGRTcGFjZUdldENsZWFudXAATw1kU3BhY2VDb2xsaWRlAFIUZENyZWF0ZUdlb21UcmFuc2Zvcm0AWxVkR2VvbVRyYW5zZm9ybVNldEdlb20AXBVkR2VvbVRyYW5zZm9ybUdldEdlb20AXRhkR2VvbVRyYW5zZm9ybVNldENsZWFudXAAXhhkR2VvbVRyYW5zZm9ybUdldENsZWFudXAAXxZkR2VvbVRyaU1lc2hEYXRhQ3JlYXRlAGEXZEdlb21UcmlNZXNoRGF0YURlc3Ryb3kAYhxkR2VvbVRyaU1lc2hEYXRhQnVpbGRTaW5nbGUxAGMbZEdlb21UcmlNZXNoRGF0YUJ1aWxkU2luZ2xlAGQOZENyZWF0ZVRyaU1lc2gAcg9kQ3JlYXRlQ3lsaW5kZXIAiwEaZEdlb21IZWlnaHRmaWVsZERhdGFDcmVhdGUAlQEhZEdlb21IZWlnaHRmaWVsZERhdGFCdWlsZENhbGxiYWNrAJYBHWRHZW9tSGVpZ2h0ZmllbGREYXRhU2V0Qm91bmRzAJcBG2RHZW9tSGVpZ2h0ZmllbGREYXRhRGVzdHJveQCYARJkQ3JlYXRlSGVpZ2h0ZmllbGQAmQEOZEJvZHlBZGRUb3JxdWUAnwINZEJvZHlBZGRGb3JjZQCeAhNkSm9pbnRTZXRCYWxsQW5jaG9yAJ0BE2RKb2ludEdldEJhbGxBbmNob3IAnwEUZEpvaW50U2V0SGluZ2VBbmNob3IApAESZEpvaW50U2V0SGluZ2VBeGlzAKUBFGRKb2ludEdldEhpbmdlQW5jaG9yAKYBEmRKb2ludEdldEhpbmdlQXhpcwCnARNkSm9pbnRTZXRIaW5nZVBhcmFtAKgBE2RKb2ludEdldEhpbmdlUGFyYW0AqQETZEpvaW50R2V0SGluZ2VBbmdsZQCqARdkSm9pbnRHZXRIaW5nZUFuZ2xlUmF0ZQCsARdkSm9pbnRHZXRTbGlkZXJQb3NpdGlvbgCwARtkSm9pbnRHZXRTbGlkZXJQb3NpdGlvblJhdGUAsQETZEpvaW50U2V0U2xpZGVyQXhpcwCyARNkSm9pbnRHZXRTbGlkZXJBeGlzALMBFGRKb2ludFNldFNsaWRlclBhcmFtALQBFGRKb2ludEdldFNsaWRlclBhcmFtALUBFWRKb2ludFNldEhpbmdlMkFuY2hvcgC8ARRkSm9pbnRTZXRIaW5nZTJBeGlzMQC+ARRkSm9pbnRTZXRIaW5nZTJBeGlzMgC/ARRkSm9pbnRTZXRIaW5nZTJQYXJhbQDAARVkSm9pbnRHZXRIaW5nZTJBbmNob3IAwQEUZEpvaW50R2V0SGluZ2UyQXhpczEAwgEUZEpvaW50R2V0SGluZ2UyQXhpczIAwwEUZEpvaW50R2V0SGluZ2UyUGFyYW0AxAEVZEpvaW50R2V0SGluZ2UyQW5nbGUxAMUBGWRKb2ludEdldEhpbmdlMkFuZ2xlMVJhdGUAxgEZZEpvaW50R2V0SGluZ2UyQW5nbGUyUmF0ZQDHARhkSm9pbnRTZXRVbml2ZXJzYWxBbmNob3IAywELZFJGcm9tMkF4ZXMA6QIXZEpvaW50U2V0VW5pdmVyc2FsQXhpczEAzQEXZEpvaW50U2V0VW5pdmVyc2FsQXhpczIAzgEYZEpvaW50R2V0VW5pdmVyc2FsQW5jaG9yAM8BGWRKb2ludEdldFVuaXZlcnNhbEFuY2hvcjIA0AEXZEpvaW50R2V0VW5pdmVyc2FsQXhpczEA0QEXZEpvaW50R2V0VW5pdmVyc2FsQXhpczIA0gEXZEpvaW50U2V0VW5pdmVyc2FsUGFyYW0A0wEXZEpvaW50R2V0VW5pdmVyc2FsUGFyYW0A1AEYZEpvaW50R2V0VW5pdmVyc2FsQW5nbGUxANUBGGRKb2ludEdldFVuaXZlcnNhbEFuZ2xlMgDYARxkSm9pbnRHZXRVbml2ZXJzYWxBbmdsZTFSYXRlANkBHGRKb2ludEdldFVuaXZlcnNhbEFuZ2xlMlJhdGUA2gEWZEpvaW50U2V0QU1vdG9yTnVtQXhlcwDeARNkSm9pbnRTZXRBTW90b3JBeGlzAN8BFGRKb2ludFNldEFNb3RvckFuZ2xlAOEBFGRKb2ludFNldEFNb3RvclBhcmFtAOIBE2RKb2ludFNldEFNb3Rvck1vZGUA4wEWZEpvaW50R2V0QU1vdG9yTnVtQXhlcwDkARNkSm9pbnRHZXRBTW90b3JBeGlzAOUBFmRKb2ludEdldEFNb3RvckF4aXNSZWwA5gEUZEpvaW50R2V0QU1vdG9yQW5nbGUA5wEYZEpvaW50R2V0QU1vdG9yQW5nbGVSYXRlAOgBFGRKb2ludEdldEFNb3RvclBhcmFtAOkBE2RKb2ludEdldEFNb3Rvck1vZGUA6gEOZEpvaW50U2V0Rml4ZWQA7wEMZE1hc3NTZXRaZXJvAPgBEmRNYXNzU2V0UGFyYW1ldGVycwD5AQ5kTWFzc1NldFNwaGVyZQD6ARNkTWFzc1NldFNwaGVyZVRvdGFsAPsBD2RNYXNzU2V0Q2Fwc3VsZQD8ARRkTWFzc1NldENhcHN1bGVUb3RhbAD9AQtkTWFzc0FkanVzdAD+ARBkTWFzc1NldEN5bGluZGVyAP8BFWRNYXNzU2V0Q3lsaW5kZXJUb3RhbACAAgtkTWFzc1NldEJveACBAhBkTWFzc1NldEJveFRvdGFsAIICDmRNYXNzVHJhbnNsYXRlAIMCC2RNYXNzUm90YXRlAIQCCGRNYXNzQWRkAIUCC2RCb2R5Q3JlYXRlAJACDGRCb2R5RGVzdHJveQCRAhFkQm9keVNldExpbmVhclZlbACVAhJkQm9keVNldEFuZ3VsYXJWZWwAlgIQZEJvZHlHZXRQb3NpdGlvbgCXAhBkQm9keUdldFJvdGF0aW9uAJgCEmRCb2R5R2V0QW5ndWxhclZlbACbAgxkQm9keVNldE1hc3MAnAIMZEJvZHlHZXRNYXNzAJ0CEGRCb2R5QWRkUmVsRm9yY2UAoAIRZEJvZHlBZGRSZWxUb3JxdWUAoQISZEJvZHlBZGRGb3JjZUF0UG9zAKICFWRCb2R5QWRkRm9yY2VBdFJlbFBvcwCjAhVkQm9keUFkZFJlbEZvcmNlQXRQb3MApAIYZEJvZHlBZGRSZWxGb3JjZUF0UmVsUG9zAKUCDWRCb2R5R2V0Rm9yY2UApgIOZEJvZHlHZXRUb3JxdWUApwITZEJvZHlHZXRSZWxQb2ludFBvcwCoAhNkQm9keUdldFJlbFBvaW50VmVsAKkCEWRCb2R5R2V0TnVtSm9pbnRzAKoCDWRCb2R5R2V0Sm9pbnQAqwILZEJvZHlFbmFibGUArAIMZEJvZHlEaXNhYmxlAK0CDmRCb2R5SXNFbmFibGVkAK4CEGRKb2ludENyZWF0ZUJhbGwArwIRZEpvaW50Q3JlYXRlSGluZ2UAsQISZEpvaW50Q3JlYXRlU2xpZGVyALICE2RKb2ludENyZWF0ZUNvbnRhY3QAswISZEpvaW50Q3JlYXRlSGluZ2UyALQCFWRKb2ludENyZWF0ZVVuaXZlcnNhbAC1AhFkSm9pbnRDcmVhdGVGaXhlZAC2AhBkSm9pbnRDcmVhdGVOdWxsALcCEmRKb2ludENyZWF0ZUFNb3RvcgC4Ag1kSm9pbnREZXN0cm95ALkCEWRKb2ludEdyb3VwQ3JlYXRlALoCEmRKb2ludEdyb3VwRGVzdHJveQC7AhBkSm9pbnRHcm91cEVtcHR5ALwCDGRKb2ludEF0dGFjaAC9Ag1kSm9pbnRHZXRUeXBlAL4CDWRKb2ludEdldEJvZHkAvwINZEFyZUNvbm5lY3RlZADAAgxkV29ybGRDcmVhdGUAwQINZFdvcmxkRGVzdHJveQDCAhBkV29ybGRTZXRHcmF2aXR5AMMCEGRXb3JsZEdldEdyYXZpdHkAxAIMZFdvcmxkU2V0RVJQAMUCDGRXb3JsZEdldEVSUADGAgxkV29ybGRTZXRDRk0AxwIMZFdvcmxkR2V0Q0ZNAMgCCmRXb3JsZFN0ZXAAyQIPZFdvcmxkUXVpY2tTdGVwAMoCH2RXb3JsZFNldFF1aWNrU3RlcE51bUl0ZXJhdGlvbnMAywIgZFdvcmxkU2V0Q29udGFjdE1heENvcnJlY3RpbmdWZWwAzAIgZFdvcmxkR2V0Q29udGFjdE1heENvcnJlY3RpbmdWZWwAzQIcZFdvcmxkU2V0Q29udGFjdFN1cmZhY2VMYXllcgDOAhxkV29ybGRHZXRDb250YWN0U3VyZmFjZUxheWVyAM8CDGRDcmVhdGVQbGFuZQDVAhNkR2VvbVBsYW5lU2V0UGFyYW1zANYCEmRSRnJvbUF4aXNBbmRBbmdsZQDlAhJkUUZyb21BeGlzQW5kQW5nbGUA5gIRZFJGcm9tRXVsZXJBbmdsZXMA6AINZFFTZXRJZGVudGl0eQDqAg1kQ3JlYXRlU3BoZXJlAPECFGRHZW9tU3BoZXJlU2V0UmFkaXVzAPICEF9fZXJybm9fbG9jYXRpb24A7wMIc2V0VGhyZXcAjAQJc3RhY2tTYXZlAJoEDHN0YWNrUmVzdG9yZQCbBApzdGFja0FsbG9jAJwEDGR5bkNhbGxfamlqaQCdBAnIAgEAQQELwgEuFA0wHhUt9QL2AvcCEhMaGxwd3QLfAuAC4QLiAnpzeXt2eCgiJSOEAYUBhgGHAYgBiQGbAVo8L44EVC8+P0BBQlNDREZVQ0dIVldYZWZnaGlqa2xtbm9wcTAeigH0AhEZmgGTAZQBkgGgAaEBogGtAa4BrwG2AbcBuAFougG7AcgByQHKAdsB3AHdAewB7QHuAfAB8QHyAfMB9AH6AtgCFNQC4wLbAuMC8AKDAy+FA5ABL4cDiAOJA9wD/QKKA4sDjAONA4gDiQOOA5gDmQOaA5wDnQOwA58DoAOhA6MDpAOxA6YDpwOoA5wDqQOyA6sDrAOtA5wDrgOzA7QDtQOOA5ABtgO3A4gDiQOQAbYDygPLA8wDzQPOA88DjgP3A/gD+QPcA/oDhASFBJABtgNoaJAEmQSXBJIEtgOYBJYEkwQKyfIWmATIAwEBf0HoowEQ2gMiAEIANwI0IABB3O0ANgIAQbCkARDaAyIAQgA3AjQgAEHY7gA2AgAgAEIANwI8QfSkARDaAyIAQQE6ALACIABBzOoANgIAQainARCGAyIAQgA3AlwgAEGc7gA2AgAgAEGAAjsBiAEgAEH////7BzYChAEgAEIANwJkQbSoARCGAyIAQZDwADYCACAAQRBqEOEDGiAAQQA2AjAgAEIANwIoIABCADcCICAAQYECOwGQAkHIqgEQ2gNB2OkANgIAQZirARDhAxpBsKsBQgA3AgBBqKsBQgA3AgBBuKsBQoCAgIDQmbPGPzcCAEHAqwEQ4QMaQfirAUIANwIAQZCsAUHNmbP8AzYCAEHQqwFBADYCAEHwqwFCADcCAEGArAFCADcCAEHUqwFCADcCAEHcqwFCADcCAEHkqwFCADcCAEGIrAFCgICAgICAgMA/NwIAQeyrAUGAgID8AzYCAEH8qwFBgICA/AM2AgBBlKwBEOEDGkG8rAFCADcCAEG0rAFCADcCAEGsrAFCADcCAEGkrAFCADcCAEHErAFBzZmz/AM2AgBByKwBEOEDGkHQtAFB2LMBNgIAQYi0AUEqNgIAC4sCAgZ/AX0gAkECayEDIAJBAk4EQCADQQJ0QXhxIQYCfyADQQJxBEAgACEEIAEhBSADDAELIAAqAgAgASoCAJRDAAAAAJIgACoCBCABKgIElJIhCSABQQhqIQUgAEEIaiEEIAJBBGsLIQcgBkEIaiEGIANBfnEhCCADQQJPBEADQCAJIAQqAgAgBSoCAJSSIAQqAgQgBSoCBJSSIAQqAgggBSoCCJSSIAQqAgwgBSoCDJSSIQkgBUEQaiEFIARBEGohBCAHQX5xIQMgB0EEayEHIANBAkcNAAsLIAEgBmohASACIAhrQQRrIQMgACAGaiEACyADQX9GBH0gACoCACABKgIAlCAJkgUgCQsLxA0CDn8bfQJAIAJBAEwNAAJAIAJBAUYEQAwBCyACQQJrIQ0gA0EBaiEMIANBAmpBAnQhDiADQQNqQQJ0IQ8gA0EEakECdCEQIANBBWpBAnQhEQNAIAAgCiILIANsQQJ0aiEFQQAhBwJAIAtFBEBDAAAAACETQwAAAAAhFEMAAAAAIRUMAQsDQCAAIAMgB2xBAnRqIQZDAAAAACESIAchCCAFIQRDAAAAACETQwAAAAAhFEMAAAAAIRUgBwRAA0AgEiAEIANBAnQiCWoqAgAiFiAGIAlqKgIAIhiUkiAEIAxBAnQiCWoqAgAiFyAGIAlqKgIAIhmUkiESIBUgBioCACIaIAQqAgAiG5SSIAYqAgQiHCAEKgIEIh2UkiEVIBMgGyAYlJIgHSAZlJIhEyAUIBogFpSSIBwgF5SSIRQgBEEIaiEEIAZBCGohBiAIQQNKIQkgCEECayEIIAkNAAsLIAQgBCoCACAVkyIVOAIAIAQgA0ECdCIIaiIJIAkqAgAgFJMiFDgCACAEIAQqAgQgE5MgBiAIaioCACITIBWUkzgCBCAEIAxBAnQiCWoiBCAEKgIAIBKTIBMgFJSTOAIAIAdBAmoiByALSQ0AC0MAAAAAIRMgASEEQwAAAAAhFEMAAAAAIRUgCyIGQQVLBEADQCAFIAhqIgcqAgAhEiAFIAUqAgAiIiAEKgIAIhaUIhs4AgAgByASIBaUIiM4AgAgBSAJaiIHKgIAIRYgBSAFKgIEIiQgBCoCBCIYlCIcOAIEIAcgFiAYlCIlOAIAIAUgDmoiByoCACEYIAUgBSoCCCImIAQqAggiF5QiHTgCCCAHIBggF5QiJzgCACAFIA9qIgcqAgAhFyAFIAUqAgwiKCAEKgIMIhmUIh44AgwgByAXIBmUIik4AgAgBSAQaiIHKgIAIRkgBSAFKgIQIiogBCoCECIalCIgOAIQIAcgGSAalCIrOAIAIAUgEWoiByoCACEaIAUgBSoCFCIsIAQqAhQiH5QiITgCFCAHIBogH5QiHzgCACAVIBIgI5SSIBYgJZSSIBggJ5SSIBcgKZSSIBkgK5SSIBogH5SSIRUgFCASIBuUkiAWIByUkiAYIB2UkiAXIB6UkiAZICCUkiAaICGUkiEUIBMgIiAblJIgJCAclJIgJiAdlJIgKCAelJIgKiAglJIgLCAhlJIhEyAEQRhqIQQgBUEYaiEFIAZBC0ohByAGQQZrIQYgBw0ACwsgBkEATA0AA0AgBSAIaiIJKgIAIRIgBSAFKgIAIhggBCoCACIXlCIWOAIAIAkgEiAXlCIXOAIAIBQgEiAWlJIhFCAVIBIgF5SSIRUgBEEEaiEEIAVBBGohBSATIBggFpSSIRMgBkEBSyEJIAZBAWshBiAJDQALCyAFIAxBAnRqKgIAIRIgBSADQQJ0aiIEKgIAIRYgASALQQJ0aiIGQwAAgD8gBSoCACATk5UiEzgCACAGQwAAgD8gEiAVkyAWIBSTIhIgEiATlCISlEMAAAAAkpOVOAIEIAQgEjgCACALQQJqIgogDUwNAAsgAiAKRg0BIAAgAyAKbEECdGohBUEAIQcgA0EBakECdCEMA0AgACADIAdsQQJ0aiEEQwAAAAAhEiAHIQggBSEGQwAAAAAhEyAHBEADQCATIAQqAgAgBioCACIUlJIgBCoCBCAGKgIEIhWUkiETIBIgFCAEIANBAnRqKgIAlJIgFSAEIAxqKgIAlJIhEiAGQQhqIQYgBEEIaiEEIAhBA0ohCSAIQQJrIQggCQ0ACwsgBiAGKgIAIBOTIhM4AgAgBiAGKgIEIBKTIAQgA0ECdGoqAgAgE5STOAIEIAcgC0khBCAHQQJqIQcgBA0AC0MAAAAAIRICQAJAIAtBA00EQCABIQQgCiEGDAELIAEhBCAKIQgDQCAFIAUqAgAiEyAEKgIAlCIUOAIAIAUgBSoCBCIVIAQqAgSUIhY4AgQgBSAFKgIIIhggBCoCCJQiFzgCCCAFIAUqAgwiGSAEKgIMlCIaOAIMIAUgBSoCECIbIAQqAhCUIhw4AhAgBSAFKgIUIh0gBCoCFJQiHjgCFCASIBMgFJSSIBUgFpSSIBggF5SSIBkgGpSSIBsgHJSSIB0gHpSSIRIgBEEYaiEEIAVBGGohBSAIQQtLIQkgCEEGayIGIQggCQ0ACyAGRQ0BCwNAIAUgBSoCACITIAQqAgCUIhQ4AgAgBEEEaiEEIAVBBGohBSASIBMgFJSSIRIgBkEBSiEIIAZBAWshBiAIDQALCyAFIQALIAEgCkECdGpDAACAPyAAKgIAIBKTlTgCAAsLrA4CLH8QfSACQQROBEAgAkEEayEQIANBA2wiB0ECaiENIAdBAWohDiADQQF0IghBAXIhDyAHQQNqQQJ0IREgB0EEakECdCESIAdBBWpBAnQhEyAHQQZqQQJ0IRQgB0EHakECdCEVIAdBCGpBAnQhFiAHQQlqQQJ0IRcgB0EKakECdCEYIAdBC2pBAnQhGSAIQQJqQQJ0IRogCEEDakECdCEbIAhBBGpBAnQhHCAIQQVqQQJ0IR0gCEEGakECdCEeIAhBB2pBAnQhHyAIQQhqQQJ0ISAgCEEJakECdCEhIAhBCmpBAnQhIiAIQQtqQQJ0ISMgA0EBakECdCEkIANBAmpBAnQhJSADQQNqQQJ0ISYgA0EEakECdCEnIANBBWpBAnQhKCADQQZqQQJ0ISkgA0EHakECdCEqIANBCGpBAnQhKyADQQlqQQJ0ISwgA0EKakECdCEtIANBC2pBAnQhLgNAIAAgAyALbEECdGohBEMAAAAAITJDAAAAACEzIAEhBUMAAAAAITFDAAAAACE0IAsiBkELSwRAA0AgBCoCLCAFKgIsIjCUIAQqAiggBSoCKCI1lCAEKgIkIAUqAiQiNpQgBCoCICAFKgIgIjeUIAQqAhwgBSoCHCI4lCAEKgIYIAUqAhgiOZQgBCoCFCAFKgIUIjqUIAQqAhAgBSoCECI7lCAEKgIMIAUqAgwiPJQgBCoCCCAFKgIIIj2UIAQqAgQgBSoCBCI+lCAEKgIAIAUqAgAiP5QgNJKSkpKSkpKSkpKSkiE0IAQgGWoqAgAgMJQgBCAYaioCACA1lCAEIBdqKgIAIDaUIAQgFmoqAgAgN5QgBCAVaioCACA4lCAEIBRqKgIAIDmUIAQgE2oqAgAgOpQgBCASaioCACA7lCAEIBFqKgIAIDyUIAQgDUECdGoqAgAgPZQgBCAOQQJ0aioCACA+lCAEIAdBAnRqKgIAID+UIDOSkpKSkpKSkpKSkpIhMyAEICNqKgIAIDCUIAQgImoqAgAgNZQgBCAhaioCACA2lCAEICBqKgIAIDeUIAQgH2oqAgAgOJQgBCAeaioCACA5lCAEIB1qKgIAIDqUIAQgHGoqAgAgO5QgBCAbaioCACA8lCAEIBpqKgIAID2UIAQgD0ECdGoqAgAgPpQgBCAIQQJ0aioCACA/lCAykpKSkpKSkpKSkpKSITIgBCAuaioCACAwlCAEIC1qKgIAIDWUIAQgLGoqAgAgNpQgBCAraioCACA3lCAEICpqKgIAIDiUIAQgKWoqAgAgOZQgBCAoaioCACA6lCAEICdqKgIAIDuUIAQgJmoqAgAgPJQgBCAlaioCACA9lCAEICRqKgIAID6UIAQgA0ECdGoqAgAgP5QgMZKSkpKSkpKSkpKSkiExIAVBMGohBSAEQTBqIQQgBkEXSiEKIAZBDGshBiAKDQALCwJAIAZBAEwEQCAEIQwMAQsgBCAGQQJ0Ii9qIQwgBSEKA0AgBCoCACAKKgIAIjCUIDSSITQgBCAHQQJ0aioCACAwlCAzkiEzIAQgCEECdGoqAgAgMJQgMpIhMiAEIANBAnRqKgIAIDCUIDGSITEgBkEBSyEJIAZBAWshBiAEQQRqIQQgCkEEaiEKIAkNAAsgBSAvaiEFCyAFIAUqAgAgNJMiMDgCACAFIAUqAgQgMZMgDCADQQJ0aioCACAwlJMiMTgCBCAFIAUqAgggMpMgDCAIQQJ0aioCACAwlJMgDCAPQQJ0aioCACAxlJMiMjgCCCAFIAUqAgwgM5MgDCAHQQJ0aioCACAwlJMgDCAOQQJ0aioCACAxlJMgDCANQQJ0aioCACAylJM4AgwgC0EEaiILIBBMDQALCyACIAtKBEADQCAAIAMgC2xBAnRqIQRDAAAAACEwIAEhBSALIglBC0sEQANAIAQqAiwgBSoCLJQgBCoCKCAFKgIolCAEKgIkIAUqAiSUIAQqAiAgBSoCIJQgBCoCHCAFKgIclCAEKgIYIAUqAhiUIAQqAhQgBSoCFJQgBCoCECAFKgIQlCAEKgIMIAUqAgyUIAQqAgggBSoCCJQgBCoCBCAFKgIElCAEKgIAIAUqAgCUIDCSkpKSkpKSkpKSkpIhMCAFQTBqIQUgBEEwaiEEIAlBF0ohBiAJQQxrIQkgBg0ACwsgCUEASgRAQQAhByAJIQogBSEGIAlBA3EiCARAA0AgCkEBayEKIAQqAgAgBioCAJQgMJIhMCAEQQRqIQQgBkEEaiEGIAdBAWoiByAIRw0ACwsgCUECdCEHIAlBBE8EQANAIAQqAgwgBioCDJQgBCoCCCAGKgIIlCAEKgIEIAYqAgSUIAQqAgAgBioCAJQgMJKSkpIhMCAGQRBqIQYgBEEQaiEEIApBBWshCSAKQQRrIQogCUF+SQ0ACwsgBSAHaiEFCyAFIAUqAgAgMJM4AgAgC0EBaiILIAJHDQALCwulCQIIfQ9/IAAgA0EBaiACQQFrbEECdGohE0EAIANrIREgASACQQJ0akEEayEUIAJBBE4EQCACQQRrIRJBACADQQJ0ayEVQX4gA2tBAnQhFiARQQF0QQNrQQJ0IRdBfSADa0ECdCEYA0AgEyAOQQJ0ayEDQwAAAAAhByAOIQ8gFCEAQwAAAAAhCEMAAAAAIQlDAAAAACEKQwAAAAAhBEMAAAAAIQVDAAAAACEGIA4EQANAIAogAyoCACAAKgIAIgSUkiADIBFBAnQiEGoiASoCACAAQQRrKgIAIgWUkiABIBBqIg0qAgAgAEEIayoCACIGlJIgDSAQaiIMKgIAIABBDGsqAgAiC5SSIQogByAEIANBDGsqAgCUkiAFIAFBDGsqAgCUkiAGIA1BDGsqAgCUkiALIAxBDGsqAgCUkiEHIAggBCADQQhrKgIAlJIgBSABQQhrKgIAlJIgBiANQQhrKgIAlJIgCyAMQQhrKgIAlJIhCCAJIAQgA0EEayoCAJSSIAUgAUEEayoCAJSSIAYgDUEEayoCAJSSIAsgDEEEayoCAJSSIQkgDCAQaiEDIABBEGshACAPIgFBBGshDyABQQdKDQALIAFBBU4EQCAPIBVsIRlBACAPQQJ0ayEaIAMhASAAIQ0DQCAKIAEqAgAgDSoCACIElJIhCiAHIAQgAUEMayoCAJSSIQcgCCAEIAFBCGsqAgCUkiEIIAkgBCABQQRrKgIAlJIhCSAPQQFLIQwgD0EBayEPIAEgEGohASANQQRrIQ0gDA0ACyADIBlqIQMgACAaaiEACyAJIQUgCCEGIAohBAsgACAAKgIAIASTIgQ4AgAgAEEEayIBIAEqAgAgBZMgA0EEayoCACAElJMiBTgCACAAQQhrIgEgASoCACAGkyADQQhrKgIAIASUkyADIBZqKgIAIAWUkyIGOAIAIABBDGsiACAAKgIAIAeTIANBDGsqAgAgBJSTIAMgGGoqAgAgBZSTIAMgF2oqAgAgBpSTOAIAIA5BBGoiDiASTA0ACwsgAiAOSgRAA0AgEyAOQQJ0ayEDQwAAAAAhBCAUIQAgDiIMQQNLBEADQCAEIAMqAgAgACoCAJSSIAMgEUECdCIBaiIDKgIAIABBBGsqAgCUkiABIANqIgMqAgAgAEEIayoCAJSSIAEgA2oiAyoCACAAQQxrKgIAlJIhBCABIANqIQMgAEEQayEAIAxBB0ohASAMQQRrIQwgAQ0ACwsgDEEASgRAIAxBAnQhEiAMIQ0gACEBQQAhECAMQQNxIg8EQANAIA1BAWshDSAEIAMqAgAgASoCAJSSIQQgAyARQQJ0aiEDIAFBBGshASAQQQFqIhAgD0cNAAsLQQAgEmshECAMQQRPBEADQCAEIAMqAgAgASoCAJSSIAMgEUECdCIMaiIDKgIAIAFBBGsqAgCUkiADIAxqIgMqAgAgAUEIayoCAJSSIAMgDGoiAyoCACABQQxrKgIAlJIhBCADIAxqIQMgAUEQayEBIA1BBWshDCANQQRrIQ0gDEF+SQ0ACwsgACAQaiEACyAAIAAqAgAgBJM4AgAgDkEBaiIOIAJHDQALCwsoAQF/AkAgACgCCCICRQ0AIAIgAEEMakYNACACIAAoAgQgAWwQjwILC8IJAQ1/IAFBAE4EQCABIAAoAgRKBEAgACgCCCAAQQxqRgRAQQBBiQpBABCOAQtBASEFA0AgBSIMQQF0IQUgASAMSg0ACwJ/IAAoAggiBQRAAn8gACgCBCACbCELIAIgDGwhAkHwsgEoAgAiCgRAIAUgCyACIAoRBQAMAQsCfyACIQlBACECIAUiCkUEQCAJEIkEDAELIAlBQE8EQEGsswFBMDYCAEEADAELAn9BECAJQQtqQXhxIAlBC0kbIQQgCkEIayIFKAIEIghBeHEhAwJAIAhBA3FFBEBBACAEQYACSQ0CGiAEQQRqIANNBEAgBSECIAMgBGtB6MABKAIAQQF0TQ0CC0EADAILIAMgBWohBgJAIAMgBE8EQCADIARrIgNBEEkNASAFIAhBAXEgBHJBAnI2AgQgBCAFaiIEIANBA3I2AgQgBiAGKAIEQQFyNgIEIAQgAxCLBAwBC0GgvQEoAgAgBkYEQEGUvQEoAgAgA2oiAyAETQ0CIAUgCEEBcSAEckECcjYCBCAEIAVqIgggAyAEayIEQQFyNgIEQZS9ASAENgIAQaC9ASAINgIADAELQZy9ASgCACAGRgRAQZC9ASgCACADaiIDIARJDQICQCADIARrIgJBEE8EQCAFIAhBAXEgBHJBAnI2AgQgBCAFaiIEIAJBAXI2AgQgAyAFaiIDIAI2AgAgAyADKAIEQX5xNgIEDAELIAUgCEEBcSADckECcjYCBCADIAVqIgQgBCgCBEEBcjYCBEEAIQJBACEEC0GcvQEgBDYCAEGQvQEgAjYCAAwBCyAGKAIEIgdBAnENASAHQXhxIANqIg0gBEkNASANIARrIQ8CQCAHQf8BTQRAIAdBA3YhCyAGKAIMIgIgBigCCCIDRgRAQYi9AUGIvQEoAgBBfiALd3E2AgAMAgsgAyACNgIMIAIgAzYCCAwBCyAGKAIYIQ4CQCAGIAYoAgwiB0cEQEGYvQEoAgAaIAYoAggiAyAHNgIMIAcgAzYCCAwBCwJAIAZBFGoiAigCACIDRQRAIAYoAhAiA0UNASAGQRBqIQILA0AgAiELIAMiB0EUaiICKAIAIgMNACAHQRBqIQIgBygCECIDDQALIAtBADYCAAwBC0EAIQcLIA5FDQACQCAGKAIcIgJBAnRBuL8BaiIDKAIAIAZGBEAgAyAHNgIAIAcNAUGMvQFBjL0BKAIAQX4gAndxNgIADAILIA5BEEEUIA4oAhAgBkYbaiAHNgIAIAdFDQELIAcgDjYCGCAGKAIQIgMEQCAHIAM2AhAgAyAHNgIYCyAGKAIUIgNFDQAgByADNgIUIAMgBzYCGAsgD0EPTQRAIAUgCEEBcSANckECcjYCBCAFIA1qIgQgBCgCBEEBcjYCBAwBCyAFIAhBAXEgBHJBAnI2AgQgBCAFaiIEIA9BA3I2AgQgBSANaiIDIAMoAgRBAXI2AgQgBCAPEIsECyAFIQILIAILIgIEQCACQQhqDAELQQAgCRCJBCICRQ0AGiACIApBfEF4IApBBGsoAgAiBUEDcRsgBUF4cWoiBSAJIAUgCUkbEOwDGiAKEIoEIAILCwwBCyACIAxsEI4CCyEFIAAgDDYCBCAAIAU2AggLIAAgATYCAAsL7AECAX8KfSAAKAIYIgEqAjghBiABKgIwIQcgASoCNCEIIAEqAighAyABKgIgIQkgASoCJCEKIAAgASoCACABKgIQIAAqAkwiApSLIAEqAhQgACoCUCIElIuSIAEqAhggACoCVCIFlIuSQwAAAD+UIguTOAIsIAAgCyABKgIAkjgCMCAAIAEqAgQgAiAJlIsgBCAKlIuSIAUgA5SLkkMAAAA/lCIDkzgCNCAAIAMgASoCBJI4AjggACABKgIIIAIgB5SLIAQgCJSLkiAFIAaUi5JDAAAAP5QiApM4AjwgAEFAayACIAEqAgiSOAIAC4QBAQJ/QdwAEI4CIQUjAEEQayIEJAAgBSAAQQEQLCIAQfzhADYCAAJAAkAgAUMAAAAAYEUNACACQwAAAABgRQ0AIANDAAAAAGANAQsgBEHfCjYCAEECQdnfACAEEI4BCyAAIAE4AkwgAEEBNgIEIAAgAzgCVCAAIAI4AlAgBEEQaiQAIAULjgEBAX8jAEEgayIEJAACQCAABEAgACgCBEEBRg0BCyAEQckSNgIQQQJBw9UAIARBEGoQjgELAkACQCABQwAAAABeRQ0AIAJDAAAAAF5FDQAgA0MAAAAAXg0BCyAEQckSNgIAQQJB2d8AIAQQjgELIAAgATgCTCAAIAM4AlQgACACOAJQIAAQPSAEQSBqJAALVwEBfyMAQRBrIgIkAAJAIAAEQCAAKAIEQQFGDQELIAJB3BI2AgBBAkHD1QAgAhCOAQsgASAAKgJMOAIAIAEgACoCUDgCBCABIAAqAlQ4AgggAkEQaiQAC9gDAgZ9An8jAEEQayILJAACQCAABEAgACgCBEEBRg0BCyALQaAjNgIAQQJBw9UAIAsQjgELIAAtAAhBAnEEQCAAECsgACAAKAIIQX1xNgIICyAAKgJUQwAAAD+UIgggACgCGCIKKgI4IAMgCioCCJMiBJQgCioCGCABIAoqAgCTIgWUIAIgCioCBJMiBiAKKgIolJKSIgmSIQMgACoCUEMAAAA/lCICIAoqAjQgBJQgCioCFCAFlCAGIAoqAiSUkpIiB5IhASACIAeTIQIgACoCTEMAAAA/lCIHIAoqAjAgBJQgCioCECAFlCAGIAoqAiCUkpIiBJIhBSAHIASTIQQgC0EQaiQAAn0CQAJAIAggCZMiBkMAAAAAXQ0AIANDAAAAAF0NACACQwAAAABdDQAgAUMAAAAAXQ0AIARDAAAAAF0NACAFQwAAAABdRQ0BCyADIAEgBSAGIAIgBEMAAAAAIARDAAAAAF4bIgQgAiAEXhsiAiACIAZdGyICIAIgBV0bIgIgASACXhsiAiACIANdG4wMAQsgAyABIAUgBiACIARDAACATyAEQwAAgE9dGyIEIAIgBF0bIgIgAiAGXhsiAiACIAVeGyICIAEgAl0bIgIgAiADXhsLC6lKAyt9F38DfCMAQUBqIkAkACAEQTNMBEAgQEGXGDYCJCBAQb4KNgIgQQFB3ckAIEBBIGoQjgELIAAoAgRBAUcEQCBAQZcYNgIUIEBBvgo2AhBBAUGDMyBAQRBqEI4BCyABKAIEQQFHBEAgQEGXGDYCBCBAQb4KNgIAQQFBzTIgQBCOAQsgACgCGCI9ITQgPUEQaiEzIAEoAhgiPSExIEBBMGohOyBAQSxqITggQEEoaiFEIAJB//8DcSFBIwBB4AJrIjAkACAzKgIkIQYgMyoCBCEKIDMqAhQhCyAzKgIoIQ0gMyoCCCEMIDMqAhghCSA0KgIIIRIgMSoCCCETIDQqAgAhFCAxKgIAIRcgNCoCBCEYIDEqAgQhGSAzKgIgIQUgMyoCACEIIDMqAhAhByAwIABBzABqIgIqAgBDAAAAP5QiEDgCxAIgMCACKgIEQwAAAD+UIhU4AsgCIDAgAioCCEMAAAA/lCIWOALMAiAwIAFBzABqIjwqAgBDAAAAP5QiETgCuAIgMCA8KgIEQwAAAD+UIg44ArwCIDAgPCoCCEMAAAA/lCIPOALAAkEAIQICQCAFIBMgEpMiEpQgCCAXIBSTIhOUIAcgGSAYkyIUlJKSIh+LIA8gBSA9QRBqIjYqAigiGpQgCCA2KgIIIhuUIAcgNioCGCIslJKSIiCLIi2UIA4gBSA2KgIkIhiUIAggNioCBCIZlCAHIDYqAhQiHJSSkiIhiyIulCARIAUgNioCICIXlCAIIDYqAgAiBZQgByA2KgIQIgiUkpIiIosiL5QgEJKSkpMiB0MAAAAAXg0AIAYgEpQgCiATlCAUIAuUkpIhHSAGIBqUIAogG5QgLCALlJKSIiOLISQgBiAYlCAKIBmUIBwgC5SSkiIliyEmIAYgF5QgCiAFlCAIIAuUkpIiJ4shCkMAAID/IQZBACE8IAdDAACA/14EQCAfQwAAAABdIT4gMyE6QQEhPCAHIQYLIB2LIA8gJJQgDiAmlCARIAqUIBWSkpKTIgdDAAAAAF4NACANIBKUIAwgE5QgFCAJlJKSIR4gDSAalCAMIBuUICwgCZSSkiIoiyEpIA0gGJQgDCAZlCAcIAmUkpIiKoshKyANIBeUIAwgBZQgCCAJlJKSIg2LIQsgBiAHXQRAIDNBBGohOiAdQwAAAABdIT5BAiE8IAchBgsgHosgDyAplCAOICuUIBEgC5QgFpKSkpMiB0MAAAAAXg0AIAYgB10EQCAzQQhqITogHkMAAAAAXSE+QQMhPCAHIQYLIBcgEpQgBSATlCAUIAiUkpIiCIsgESAWIAuUIBAgL5QgFSAKlJKSkpMiBUMAAAAAXg0AIAUgBl4EQCAIQwAAAABdIT4gNiE6QQQhPCAFIQYLIBggEpQgGSATlCAUIByUkpIiCIsgDiAWICuUIBAgLpQgFSAmlJKSkpMiBUMAAAAAXg0AIAUgBl4EQCA2QQRqITogCEMAAAAAXSE+QQUhPCAFIQYLIBogEpQgGyATlCAUICyUkpIiCIsgDyAWICmUIBAgLZQgFSAklJKSkpMiBUMAAAAAXg0AIAUgBl4EQCA2QQhqITogCEMAAAAAXSE+QQYhPCAFIQYLIB4gJ5QgDSAdlJMiB4sgDyAulCAOIC2UIBUgC5QgFiAKlJKSkpMiBUMAAAAAXg0AIB2MIQgCQCAnICeUIhIgDSANlEMAAAAAkiIJkpEiDEMAAAAAXkUNACAFIAyVIgVDZmaGP5QgBl5FDQAgMCAnIAyVOALYAiAwIA2MIAyVOALUAiAwQwAAAAAgDJU4AtACIAdDAAAAAF0hPkEAITpBByE8IAUhBgsgHiAllCAqIAiUkiIHiyAPIC+UIBEgLZQgFSArlCAWICaUkpKSkyIFQwAAAABeDQACQCAlICWUIhQgKiAqlEMAAAAAkiITkpEiDEMAAAAAXkUNACAFIAyVIgVDZmaGP5QgBl5FDQAgMCAlIAyVOALYAiAwICqMIAyVOALUAiAwQwAAAAAgDJU4AtACIAdDAAAAAF0hPkEAITpBCCE8IAUhBgsgHiAjlCAoIAiUkiIIiyAOIC+UIBEgLpQgFSAplCAWICSUkpKSkyIFQwAAAABeDQACQCAjICOUIhcgKCAolEMAAAAAkiIMkpEiB0MAAAAAXkUNACAFIAeVIgVDZmaGP5QgBl5FDQAgMCAjIAeVOALYAiAwICiMIAeVOALUAiAwQwAAAAAgB5U4AtACIAhDAAAAAF0hPkEAITpBCSE8IAUhBgsgHyANlCAiIB6UkyIHiyAPICaUIA4gJJQgECALlCAWIC+UkpKSkyIFQwAAAABeDQAgHowhCAJAICIgIpQiGCAJkpEiCUMAAAAAXkUNACAFIAmVIgVDZmaGP5QgBl5FDQAgMCAijCAJlTgC2AIgMEMAAAAAIAmVOALUAiAwIA0gCZU4AtACIAdDAAAAAF0hPkEAITpBCiE8IAUhBgsgHyAqlCAhIAiUkiIHiyAPIAqUIBEgJJQgECArlCAWIC6UkpKSkyIFQwAAAABeDQACQCAhICGUIgkgE5KRIg1DAAAAAF5FDQAgBSANlSIFQ2Zmhj+UIAZeRQ0AIDAgIYwgDZU4AtgCIDBDAAAAACANlTgC1AIgMCAqIA2VOALQAiAHQwAAAABdIT5BACE6QQshPCAFIQYLIB8gKJQgICAIlJIiCIsgDiAKlCARICaUIBAgKZQgFiAtlJKSkpMiBUMAAAAAXg0AAkAgICAglCINIAySkSIHQwAAAABeRQ0AIAUgB5UiBUNmZoY/lCAGXkUNACAwICCMIAeVOALYAiAwQwAAAAAgB5U4AtQCIDAgKCAHlTgC0AIgCEMAAAAAXSE+QQAhOkEMITwgBSEGCyAdICKUICcgH5STIgeLIA8gK5QgDiAplCAQIAqUIBUgL5SSkpKTIgVDAAAAAF4NACAfjCEIAkAgEiAYkpEiCkMAAAAAXkUNACAFIAqVIgVDZmaGP5QgBl5FDQAgMEMAAAAAIAqVOALYAiAwICIgCpU4AtQCIDAgJ4wgCpU4AtACIAdDAAAAAF0hPkEAITpBDSE8IAUhBgsgHSAhlCAlIAiUkiIHiyAPIAuUIBEgKZQgECAmlCAVIC6UkpKSkyIFQwAAAABeDQACQCAUIAmSkSIKQwAAAABeRQ0AIAUgCpUiBUNmZoY/lCAGXkUNACAwQwAAAAAgCpU4AtgCIDAgISAKlTgC1AIgMCAljCAKlTgC0AIgB0MAAAAAXSE+QQAhOkEOITwgBSEGCyAdICCUICMgCJSSIgiLIA4gC5QgESArlCAQICSUIBUgLZSSkpKTIgVDAAAAAF4NAAJAAkACQAJAIBcgDZKRIgdDAAAAAF5FDQAgBSAHlSIFQ2Zmhj+UIAZeRQ0AIDBDAAAAACAHlTgC2AIgMCAgIAeVOALUAiAwICOMIAeVOALQAiAIQwAAAABdIT5BDyE8DAELIDxFDQMgOg0BIAYhBQsgOyAzKgIIIDBB0AJqIgIqAgiUIDMqAgAgAioCAJQgMyoCBCACKgIElJKSOAIAIDsgMyoCGCACKgIIlCAzKgIQIAIqAgCUIDMqAhQgAioCBJSSkjgCBCA7IDMqAiggAioCCJQgMyoCICACKgIAlCAzKgIkIAIqAgSUkpI4AggMAQsgOyA6KgIAOAIAIDsgOioCEDgCBCA7IDoqAiA4AgggBiEFCyA+BEAgOyA7KgIAjDgCACA7IDsqAgSMOAIEIDsgOyoCCIw4AggLIDggBYw4AgAgPEEHTwRAIDAgNCkCADcDQCAwIDQoAgg2AkggMCAWIBaMIDsqAggiBSAzKgIoIg+UIDsqAgAiCCAzKgIIIg2UIDsqAgQiByAzKgIYIgqUkpJDAAAAAF4bIgYgCpQgFSAVjCAFIDMqAiQiDJQgCCAzKgIEIgmUIAcgMyoCFCILlJKSQwAAAABeGyIKIAuUIBAgEIwgBSAzKgIgIhKUIAggMyoCACITlCAHIDMqAhAiFJSSkkMAAAAAXhsiCyAUlCAwKgJEkpKSOAJEIDAgBiANlCAKIAmUIAsgE5QgMCoCQJKSkjgCQCAwIAYgD5QgCiAMlCALIBKUIDAqAkiSkpI4AkggMCAxKAIINgKoASAwIDEpAgA3A6ABIDAgMCoCwAIiBowgBiAFIDYqAigiC5QgCCA2KgIIIg+UIAcgNioCGCIKlJKSQwAAAABeGyIGIAqUIA6MIA4gBSA2KgIkIhCUIAggNioCBCINlCAHIDYqAhQiDJSSkkMAAAAAXhsiCiAMlCARjCARIAUgNioCICIOlCAIIDYqAgAiDJQgByA2KgIQIgiUkpJDAAAAAF4bIgUgCJQgMCoCpAGSkpI4AqQBIDAgBiAPlCAKIA2UIAUgDJQgMCoCoAGSkpI4AqABIDAgBiALlCAKIBCUIAUgDpQgMCoCqAGSkpI4AqgBIDAgMyA8QQdrQf8BcSI0QQNuQQJ0aiIzKgIAOALwASAwIDMqAhA4AvQBIDAgMyoCIDgC+AEgMCA2IDRBA3BBAnRqIjMqAgA4AiAgMCAzKgIQOAIkIDAgMyoCIDgCKCAwQUBrITQgMEGgAWohMyAwQaACaiE2QwAAAAAhBSAwQwAAgD8gMEHwAWoiAioCCCIGIDBBIGoiMSoCCCILlCACKgIAIgcgMSoCACIMlCACKgIEIgggMSoCBCINlJKSIgogCpSTIglDF7fROF8EfUMAAAAABUMAAIA/IAmVIgkgCiAGIDMqAgggNCoCCJMiBZQgByAzKgIAIDQqAgCTIgaUIAggMyoCBCA0KgIEkyIHlJKSIgiUIAsgBZQgDCAGlCANIAeUkpIiBpOUIQUgCSAIIAogBpSTlAs4AgAgNiAFOAIAIDAqAkAhByAwKgLwASEGIDAqAqABIQogMCoCICELIDAqAkQhESAwKgL0ASEOIDAqAqQBIQ8gMCoCJCEQIAMgMCoC+AEgMCoCACIFlCAwKgJIkiAwKgIoIDAqAqACIgiUIDAqAqgBkpJDAAAAP5Q4AgggAyARIA4gBZSSIA8gECAIlJKSQwAAAD+UOAIEIAMgByAGIAWUkiAKIAsgCJSSkkMAAAA/lDgCACADIDgqAgA4AiAgRCA8NgIAQQEhAgwBCyA2IDMgPEEESSICGyE4IDsqAgAhBQJ9IDxBA00EQCA7KgIIIQggOyoCBAwBCyAFjCEFIDsqAgiMIQggOyoCBIwLIQcgNCAxIAIbITsgMSA0IAIbITQgMEG4AmogMEHEAmogAhshMSAwIAg4AqgCIDAgBzgCpAIgMCAFOAKgAiAwQZACaiI1IDgqAiAgMEGgAmoiMioCCJQgOCoCACAyKgIAlCA4KgIQIDIqAgSUkpI4AgAgNSA4KgIkIDIqAgiUIDgqAgQgMioCAJQgOCoCFCAyKgIElJKSOAIEIDUgOCoCKCAyKgIIlCA4KgIIIDIqAgCUIDgqAhggMioCBJSSkjgCCCAwKgKYAoshBQJ/IDAqApQCiyIIIDAqApACiyIHXgRAQQFBAiAFIAhdIjobITJBAAwBCyAFIAddIjpFQQF0ITIgOgshPiAzIDYgAhshNiAwQcQCaiAwQbgCaiACGyEzIDEgMkECdCICaioCACIFIAWMIDBBkAJqIAJyKgIAQwAAAABdGyIFIAIgOGoiAioCIJQgNCoCCCA7KgIIk5IhESAFIAIqAhCUIDQqAgQgOyoCBJOSIQ4gBSACKgIAlCA0KgIAIDsqAgCTkiEPQQJBASA6GyE6QQEhNEECIQICQAJAAkBBf0F8IDxBBEkbIDxqIkMOAgIAAQtBACE0DAELQQEhAkEAITQLIDYgNEECdCIyaiI0KgIgIQUgNCoCACEIIDQqAhAhByAwIBEgNiACQQJ0IgJqIjYqAiAiBpQgDyA2KgIAIgqUIA4gNioCECILlJKSIhAgBiA4ID5BAnQiNGoiNioCICIJlCAKIDYqAgAiEpQgCyA2KgIQIhOUkpIiDCAxIDRqKgIAIhSUIheSIhggBiA4IDpBAnQiNWoiNCoCICIZlCAKIDQqAgAiHJQgCyA0KgIQIhqUkpIiCiAxIDVqKgIAIhuUIgaTOAKMAiAwIBEgBZQgDyAIlCAOIAeUkpIiDSAUIAUgCZQgCCASlCAHIBOUkpIiC5QiCZIiEiAbIAUgGZQgCCAclCAHIBqUkpIiCJQiBZM4AogCIDAgGCAGkjgChAIgMCASIAWSOAKAAiAwIBAgF5MiByAGkjgC/AEgMCANIAmTIgkgBZI4AvgBIDAgByAGkzgC9AEgMCAJIAWTOALwASAwIDIgM2oqAgA4AugBIDAgAiAzaioCADgC7AEgMEGgAWohMkEAITUjAEFAaiI9JAAgMEHoAWoiOSoCACIGIDBB8AFqIgIqAgAiB4wiBV4EfyAyIAc4AgAgMiACKgIEOAIEIDkqAgAhBiACKgIAIgeMIQVBASE1IDJBCGoFIDILITEgBSAGXSAGIAIqAggiBYwiCV5HBEAgMSACKgIMIAIqAgQiCZMgBSAHk5UgBowgB5OUIAmSOAIEIDEgOSoCAIw4AgAgNUEBaiE1IAIqAggiBYwhCSAxQQhqITEgOSoCACEGCyAGIAleBEAgMSAFOAIAIDEgAioCDDgCBCA1QQFqITUgAioCCCIFjCEJIDFBCGohMSA5KgIAIQYLIAYgCV4gBiACKgIQIgmMIgdeRwRAIDEgAioCFCACKgIMIgeTIAkgBZOVIAaMIAWTlCAHkjgCBCAxIDkqAgCMOAIAIDVBAWohNSACKgIQIgmMIQcgMUEIaiExIDkqAgAhBgsgBiAHXgRAIDEgCTgCACAxIAIqAhQ4AgQgNUEBaiE1IAIqAhAiCYwhByAxQQhqITEgOSoCACEGCyAGIAdeIAYgAioCGCIFjCIHXkcEQCAxIAIqAhwgAioCFCIHkyAFIAmTlSAGjCAJk5QgB5I4AgQgMSA5KgIAjDgCACA1QQFqITUgAioCGCIFjCEHIDFBCGohMSA5KgIAIQYLIAYgB14EQCAxIAU4AgAgMSACKgIcOAIEIDVBAWohNSACKgIYIgWMIQcgMUEIaiExIDkqAgAhBgsCQAJAAkAgBiACKgIAIgmMXiAGIAdeRwRAIDEgAioCBCACKgIcIgeTIAkgBZOVIAaMIAWTlCAHkjgCBCAxIDkqAgCMOAIAQQghMSA1QQFqIjVBCHENAwwBCyA1DQBBACExDAELAn8gMioCACIFIDkqAgAiBl1FBEBBACExID0MAQsgPSAFOAIAID0gMioCBDgCBCA5KgIAIQYgMioCACEFQQEhMSA9QQhyCyECIDJBCGohNyAFIAZdIDIgNUEBSyI/QQN0aioCACIJIAZdRwRAIAIgNyAyID8bKgIEIDIqAgQiB5MgCSAFk5UgBiAFk5QgB5I4AgQgAiA5KgIAOAIAIDFBAWohMSACQQhqIQILAkAgNUECSA0AIDcqAgAiBiA5KgIAIgVdBEAgAiAGOAIAIAIgMioCDDgCBCAxQQFqITEgOSoCACEFIDcqAgAhBiACQQhqIQILIDJBEGohNyAyIDVBA2tBfkkiP0EEdGoqAgAiCSAFXSAFIAZeRwRAIAIgNyAyID8bKgIEIDIqAgwiB5MgCSAGk5UgBSAGk5QgB5I4AgQgAiA5KgIAOAIAIDFBAWoiMUEIcQ0CIAJBCGohAgsgNUEDSA0AIDcqAgAiBiA5KgIAIgVdBEAgAiAGOAIAIAIgMioCFDgCBCAxQQFqIjFBCHENAiA5KgIAIQUgNyoCACEGIAJBCGohAgsgMkEYaiE3IDJBAEEYIDVB/gFxQQJGIj8baioCACIJIAVdIAUgBl5HBEAgAiAyIDcgPxsqAgQgMioCFCIHkyAJIAaTlSAFIAaTlCAHkjgCBCACIDkqAgA4AgAgMUEBaiIxQQhxDQIgAkEIaiECCyA1QQRIDQAgNyoCACIGIDkqAgAiBV0EQCACIAY4AgAgAiAyKgIcOAIEIDFBAWoiMUEIcQ0CIDkqAgAhBSA3KgIAIQYgAkEIaiECCyAyQSBqITcgMiA1QQVrQX5JIj9BBXRqKgIAIgkgBV0gBSAGXkcEQCACIDcgMiA/GyoCBCAyKgIcIgeTIAkgBpOVIAUgBpOUIAeSOAIEIAIgOSoCADgCACAxQQFqIjFBCHENAiACQQhqIQILIDVBBUgNACA3KgIAIgYgOSoCACIFXQRAIAIgBjgCACACIDIqAiQ4AgQgMUEBaiIxQQhxDQIgOSoCACEFIDcqAgAhBiACQQhqIQILIDJBKGohNyAyQQBBKCA1Qf4BcUEERiI/G2oqAgAiCSAFXSAFIAZeRwRAIAIgMiA3ID8bKgIEIDIqAiQiB5MgCSAGk5UgBSAGk5QgB5I4AgQgAiA5KgIAOAIAIDFBAWoiMUEIcQ0CIAJBCGohAgsgNUEGSA0AIDcqAgAiBiA5KgIAIgVdBEAgAiAGOAIAIAIgMioCLDgCBCAxQQFqIjFBCHENAiA5KgIAIQUgNyoCACEGIAJBCGohAgsgMkEwaiE3IDJBMEEAIDVBB2tBfkkiPxtqKgIAIgkgBV0gBSAGXkcEQCACIDcgMiA/GyoCBCAyKgIsIgeTIAkgBpOVIAUgBpOUIAeSOAIEIAIgOSoCADgCACAxQQFqIjFBCHENAiACQQhqIQILIDVBB0gNACA3KgIAIgYgOSoCACIFXQRAIAIgBjgCACACIDIqAjQ4AgQgMUEBaiIxQQhxDQIgOSoCACEFIDcqAgAhBiACQQhqIQILIDJBOGohNyAyQQBBOCA1Qf4BcUEGRiI/G2oqAgAiCSAFXSAFIAZeRwRAIAIgMiA3ID8bKgIEIDIqAjQiB5MgCSAGk5UgBSAGk5QgB5I4AgQgAiA5KgIAOAIAIDFBAWoiMUEIcQ0CIAJBCGohAgsgNUEISA0AIDcqAgAiBiA5KgIAIgVdBEAgAiAGOAIAIAIgMioCPDgCBCAxQQFqIjFBCHENAiA5KgIAIQUgNyoCACEGIAJBCGohAgsgMiA1QQlrQX5JQQZ0aiI1KgIAIgkgBV0gBSAGXkYNACACIDUqAgQgMioCPCIHkyAJIAaTlSAFIAaTlCAHkjgCBCACIDkqAgA4AgAgMUEBaiIxQQhxDQELIDFBAEwEQEEAITEMAQsgPUEEciFFQQAhNyA9IQIgMiE1A0AgOSoCBCIGIAIqAgQiCYwiBV4EQCA1IAIqAgA4AgAgNSACKgIEOAIEIDdBAWoiN0EIcQRAIDchMQwECyACKgIEIgmMIQUgNUEIaiE1IDkqAgQhBgsgAkEIaiE/IAUgBl0gBiACQQxqIEUgMUEBSyJCGyoCACIFjF5HBEAgNSA/ID0gQhsqAgAgAioCACIHkyAFIAmTlSAGjCAJk5QgB5I4AgAgNSA5KgIEjDgCBCA3QQFqIjdBCHEEQCA3ITEMBAsgNUEIaiE1CyAxQQFKIUIgMUEBayExID8hAiBCDQALQQAhMSA3QQBMDQAgPSE1IDIhAgNAIAIqAgQiBSA5KgIEIgZdBEAgNSACKgIAOAIAIDUgAioCBDgCBCAxQQFqIjFBCHENAiACKgIEIQUgNUEIaiE1IDkqAgQhBgsgBSAGXSACQQhqIj8gMiA3QQFLGyJCKgIEIgkgBl1HBEAgNSBCKgIAIAIqAgAiB5MgCSAFk5UgBiAFk5QgB5I4AgAgNSA5KgIEOAIEIDFBAWoiMUEIcQ0CIDVBCGohNQsgN0EBSiFCIDdBAWshNyA/IQIgQg0ACwsgMiA9IDFBA3QQ7AMaCyA9QUBrJAAgMSICQQBMBEBBACECDAELQwAAgD8gCyAKlCAMIAiUk5UiBSAMjJQhDCAFIAiMlCEJIAogBZQhEiALIAWUIRMgMyBDQQJ0aioCACEUIDggOkECdGoiMyoCICEXIDggPkECdGoiMSoCICEYIDMqAhAhGSAxKgIQIRwgNCoCACEaIDYqAgAhG0EAITMgMCoCqAIhLCAwKgKkAiEVIDAqAqACIRZBACE2A0AgMEFAayAzQQxsaiI0IAwgMEGgAWogNkEDdGoiMSoCACIKIA2TIgiUIBMgMSoCBCILIBCTIgeUkiIFIBmUIBIgCJQgCSAHlJIiCCAclCAOkpIiBzgCBCA0IAUgGpQgCCAblCAPkpIiBjgCACA0IAUgF5QgCCAYlCARkpIiBTgCCCAwQSBqIDNBAnRqIBQgLCAFlCAWIAaUIBUgB5SSkpMiBTgCACAFQwAAAABgBEAgMEGgAWogM0EDdGoiNCALOAIEIDQgCjgCACAzQQFqITMLIDZBAWoiNiACRw0ACyAzQQBMBEBBACECDAELAkBBASAzIEEgMyBBSBsiNiA2QQFMGyICIDNPBEBBACE2A0AgAyAEIDZsaiI0IDBBQGsgNkEMbGoiMSoCACA7KgIAkjgCACA0IDEqAgQgOyoCBJI4AgQgNCAxKgIIIDsqAgiSOAIIIDQgMEEgaiA2QQJ0aioCADgCICA2QQFqIjYgM0cNAAsgMyECDAELQQAhNkEAITECQCAzQQJJDQAgM0EBayI0QQNxITdBACE4IDAqAiAhBQJAIDNBAmtBA0kEQEEBITQMAQsgNEF8cSE/QQEhNEEAIUEDQCAwQSBqIDRBA2oiOkECdGoqAgAiCCAwQSBqIDRBAmoiPkECdGoqAgAiByAwQSBqIDRBAWoiMkECdGoqAgAiBiAwQSBqIDRBAnRqKgIAIgogBSAFIApdIjUbIgUgBSAGXSJDGyIFIAUgB10iPRsiBSAFIAhdIjkbIQUgOiA+IDIgNCAxIDUbIEMbID0bIDkbITEgNEEEaiE0IEFBBGoiQSA/Rw0ACwsgN0UNAANAIDBBIGogNEECdGoqAgAiCCAFIAUgCF0iQRshBSA0IDEgQRshMSA0QQFqITQgOEEBaiI4IDdHDQALCyAwQaABaiE0IDAhQUEAIThDAAAAACEFQwAAAAAhB0EAITpDAAAAACEMIwBB0ABrIjIkAAJAAn0CQAJAAkAgM0EBaw4CAQIACyAzQQJOBEAgM0ECayE3A0AgBSA0IDhBA3RqIjUqAgAiCCA1KgIMIgqUIDUqAgQiCSA1KgIIIguUkyIGkiEFIAYgCiAJkpQgDJIhDCAGIAggC5KUIAeSIQcgNyA4RiE1IDhBAWohOCA1RQ0ACwsgM0EATA0DIDNBA3QgNGoiOEEIayoCACIKIDQqAgQiBpQgOEEEayoCACIJIDQqAgAiC5STIgggBiAJkpQgDJJDAACAPyAFIAiSQwAAQECUlSIFlCEGIAggCiALkpQgB5IgBZQMAgsgNCoCBCEGIDQqAgAMAQsgNCoCBCA0KgIMkkMAAAA/lCEGIDQqAgAgNCoCCJJDAAAAP5QLIQVBACE4A0AgMkEwaiA4QQJ0aiA0IDhBA3RqIjUqAgQgBpMgNSoCACAFkxDmAzgCACA4QQFqIjggM0cNAAtBACE0QQAhNSAzQQFrQQdPBEAgM0F4cSE6QQAhNwNAIDVBAnQiOCAyQRBqakEBNgIAIDJBEGogOEEEcmpBATYCACAyQRBqIDhBCHJqQQE2AgAgMkEQaiA4QQxyakEBNgIAIDJBEGogOEEQcmpBATYCACAyQRBqIDhBFHJqQQE2AgAgMkEQaiA4QRhyakEBNgIAIDJBEGogOEEccmpBATYCACA1QQhqITUgN0EIaiI3IDpHDQALCyAzQQdxIjhFBEBBASE6DAELA0BBASE6IDJBEGogNUECdGpBATYCACA1QQFqITUgNEEBaiI0IDhHDQALCyAxQQJ0IjggMkEQampBADYCACBBIDE2AgAgAkECTgRARBgtRFT7IRlAIAK3oyFIIDJBMGogOGoqAgC7IUlBASE3A0AgQSAxNgIEIEFBBGohQQJAIDoEQCA3srsgSKIgSaC2Iga7IkdEGC1EVPshGcCgtiAGIEdEGC1EVPshCUBkGyEHQQAhOEMoa25OIQUgMSE0A0ACQCA4QQJ0IjUgMkEQamooAgBFDQBEGC1EVPshGUAgMkEwaiA1aioCACAHk4siBrsiR6G2IAYgR0QYLURU+yEJQGQbIgYgBV1FDQAgQSA4NgIAIDghNCAGIQULIDhBAWoiOCAzRw0ACyAxIDRHDQELIDJBlxg2AgQgMkH6DTYCAEEBQfzEACAyEI4BIEEoAgAhNAsgMkEQaiA0QQJ0akEANgIAIDdBAWoiNyACRw0ACwsgMkHQAGokAANAIAMgBCA2bGoiMyAwQUBrIDAgNkECdGooAgAiMUEMbGoiNCoCACA7KgIAkjgCACAzIDQqAgQgOyoCBJI4AgQgMyA0KgIIIDsqAgiSOAIIIDMgMEEgaiAxQQJ0aioCADgCICA2QQFqIjYgAkcNAAsLIEQgPDYCAAsgMEHgAmokAAJAIAIiMkEATA0AIEAqAjiMIQcgQCoCNIwhBSBAKgIwjCEGQQAhPSACQQFHBEAgAkF+cSExA0AgAyAEID1saiICIAE2AiggAiAANgIkIAIgBjgCECACIAc4AhggAiAFOAIUIAMgPUEBciAEbGoiAiABNgIoIAIgADYCJCACIAc4AhggAiAFOAIUIAIgBjgCECA9QQJqIT0gRkECaiJGIDFHDQALCyAyQQFxRQ0AIAMgBCA9bGoiAiABNgIoIAIgADYCJCACIAY4AhAgAiAHOAIYIAIgBTgCFAsgQEFAayQAIDILqw4CB38XfSMAQTBrIgckACAEQTNMBEAgB0GXGDYCJCAHQdsnNgIgQQFB3ckAIAdBIGoQjgELIAAoAgRBAUcEQCAHQZcYNgIUIAdB2yc2AhBBAUGDMyAHQRBqEI4BCyABKAIEQQRHBEAgB0GXGDYCBCAHQdsnNgIAQQFB0jYgBxCOAQsgAyABNgIoIAMgADYCJAJAIAEqAlQiDSAAKAIYIgUqAjAiD5QgASoCTCIMIAUqAhAiEZQgASoCUCIOIAUqAiAiEJSSkiAAKgJMIheUIhOLIhUgDSAFKgI0IhqUIAwgBSoCFCIblCAOIAUqAiQiHJSSkiAAKgJQIhiUIhmLIhaSIA0gBSoCOCIdlCAMIAUqAhgiHpQgDiAFKgIoIh+UkpIgACoCVCIglCISiyIUkkMAAAA/lCABKgJYkiANIAUqAggiIZQgDCAFKgIAIiKUIA4gBSoCBCIMlJKSkyINQwAAAABdDQAgAyAgQwAAAL9DAAAAPyASQwAAAABeG5QiDiAdlCAYQwAAAL9DAAAAPyAZQwAAAABeG5QiGCAalCAXQwAAAL9DAAAAPyATQwAAAABeG5QiFyAPlCAhkpKSIg84AgggAyAOIB+UIBggHJQgFyAQlCAMkpKSIhA4AgQgAyAOIB6UIBggG5QgFyARlCAikpKSIg44AgAgAyABKgJMOAIQIAMgASoCUDgCFCABKgJUIQwgAyANOAIgIAMgDDgCGEEBIQgCQEEDQQEgAkH//wNxIgYgBkEBTRsiAiACQQNPGyIKQQFGBEBBASEGDAELIAMgBGoiAiABKgJMOAIQIAIgASoCUDgCFCACIAEqAlQ4AhggBkEDTwRAIAMgBEEBdGoiBiABKgJMOAIQIAYgASoCUDgCFCAGIAEqAlQ4AhgLAkACfQJAAkACQAJAAkACQAJAAkAgFSAWXSILBEAgFCAVXQ0BQQEhBiANIBWTIg1DAAAAAF0NCyAFKgIQIQwgACoCTCERAn0gE0MAAAAAXgRAIAIgESAMlCAOkjgCACACIAAqAkwgBSoCIJQgEJI4AgQgACoCTCAFKgIwlCAPkgwBCyACIA4gESAMlJM4AgAgAiAQIAAqAkwgBSoCIJSTOAIEIA8gACoCTCAFKgIwlJMLIQwgAiANOAIgIAIgDDgCCEECIQYgCkECRw0EDAoLIBQgFl1FDQELQQEhBiANIBSTIg1DAAAAAF0NCSAFKgIYIQwgACoCVCERAn0gEkMAAAAAXgRAIAIgESAMlCAOkjgCACACIAAqAlQgBSoCKJQgEJI4AgQgACoCVCAFKgI4lCAPkgwBCyACIA4gESAMlJM4AgAgAiAQIAAqAlQgBSoCKJSTOAIEIA8gACoCVCAFKgI4lJMLIQwgAiANOAIgIAIgDDgCCEECIQYgCkECRg0IIAsNAQwEC0EBIQYgDSAWkyINQwAAAABdDQggBSoCFCEMIAAqAlAhEQJ9IBlDAAAAAF4EQCACIBEgDJQgDpI4AgAgAiAAKgJQIAUqAiSUIBCSOAIEIAAqAlAgBSoCNJQgD5IMAQsgAiAOIBEgDJSTOAIAIAIgECAAKgJQIAUqAiSUkzgCBCAPIAAqAlAgBSoCNJSTCyEMIAIgDTgCICACIAw4AghBAiEGIApBAkYNByAUIBVeRQ0CCyANIBWTIg1DAAAAAF0NAyAFKgIQIQwgACoCTCESIBNDAAAAAF4EQCADIARBAXQiAmoiBiASIAyUIA6SOAIAIAYgACoCTCAFKgIglCAQkjgCBCAAKgJMIAUqAjCUIA+SDAYLIAMgBEEBdCICaiIGIA4gEiAMlJM4AgAgBiAQIAAqAkwgBSoCIJSTOAIEIA8gACoCTCAFKgIwlJMMBQsgFCAWXg0BCyANIBSTIg1DAAAAAF0NASAFKgIYIQwgACoCVCETIBJDAAAAAF4EQCADIARBAXQiAmoiBiATIAyUIA6SOAIAIAYgACoCVCAFKgIolCAQkjgCBCAAKgJUIAUqAjiUIA+SDAQLIAMgBEEBdCICaiIGIA4gEyAMlJM4AgAgBiAQIAAqAlQgBSoCKJSTOAIEIA8gACoCVCAFKgI4lJMMAwsgDSAWkyINQwAAAABdDQAgBSoCFCEMIAAqAlAhEiAZQwAAAABeRQ0BIAMgBEEBdCICaiIGIBIgDJQgDpI4AgAgBiAAKgJQIAUqAiSUIBCSOAIEIAAqAlAgBSoCNJQgD5IMAgsMAgsgAyAEQQF0IgJqIgYgDiASIAyUkzgCACAGIBAgACoCUCAFKgIklJM4AgQgDyAAKgJQIAUqAjSUkwshDCAGIAw4AgggAiADaiANOAIgQQMhBkEAIQgMAQtBASEJQQAhCAsgAyABNgIoIAMgADYCJCAIDQAgAyAEaiIFIAE2AiggBSAANgIkIAkNACADIARBAXRqIgUgATYCKCAFIAA2AiQLIAdBMGokACAGCwwAIAAQLkHcABCPAgukAQIBfwV9IAAoAhgiASoCOCEFIAEqAighAyAAIAEqAgAgASoCGCAAKgJQIgKUi0MAAAA/lCAAKgJMIgSSIgaTOAIsIAAgBiABKgIAkjgCMCAAIAEqAgQgBCACIAOUi0MAAAA/lJIiA5M4AjQgACADIAEqAgSSOAI4IAAgASoCCCAEIAIgBZSLQwAAAD+UkiICkzgCPCAAQUBrIAIgASoCCJI4AgALbAECf0HUABCOAiEEIwBBEGsiAyQAIAQgAEEBECwiAEGo4gA2AgAgAUMAAAAAXiACQwAAAABecUUEQCADQZYpNgIAQQJB2d8AIAMQjgELIAAgAjgCUCAAIAE4AkwgAEECNgIEIANBEGokACAEC3YBAX8jAEEgayIDJAACQCAABEAgACgCBEECRg0BCyADQagQNgIQQQJBz9YAIANBEGoQjgELIAFDAAAAAF4gAkMAAAAAXnFFBEAgA0GoEDYCAEECQdnfACADEI4BCyAAIAI4AlAgACABOAJMIAAQPSADQSBqJAALTQEBfyMAQRBrIgMkAAJAIAAEQCAAKAIEQQJGDQELIANB+xA2AgBBAkHP1gAgAxCOAQsgASAAKgJMOAIAIAIgACoCUDgCACADQRBqJAAL9wECCX0CfyMAQRBrIg4kAAJAIAAEQCAAKAIEQQJGDQELIA5BySM2AgBBAkHP1gAgDhCOAQsgAC0ACEECcQRAIAAQKyAAIAAoAghBfXE2AggLAkAgAyAAKAIYIg0qAggiB5MgDSoCOCIIlCABIA0qAgAiCZMgDSoCGCIKlCACIA0qAgQiC5MgDSoCKCIMlJKSIgUgACoCUEMAAAA/lCIGjCIEXQ0AIAYgBSIEXUUNACAGIQQLIAAqAkwhBSAOQRBqJAAgBSADIAQgCJQgB5KTIgMgA5QgASAEIAqUIAmSkyIDIAOUIAIgBCAMlCALkpMiBCAElJKSkZMLwgICCX0BfyMAQUBqIgIkACAEQTNMBEAgAkGtGzYCJCACQaYnNgIgQQFB3ckAIAJBIGoQjgELIAAoAgRBAkcEQCACQa0bNgIUIAJBpic2AhBBAUHENyACQRBqEI4BCyABKAIEBEAgAkGtGzYCBCACQaYnNgIAQQFB4DUgAhCOAQsgAyABNgIoIAMgADYCJCACIAAqAlBDAAAAP5QiBYwiBiAFIAAoAhgiBCoCOCIHIAEoAhgiDioCCCAEKgIIIgiTlCAEKgIYIgkgDioCACAEKgIAIgqTlCAEKgIoIgsgDioCBCAEKgIEIgyTlJKSIg0gBSANXRsiBSAFIAZdGyIFIAeUIAiSOAI4IAIgDCAFIAuUkjgCNCACIAogBSAJlJI4AjAgAkEwaiAAKgJMIA4gASoCTCADEIIBIQAgAkFAayQAIAAL0wwCH30IfyMAQfAAayICJAAgBEEzTARAIAJBrRs2AiQgAkGLCzYCIEEBQd3JACACQSBqEI4BCyAAKAIEQQJHBEAgAkGtGzYCFCACQYsLNgIQQQFBxDcgAkEQahCOAQsgASgCBEEBRwRAIAJBrRs2AgQgAkGLCzYCAEEBQc0yIAIQjgELIAMgATYCKCADIAA2AiQgAiAAKgJQQwAAAD+UIhEgACgCGCIEKgIYlCIFIAQqAgCSOAJgIAIgESAEKgIolCIGIAQqAgSSOAJkIAIgESAEKgI4lCIRIAQqAgiSOAJoIAIgBCoCACAFkzgCUCACIAQqAgQgBpM4AlQgAiAEKgIIIBGTOAJYIAAqAkwhESABKAIYIgQhJCACQUBrISggAkEwaiEpIARBEGoiACoCKCIGIAJB0ABqIgQqAgggAkHgAGoiJioCCCIHkyIYlCAAKgIIIgUgBCoCACAmKgIAIiCTIhmUIAAqAhgiCCAEKgIEICYqAgQiCZMiGpSSkiIbQwAAAABdIScgBiAHICQqAgiTIgeUIAUgICAkKgIAkyIGlCAJICQqAgSTIgUgCJSSkiEJIAAqAiQiCCAHlCAAKgIEIgsgBpQgBSAAKgIUIgqUkpIiFowhFyAAKgIgIhwgB5QgACoCACIHIAaUIAAqAhAiBiAFlJKSIgWMIAUgHCAYlCAHIBmUIAYgGpSSkiIdQwAAAABdIiobIRIgG4whBiAIIBiUIAsgGZQgCiAalJKSIh6MIB4gHkMAAAAAXSIrGyEMIAFBzABqIgEqAgQhBSABKgIAQwAAAD+UIQ1DAAAAQCEHQQAhBAJ9QwAAAEAgHYwgHSAqGyITQwAAAABeRQ0AGiANjCIIIBJeBEBBfyElIAggEpMgE5UMAQsgDSASXSElIA0gEpMgE5ULIQggCYwhCyAGIBsgJxshDiABKgIIIQYgFyAWICsbIRQgBUMAAAA/lCEPAkAgDEMAAAAAXkUNACAUIA+MIgddRQRAIA8gFF0hBCAPIBSTIAyVIQcMAQsgByAUkyAMlSEHQX8hBAsgCyAJICcbIRUgBkMAAAA/lCEQQwAAAAAhCgJAQwAAAAAgEyATlCIcQwAAAAAgJRsgCJSTIAwgDJQiF0MAAAAAIAQbIAeUkyAOIA6UIhZDAAAAAAJ/IA5DAAAAAF5FBEBDAAAAQCEGQQAMAQsgFSAQjCIGXUUEQCAQIBWTIA6VIQYgECAVXQwBCyAGIBWTIA6VIQZBfwsiARsgBpSTIh9DAAAAAGANACAQIBWTIA6VISEgDyAUkyAMlSEiIA0gEpMgE5UhI0MAAAAAIQkDQCAWQwAAAAAgARsgBiAHIAhDAACAPyAIQwAAgD9dG0MAAIA/IAggCV4bIgUgByAJXhsgBSAFIAdeGyAFIAdDAACAP10bIgUgBiAJXhsgBSAFIAZeGyAFIAZDAACAP10bIgUgBpOUIBdDAAAAACAEGyAFIAeTlCAcQwAAAAAgJRsgBSAIk5RDAAAAAJKSkiILQwAAAABgRQRAICEgBiAFIAZbIicbIQYgIiAHIAUgB1siKhshByAjIAggBSAIWyIrGyEIIAEgJ2ohASAEICpqIQQgJSAraiElQwAAgD8hCiAFIQkgCyEfIAVDAACAP10NAQwCCwsgCSAfIAsgH5MgBSAJk5WVkyEKCyAoIAogGZQgIJI4AgAgKCAKIBqUICYqAgSSOAIEICggCiAYlCAmKgIIkjgCCAJAIAogE5QgEpIiB4wgByAdQwAAAABdGyIGIA2MIgddDQAgBiEHIAYgDV5FDQAgDSEHCwJAIAogDJQgFJIiBowgBiAeQwAAAABdGyIFIA+MIgZdDQAgBSEGIAUgD15FDQAgDyEGCwJAIAogDpQgFZIiBYwgBSAbQwAAAABdGyIIIBCMIgVdDQAgECAIIgVdRQ0AIBAhBQsgACoCKCEIIAAqAiAhCSAAKgIkIQsgACoCGCEKIAAqAhAhFiAAKgIUIRcgKSAAKgIIIAWUIAAqAgAgB5QgACoCBCAGlJKSICQqAgCSOAIAICkgCiAFlCAWIAeUIAYgF5SSkiAkKgIEkjgCBCApIAggBZQgCSAHlCAGIAuUkpIgJCoCCJI4AgggAkFAayARIAJBMGpDAAAAACADEIIBIQQgAkHwAGokACAEC8wUAgV/HH0jAEGQAWsiBSQAIARBM0wEQCAFQa0bNgIkIAVBsCk2AiBBAUHdyQAgBUEgahCOAQsgACgCBEECRwRAIAVBrRs2AhQgBUGwKTYCEEEBQcQ3IAVBEGoQjgELIAEoAgRBAkcEQCAFQa0bNgIEIAVBsCk2AgBBAUGKNyAFEI4BCyADIAE2AiggAyAANgIkIAEqAlBDAAAAP5QhDyAAKgJQQwAAAD+UIQoCfwJAQwAAgD8gACgCGCIHKgI4IhQgASgCGCIGKgI4IhCUIAcqAhgiESAGKgIYIg2UIAcqAigiEiAGKgIoIhOUkpIiCyALlJNDrMUnN11FBEAgByoCACELDAELIBCMIBAgC0MAAAAAXSIIGyEQIBOMIBMgCBshEyANjCANIAgbIQ0gCowiDiAPjCAUIAcqAggiFSAGKgIIk5QgESAHKgIAIgsgBioCAJOUIBIgByoCBCIWIAYqAgSTlJKSIheTIgwgDCAOXRsiDiAKIA8gF5MiDCAKIAxdGyIMX0UNAAJAAkAgAkH+/wNxRQ0AIAwgDl5FDQAgBSAOIBSUIBWSOAKIASAFIA4gEpQgFpI4AoQBIAUgDiARlCALkjgCgAEgBSAXIA6SIgogDZQgBioCAJI4AnAgBSAKIBOUIAYqAgSSOAJ0IAUgCiAQlCAGKgIIkjgCeCAFQYABaiAAKgJMIAVB8ABqIAEqAkwgAxCCASEIIAcqAgghFSAHKgIEIRYgByoCACELIAhFDQAgBSAMIBSUIBWSOAKIASAFIAwgEpQgFpI4AoQBIAUgDCARlCALkjgCgAEgBSAXIAySIgogDZQgBioCAJI4AnAgBSAKIBOUIAYqAgSSOAJ0IAUgCiAQlCAGKgIIkjgCeCAFQYABaiAAKgJMIAVB8ABqIAEqAkwgAyAEaiIEEIIBDQEgByoCCCEVIAcqAgQhFiAHKgIAIQsLIAUgDiAMkkMAAAA/lCIKIBSUIBWSOAKIASAFIAogEpQgFpI4AoQBIAUgCiARlCALkjgCgAEgBSAXIAqSIgogDZQgBioCAJI4AnAgBSAKIBOUIAYqAgSSOAJ0IAUgCiAQlCAGKgIIkjgCeCAFQYABaiAAKgJMIAVB8ABqIAEqAkwgAxCCAQwCCyAEIAE2AiggBCAANgIkQQIMAQsgBSARIAqUIhEgC5I4AmAgBSASIAqUIhIgByoCBJI4AmQgBSAUIAqUIgogByoCCJI4AmggBSAHKgIAIBGTOAJQIAUgByoCBCASkzgCVCAFIAcqAgggCpM4AlggBSANIA+UIgogBioCAJI4AkAgBSATIA+UIg0gBioCBJI4AkQgBSAQIA+UIg8gBioCCJI4AkggBSAGKgIAIAqTOAIwIAUgBioCBCANkzgCNCAFIAYqAgggD5M4AjggBUGAAWohAiAFQfAAaiEEIAVBMGoiCCoCCCIKIAVBQGsiBioCCCIVkyINIBUgBUHgAGoiByoCCCILkyIXlCAIKgIAIhYgBioCACIYkyIOIBggByoCACIQkyIflCAIKgIEIhEgBioCBCIZkyIPIBkgByoCBCIMkyIglJKSIRoCQAJAIAVB0ABqIgkqAggiGyALkyISIBeUIAkqAgAiHCAQkyITIB+UIAkqAgQiHSAMkyIUICCUkpIiHkMAAAAAX0UNACAaQwAAAABgRQ0AIAIgEDgCACACIAcqAgQ4AgQgAiAHKgIIOAIIIAQgBioCADgCACAEIAYqAgQ4AgQgBCAGKgIIOAIIDAELIA0gCiALkyILlCAOIBYgEJMiI5QgESAMkyIMIA+UkpIhJAJAIBIgC5QgEyAjlCAUIAyUkpIiJUMAAAAAX0UNACAkQwAAAABfRQ0AIAIgEDgCACACIAcqAgQ4AgQgAiAHKgIIOAIIIAQgCCoCADgCACAEIAgqAgQ4AgQgBCAIKgIIOAIIDAELIA0gFSAbkyIVlCAOIBggHJMiGJQgDyAZIB2TIhmUkpIhIQJAIBIgFZQgEyAYlCAUIBmUkpIiIkMAAAAAYEUNACAhQwAAAABgRQ0AIAIgHDgCACACIAkqAgQ4AgQgAiAJKgIIOAIIIAQgBioCADgCACAEIAYqAgQ4AgQgBCAGKgIIOAIIDAELIA0gCiAbkyIKlCAOIBYgHJMiFpQgESAdkyIRIA+UkpIhGwJAIBIgCpQgEyAWlCAUIBGUkpIiCkMAAAAAYEUNACAbQwAAAABfRQ0AIAIgHDgCACACIAkqAgQ4AgQgAiAJKgIIOAIIIAQgCCoCADgCACAEIAgqAgQ4AgQgBCAIKgIIOAIIDAELIBIgEpQgEyATlCAUIBSUkpIhFgJAIB5DAAAAAGBFDQAgIkMAAAAAX0UNACANIBcgHiAWlSIRIBKUIh2TlCAOIB8gESATlCIik5QgDyAgIBEgFJQiEZOUkpJDAAAAAGBFDQAgAiAiIBCSOAIAIAIgESAHKgIEkjgCBCACIB0gByoCCJI4AgggBCAGKgIAOAIAIAQgBioCBDgCBCAEIAYqAgg4AggMAQsCQCAlQwAAAABgRQ0AIApDAAAAAF9FDQAgDSALICUgFpUiCiASlCIRk5QgDiAjIAogE5QiC5OUIA8gDCAKIBSUIgqTlJKSQwAAAABfRQ0AIAIgCyAQkjgCACACIAogByoCBJI4AgQgAiARIAcqAgiSOAIIIAQgCCoCADgCACAEIAgqAgQ4AgQgBCAIKgIIOAIIDAELIA0gDZQgDiAOlCAPIA+UkpIhCwJAIBpDAAAAAF9FDQAgJEMAAAAAYEUNACASIBqMIAuVIgqMIgwgDZQgF5OUIBMgDCAOlCAfk5QgFCAMIA+UICCTlJKSQwAAAABgRQ0AIAIgEDgCACACIAcqAgQ4AgQgAiAHKgIIOAIIIAQgCiAOlCAGKgIAkjgCACAEIAogD5QgBioCBJI4AgQgBCAKIA2UIAYqAgiSOAIIDAELAkAgIUMAAAAAX0UNACAbQwAAAABgRQ0AIBIgIYwgC5UiF4wiDCANlCAVk5QgEyAMIA6UIBiTlCAUIAwgD5QgGZOUkpJDAAAAAF9FDQAgAiAcOAIAIAIgCSoCBDgCBCACIAkqAgg4AgggBCAXIA6UIAYqAgCSOAIAIAQgFyAPlCAGKgIEkjgCBCAEIBcgDZQgBioCCJI4AggMAQsgFiALlCASIA2UIBMgDpQgFCAPlJKSIgwgDJSTIhVDAAAAAF8EQCACIBA4AgAgAiAHKgIEOAIEIAIgByoCCDgCCCAEIAYqAgA4AgAgBCAGKgIEOAIEIAQgBioCCDgCCAwBCyACIAsgHpQgGiAMjJSSQwAAgD8gFZUiFZQiCyATlCAQkjgCACACIAsgFJQgByoCBJI4AgQgAiALIBKUIAcqAgiSOAIIIAQgDCAelCAaIBaUkyAVlCIQIA6UIAYqAgCSOAIAIAQgECAPlCAGKgIEkjgCBCAEIBAgDZQgBioCCJI4AggLIAVBgAFqIAAqAkwgBUHwAGogASoCTCADEIIBCyEGIAVBkAFqJAAgBgvNBQIDfwh9IwBBMGsiBiQAIARBM0wEQCAGQa0bNgIkIAZBvyg2AiBBAUHdyQAgBkEgahCOAQsgACgCBEECRwRAIAZBrRs2AhQgBkG/KDYCEEEBQcQ3IAZBEGoQjgELIAEoAgRBBEcEQCAGQa0bNgIEIAZBvyg2AgBBAUHSNiAGEI4BCwJAIAAqAkwgASoCWCAAKgJQIgggACgCGCIFKgI4IgmUQwAAAD+UQwAAgL9DAACAPyABKgJUIgogCZQgASoCTCILIAUqAhgiDJQgASoCUCINIAUqAigiDpSSkkMAAAAAXhsiCZQgBSoCCJIiDyAKlCAMIAiUQwAAAD+UIAmUIAUqAgCSIgogC5QgDSAIIA6UQwAAAD+UIAmUIAUqAgSSIgiUkpKTkiIMQwAAAABdDQAgAyALOAIQIAMgASoCUDgCFCADIAEqAlQ4AhggAyAKIAEqAkwgACoCTJSTOAIAIAMgCCABKgJQIAAqAkyUkzgCBCAAKgJMIQggASoCVCELIAMgDDgCICADIA8gCyAIlJM4AggCfyACQf7/A3FFBEBBASEHQQEMAQtBASEHQQEgACoCTCABKgJYIAAqAlAiCCAFKgI4lEMAAAC/lCAJlCAFKgIIkiILIAEqAlSUIAUqAhggCJRDAAAAv5QgCZQgBSoCAJIiCiABKgJMIgyUIAggBSoCKJRDAAAAv5QgCZQgBSoCBJIiCSABKgJQlJKSk5IiCEMAAAAAYEUNABogAyAEaiIFIAw4AhAgBSABKgJQOAIUIAUgASoCVDgCGCAFIAogASoCTCAAKgJMlJM4AgAgBSAJIAEqAlAgACoCTJSTOAIEIAAqAkwhCSABKgJUIQogBSAIOAIgIAUgCyAKIAmUkzgCCEECIQdBAAshAiADIAE2AiggAyAANgIkIAINACADIARqIgUgATYCKCAFIAA2AiQLIAZBMGokACAHCwwAIAAQLkHUABCPAgu1AwEGfQJ/AkAgASoCCCIDIAOUIAEqAgAiAyADlCABKgIEIgMgA5SSkpFDrMUnN10NACABENACQQAgACoCsAMgASoCCCIDlCAAKgKoAyABKgIAIgSUIAEqAgQiBSAAKgKsA5SSkiIIiyIHIAAqAlBDAACAP0MAAIA/IAAqAkggA5QgACoCQCAElCAAKgJEIAWUkpIiBiAGQwAAgD9eGyIGIAaUk5GUIAAqAlRDAAAAP5QgBpSLkiIGIAAqAoACIAOUIAAqAuABIASUIAUgACoC8AGUkpKLIAAqAqAClCAAKgL8ASADlCAAKgLcASAElCAFIAAqAuwBlJKSiyAAKgKcApQgACoCmAIgACoC+AEgA5QgACoC2AEgBJQgBSAAKgLoAZSSkouUkpIiBJIiA14NARogAyAHkyIDIAAqAsgDXUUNACAAIAM4AsgDIAAgASoCACIFOAK4AyAAIAEqAgQiBzgCvAMgASoCCCEDIAAgAjYC1AMgACADOALAAyAAIAY4AtADIAAgBDgCzAMgCEMAAAAAXkUNACAAIAOMOALAAyAAIAeMOAK8AyAAIAWMOAK4AwtBAQsLxwICAX8MfSMAQSBrIgUkACAFIAMqAgAgAioCAJM4AhAgBSADKgIEIAIqAgSTOAIUIAUgAyoCCCACKgIIkzgCGCAFQRBqENACQQEhAyAFKgIYIgogACoCSCIHlCAFKgIQIgsgACoCQCIIlCAFKgIUIgwgACoCRCINlJKSIgaLQ6zFJzddRQRAIAUgASoCBCIJIAwgASoCCCIOIAIqAggiD5MgB5QgASoCACIQIAIqAgAiEZMgCJQgDSAJIAIqAgQiCZOUkpIgBpUiBpQgCZKTIgkgB5QgDSAOIAogBpQgD5KTIg6UkyIPIAyUIAsgDiAIlCAHIBAgCyAGlCARkpMiBpSTIgeUkzgCCCAFIAYgDZQgCCAJlJMiCCALlCAKIA+UkzgCBCAFIAcgCpQgDCAIlJM4AgAgACAFIAQQHyEDCyAFQSBqJAAgAwv2AgEGfSAAKgIIIAAqAhAiAiAAKgIkIgOUIAAqAhQiBCAAKgIgIgWUk5QgACoCACAEIAAqAigiBpQiByAAKgIYIgQgA5QiA5OUIAIgBpQgBCAFlJMgACoCBJSTkiICi0NvEgM6XQRAIAEQ5AIPCyABIAcgAyAClZM4AgAgASAAKgIEIAAqAiiUIAAqAgggACoCJJSTjCAClTgCBCABIAAqAgQgACoCGJQgACoCCCAAKgIUlCAClZM4AgggASAAKgIQIAAqAiiUIAAqAiAgACoCGJSTjCAClTgCECABIAAqAgAgACoCKJQgACoCCCAAKgIglCAClZM4AhQgASAAKgIAIAAqAhiUIAAqAgggACoCEJSTjCAClTgCGCABIAAqAhAgACoCJJQgACoCFCAAKgIglCAClZM4AiAgASAAKgIAIAAqAiSUIAAqAgQgACoCIJSTjCAClTgCJCABIAAqAgAgACoCFJQgACoCECAAKgIElCAClZM4AigLtzcCHn0SfyMAQaAEayIlJAAgJSAENgKYBCAlIAI2ApQEICUgATYCiAQgJSAANgKMBCAlIAM2ApAEICVBCGoiACAAKAKEBBA3IgEqAgA4AgAgACABKgIEOAIEIAAgASoCCDgCCCAAIAEqAhA4AhAgACABKgIUOAIUIAAgASoCGDgCGCAAIAEqAiA4AiAgACABKgIkOAIkIAAgASoCKDgCKCAAIAAoAoQEEDYiASoCADgCMCAAQTRqIisgASoCBDgCACAAQThqIiwgASoCCDgCACAAIAAqAgg4AkAgACAAKgIYOAJEIAAgACoCKDgCSCAAKAKEBCAAQdAAaiAAQdQAahCMASAAIAAoAoAEEDciASoCADgC2AEgAEHcAWoiLSABKgIEOAIAIABB4AFqIi4gASoCCDgCACAAQegBaiIvIAEqAhA4AgAgAEHsAWoiMCABKgIUOAIAIABB8AFqIjEgASoCGDgCACAAQfgBaiIyIAEqAiA4AgAgAEH8AWoiMyABKgIkOAIAIABBgAJqIjQgASoCKDgCACAAIAAoAoAEEDYiASoCADgCiAIgAEGMAmoiAiABKgIEOAIAIABBkAJqIgMgASoCCDgCACAAKAKABCAAQZgCahAQIAAgACoCmAJDAAAAP5QiBzgCmAIgAEGcAmoiASABKgIAQwAAAD+UIgU4AgAgAEGgAmoiASABKgIAQwAAAD+UIgY4AgAgAEGgA2oiASAGOAIAIABBnANqIgQgBTgCACAAQZADaiIjIAY4AgAgAEGAA2oiJCAGOAIAIABB+AJqIiYgBzgCACAAQZgDaiInIAeMIgs4AgAgAEGMA2oiKCAFjCIMOAIAIABBiANqIikgCzgCACAAQfwCaiIqIAw4AgAgLSoCACENIC4qAgAhDiACKgIAIQggMSoCACEPIC8qAgAhECAwKgIAIREgACoCiAIhCSAAKgLYASESIAAgNCoCACIUIAaUIDIqAgAiFSAHlCIXIAUgMyoCACIWlCIZkiITkiADKgIAIgqSOALwAiAAIAggDyAGlCAQIAeUIhggBSARlCIakiIbkpI4AuwCIAAgCSAOIAaUIBIgB5QiHCANIAWUIh2SIh6SkjgC6AIgACAKIBQgBowiBZQiBiATkpI4AsACIAAgCCAPIAWUIgcgG5KSOAK8AiAAIAkgDiAFlCIFIB6SkjgCuAIgACAKIAYgFyAWIAyUIhOSkpI4AuACIAAgCCAHIBggESAMlCIXkpKSOALcAiAAIAkgBSAcIA0gDJQiDJKSkjgC2AIgACAKIAYgFSALlCIYIBOSkpI4AtACIAAgCCAHIBAgC5QiEyAXkpKSOALMAiAAIAkgBSASIAuUIgsgDJKSkjgCyAIgACAKIAYgGCAZkpKSOAKwAiAAIAggByATIBqSkpI4AqwCIAAgCSAFIAsgHZKSkjgCqAIgJCAKIBQgJCoCACIGlCAVICYqAgAiB5QgFiAqKgIAIgWUkpKSOAIAICogCCAPIAaUIBAgB5QgBSARlJKSkjgCACAmIAkgDiAGlCASIAeUIA0gBZSSkpI4AgAgACAAKgIwIAAqAogCkzgCqAMgKSAJIA4gIyoCACIGlCASICkqAgAiB5QgDSAoKgIAIgWUkpKSOAIAICggCCAPIAaUIBAgB5QgBSARlJKSkjgCACAjIAogFCAGlCAVIAeUIAUgFpSSkpI4AgAgJyAJIA4gASoCACIGlCASICcqAgAiB5QgDSAEKgIAIgWUkpKSOAIAIAQgCCAPIAaUIBAgB5QgBSARlJKSkjgCACABIAogFCAGlCAVIAeUIAUgFpSSkpI4AgAgACArKgIAIAIqAgCTOAKsAyADKgIAIQggLCoCACEJIABBgICA/Ac2AsgDIAAgCSAIkzgCsAMgAEEANgLAAyAAQgA3ArgDIABBADYClAQgAEEANgLUAyAAQgA3AswDIABBADYC0AEgAELfhrL72+L74T43AsgBIABBADYCwAEgAEKb3o/22+ugtj83ArgBIABBADYCsAEgAEKL3o/2k+ygtj83AqgBIABBADYCoAEgAELdhrL70+P74T43ApgBIABBADYCkAEgAELghrL7g+L74b5/NwKIASAAQQA2AoABIABCmN6P9uProLa/fzcCeCAAQQA2AnAgAEKV3o/26+ugtr9/NwJoIABBADYCYCAAQt6Gsvvr4vvhvn83AlhBACEEQQAhAyMAQSBrIgEkACAlQQhqIgBCgICA/Ac3AsgDIABBADYClAQgAEIANwLQAyABQgA3AxggAUIANwMQIAEgACoC2AE4AhAgASAAKgLoATgCFCABIAAqAvgBOAIYAkAgACABQRBqQQEQH0UNACABIAAqAtwBOAIQIAEgACoC7AE4AhQgASAAKgL8ATgCGCAAIAFBEGpBAhAfRQ0AIAEgACoC4AE4AhAgASAAKgLwATgCFCABIAAqAoACOAIYIAAgAUEQakEDEB9FDQAgASAAKgJAOAIQIAEgACoCRDgCFCABIAAqAkg4AhggACABQRBqQQQQH0UNACABIAAqAkQiBSAAKgL4ASIHlCAAKgLoASIKIAAqAkgiBpSTIgk4AhAgASAGIAAqAtgBIguUIAcgACoCQCIIlJMiBzgCFCABIAggCpQgCyAFlJMiCjgCGAJ9IAogCpQgCSAJlCAHIAeUkpJDvTeGNV5FBEAgBYwhCSAIjCEKIAaMDAELIAAgAUEQakEFEB9FDQEgACoCRCIFjCEJIAAqAkAiCIwhCiAAKgJIIgaMCyEHIAEgBSAAKgL8ASIMlCAAKgLsASINIAeUkiILOAIQIAEgBiAAKgLcASIOlCAMIAqUkiIMOAIUIAEgCCANlCAOIAmUkiINOAIYIA0gDZQgCyALlCAMIAyUkpJDvTeGNV4EQCAAIAFBEGpBBhAfRQ0BIAAqAkQiBYwhCSAAKgJAIgiMIQogACoCSCIGjCEHCyABIAUgACoCgAIiC5QgACoC8AEiDCAHlJIiBTgCECABIAYgACoC4AEiB5QgCyAKlJIiBjgCFCABIAggDJQgByAJlJIiCDgCGCAIIAiUIAUgBZQgBiAGlJKSQ703hjVeBEAgACABQRBqQQcQH0UNAQsDQCABIAAqAkgiBSAAKgJEIgYgACADQQR0aiICKgKwAiAAKgI4kyIHlCAFIAIqAqwCIAAqAjSTIgmUkyIKlCAAKgJAIgggCZQgAioCqAIgACoCMJMiCyAGlJMiDCAIlJMiCTgCFCABIAYgDJQgBSAFIAuUIAcgCJSTIgeUkyIFOAIQIAEgCCAHlCAKIAaUkyIGOAIYAkAgBiAGlCAFIAWUIAkgCZSSkkO9N4Y1XkUNACAAIAFBEGogA0EIahAfDQBBACEDDAILIANBAWoiA0EIRw0ACyABIAAqAkAgACoCVEMAAAA/lCIFlCAAKgIwkjgCACABIAAqAkQgBZQgACoCNJI4AgQgASAAKgJIIAWUIAAqAjiSOAIIQQAhAyAAIAEgAEG4AmoiAiAAQagCaiIjQRAQIEUNACAAIAEgAiAAQdgCaiIkQREQIEUNACAAIAEgAEHIAmoiJiAkQRIQIEUNACAAIAEgJiAjQRMQIEUNACAAIAEgAEHoAmoiJyACQRQQIEUNACAAIAEgJyAAQZgDaiIoQRUQIEUNACAAIAEgIyAoQRYQIEUNACAAIAEgAEH4AmoiKSAkQRcQIEUNACAAIAEgKSAAQYgDaiIqQRgQIEUNACAAIAEgJiAqQRkQIEUNACAAIAEgJyApQRoQIEUNACAAIAEgKiAoQRsQIEUNACABIAAqAjAgACoCQCAAKgJUQwAAAD+UIgWUkzgCACABIAAqAjQgACoCRCAFlJM4AgQgASAAKgI4IAAqAkggBZSTOAIIIAAgASACICNBHBAgRQ0AIAAgASACICRBHRAgRQ0AIAAgASAmICRBHhAgRQ0AIAAgASAmICNBHxAgRQ0AIAAgASAnIAJBIBAgRQ0AIAAgASAnIChBIRAgRQ0AIAAgASAjIChBIhAgRQ0AIAAgASApICRBIxAgRQ0AIAAgASApICpBJBAgRQ0AIAAgASAmICpBJRAgRQ0AIAAgASAnIClBJhAgRQ0AIAAgASAqIChBJxAgIQMLIAFBIGokAAJAIANFDQAgJSgC3ANFBEAgJUH0FzYCBCAlQeUKNgIAQQFBrMcAICUQjgEMAQsCQCAlKgLIAyAlKgJQlCAlKgLAAyAlKgJIlCAlKgLEAyAlKgJMlJKSi0NmZmY/XQRAQQAhJCMAQUBqIgMkACADICVBCGoiAioCwAMiBSACQcgAaiIAKgIAIgYgBiAFlCACKgJAIgYgAioCuAMiB5QgAkHEAGoiIyoCACIIIAIqArwDIgmUkpIiBZSTOAI4IAMgCSAIIAWUkzgCNCADIAcgBiAFlJM4AjAgA0EwahDQAiADKgI4IQcgAyoCNCEIIAIgAioCQCACKgJUQwAAAD+UIgWUIgkgAyoCMCACKgJQIgaUIAIqAjCSIgqSIAIqAogCIguTOALYAyACICMqAgAgBZQiDCAIIAaUIAIqAjSSIgiSIAIqAowCIg2TOALcAyACIAcgBpQgAioCOJIiBiAAKgIAIAWUIgWTIAIqApACIgeTOALwAyACIAggDJMgDZM4AuwDIAIgCiAJkyALkzgC6AMgAiAFIAaSIAeTOALgAyACKgLoASEFIAIqAtgBIQYgAyACKgL4ATgCKCADIAU4AiQgAyAGOAIgIAMgAioCmAI4AiwCQCACQdgDaiIAIAJB6ANqIiMgA0EgahCDAUUNACACKgLcASEFIAIqAuwBIQYgAyACKgL8ATgCKCADIAY4AiQgAyAFOAIgIAMgAioCnAI4AiwgACAjIANBIGoQgwFFDQAgAioC4AEhBSACKgLwASEGIAMgAioCgAI4AiggAyAGOAIkIAMgBTgCICADIAIqAqACOAIsIAAgIyADQSBqEIMBRQ0AIAIqAtgBIQUgAioC6AEhBiADIAIqAvgBjDgCKCADIAaMOAIkIAMgBYw4AiAgAyACKgKYAjgCLCAAICMgA0EgahCDAUUNACACKgLcASEFIAIqAuwBIQYgAyACKgL8AYw4AiggAyAGjDgCJCADIAWMOAIgIAMgAioCnAI4AiwgACAjIANBIGoQgwFFDQAgAioC4AEhBSACKgLwASEGIAMgAioCgAKMOAIoIAMgBow4AiQgAyAFjDgCICADIAIqAqACOAIsIAAgIyADQSBqEIMBRQ0AIAIgAioCzAMiBiACKgLgAyIHIAIqAsADIgiUIAIqAtgDIgkgAioCuAMiCpQgAioC3AMiCyACKgK8AyIMlJKSkiIFOAL4AyACIAYgCCACKgLwAyINlCAKIAIqAugDIgiUIAwgAioC7AMiCpSSkpIiBjgC/AMgBUMAAAAAXQRAIAJBADYC+ANDAAAAACEFCyAGQwAAAABdBEAgAkEANgL8AwsgAiAJIAIqAogCIgaSOALYAyACIAIqAowCIgkgC5I4AtwDIAIgAioCkAIiCyANkjgC8AMgAiAJIAqSOALsAyACIAggBpI4AugDIAIgCyAHkjgC4AMgAigCkAQiIyEmIAIoAogEIiQhJyACKAKUBCIAIQEgACACLwGMBCIoTwRAIANB/yM2AhQgA0HXzQA2AhBBAUGfygAgA0EQahCOASACKAKQBCEmIAIoAogEIScgAi8BjAQhKCACKgL4AyEFIAIoApQEIQELICQgACAjbGoiACAFOAIgIAAgAioCuAMiBTgCECAAQRRqIiQgAioCvAMiBjgCACAAQRhqIiogAioCwAMiBzgCACAAIAIqAtgDOAIAIAAgAioC3AM4AgQgACACKgLgAzgCCCAAIAIoAoQEIik2AiQgAigCgAQhIyAqIAeMOAIAICQgBow4AgAgACAFjDgCECAAICM2AihBASEkIAIgAUEBaiIANgKUBCAAIQEgACAoTwRAIANB/yM2AgQgA0HXzQA2AgBBAUGfygAgAxCOASACKAKABCEjIAIoAoQEISkgAigClAQhAQsgJyAAICZsaiIAIAIqAvwDOAIgIAAgAioCuAMiBTgCECAAQRRqIiYgAioCvAMiBjgCACAAQRhqIicgAioCwAMiBzgCACAAIAIqAugDOAIAIAAgAioC7AM4AgQgAioC8AMhCCAAICM2AiggACApNgIkIAAgCDgCCCAnIAeMOAIAICYgBow4AgAgACAFjDgCECACIAFBAWo2ApQECyADQUBrJAAgJA0BDAILQQAhAiMAQYAGayIAJAAgJUEIaiIBKgJUQwAAAD+UIQUgASoCMCEGAn0gASoCSCIHIAEqAsADlCABKgJAIgggASoCuAOUIAEqAkQiCSABKgK8A5SSkkMAAAAAXgRAIAkgBZQgASoCNJIhDCAIIAWUIAaSIQ1DAACAvyEeIAcgBZQgASoCOJIMAQsgASoCNCAJIAWUkyEMIAYgCCAFlJMhDUMAAIA/IR4gASoCOCAHIAWUkwshFCABQdgBaiAAQcAFahAhIAAgACoCyAUgASoCwAMiBZQgACoCwAUgASoCuAMiBpQgACoCxAUgASoCvAMiB5SSkiIIOALwBSAAIAUgACoC2AWUIAYgACoC0AWUIAcgACoC1AWUkpIiCTgC9AUgACAFIAAqAugFlCAGIAAqAuAFlCAHIAAqAuQFlJKSIgU4AvgFIAWLIQUCfyAJiyIGIAiLIgdeBEAgBSAHXQRAQQEhAkECDAILQQFBAiAFIAZdIgMbIQJBAkEBIAMbIQRBAAwBCyAFIAZdBEBBASEEQQIMAQsgBSAHXSICQQF0IQQgAkEBc0EBdCECQQELISQgAUHYAWoiAyACQQJ0IgJqIiMqAiAhCyAjKgIAIRUgIyoCECEXIAFBmAJqIiMgAmoqAgAhCCABKgKQAiEYIAEqAowCIRkgAEHwBWogAnIqAgAhCSABKgKIAiEaQQAhAiAAQQA2ApgDIABBADYCqAMgAEEANgK4AyAAQQA2AsgDIABBADYCmAEgAEEANgKoASAAQQA2ArgBIABBADYCiAMgAEIANwOAAyAAQgA3A5ADIABCADcDoAMgAEIANwOwAyAAQgA3A8ADIABBADYCiAEgAEIANwOAASAAQgA3A5ABIABCADcDoAEgAEIANwOwASAAQQA2AsgBIABBADYC2AMgAEEANgLYASAAQQA2AugDIABBADYC6AEgAEEANgL4AyAAQQA2AvgBIABBADYCiAQgAEEANgKIAiAAQgA3A8ABIABCADcD0AMgAEIANwPQASAAQgA3A+ADIABCADcD4AEgAEIANwPwAyAAQgA3A/ABIABCADcDgAQgAEIANwOAAiAAQQA2ApgEIABBADYCmAIgAEEANgKoBCAAQQA2AqgCIABBADYCuAQgAEEANgK4AiAAQQA2AsgEIABBADYCyAIgAEEANgLYBCAAQgA3A5AEIABCADcDkAIgAEIANwOgBCAAQgA3A6ACIABCADcDsAQgAEIANwOwAiAAQgA3A8AEIABCADcDwAIgAEIANwPQBCAAQQA2AtgCIABBADYC6AQgAEEANgLoAiAAQQA2AvgEIABBADYC+AIgAEIANwPQAiAAQgA3A+AEIABCADcD4AIgAEIANwPwBCAAQgA3A/ACIAMgJEECdCImaiIkKgIgIQ4gAyAEQQJ0IgRqIgMqAiAhDyAkKgIAIRAgAyoCACERICMgJmoqAgAhBSAkKgIQIQogBCAjaioCACEGIAMqAhAhEiABIABB0ABqECEgACAAKgJ4IgcgBSAOlCITIAYgD5QiDyAYIAsgCIwgCCAJQwAAAABeGyIJlJIiFpIiH5IgFJMiGJQgACoCcCIIIAUgEJQiGyAGIBGUIhEgGiAJIBWUkiIckiIgkiANkyIalCAFIAqUIh0gBiASlCISIBkgCSAXlJIiIZIiIpIgDJMiFyAAKgJ0IgaUkpI4ArgFIAAgACoCaCIJIBiUIAAqAmAiCyAalCAXIAAqAmQiFZSSkjgCtAUgACAHIBMgFiAPkyIWkiAUkyIZlCAIIBsgHCARkyITkiANkyIPlCAGIB0gISASkyIbkiAMkyIRlJKSOAKoBSAAIAkgGZQgCyAPlCARIBWUkpI4AqQFIAAgByAOIAWMIgWUIhwgFpIgFJMiEpQgCCAFIBCUIhYgE5IgDZMiE5QgBiAFIAqUIh0gG5IgDJMiCpSSkjgCmAUgACAJIBKUIAsgE5QgCiAVlJKSOAKUBSAAIAAqAlgiBSAYlCAAKgJQIg4gGpQgFyAAKgJUIhCUkpI4ArAFIAAgBSAZlCAOIA+UIBEgEJSSkjgCoAUgACAFIBKUIA4gE5QgCiAQlJKSOAKQBSAAIAcgHCAfkiAUkyIKlCAIIBYgIJIgDZMiB5QgBiAdICKSIAyTIgiUkpI4AogFIAAgCSAKlCALIAeUIAggFZSSkjgChAUgACAFIAqUIA4gB5QgCCAQlJKSOAKABSAAQQA2AkwgAEEANgJIIABBADYCPCAAIB44AjggAEIANwMwIABBgAVqQQQgAEGAA2ogAEHMAGogAEEwahB0A0AgACABIAJBBHRqIgMqAlg4AjAgACADKgJcOAI0IAAgAyoCYDgCOCAAIAEqAlA4AjwCQCACQQFxRQRAIABBgANqIAAoAkwgAEGAAWogAEHIAGogAEEwahB0DAELIABBgAFqIAAoAkggAEGAA2ogAEHMAGogAEEwahB0CyAAKAJMQRFPBEAgAEH0FzYCJCAAQcgWNgIgQQFByj0gAEEgahCOAQsgACgCSEERTwRAIABB9Bc2AhQgAEHIFjYCEEEBQe48IABBEGoQjgELIAJBAWoiAkEIRw0ACyAAKAJMIiNBAEoEQEEAIQMDQCABKgLQAyAUIAEqAiggAEGAA2ogA0EEdGoiAioCCCIFlCABKgIgIAIqAgAiBpQgAioCBCIHIAEqAiSUkpKSIgggASoCOJMgASoCwAOUIA0gASoCCCAFlCABKgIAIAaUIAEqAgQgB5SSkpIiCSABKgIwkyABKgK4A5QgDCABKgIYIAWUIAEqAhAgBpQgByABKgIUlJKSkiIFIAEqAjSTIAEqArwDlJKSkyIGQwAAAABeBEAgASgCkAQhBCABKAKIBCEmIAEoApQEIgIhJCACIAEvAYwETwRAIABB/yM2AgQgAEHXzQA2AgBBAUGfygAgABCOASABKAKUBCEkIAAoAkwhIwsgJiACIARsaiICIAY4AiAgAiABKgK4AyIGOAIQIAJBFGoiBCABKgK8AyIHOAIAIAEqAsADIQsgAiAIOAIIIAIgBTgCBCACIAk4AgAgAiABKAKEBDYCJCABKAKABCEmIAIgC4w4AhggBCAHjDgCACACIAaMOAIQIAIgJjYCKCABICRBAWo2ApQECyADQQFqIgMgI0gNAAsLIABBgAZqJAALICUoApwEIQQLICVBoARqJAAgBAuqFAMEfxV9AXwjAEGgA2siBSQAIARBM0wEQCAFQeQaNgLUASAFQYAoNgLQAUEBQd3JACAFQdABahCOAQsgAkH//wNxIgZFBEAgBUHkGjYCxAEgBUGAKDYCwAFBAUHGxAAgBUHAAWoQjgELIAAgBUGcA2ogBUGYA2oQjAEgACgCGCECIAEgBUGAA2oQ1wIgBSAFKgKAAyITOALwAiAFIAUqAoQDIhQ4AvQCIAVBADYC/AIgBSAFKgKIAyIVOAL4AiAFIBUgBSoCjAMiCZQ4AugCIAUgCSAUlDgC5AIgBSATIAmUOALgAiAFQQA2AuwCIAAoAhgiByoCOCIJIAmUIAcqAhgiCiAKlCAHKgIoIgsgC5SSkpG7Ih5EHqfoSC7/7z9mRQRAIAVB5Bo2ArQBIAVBgCg2ArABQQFB5MEAIAVBsAFqEI4BCyAeRHGsi9toAPA/ZUUEQCAFQeQaNgKkASAFQYAoNgKgAUEBQZbEACAFQaABahCOAQsgBSAKIAUqApgDQwAAAD+UIgyUIg0gAioCACIRkiISOALQAiAFIAsgDJQiDyACKgIEIheSIhA4AtQCIAIqAgghDkEAIQIgBUEANgLcAiAFIA4gCSAMlCIYkiIMOALYAiAFQQA2AswCIAUgDiAYkyIOOALIAiAFIBcgD5MiDzgCxAIgBSARIA2TIg04AsACIAVBADYCvAIgBSAJOAK4AiAFIAs4ArQCIAUgCjgCsAIgBUEANgKsAiAFIAmMIhE4AqgCIAUgC4wiFzgCpAIgBSAKjCIYOAKgAgJ/IBUgCZQgEyAKlCAUIAuUkpKLu0QrhxbZzvfvP2YEQCAFKgKIAyIZIAyUIAUqAoADIhYgEpQgBSoChAMiGyAQlJKSIAUqAowDIhySIh1DAAAAAF8EQCAJIApDAAAAAJQiDiALQwAAAACUIg2SkoshDwJ9IAlDAAAAAJQiFiAKIA2SkosiGSAWIA4gC5KSiyIWXwRAQwAAAAAhDUMAAIA/IA8gGWANARoLQwAAgD9DAAAAACAWIBlfRSAPIBZgRXIiAhshDUMAAAAAQwAAgD8gAhshGkMAAAAACyEOIAogGpQgDiAXlJIhDyAJIA6UIA0gGJSSIRcgCyANlCAaIBGUkiEYIA0gBSoCnAMiCZQhCiAaIAmUIQsgDiAJlCEOIAZFBEAgBUH/IzYClAEgBUHXzQA2ApABQQFBn8oAIAVBkAFqEI4BCyAPIAmUIQ0gCSAXlCERIBggCZQhDyADIAA2AiggAyABNgIkIAMgEzgCECADIAwgCpI4AgggAyAQIAuSOAIEIAMgEiAOkjgCACADIB2LIgk4AiAgAyAVOAIYIAMgFDgCFCAGQQFNBEAgBUH/IzYChAEgBUHXzQA2AoABQQFBn8oAIAVBgAFqEI4BCyADIARqIgIgADYCKCACIAE2AiQgAiAMIA2SOAIIIAIgECARkjgCBCACIBIgD5I4AgAgAiAJOAIgIAIgEzgCECACIBU4AhggAiAUOAIUIAZBAk0EQCAFQf8jNgJ0IAVB180ANgJwQQFBn8oAIAVB8ABqEI4BCyADIARBAXRqIgIgADYCKCACIAE2AiQgAiAMIAqTOAIIIAIgECALkzgCBCACIBIgDpM4AgAgAiAJOAIgIAIgEzgCECACIBU4AhggAiAUOAIUIAZBA00EQCAFQf8jNgJkIAVB180ANgJgQQFBn8oAIAVB4ABqEI4BCyADIARBA2xqIgMgADYCKCADIAE2AiQgAyAMIA2TOAIIIAMgECARkzgCBCADIBIgD5M4AgAgAyAJOAIgIAMgEzgCECADIBU4AhggAyAUOAIUQQQMAgtDAAAAACEMQQAgHCAZIA6UIBYgDZQgGyAPlJKSkiIaQwAAAABfRQ0BGiAJIApDAAAAAJQiEiALQwAAAACUIhCSkoshGQJ9IAlDAAAAAJQiGyAKIBCSkosiFiAbIBIgC5KSiyIbXwRAQwAAAAAhEEMAAIA/IBYgGV8NARoLQwAAgD9DAAAAACAWIBtgRSAZIBtgRXIiAhshEEMAAAAAQwAAgD8gAhshDEMAAAAACyESIAogDJQgEiAXlJIhFyAJIBKUIBAgGJSSIRggCyAQlCAMIBGUkiERIBAgBSoCnAMiCZQhCiAMIAmUIQsgEiAJlCEMIAZFBEAgBUH/IzYCVCAFQdfNADYCUEEBQZ/KACAFQdAAahCOAQsgFyAJlCESIAkgGJQhECARIAmUIREgAyABNgIoIAMgADYCJCADIBM4AhAgAyAOIAqSOAIIIAMgDyALkjgCBCADIA0gDJI4AgAgAyAaiyIJOAIgIAMgFTgCGCADIBQ4AhQgBkEBTQRAIAVB/yM2AkQgBUHXzQA2AkBBAUGfygAgBUFAaxCOAQsgAyAEaiICIAE2AiggAiAANgIkIAIgDiASkjgCCCACIA8gEJI4AgQgAiANIBGSOAIAIAIgCTgCICACIBM4AhAgAiAVOAIYIAIgFDgCFCAGQQJNBEAgBUH/IzYCNCAFQdfNADYCMEEBQZ/KACAFQTBqEI4BCyADIARBAXRqIgIgATYCKCACIAA2AiQgAiAOIAqTOAIIIAIgDyALkzgCBCACIA0gDJM4AgAgAiAJOAIgIAIgEzgCECACIBU4AhggAiAUOAIUIAZBA00EQCAFQf8jNgIkIAVB180ANgIgQQFBn8oAIAVBIGoQjgELIAMgBEEDbGoiAyABNgIoIAMgADYCJCADIA4gEpM4AgggAyAPIBCTOAIEIAMgDSARkzgCACADIAk4AiAgAyATOAIQIAMgFTgCGCADIBQ4AhRBBAwBCyAFQdACaiAFQbACaiAFQeACaiAFQfACaiAFKgKcAyAFQZACaiAFQYACaiAFQdwBahAkIQcgBUHAAmogBUGgAmogBUHgAmogBUHwAmogBSoCnAMgBUHwAWogBUHgAWogBUHYAWoQJCEIIAcEQCAGRQRAIAVB/yM2AhQgBUHXzQA2AhBBAUGfygAgBUEQahCOAQsgBSoCgAIhCiAFKgKEAiELIAUqApwDIQkgBSoCiAIhESADIAE2AiggAyAANgIkIAMgEzgCECADIBU4AhggAyAUOAIUIAMgESAJlCAMkjgCCCADIAsgCZQgEJI4AgQgAyASIAogCZSSOAIAIAMgBSoC3AEgFSARlCATIAqUIBQgC5SSkpSLOAIgQQEhAgsgAiAIRQ0AGiACIAZPBEAgBUH/IzYCBCAFQdfNADYCAEEBQZ/KACAFEI4BCyAFKgLgASEKIAUqAuQBIQsgBSoCnAMhCSAFKgLoASEMIAMgAiAEbGoiAyABNgIoIAMgADYCJCADIAwgCZQgDpI4AgggAyALIAmUIA+SOAIEIAMgDSAKIAmUkjgCACADIBM4AhAgAyAVOAIYIAMgFDgCFCADIAUqAtgBIBUgDJQgEyAKlCAUIAuUkpKUizgCICACQQFqCyECIAVBoANqJAAgAgvpAwIPfQJ/IwBBEGsiFyQAAkAgASoCCCIIIAMqAggiCZQgASoCACIKIAMqAgAiDJQgASoCBCINIAMqAgQiD5SSkiILQ/7/fz9gDQAgACoCCCEQIAAqAgAhDiAAKgIEIREgAioCCCETIAIqAgAhFCACKgIEIRUgFyAKIA+UIAwgDZSTOAIIIBcgCCAMlCAJIAqUkzgCBCAXIA0gCZQgDyAIlJM4AgAgFxDQAiAFIBcqAggiEiAAKgIIQwAAgD9DAACAPyALIAuUk5UiFiAIIBCUIAogDpQgDSARlJKSIg4gCyAJIBOUIAwgFJQgDyAVlJKSIhGUk5QiECAIlCAJIBYgESALIA6Uk5QiC5SSIg6TlCAXKgIAIgggACoCACAQIAqUIAwgC5SSIgyTlCAAKgIEIBAgDZQgDyALlJIiDZMgFyoCBCIJlJKSIBIgEpQgCCAIlCAJIAmUkpKVIgogEpQgDpI4AgggBSAKIAmUIA2SOAIEIAUgCiAIlCAMkiIIOAIAIAYgCCAAKgIAkyIIOAIAIAYgBSoCBCAAKgIEkyIJOAIEIAYgBSoCCCAAKgIIkyIKOAIIIAogCpQgCCAIlCAJIAmUkpKRIgggBGANACAHIAQgCJM4AgAgBhDQAkEBIRgLIBdBEGokACAYC8IgAhp9An8jAEHAAWsiBCQAIAAgBEGwAWoQOCAAEDciHyoCKCEbIB8qAhghHCAfKgIIIR0gABA2Ih8qAgAhEyAfKgIEIRQgHyoCCCEVIAAgBEGsAWogBEGoAWoQjAEgARDzAiERIAEQNxogARA2Ih8qAggiFyAVkyEJIB8qAgQiGCAUkyELIB8qAgAiGSATkyEHQwAAgD8hBSAEKgK8ASIMIAyUIAQqArgBIg0gDZQgBCoCsAEiDiAOlCAEKgK0ASIPIA+UkpKSIhBDAAAAAF4EQCAMjCAQlSEGIA2MIBCVIQogD4wgEJUhCCAOIBCVIQULIAYgByAFlCAJIAqUkiALIAaUkyIQlCAFIAsgBZQgByAGlJIgCSAIlJMiFpQgCiAJIAaUIAcgCJQgCyAKlJKSIhqUkpIgCCAJIAWUIAsgCJSSIAcgCpSTIgeUkyELIAogB5QgBSAQlCAIIBqUkpIgBiAWlJMhCSAEKgKoASIeQwAAAL+UIhIgCCAWlCAFIAeUIAYgGpSSkiAKIBCUkyIFkyEIAkACQAJAIAUgHkMAAAA/lCIGkyIKQwAAAABfRQ0AIAhDAAAAAF9FDQBBACEfIAUgBZMiByAHlCAJIAmUIAsgC5SSkpEiECARIAQqAqwBIgeSX0UNAgJAIAmLIAdfRQ0AIAuLIAdfRQ0AQwAAAAAhBSAAEDMhHyABEDMhIEMAAAAAIQdDAAAAACEMQwAAAAAhDSAfBEAgHxCaAiIfKgIIIQcgHyoCACENIB8qAgQhDAtDAAAAACEOQwAAAAAhDyAgBEAgIBCaAiIfKgIIIQUgHyoCACEPIB8qAgQhDgsgBCAFIAeTOAKIASAEIA4gDJM4AoQBIAQgDyANkzgCgAEgBEGAAWoQ0AIgBCAbOAJ4IAQgHDgCdCAEIB04AnAgBEHwAGoQ0AIgBCoCuAEhBSAEKgKwASEHAn0gBCoCiAEgBCoCeJQgBCoCgAEgBCoCcJQgBCoChAEgBCoCdJSSkkMAAAAAXQRAIAQgBCoCtAEiDCAMIAdDAAAAAJQiECAEKgK8ASIIQwAAAACUkpIiDZQgByAFQwAAAICUIAxDAAAAAJQiDyAHk5IiDpQgCCAPIAVDAAAAAJSSIAiTIg+UkpIgBSAIQwAAAICUIBAgBZOSIhCUkzgCmAEgBCAIIBCUIAcgDZQgBSAPlJKSIAwgDpSTOAKUASAEIAUgDpQgByAQlCAMIA+UkpIgCCANlJM4ApABIARBkAFqENACIAQqArQBIgUgCyAEKgKwASIIlCAJIAQqArwBIgeUkiAGIAWUkyINlCAIIAYgCJQgCyAFlJIgCSAEKgK4ASIMlJMiDpQgByAGIAeUIAkgBZQgCyAMlJKSIg+UkpIhECAMIAkgCJQgBiAMlJIgCyAHlJMiBpQhCSAHIAaUIAggDZQgDCAPlJKSIQsgBSAOlCEWIAwgDpQgCCAGlCAFIA+UkpIhBSAHIA2UIQYgESAKkyEHIAJB//8DcUUEQCAEQf8jNgIUIARB180ANgIQQQFBn8oAIARBEGoQjgELIBAgCZMhCCALIBaTIQogAyAHOAIgIAMgBCoCkAE4AhAgBSAGkwwBCyAEIAQqArQBIgYgB0MAAAAAlCIPIAQqArwBIgpDAAAAAJSSIAaTIgyUIAcgBUMAAACAlCAHIAZDAAAAAJQiDpKSIg2UIAogCiAOIAVDAAAAAJSSkiIOlJKSIAUgCkMAAACAlCAPIAWSkiIPlJM4ApgBIAQgCiAPlCAHIAyUIAUgDpSSkiAGIA2UkzgClAEgBCAFIA2UIAcgD5QgBiAOlJKSIAogDJSTOAKQASAEQZABahDQAiAEKgK0ASIFIAsgBCoCsAEiCpQgCSAEKgK8ASIGlJIgEiAFlJMiDJQgCiASIAqUIAsgBZSSIAkgBCoCuAEiB5STIg2UIAYgEiAGlCAJIAWUIAsgB5SSkiIOlJKSIQ8gByAJIAqUIBIgB5SSIAsgBpSTIgmUIQsgBiAJlCAKIAyUIAcgDpSSkiEQIAUgDZQhFiAHIA2UIAogCZQgBSAOlJKSIQUgBiAMlCEGIBEgCJMhCSACQf//A3FFBEAgBEH/IzYCJCAEQdfNADYCIEEBQZ/KACAEQSBqEI4BCyAPIAuTIQggECAWkyEKIAMgCTgCICADIAQqApABOAIQIAUgBpMLIQYgAyAEKgKUATgCFCAEKgKYASEFIAMgATYCKCADIAA2AiQgAyAVIAiSOAIIIAMgFCAKkjgCBCADIBMgBpI4AgAgAyAFOAIYDAILIAQgFSAPIA5DAAAAAJQiCSAMQwAAAACUkiAFIA+UkyIIlCAOIA1DAAAAgJQgBSAOlCAPQwAAAACUIgaSkiIKlCAMIAUgDJQgBiANQwAAAACUkpIiBpSSkiANIAxDAAAAgJQgCSANIAWUkpIiBZSTkiIJOAKYASAEIBcgCZM4AogBIAQgFCAMIAWUIA4gCJQgDSAGlJKSIA8gCpSTkiIJOAKUASAEIBggCZM4AoQBIAQgEyANIAqUIA4gBZQgDyAGlJKSIAwgCJSTkiIFOAKQASAEIBkgBZM4AoABIARBgAFqENACIBEgBCoCrAEiBZIgEJMhCSAFIBGTIBCTIgUgBCoCiAEiCJRDAAAAP5QgF5IhCyAEKgKEASIKIAWUQwAAAD+UIBiSIQcgBCoCgAEiBiAFlEMAAAA/lCAZkiEFIAJB//8DcUUEQCAEQf8jNgIEIARB180ANgIAQQFBn8oAIAQQjgEgBCoCiAEhCCAEKgKEASEKIAQqAoABIQYLIAMgATYCKCADIAA2AiQgAyALOAIIIAMgBzgCBCADIAU4AgAgAyAJOAIgIAMgCIw4AhggAyAKjDgCFCADIAaMOAIQDAELIApDAAAAAF4EQEEAIR8gCiARXUUNAiAEKgKsASAFIAWTIgggCJQgCSAJlCALIAuUkpKRXgRAIAQgDyAPIA5DAAAAAJQiECAMQwAAAACUkpIiBZQgDiANQwAAAICUIA9DAAAAAJQiByAOk5IiCJQgDCAHIA1DAAAAAJSSIAyTIgeUkpIgDSAMQwAAAICUIBAgDZOSIhCUkzgCmAEgBCAMIBCUIA4gBZQgDSAHlJKSIA8gCJSTOAKUASAEIA0gCJQgDiAQlCAPIAeUkpIgDCAFlJM4ApABIARBkAFqENACIBUgBCoCtAEiBSALIAQqArABIgiUIAkgBCoCvAEiB5SSIAYgBZSTIg2UIAggBiAIlCALIAWUkiAJIAQqArgBIgyUkyIOlCAHIAYgB5QgCSAFlCALIAyUkpIiD5SSkiAMIAkgCJQgBiAMlJIgCyAHlJMiBpSTkiEJIBQgByAGlCAIIA2UIAwgD5SSkiAFIA6Uk5IhCyATIAwgDpQgCCAGlCAFIA+UkpIgByANlJOSIQUgESAKkyEIIAJB//8DcUUEQCAEQf8jNgI0IARB180ANgIwQQFBn8oAIARBMGoQjgELIAMgCDgCICADIAQqApABOAIQIAMgBCoClAE4AhQgBCoCmAEhCCADIAE2AiggAyAANgIkIAMgCTgCCCADIAs4AgQgAyAFOAIAIAMgCDgCGAwCCyAEQQA2ApgBIAQgCTgCkAEgBCALOAKUASAEQZABahDQAiAEKgKYASAEKgKsASIIlCAGkiIKIAWTIgUgBZQgBCoCkAEgCJRDAAAAAJIiBSAJkyIGIAaUIAQqApQBIAiUQwAAAACSIgggC5MiBiAGlJKSkSIMIBFdRQ0CIAQgFSAEKgK0ASIGIAggBCoCsAEiCZQgBSAEKgK8ASILlJIgCiAGlJMiDZQgCSAKIAmUIAggBpSSIAUgBCoCuAEiB5STIg6UIAsgCiALlCAFIAaUIAggB5SSkiIPlJKSIAcgBSAJlCAKIAeUkiAIIAuUkyIFlJOSIgggF5M4AogBIAQgFCALIAWUIAkgDZQgByAPlJKSIAYgDpSTkiIKIBiTOAKEASAEIBMgByAOlCAJIAWUIAYgD5SSkiALIA2Uk5IiBSAZkzgCgAEgESAMkyEGIARBgAFqENACIAJB//8DcUUEQCAEQf8jNgJEIARB180ANgJAQQFBn8oAIARBQGsQjgELIAMgBjgCICADIAQqAoABOAIQIAMgBCoChAE4AhQgBCoCiAEhBiADIAE2AiggAyAANgIkIAMgCDgCCCADIAo4AgQgAyAFOAIAIAMgBjgCGAwBC0EAIR8gBSASXUUNASAIIBFdRQ0BIAQqAqwBIAUgBZMiCiAKlCAJIAmUIAsgC5SSkpFeBEAgBCAPIA5DAAAAAJQiByAMQwAAAACUkiAPkyIFlCAOIA1DAAAAgJQgDiAPQwAAAACUIgaSkiIKlCAMIAwgBiANQwAAAACUkpIiBpSSkiANIAxDAAAAgJQgByANkpIiB5STOAKYASAEIAwgB5QgDiAFlCANIAaUkpIgDyAKlJM4ApQBIAQgDSAKlCAOIAeUIA8gBpSSkiAMIAWUkzgCkAEgBEGQAWoQ0AIgFSAEKgK0ASIFIAsgBCoCsAEiCpQgCSAEKgK8ASIGlJIgEiAFlJMiDJQgCiASIAqUIAsgBZSSIAkgBCoCuAEiB5STIg2UIAYgEiAGlCAJIAWUIAsgB5SSkiIOlJKSIAcgCSAKlCASIAeUkiALIAaUkyIJlJOSIQsgFCAGIAmUIAogDJQgByAOlJKSIAUgDZSTkiEPIBMgByANlCAKIAmUIAUgDpSSkiAGIAyUk5IhBSARIAiTIQggAkH//wNxRQRAIARB/yM2AlQgBEHXzQA2AlBBAUGfygAgBEHQAGoQjgELIAMgCDgCICADIAQqApABOAIQIAMgBCoClAE4AhQgBCoCmAEhCCADIAE2AiggAyAANgIkIAMgCzgCCCADIA84AgQgAyAFOAIAIAMgCDgCGAwBCyAEQQA2ApgBIAQgCTgCkAEgBCALOAKUASAEQZABahDQAiAEKgKYASAEKgKsASIIlCASkiIKIAWTIgUgBZQgBCoCkAEgCJRDAAAAAJIiBSAJkyIGIAaUIAQqApQBIAiUQwAAAACSIgggC5MiBiAGlJKSkSIMIBFdRQ0BIAQgFSAEKgK0ASIGIAggBCoCsAEiCZQgBSAEKgK8ASILlJIgCiAGlJMiDZQgCSAKIAmUIAggBpSSIAUgBCoCuAEiB5STIg6UIAsgCiALlCAFIAaUIAggB5SSkiIPlJKSIAcgBSAJlCAKIAeUkiAIIAuUkyIFlJOSIgggF5M4AogBIAQgFCALIAWUIAkgDZQgByAPlJKSIAYgDpSTkiIKIBiTOAKEASAEIBMgByAOlCAJIAWUIAYgD5SSkiALIA2Uk5IiBSAZkzgCgAEgESAMkyEGIARBgAFqENACIAJB//8DcUUEQCAEQf8jNgJkIARB180ANgJgQQFBn8oAIARB4ABqEI4BCyADIAY4AiAgAyAEKgKAATgCECADIAQqAoQBOAIUIAQqAogBIQYgAyABNgIoIAMgADYCJCADIAg4AgggAyAKOAIEIAMgBTgCACADIAY4AhgLQQEhHwsgBEHAAWokACAfC6EEAQl9An8CQCAEKgIIIgcgB5QgBCoCACIIIAiUIAQqAgQiCiAKlJKSkSIJQ6zFJzddDQAgBCAHIAmVIgc4AgggBCAKIAmVIgo4AgQgBCAIIAmVIgg4AgAgACoCdEMAAAA/lCELIAAqAmggB5QgACoCYCAIlCAAKgJkIAqUkpIiCYtDAACAP14EfSALiwUgACoCcEMAAIA/IAkgCZSTkZQgCSALlIuSCyEMQQAgAyoCCCAAKgJYIg2TIAeUIAMqAgAgACoCUCIOkyAIlCAKIAMqAgQgACoCVCIPk5SSkiIJIAIqAgggDZMgB5QgAioCACAOkyAIlCAKIAIqAgQgD5OUkpIiCyABKgIIIA2TIAeUIAEqAgAgDpMgCJQgCiABKgIEIA+TlJKSIgdDAACAfyAHQwAAgH9dGyIIIAggC14bIgggCCAJXhsiCCAJIAsgB0MAAID/IAdDAACA/14bIgcgByALXRsiByAHIAldGyIHkkMAAAA/lCIKiyIJIAwgByAIk0MAAAA/lJIiB14NARogCSAHk4wiByAAKgLoAl1FDQAgACAMOALwAiAAIAo4AuwCIAAgBzgC6AIgACAEKgIAIgg4AvgCIAAgBCoCBCIJOAL8AiAEKgIIIQcgACAFNgL0AiAAIAc4AoADIApDAAAAAF1FDQAgBg0AIAAgB4w4AoADIAAgCYw4AvwCIAAgCIw4AvgCIAAgCow4AuwCC0EBCwvVAgIBfw19IwBBIGsiCSQAIAkgByoCACAGKgIAkzgCECAJIAcqAgQgBioCBJM4AhQgCSAHKgIIIAYqAgiTOAIYIAlBEGoQ0AJBASEHIAkqAhgiDiAFKgIIIgqUIAkqAhAiDyAFKgIAIguUIAkqAhQiECAFKgIEIhGUkpIiDItDrMUnN11FBEAgCSAEKgIEIg0gBioCBCISIBAgBCoCCCITIAYqAggiFJMgCpQgBCoCACIVIAYqAgAiFpMgC5QgESANIBKTlJKSIg2UIAyVkpMiEiAKlCARIBMgFCAOIA2UIAyVkpMiE5STIhQgEJQgDyATIAuUIAogFSAWIA8gDZQgDJWSkyIMlJMiCpSTOAIIIAkgDCARlCALIBKUkyILIA+UIA4gFJSTOAIEIAkgCiAOlCAQIAuUkzgCACAAIAEgAiADIAkgCEEAECYhBwsgCUEgaiQAIAcL2TgDD38VfQJ+IwBB8AVrIgkkACAJIgYgBDYC5AUgBiACNgLgBSAGIAE2AtgFIAYgADYC1AUgBkEANgLoBSAGIAM2AtwFIAZBjAJqIgAgACgCyAMQNyIBKgIAOAIAIAAgASoCBDgCBCAAIAEqAgg4AgggACABKgIQOAIQIAAgASoCFDgCFCAAIAEqAhg4AhggACABKgIgOAIgIAAgASoCJDgCJCAAIAEqAig4AiggACgCyAMgAEEwahA4IAAgACgCyAMQNiIBKgIAOAJQIAAgASoCBDgCVCAAIAEqAgg4AlggACAAKgIIOAJgIAAgACoCGDgCZCAAIAAqAig4AmggACgCyAMgAEHwAGogAEH0AGoQjAEgACAAKALMAxA3IgEqAgA4ApgCIAAgASoCBDgCnAIgACABKgIIOAKgAiAAIAEqAhA4AqgCIAAgASoCFDgCrAIgACABKgIYOAKwAiAAIAEqAiA4ArgCIAAgASoCJDgCvAIgACABKgIoOALAAiAAKALMAyAAQfgBahA4IAAgACgCzAMQNiIBKgIAOALIAiAAIAEqAgQ4AswCIAEqAgghHiAAQQA2AvABIABC34ay+9vi++E+NwLoASAAQQA2AuABIABCm96P9tvroLY/NwLYASAAQQA2AtABIABCi96P9pPsoLY/NwLIASAAQQA2AsABIABC3Yay+9Pj++E+NwK4ASAAQQA2ArABIABC4Iay+4Pi++G+fzcCqAEgAEEANgKgASAAQpjej/bj66C2v383ApgBIABBADYCkAEgAEKV3o/26+ugtr9/NwKIASAAQQA2AoABIABC3oay++vi++G+fzcCeCAAIB44AtACIABB2AJqQQQQhgIgAEEANgLsAiAGKgLkAiEfIAYpAtwCISkgBioCjAIhICAGKgL8AiEeIAYqAoADISEgBioCnAIhIiAGKgKsAiEjIAYqApACISQgBioCoAIhJSAGKgKwAiEmIAYqApQCIScgBioCpAIhKCAGIAYqArQCOAKIAiAGICg4AoQCIAYgJzgCgAIgBiAmOAL8ASAGICU4AvgBIAYgJDgC9AEgBiAjOALwASAGICI4AuwBIAYgIUMAAAA/lDgC5AEgBiAeOALgASAGICA4AugBIAYgHjgC3AEgBiAfOALYASAGICk3AtABIAYgBioCpAQ4ApABIAYgBioCqAQ4AqABIAYgBioCrAQ4ArABIAYgBioCtAQ4ApQBIAYgBioCuAQ4AqQBIAYgBioCvAQ4ArQBIAYgBioCxAQ4ApgBIAYgBioCyAQ4AqgBIAYgBioCzAQ4ArgBIAYgBioC1AQ4AsABIAYgBioC2AQ4AsQBIAYgBioC3AQ4AsgBIAZBgICA/AM2AswBIAZBADYCvAEgBkEANgKsASAGQQA2ApwBQfikAQJ/IAYoAtgFIgMtAIEBBEACQAJAIAMoAmgiAUEASgRAIAMoAnAhAkEAIQQgBigC1AUhAANAIAIgBEHYAGxqKAJUIABGDQIgBEEBaiIEIAFHDQALCyADQegAaiEBIAZBOGpBAEHYABDuAxogBkE4ahDhAyIEQgA3AjggBEHNmbP8AzYCUCAEQQA2AhAgBEIANwIUIARCADcCMCAEQUBrQgA3AgAgBEIANwIcIARCADcCJCAEQoCAgICAgIDAPzcCSCAEQYCAgPwDNgIsIARBgICA/AM2AjwgAygCaCICQQFqIQACQCADKAJsIAJKBEAgASAANgIADAELIAEgAEHYABAMIAEoAgBBAWshAgsgAygCcCACQdgAbGogBEHYABDsAxogBBDiAyAGKALUBSECIAYoAtgFIgMoAmhB2ABsIAMoAnBqQdgAayIEQYCAgPwDNgJQIAQgAjYCVAwBCyACIARB2ABsaiEEC0H4pAEoAgBBAnIMAQtBwKsBIQRB+KQBKAIAQX1xCzYCACAEIAZB0AFqIAMoAlggBkGQAWoQjwMCQEGEpQEoAgAiBEUNACAEKAIEIgtFDQAgBCgCCCEMIAYoAtgFIgQoAlAiAgRAIAQgBigC1AUgDCALIAIRBgALIAkgBi8B4AVBLGxBHmpB8P//A3FrIgQkACAGIAQ2AuwFIAtBAEwNACAGQaQEaiENIAZB1ARqIQ4gBkEgaiESIAZBEGohE0EAIQQDQCAGKALoBSAGLwHgBU4NASAMIA9BAnRqIQICQCAGKALYBSIBKAJMIgAEfyABIAYoAtQFIAIoAgAgABEFAEUNASAGKALYBQUgAQsgAigCACAOIA0gBhApQQAhCSMAQUBqIggkACAGQYwCaiIFIBIiACoCACATIgEqAgCTIhQ4AqgDIAUgACoCBCABKgIEkyIVOAKsAyAFIAAqAgggASoCCJMiFjgCsAMgASoCCCEXIAYiAyoCCCEYIAVBkANqIgcgFCADKgIEIAEqAgSTIhmUIAMqAgAgASoCAJMiGiAVlJM4AgAgBUGMA2oiCiAWIBqUIBggF5MiFyAUlJM4AgAgBSAVIBeUIBkgFpSTOAKIAyAFQYgDahDQAgJAIAcqAgAiFCAFKgJYlCAFKgKIAyIVIAUqAlCUIAoqAgAiFiAFKgJUlJKSIAMqAggiFyAUlCADKgIAIhQgFZQgAyoCBCIVIBaUkpKTQwAAAABdIgMNAAJAIAMEQCAAIQMgASEADAELIAEhAwsgACkCACEqIAAqAgghFiADKQIAISkgAyoCCCEYIAggFzgCOCAIIBU4AjQgCCAUOAIwIAggGDgCKCAIICk3AyAgCCAWOAIYIAggKjcDECAFQYCAgPwHNgLoAiMAQUBqIgMkACAFIAhBIGoiACoCACAIQTBqIgEqAgCTOAKYAyAFIAAqAgQgASoCBJM4ApwDIAUgACoCCCABKgIIkzgCoAMgBSABKgIAIAhBEGoiByoCAJM4ArgDIAUgASoCBCAHKgIEkzgCvAMgBSABKgIIIAcqAgiTOALAAyADIAUqAmAgBSoCdEMAAAA/lCIWlCAFKgJQkiIaOAIwIAMgBSoCZCAWlCAFKgJUkiIbOAI0IAMgBSoCaCAWlCAFKgJYkiIWOAI4IAVBADYC9AIgAyAFKgKIA4w4AiAgAyAFKgKMA4w4AiQgAyAFKgKQA4w4AigCQCAFIAEgACAHIANBIGpBAUEBECZFDQAgAyAFKgJkIhUgBSoCoAMiF5QgBSoCnAMiFCAFKgJoIhiUkzgCICADIBQgBSoCYCIZlCAVIAUqApgDIhSUkzgCKCADIBggFJQgFyAZlJM4AiQgBSABIAAgByADQSBqQQJBABAmRQ0AIAMgBSoCZCIVIAUqArADIheUIAUqAqwDIhQgBSoCaCIYlJM4AiAgAyAUIAUqAmAiGZQgFSAFKgKoAyIUlJM4AiggAyAYIBSUIBcgGZSTOAIkIAUgASAAIAcgA0EgakEDQQAQJkUNACADIAUqAmQiFSAFKgLAAyIXlCAFKgK8AyIUIAUqAmgiGJSTOAIgIAMgFCAFKgJgIhmUIBUgBSoCuAMiFJSTOAIoIAMgGCAUlCAXIBmUkzgCJCAFIAEgACAHIANBIGpBBEEAECZFDQAgAyABKgIEIBuTIhggBSoCaCIVlCAFKgJkIhcgASoCCCAWkyIZlJMiHCAXlCAFKgJgIhQgGSAUlCAVIAEqAgAgGpMiGZSTIh2UkzgCKCADIBQgGSAXlCAUIBiUkyIYlCAVIByUkzgCJCADIB0gFZQgFyAYlJM4AiAgBSABIAAgByADQSBqQQtBABAmRQ0AIAMgACoCBCAbkyIXIAUqAmgiG5QgBSoCZCIVIAAqAgggFpMiFJSTIhggFZQgBSoCYCIWIBQgFpQgGyAAKgIAIBqTIhqUkyIUlJM4AiggAyAWIBogFZQgFiAXlJMiGpQgGyAYlJM4AiQgAyAUIBuUIBUgGpSTOAIgIAUgASAAIAcgA0EgakEMQQAQJkUNACADQSBqIhEgByoCCCADQTBqIhAqAgiTIhggBUHgAGoiCioCACIVlCAKKgIIIhQgByoCACAQKgIAkyIWlJMiGSAUlCAKKgIEIhcgFiAXlCAVIAcqAgQgECoCBJMiFpSTIhWUkzgCACARIBUgCioCAJQgCioCCCAWIBSUIBcgGJSTIhSUkzgCBCARIBQgCioCBJQgCioCACAZlJM4AgggBSABIAAgByADQSBqQQ1BABAmRQ0AIAMgBSoCYDgCICADIAUqAmQ4AiQgAyAFKgJoOAIoIAUgASAAIAcgA0EgakEOQQAQJkUNACADIAUqAmAgBSoCdEMAAAA/lCIWlCIaIAUqAlAiG5I4AhAgAyAFKgJkIBaUIhUgBSoCVCIXkjgCFCADIAUqAmggFpQiFiAFKgJYIhSSOAIYIAMgFCAWkzgCCCADIBcgFZM4AgQgAyAbIBqTOAIAIAUgASAAIAcgA0EQaiAKIAEgAEEPECdFDQAgBSABIAAgByADQRBqIAogACAHQRAQJ0UNACAFIAEgACAHIANBEGogCiABIAdBERAnRQ0AIAUgASAAIAcgAyAKIAEgAEESECdFDQAgBSABIAAgByADIAogACAHQRMQJ0UNACAFIAEgACAHIAMgCiABIAdBFBAnIQkLIANBQGskACAJRQ0AIAUoAvQCRQRAIAhBjBo2AgQgCEGuFjYCAEEBQbc7IAgQjgEMAQsgBSoCgAMgBSoCaJQgBSoC+AIgBSoCYJQgBSoC/AIgBSoCZJSSkotDZmZmP10EQCAIQTBqIQEjAEEwayIDJAACQCAFKgKAAyIUIAUqAmgiFyAXIBSUIAUqAmAiFSAFKgL4AiIWlCAFKgJkIhggBSoC/AIiGpSSkiIUlJMiGSAZlCAWIBUgFJSTIhYgFpQgGiAYIBSUkyIaIBqUkpKRIhu7RPFo44i1+OQ+Yw0AIAUqAlghHSAFKgJUIRwgAyAVIAUqAnRDAAAAP5QiFJQgFiAblSAFKgJwIhaUIAUqAlCSIh6SIAEqAgAiH5M4AiAgAyAYIBSUIBwgFiAaIBuVlJIiHJIgASoCBCIgkzgCJCABKgIIIRogAyAYjCAUlCAckiAgkzgCFCADIBWMIBSUIB6SIB+TOAIQIAMgF4wgFJQgHSAWIBkgG5WUkiIVkiAakzgCGCADIBcgFJQgFZIgGpM4AiggBSoCjAMhFCAFKgKQAyEXIAUqAogDIRUgA0EANgIMIAMgF4w4AgggAyAUjDgCBCADIBWMOAIAIANBIGogA0EQaiADEIMBRQ0AIAUqAqADIRQgBSoCnAMhFyAFKgKQAyEVIAUqAogDIRggBSoCmAMhGSAFKgKMAyEWIANBrIufuQM2AgwgAyAYIBeUIBkgFpSTOAIIIAMgFSAZlCAUIBiUkzgCBCADIBYgFJQgFyAVlJM4AgAgA0EgaiADQRBqIAMQgwFFDQAgBSoCrAMhFCAFKgKgAyEVIAUqApgDIRggBSoCjAMhFyAFKgKcAyEZIAMgBSoCkAMiFiAFKgKoAyIalCAFKgKwAyIbIAUqAogDIh2UkyIcOAIEIAMgFyAblCAUIBaUkyIWOAIAIAMgHSAUlCAaIBeUkyIUOAIIIAMgFSAUlCAYIBaUIBkgHJSSkkOsxSe3kow4AgwgA0EgaiADQRBqIAMQgwFFDQAgBSoCwAMhFCAFKgK8AyEXIAUqApADIRUgBSoCiAMhGCAFKgK4AyEZIAUqAowDIRYgA0Gsi5+5AzYCDCADIBggF5QgGSAWlJM4AgggAyAVIBmUIBQgGJSTOAIEIAMgFiAUlCAXIBWUkzgCACADQSBqIANBEGogAxCDAUUNACADIAEqAgAiFyADKgIgkiIVOAIgIAMgASoCBCIYIAMqAiSSIhk4AiQgASoCCCEUIAMgFyADKgIQkiIXOAIQIAMgGCADKgIUkiIYOAIUIAMgFCADKgIYkiIWOAIYIAMgFCADKgIokiIUOAIoIAUoAuADIgcgBSgC3AMiAEEsbGoiAUMAAAAAIAUqAugCIhogBSoC8AIiGyAUIAUqAlgiHZMgBSoCgAMiHJQgFSAFKgJQIh6TIAUqAvgCIhWUIBkgBSoCVCIfkyAFKgL8AiIZlJKSk5MiFCAUQwAAAABdGzgCICABIAUqAvgCOAIQIAEgBSoC/AI4AhQgASAFKgKAAzgCGCABIAMqAiA4AgAgASADKgIkOAIEIAMqAighFCABQQE2AiggASAUOAIIIAUgAEEBaiIBNgLcAyABIAUvAdQDTg0AIAcgAUEsbGoiAUMAAAAAIBogGyAWIB2TIByUIBcgHpMgFZQgGCAfkyAZlJKSk5MiFCAUQwAAAABdGzgCICABIAUqAvgCOAIQIAEgBSoC/AI4AhQgASAFKgKAAzgCGCABIAMqAhA4AgAgASADKgIUOAIEIAMqAhghFCABQQE2AiggASAUOAIIIAUgAEECajYC3AMLIANBMGokAAwBCyMAQYAEayIDJAAgA0GQAmpBMBCGAiADQdAAakEwEIYCIAhBEGoiASoCCCEdIAEqAgQhISABKgIAISIgCEEgaiIAKgIIISMgACoCBCEkIAAqAgAhJSAIQTBqIgcqAgghJiAHKgIEIScgByoCACEoIANBQGtBBBCGAiAFKgJ0QwAAAD+UIRQgBSoCUCEWIAMCfSAFKgJoIhcgBSoCgAOUIAUqAmAiGCAFKgL4ApQgBSoCZCIVIAUqAvwClJKSQwAAAABeBEAgFyAUlCAFKgJYkiEeIBUgFJQgBSoCVJIhHyAYIBSUIBaSISBDAACAvwwBCyAFKgJYIBcgFJSTIR4gBSoCVCAVIBSUkyEfIBYgGCAUlJMhIEMAAIA/CzgCSEMAAAAAIRRDAACAPyEWQwAAAAAhF0MAAAAAIRggBSoCPCIZIBmUIAUqAjgiGiAalCAFKgIwIhwgHJQgBSoCNCIbIBuUkpKSIhVDAAAAAF4EQCAcIBWVIRYgGowgFZUhFyAbjCAVlSEUIBmMIBWVIRgLIAUgFjgCQCAFIBg4AkwgBSAXOAJIIAUgFDgCRCADIBQgISAfkyIVIBaUIBggIiAgkyIZlJIgHSAekyIaIBSUkyIclCAWIBogFpQgFSAUlJIgGSAXlJMiG5QgGCAaIBiUIBkgFJQgFSAXlJKSIh2UkpIgFyAZIBaUIBogF5SSIBUgGJSTIhWUkzgC+AMgAyAYIBWUIBYgHJQgFyAdlJKSIBQgG5STOAL0AyADIBcgG5QgFiAVlCAUIB2UkpIgGCAclJM4AvADIAMgFCAkIB+TIhUgFpQgGCAlICCTIhmUkiAjIB6TIhogFJSTIhyUIBYgGiAWlCAVIBSUkiAZIBeUkyIblCAYIBogGJQgGSAUlCAVIBeUkpIiHZSSkiAXIBkgFpQgGiAXlJIgFSAYlJMiFZSTOALoAyADIBggFZQgFiAclCAXIB2UkpIgFCAblJM4AuQDIAMgFyAblCAWIBWUIBQgHZSSkiAYIByUkzgC4AMgAyAUICcgH5MiFSAWlCAYICggIJMiGZSSICYgHpMiGiAUlJMiHJQgFiAaIBaUIBUgFJSSIBkgF5STIhuUIBggGiAYlCAZIBSUIBUgF5SSkiIdlJKSIBcgGSAWlCAaIBeUkiAVIBiUkyIVlJM4AtgDIAMgGCAVlCAWIByUIBcgHZSSkiAUIBuUkzgC1AMgAyAXIBuUIBYgFZQgFCAdlJKSIBggHJSTOALQA0EAIQEgA0EANgI8IANBADYCOCADIAMqAkA4AiAgA0EANgIsIAMgAykCRDcCJCADQdADakEDIANBkAJqIANBPGogA0EgahB0A0AgAyAFIAFBBHRqIgAqAng4AiAgAyAAKgJ8OAIkIAMgACoCgAE4AiggAyAFKgJwOAIsAkAgAUEBcUUEQCADQZACaiADKAI8IANB0ABqIANBOGogA0EgahB0DAELIANB0ABqIAMoAjggA0GQAmogA0E8aiADQSBqEHQLIAMoAjxBDU8EQCADQYwaNgIUIANBxyk2AhBBAUGOPyADQRBqEI4BCyADKAI4QQ1PBEAgA0GMGjYCBCADQccpNgIAQQFBpj4gAxCOAQsgAUEBaiIBQQhHDQALAkAgAygCPCIKQQBMDQAgBSgC3AMhByAFLwHUAyERIAUoAuADIRBBACEAA0AgBSoC8AIgHiAFKgI0IhQgA0GQAmogAEEEdGoiASoCBCIVIAUqAjAiFpQgASoCACIZIAUqAjwiF5SSIBQgASoCCCIalJMiHJQgFiAaIBaUIBUgFJSSIBkgBSoCOCIYlJMiG5QgFyAaIBeUIBkgFJQgGCAVlJKSIh2UkpIgGCAZIBaUIBogGJSSIBUgF5STIhWUk5IiGSAFKgJYkyAFKgKAA5QgICAYIBuUIBYgFZQgFCAdlJKSIBcgHJSTkiIaIAUqAlCTIAUqAvgClCAFKgL8AiAfIBcgFZQgFiAclCAYIB2UkpIgFCAblJOSIhQgBSoCVJOUkpKLkyIWQwAAAABeBEAgECAHQSxsaiIBIBY4AiAgASAFKgL4AjgCECABIAUqAvwCOAIUIAUqAoADIRYgAUEBNgIoIAEgGTgCCCABIBQ4AgQgASAaOAIAIAEgFjgCGCAFIAdBAWoiBzYC3AMgByARTg0CIAMoAjwhCgsgAEEBaiIAIApIDQALCyADQYAEaiQACyAIQUBrJAAgBigC6AUiCSAETA0AIAkgBEF/c2ohEEEAIQEgBigC7AUhACAJIARrQQNxIgMEQANAIAAgBEEsbGogAigCADYCJCAEQQFqIQQgAUEBaiIBIANHDQALCyAQQQNPBEADQCAAIARBLGxqIgEgAigCADYCJCABIAIoAgA2AlAgASACKAIANgJ8IAEgAigCADYCqAEgBEEEaiIEIAlHDQALCyAJIQQLIA9BAWoiDyALRw0ACwtBACENQQAhACMAQRBrIg4kAAJAIAZBjAJqIgQoAtwDIgtFDQAgC0ECTgRAIAtBAmshEiAEKALgAyEJA0AgCyAAIgJBAWoiAEoEQCAJIAJBLGxqIgNBKGohDCADQSBqIQ8gAyoCECEhIAMqAgghHiADKgIEIR8gAyoCACEgIAMqAhghIiADKgIUISMgACEBA0ACQCAgIAkgAUEsbGoiAyoCAJOLQxe30ThdRQ0AIB8gAyoCBJOLQxe30ThdRQ0AIB4gAyoCCJOLQxe30ThdRQ0AICEgAyoCEJOLQxe30ThdRQ0AICMgAyoCFJOLQxe30ThdRQ0AICIgAyoCGJOLQxe30ThdRQ0AIAwgA0EoaiADKgIgIA8qAgBeG0EANgIACyABQQFqIgEgC0cNAAsLIAIgEkcNAAsLIAtBAEwNACAEKALgAyEMQQAhCQNAIAwgCUEsbCIBaigCKEEBRgRAIAQoAtADIA0gBCgC2ANsaiIDIA0gBC8B1ANPBEAgDkH/IzYCBCAOQdfNADYCAEEBQZ/KACAOEI4BIAQoAtwDIQsgBCgC4AMhDAsgASAMaiIBKgIgOAIgIAMgASoCECIgOAIQIANBFGoiDyABKgIUIh84AgAgA0EYaiIAIAEqAhgiHjgCACADIAEqAgA4AgAgAyABKgIEOAIEIAMgASoCCDgCCCADIAQoAsgDNgIkIAMgBCgCzAM2AiggASgCJCEBIAAgHow4AgAgDyAfjDgCACADICCMOAIQIAMgATYCMCANQQFqIQ0LIAlBAWoiCSALSA0ACwsgDkEQaiQAIAZB8AVqJAAgDQuQBgIFfQN/IAAoAlgiACgCHCAAKAIkIAFsaiEBAkAgAC0ALEUEQEGAswEgACgCICIKIAAoAigiACABKAIAbGoiCysDALYiBTgCAEGEswEgCysDCLYiBjgCAEGIswEgCysDELYiBzgCAEGMswEgCiAAIAEoAgRsaiILKwMAtjgCAEGQswEgCysDCLY4AgBBlLMBIAsrAxC2OAIAQZizASAKIAAgASgCCGxqIgArAwC2OAIAQZyzASAAKwMItjgCAEGgswEgACsDELY4AgBBmLMBIQBBjLMBIQoMAQsgACgCICILIAAoAigiDCABKAIIbGohACALIAEoAgQgDGxqIQogCyAMIAEoAgBsaiIBKgIIIQcgASoCBCEGIAEqAgAhBQsgBCADKgIIIAeUIAMqAgAgBZQgBiADKgIElJKSIgg4AgAgBCADKgIYIAeUIAMqAhAgBZQgBiADKgIUlJKSIgk4AgQgBCADKgIoIAeUIAMqAiAgBZQgBiADKgIklJKSIgU4AgggBCAIIAIqAgCSOAIAIAQgAioCBCAJkjgCBCACKgIIIQYgBEEANgIMIAQgBiAFkjgCCCAEIAMqAgggCioCCCIFlCADKgIAIAoqAgAiBpQgCioCBCIHIAMqAgSUkpIiCDgCECAEQRRqIgEgBSADKgIYlCAGIAMqAhCUIAcgAyoCFJSSkiIJOAIAIARBGGoiCiAFIAMqAiiUIAYgAyoCIJQgByADKgIklJKSIgU4AgAgBCAIIAIqAgCSOAIQIAEgAioCBCAJkjgCACACKgIIIQYgBEEANgIcIAogBiAFkjgCACAEIAMqAgggACoCCCIFlCADKgIAIAAqAgAiBpQgACoCBCIHIAMqAgSUkpIiCDgCICAEQSRqIgAgBSADKgIYlCAGIAMqAhCUIAcgAyoCFJSSkiIJOAIAIARBKGoiASAFIAMqAiiUIAYgAyoCIJQgByADKgIklJKSIgU4AgAgBCAIIAIqAgCSOAIgIAAgAioCBCAJkjgCACACKgIIIQYgBEEANgIsIAEgBiAFkjgCAAutAwEEfyMAQUBqIgUkAAJAAkAgAEUNACABRQ0AIAMNAQsgBUHcKzYCMEECQdnfACAFQTBqEI4BC0HUkQEtAABFBEAgBUHcKzYCIEECQfTcACAFQSBqEI4BCyAAKAIEQRFPBEAgBUHcKzYCEEECQarXACAFQRBqEI4BCyABKAIEQRFPBEAgBUHcKzYCAEECQY7XACAFEI4BCwJAIAAgAUYNACAAKAIQIgcEQCAHIAEoAhBGDQELIAAtAAhBAnEEQCAAECsgACAAKAIIQX1xNgIICyABLQAIQQJxBEAgARArIAEgASgCCEF9cTYCCAsgACgCBEGIAWwgASgCBEEDdGoiB0HgkQFqKAIAIghFDQAgB0HkkQFqKAIABEAgASAAIAIgAyAEIAgRAwAiBkEATA0BQQAhAQNAIAMgASAEbGoiACAAKgIQjDgCECAAIAApAiRCIIk3AiQgACAAKQIsQiCJNwIsIABBFGoiAiACKgIAjDgCACAAQRhqIgAgACoCAIw4AgAgAUEBaiIBIAZHDQALDAELIAAgASACIAMgBCAIEQMAIQYLIAVBQGskACAGC+AFAhB/A30jAEEgayIDJAAgACgCHEUEQCADQdsZNgIUIANB9xM2AhBBAUG8OCADQRBqEI4BCyAAKAIQIgFFBEAgA0HbGTYCBCADQfcTNgIAQQFBpjEgAxCOASAAKAIQIQELIAAoAhgiAiABQbABaiIEKgIAIAAoAhwiACoCCJQgAUGoAWoiBSoCACAAKgIAlCABQawBaiIGKgIAIAAqAgSUkpIiETgCACACIAFBwAFqIgcqAgAgACoCCJQgAUG4AWoiCCoCACAAKgIAlCABQbwBaiIJKgIAIAAqAgSUkpIiEjgCBCACIAFB0AFqIgoqAgAgACoCCJQgAUHIAWoiCyoCACAAKgIAlCABQcwBaiIMKgIAIAAqAgSUkpIiEzgCCCACIBEgASoCmAGSOAIAIAIgASoCnAEgEpI4AgQgAiABKgKgASATkjgCCCACIAQqAgAgAEEwaiIBKgIAlCAFKgIAIAAqAhCUIAYqAgAgAEEgaiINKgIAlJKSOAIQIAIgBCoCACAAQTRqIg4qAgCUIAUqAgAgAEEUaiIPKgIAlCAGKgIAIABBJGoiECoCAJSSkjgCFCACIAQqAgAgAEE4aiIEKgIAlCAFKgIAIABBGGoiBSoCAJQgBioCACAAQShqIgYqAgCUkpI4AhggAiAHKgIAIAEqAgCUIAgqAgAgACoCEJQgCSoCACANKgIAlJKSOAIgIAIgByoCACAOKgIAlCAIKgIAIA8qAgCUIAkqAgAgECoCAJSSkjgCJCACIAcqAgAgBCoCAJQgCCoCACAFKgIAlCAJKgIAIAYqAgCUkpI4AiggAiAKKgIAIAEqAgCUIAsqAgAgACoCEJQgDCoCACANKgIAlJKSOAIwIAIgCioCACAOKgIAlCALKgIAIA8qAgCUIAwqAgAgECoCAJSSkjgCNCACIAoqAgAgBCoCAJQgCyoCACAFKgIAlCAMKgIAIAYqAgCUkpI4AjggA0EgaiQAC6giAQV/IABB2OIANgIAQdSRAS0AAEUEQEHUkQFBAToAAEHgkQFBAEGIEhDuAyEHQQohBgNAIAZBiAFsIgQgB2oiBSgCAEUEQCAFQQc2AgAgBEHkkQFqQQA2AgALIAZBA3QiBSAHaiIDKAIARQRAIANBBzYCACAFQeSRAWpBATYCAAsgBEHokQFqIgMoAgBFBEAgA0EHNgIAIARB7JEBakEANgIACyAFQeiSAWoiAygCAEUEQCADQQc2AgAgBUHskgFqQQE2AgALIARB8JEBaiIDKAIARQRAIANBBzYCACAEQfSRAWpBADYCAAsgBUHwkwFqIgMoAgBFBEAgA0EHNgIAIAVB9JMBakEBNgIACyAEQfiRAWoiAygCAEUEQCADQQc2AgAgBEH8kQFqQQA2AgALIAVB+JQBaiIDKAIARQRAIANBBzYCACAFQfyUAWpBATYCAAsgBEGAkgFqIgMoAgBFBEAgA0EHNgIAIARBhJIBakEANgIACyAFQYCWAWoiAygCAEUEQCADQQc2AgAgBUGElgFqQQE2AgALIARBiJIBaiIDKAIARQRAIANBBzYCACAEQYySAWpBADYCAAsgBUGIlwFqIgMoAgBFBEAgA0EHNgIAIAVBjJcBakEBNgIACyAEQZCSAWoiAygCAEUEQCADQQc2AgAgBEGUkgFqQQA2AgALIAVBkJgBaiIDKAIARQRAIANBBzYCACAFQZSYAWpBATYCAAsgBEGYkgFqIgMoAgBFBEAgA0EHNgIAIARBnJIBakEANgIACyAFQZiZAWoiAygCAEUEQCADQQc2AgAgBUGcmQFqQQE2AgALIARBoJIBaiIDKAIARQRAIANBBzYCACAEQaSSAWpBADYCAAsgBUGgmgFqIgMoAgBFBEAgA0EHNgIAIAVBpJoBakEBNgIACyAEQaiSAWoiAygCAEUEQCADQQc2AgAgBEGskgFqQQA2AgALIAVBqJsBaiIDKAIARQRAIANBBzYCACAFQaybAWpBATYCAAsgBEGwkgFqIgMoAgBFBEAgA0EHNgIAIARBtJIBakEANgIACyAFQbCcAWoiAygCAEUEQCADQQc2AgAgBUG0nAFqQQE2AgALIARBuJIBaiIDKAIARQRAIANBBzYCACAEQbySAWpBADYCAAsgBUG4nQFqIgMoAgBFBEAgA0EHNgIAIAVBvJ0BakEBNgIACyAEQcCSAWoiAygCAEUEQCADQQc2AgAgBEHEkgFqQQA2AgALIAVBwJ4BaiIDKAIARQRAIANBBzYCACAFQcSeAWpBATYCAAsgBEHIkgFqIgMoAgBFBEAgA0EHNgIAIARBzJIBakEANgIACyAFQcifAWoiAygCAEUEQCADQQc2AgAgBUHMnwFqQQE2AgALIARB0JIBaiIDKAIARQRAIANBBzYCACAEQdSSAWpBADYCAAsgBUHQoAFqIgMoAgBFBEAgA0EHNgIAIAVB1KABakEBNgIACyAEQdiSAWoiAygCAEUEQCADQQc2AgAgBEHckgFqQQA2AgALIAVB2KEBaiIDKAIARQRAIANBBzYCACAFQdyhAWpBATYCAAsgBEHgkgFqIgMoAgBFBEAgA0EHNgIAIARB5JIBakEANgIACyAFQeCiAWoiBCgCAEUEQCAEQQc2AgAgBUHkogFqQQE2AgALIAZBAWoiBkENRw0AC0HgkQFBCDYCAEHkkQFBADYCAEHokQEoAgBFBEBB6JEBQQk2AgBB7JEBQQA2AgALQeiSASgCAEUEQEHskgFBATYCAEHokgFBCTYCAAtBgJIBKAIARQRAQYCSAUEKNgIAQYSSAUEANgIAC0GAlgEoAgBFBEBBhJYBQQE2AgBBgJYBQQo2AgALQfCSASgCAEUEQEHwkgFBCzYCAEH0kgFBADYCAAtBiJMBKAIARQRAQYiTAUEMNgIAQYyTAUEANgIAC0GIlgEoAgBFBEBBjJYBQQE2AgBBiJYBQQw2AgALQfCTASgCAEUEQEHwkwFBDTYCAEH0kwFBADYCAAtB8JEBKAIARQRAQfSRAUEBNgIAQfCRAUENNgIAC0H4kwEoAgBFBEBB+JMBQQ42AgBB/JMBQQA2AgALQfiSASgCAEUEQEH8kgFBATYCAEH4kgFBDjYCAAtBgJQBKAIARQRAQYCUAUEPNgIAQYSUAUEANgIAC0GQlAEoAgBFBEBBkJQBQRA2AgBBlJQBQQA2AgALQZCWASgCAEUEQEGUlgFBATYCAEGQlgFBEDYCAAtBiJcBKAIARQRAQYiXAUERNgIAQYyXAUEANgIAC0GIkgEoAgBFBEBBjJIBQQE2AgBBiJIBQRE2AgALQZCXASgCAEUEQEGQlwFBEjYCAEGUlwFBADYCAAtBkJMBKAIARQRAQZSTAUEBNgIAQZCTAUESNgIAC0GYlwEoAgBFBEBBmJcBQRM2AgBBnJcBQQA2AgALQZiUASgCAEUEQEGclAFBATYCAEGYlAFBEzYCAAtBqJcBKAIARQRAQaiXAUEUNgIAQayXAUEANgIAC0GolgEoAgBFBEBBrJYBQQE2AgBBqJYBQRQ2AgALQaCXASgCAEUEQEGglwFBFTYCAEGklwFBADYCAAtBoJUBKAIARQRAQaSVAUEBNgIAQaCVAUEVNgIAC0GgmgEoAgBFBEBBoJoBQRY2AgBBpJoBQQA2AgALQaCSASgCAEUEQEGkkgFBATYCAEGgkgFBFjYCAAtBqJoBKAIARQRAQaiaAUEXNgIAQayaAUEANgIAC0GokwEoAgBFBEBBrJMBQQE2AgBBqJMBQRc2AgALQciaASgCAEUEQEHImgFBGDYCAEHMmgFBADYCAAtByJcBKAIARQRAQcyXAUEBNgIAQciXAUEYNgIAC0HgmgEoAgBFBEBB4JoBQRk2AgBB5JoBQQA2AgALQbCaASgCAEUEQEGwmgFBGjYCAEG0mgFBADYCAAtBsJQBKAIARQRAQbSUAUEBNgIAQbCUAUEaNgIAC0HAmgEoAgBFBEBBwJoBQRs2AgBBxJoBQQA2AgALQcCWASgCAEUEQEHElgFBATYCAEHAlgFBGzYCAAtBuJUBKAIARQRAQbiVAUEcNgIAQbyVAUEANgIAC0G4mgEoAgBFBEBBvJoBQQE2AgBBuJoBQRw2AgALQYCVASgCAEUEQEGAlQFBHTYCAEGElQFBADYCAAtBgJMBKAIARQRAQYSTAUEBNgIAQYCTAUEdNgIAC0H4lAEoAgBFBEBB+JQBQR42AgBB/JQBQQA2AgALQfiRASgCAEUEQEH8kQFBATYCAEH4kQFBHjYCAAtBmJUBKAIARQRAQZiVAUEfNgIAQZyVAUEANgIAC0GYlgEoAgBFBEBBnJYBQQE2AgBBmJYBQR82AgALQbCYASgCAEUEQEGwmAFBIDYCAEG0mAFBADYCAAtBsJYBKAIARQRAQbSWAUEBNgIAQbCWAUEgNgIAC0GQkgEoAgBFBEBBkJIBQSE2AgBBlJIBQQA2AgALQZCYASgCAEUEQEGUmAFBATYCAEGQmAFBITYCAAtBmJgBKAIARQRAQZiYAUEiNgIAQZyYAUEANgIAC0GYkwEoAgBFBEBBnJMBQQE2AgBBmJMBQSI2AgALQaCYASgCAEUEQEGgmAFBIzYCAEGkmAFBADYCAAtBoJQBKAIARQRAQaSUAUEBNgIAQaCUAUEjNgIAC0HAmAEoAgBFBEBBwJgBQSQ2AgBBxJgBQQA2AgALQbiXASgCAEUEQEG4lwFBJTYCAEG8lwFBADYCAAtBuJgBKAIARQRAQbyYAUEBNgIAQbiYAUElNgIAC0HQmwEoAgBFBEBB0JsBQSY2AgBB1JsBQQA2AgALQdCXASgCAEUEQEHUlwFBATYCAEHQlwFBJjYCAAtBqJsBKAIARQRAQaibAUEmNgIAQaybAUEANgIAC0GokgEoAgBFBEBBrJIBQQE2AgBBqJIBQSY2AgALQbCbASgCAEUEQEGwmwFBJjYCAEG0mwFBADYCAAtBsJMBKAIARQRAQbSTAUEBNgIAQbCTAUEmNgIAC0G4mwEoAgBFBEBBuJsBQSY2AgBBvJsBQQA2AgALQbiUASgCAEUEQEG8lAFBATYCAEG4lAFBJjYCAAtBwJsBKAIARQRAQcCbAUEmNgIAQcSbAUEANgIAC0HAlQEoAgBFBEBBxJUBQQE2AgBBwJUBQSY2AgALQdibASgCAEUEQEHYmwFBJjYCAEHcmwFBADYCAAtB2JgBKAIARQRAQdyYAUEBNgIAQdiYAUEmNgIAC0HomwEoAgBFBEBB6JsBQSY2AgBB7JsBQQA2AgALQeiaASgCAEUEQEHsmgFBATYCAEHomgFBJjYCAAtBmJkBKAIARQRAQZiZAUEnNgIAQZyZAUEANgIAC0GYkgEoAgBFBEBBmJIBQSc2AgBBnJIBQQE2AgALQaCZASgCAEUEQEGgmQFBJzYCAEGkmQFBADYCAAtBoJMBKAIARQRAQaCTAUEnNgIAQaSTAUEBNgIAC0GomQEoAgBFBEBBqJkBQSc2AgBBrJkBQQA2AgALQaiUASgCAEUEQEGolAFBJzYCAEGslAFBATYCAAtBsJkBKAIARQRAQbCZAUEnNgIAQbSZAUEANgIAC0GwlQEoAgBFBEBBsJUBQSc2AgBBtJUBQQE2AgALQbiZASgCAEUEQEG4mQFBJzYCAEG8mQFBADYCAAtBuJYBKAIARQRAQbiWAUEnNgIAQbyWAUEBNgIAC0HAmQEoAgBFBEBBwJkBQSc2AgBBxJkBQQA2AgALQcCXASgCAEUEQEHAlwFBJzYCAEHElwFBATYCAAtByJkBKAIARQRAQciZAUEnNgIAQcyZAUEANgIAC0HImAEoAgBFBEBByJgBQSc2AgBBzJgBQQE2AgALQdCZASgCAEUEQEHQmQFBJzYCAEHUmQFBADYCAAtB0JkBKAIARQRAQdCZAUEnNgIAQdSZAUEBNgIAC0HYmQEoAgBFBEBB2JkBQSc2AgBB3JkBQQA2AgALQdiaASgCAEUEQEHYmgFBJzYCAEHcmgFBATYCAAtB4JkBKAIARQRAQeCZAUEnNgIAQeSZAUEANgIAC0HgmwEoAgBFBEBB4JsBQSc2AgBB5JsBQQE2AgALQeiZASgCAEUEQEHomQFBJzYCAEHsmQFBADYCAAtB6JwBKAIARQRAQeicAUEnNgIAQeycAUEBNgIAC0HwmQEoAgBFBEBB8JkBQSc2AgBB9JkBQQA2AgALQfCdASgCAEUEQEHwnQFBJzYCAEH0nQFBATYCAAtB+JkBKAIARQRAQfiZAUEnNgIAQfyZAUEANgIAC0H4ngEoAgBFBEBB+J4BQSc2AgBB/J4BQQE2AgALQYCaASgCAEUEQEGAmgFBJzYCAEGEmgFBADYCAAtBgKABKAIARQRAQYCgAUEnNgIAQYSgAUEBNgIAC0GImgEoAgBFBEBBiJoBQSc2AgBBjJoBQQA2AgALQYihASgCAEUEQEGIoQFBJzYCAEGMoQFBATYCAAtBkJoBKAIARQRAQZCaAUEnNgIAQZSaAUEANgIAC0GQogEoAgBFBEBBkKIBQSc2AgBBlKIBQQE2AgALQZiaASgCAEUEQEGYmgFBJzYCAEGcmgFBADYCAAtBmKMBKAIARQRAQZijAUEnNgIAQZyjAUEBNgIACwsgAEEANgIUIABCADcCDCAAQR1BFSACGzYCCCAAQX82AgQCQCACBEACQEHQkQEoAgAiAgRAQdCRAUEANgIADAELQcAAEI4CIQILIAAgAjYCGCACQQQQhgIgACgCGEEQahDkAgwBCyAAQQA2AhgLIABCADcCHCAAQgA3AiQgAEEsakEGEIYCIABCfzcCRCABBEAgASAAEFALIAAL3AIBAn8jAEEQayIFJAAgBSAENgIMIAUgAzYCCCAFIAI2AgQgBUEEaiEEIwBBEGsiBiQAAkACQCAARQ0AIAFFDQAMAQsgBkGC0QA2AgBBAkHZ3wAgBhCOAQsgAUEAIAEoAgRBCmtBA0kbIQMCQAJAIABFDQAgACgCBEENa0F9SQ0AIAMEQCAAIANGBEAgACAEQSggACgCACgCJBEEAAwDCyAAKAJMIAMoAkxIBEAgACgCUCIARQ0DA0AgAyAEIABBKCADKAIAKAIoEQYAIAAoAiAiAA0ACwwDCyADKAJQIgNFDQIDQCAAIAQgA0EoIAAoAgAoAigRBgAgAygCICIDDQALDAILIAAgBCABQSggACgCACgCKBEGAAwBCyADBEAgAyAEIABBKCADKAIAKAIoEQYADAELIAQgACABEDwLIAZBEGokACAFLwEEIQQgBUEQaiQAIAJB//8DcSAEawvaAQECfyAAQdjiADYCACAAKAIoIgEEQCABIAAQUQsCQCAALQAIQQhxRQ0AIAAoAhAEQCAAKAIcRQ0BCyAAKAIYIgFFDQBB0JEBKAIAIgIEQCACQcAAEI8CC0HQkQEgATYCAAsgACgCHCIBBEBB0JEBKAIAIgIEQCACQcAAEI8CC0HQkQEgATYCAAsgACgCECICBEACQCACKAIcIgFFDQAgACABRgR/IAJBHGoFA0AgASICKAIUIgFFDQIgACABRw0ACyACQRRqCyAAKAIUNgIACyAAQgA3AhALIAALAwAACwQAQQELPwEBfyMAQRBrIgEkAAJAIABFBEAgAUH9CDYCAEECQdnfACABEI4BDAELIAAgACgCACgCBBEBAAsgAUEQaiQAC7oFAQR/IwBBMGsiBCQAIABFBEAgBEHhCTYCIEECQdnfACAEQSBqEI4BCwJAIAFFDQAgAC0ACEEIcQ0AIARB4Qk2AhBBAkGo2QAgBEEQahCOAQsCQCAAKAIoIgJFDQAgAigCYEUNACAEQeEJNgIAQQJBkdsAIAQQjgELIAAoAhAhAwJAIAEEQAJAIAMNACAAKAIYIgJFBEBBACEDDAELQQAhA0HQkQEoAgAiBQRAIAVBwAAQjwIgACgCECEDC0HQkQEgAjYCAAsgASADRwRAIAAoAhwiAgRAQdCRASgCACIFBEAgBUHAABCPAiAAKAIQIQMLQdCRASACNgIAIABBADYCHAsgACABQZgBajYCGAJAIANFDQAgAygCHCICRQ0AIAAgAkYEfyADQRxqBQNAIAIiAygCFCICRQ0CIAAgAkcNAAsgA0EUagsgACgCFDYCAAsgACABNgIQIAAgASgCHDYCFCABIAA2AhwLIAAQPQwBCyADRQ0AAkAgACgCHCIBBEACQCAALQAIQQJxBEAgABArIAAgACgCCEF9cTYCCCAAKAIcIgFFDQELQdCRASgCACICBEAgAkHAABCPAgtB0JEBIAE2AgALIABBADYCHAwBCwJAQdCRASgCACIBBEBB0JEBQQA2AgAMAQtBwAAQjgIhASAAKAIQIQMLIAAgATYCGCABIAMpAqABNwIIIAEgAykCmAE3AgAgACgCGCIBIAAoAhAiAikC0AE3AjggASACKQLIATcCMCABIAIpAsABNwIoIAEgAikCuAE3AiAgASACKQKwATcCGCABIAIpAqgBNwIQCyAAKAIQIgJFDQACQCACKAIcIgFFDQAgACABRgR/IAJBHGoFA0AgASICKAIUIgFFDQIgACABRw0ACyACQRRqCyAAKAIUNgIACyAAQgA3AhALIARBMGokAAs2AQF/IwBBEGsiASQAIABFBEAgAUH8CTYCAEECQdnfACABEI4BCyAAKAIQIQAgAUEQaiQAIAALtgICA38CfSMAQTBrIgUkACAARQRAIAVBxxw2AiBBAkHZ3wAgBUEgahCOAQsgAC0ACEEIcUUEQCAFQcccNgIQQQJBqNkAIAVBEGoQjgELAkAgACgCKCIERQ0AIAQoAmBFDQAgBUHHHDYCAEECQZHbACAFEI4BCyAAKAIQIQQCQCAAKAIcIgYEQCAEIAEgBCoCsAEgBioCCCIBlCAEKgKoASAGKgIAIgeUIAQqAqwBIAYqAgQiCJSSkpMgAiAEKgLAASABlCAEKgK4ASAHlCAIIAQqArwBlJKSkyADIAQqAtABIAGUIAQqAsgBIAeUIAggBCoCzAGUkpKTEJICDAELIAQEQCAEIAEgAiADEJICDAELIAAoAhgiBCADOAIIIAQgAjgCBCAEIAE4AgAgABA9CyAFQTBqJAAL7wUCA38XfSMAQfAAayICJAAgAEEAIAEbRQRAIAJBox02AiBBAkHZ3wAgAkEgahCOAQsgAC0ACEEIcUUEQCACQaMdNgIQQQJBqNkAIAJBEGoQjgELAkAgACgCKCIDRQ0AIAMoAmBFDQAgAkGjHTYCAEECQZHbACACEI4BCwJAIAAoAhwiAwRAIAAtAAhBAnEEQCAAECsgACAAKAIIQX1xNgIIIAAoAhwhAwsgAyoCGCEFIAMqAhQhBiADKgIoIQcgAyoCICEIIAMqAiQhCSAAKAIYIgQqAgAhFyAEKgIEIRggBCoCCCEZIAEqAgghDyABKgIAIRAgASoCBCERIAEqAhghCiABKgIQIQsgASoCFCESIAMqAhAhEyACIAEqAigiDCADKgI4IhSUIAEqAiAiDSADKgIwIhWUIAEqAiQiDiADKgI0IhaUkpIiGjgCaCACIAwgB5QgDSAIlCAOIAmUkpIiGzgCZCACIAwgBZQgDSATlCAOIAaUkpIiDDgCYCACIAogFJQgCyAVlCASIBaUkpIiDTgCWCACIAogB5QgCyAIlCASIAmUkpIiDjgCVCACIAogBZQgCyATlCASIAaUkpIiCjgCUCACIA8gFJQgECAVlCARIBaUkpIiCzgCSCACIA8gB5QgECAIlCARIAmUkpIiCDgCRCACIA8gBZQgECATlCARIAaUkpIiCTgCQCACIBkgGiADKgIIIgWUIAwgAyoCACIGlCAbIAMqAgQiB5SSkpM4AjggAiAYIA0gBZQgCiAGlCAOIAeUkpKTOAI0IAIgFyALIAWUIAkgBpQgCCAHlJKSkzgCMCAAKAIQIAJBQGsQkwIgACgCECACKgIwIAIqAjQgAioCOBCSAgwBCyAAKAIQIgMEQCADIAEQkwIMAQsgACgCGCIDIAEpAgA3AhAgAyABKQIoNwI4IAMgASkCIDcCMCADIAEpAhg3AiggAyABKQIQNwIgIAMgASkCCDcCGCAAED0LIAJB8ABqJAALeAECfyMAQSBrIgEkACAARQRAIAFB6Rw2AhBBAkHZ3wAgAUEQahCOAQsgACgCCCICQQhxBH8gAgUgAUHpHDYCAEECQajZACABEI4BIAAoAggLQQJxBEAgABArIAAgACgCCEF9cTYCCAsgACgCGCEAIAFBIGokACAAC3sBAn8jAEEgayIBJAAgAEUEQCABQcUdNgIQQQJB2d8AIAFBEGoQjgELIAAoAggiAkEIcQR/IAIFIAFBxR02AgBBAkGo2QAgARCOASAAKAIIC0ECcQRAIAAQKyAAIAAoAghBfXE2AggLIAAoAhghACABQSBqJAAgAEEQagu+AQECfyMAQSBrIgIkACAARQRAIAJB/B02AhBBAkHZ3wAgAkEQahCOAQsgAC0ACEEIcUUEQCACQfwdNgIAQQJBqNkAIAIQjgELAkACQCAAKAIQIgNFDQAgACgCHA0AIAEgAxCZAiIAKgIAOAIAIAEgACoCBDgCBCABIAAqAgg4AgggASAAKgIMOAIMDAELIAAtAAhBAnEEQCAAECsgACAAKAIIQX1xNgIICyABIAAoAhhBEGoQ7gILIAJBIGokAAupAQECfyMAQSBrIgIkACAARQRAIAJB9s4ANgIQQQJB2d8AIAJBEGoQjgELIAFFBEAgAkH2zgA2AgBBAkHZ3wAgAhCOAQsgACgCCCIDQQRxBEAgA0ECcQRAIAAQKyAAIAAoAghBfXE2AggLIAAgACgCACgCCBEBACAAIAAoAghBe3E2AggLIAEgACkCLDcCACABIAApAjw3AhAgASAAKQI0NwIIIAJBIGokAAs8AQF/IwBBEGsiASQAIABFBEAgAUGbLDYCAEECQdnfACABEI4BCyAAKAIEIQAgAUEQaiQAIABBCmtBA0kLNgEBfyMAQRBrIgEkACAARQRAIAFBsw42AgBBAkHZ3wAgARCOAQsgACgCBCEAIAFBEGokACAAC0cBAX8gACgCACIDQf//A3EEQCABIAIgAyAAKAIEIAAoAggQKiECIAAgACgCACACazYCACAAIAAoAgQgAiAAKAIIbGo2AgQLC4ICAQN/IwBBMGsiAiQAIABFBEAgAkHpLDYCIEECQdnfACACQSBqEI4BCyAAKAIcBEAgACAAKAIIQQJyNgIICwJAIAAoAigiA0UEQCAAIQEMAQsDQCADIQEgACgCCCIDQQFxBEAgACEBDAILIAAgASgCYAR/IAJB6Sw2AhBBAkHm2gAgAkEQahCOASAAKAIIBSADC0EFcjYCCCABIAAgASgCACgCHBEAACABIgAoAigiAw0ACwsDQAJAIAEgASgCCEEFcjYCCCABKAIoIgBFDQAgACgCYARAIAJB6Sw2AgBBAkHm2gAgAhCOASABKAIoIQALIAAhASAADQELCyACQTBqJAALpwICAn8HfSAAKAJQIgEEQEMAAIB/IQRDAACA/yEFQwAAgP8hBkMAAIB/IQdDAACA/yEIQwAAgH8hCQNAIAEoAggiAkEEcQRAIAJBAnEEQCABECsgASABKAIIQX1xNgIICyABIAEoAgAoAggRAQAgASABKAIIQXtxNgIICyABQUBrKgIAIgMgBSADIAVeGyEFIAEqAjgiAyAGIAMgBl4bIQYgASoCMCIDIAggAyAIXhshCCABKgI8IgMgBCADIARdGyEEIAEqAjQiAyAHIAMgB10bIQcgASoCLCIDIAkgAyAJXRshCSABKAIgIgENAAsgACAJOAIsIABBQGsgBTgCACAAIAQ4AjwgACAGOAI4IAAgBzgCNCAAIAg4AjAPCyAAQSxqQQYQhgILtQEBA38jAEEQayIDJAACQCABQQBOBEAgACgCTCABSg0BCyADQaUeNgIAQQJBgdoAIAMQjgELAkACfwJAIAAoAlwiAkUNACAAKAJYIAFBAWtHDQAgACACKAIgIgI2AlwgAEHYAGoMAQsgACgCUCECIAFBAEoEQANAIAJFBEBBACECDAQLIAIoAiAhAiAEQQFqIgQgAUcNAAsLIAAgAjYCXCAAQdgAagsgATYCAAsgA0EQaiQAIAIL1QEBAn8jAEEwayICJAAgACgCYARAIAJBtS42AiBBAkHm2gAgAkEgahCOAQsgAUUEQCACQbUuNgIQQQJB2d8AIAJBEGoQjgELAkAgASgCKEUEQCABKAIgRQ0BCyACQbUuNgIAQQJB4dsAIAIQjgELIAEgADYCKCAAKAJQIQMgASAAQdAAajYCJCABIAM2AiAgACgCUCIDBEAgAyABQSBqNgIkCyAAIAE2AlAgAEEANgJcIAAgACgCTEEBajYCTCABIAEoAghBBXI2AgggABA9IAJBMGokAAuwAQECfyMAQTBrIgIkACAAKAJgBEAgAkG/JDYCIEECQebaACACQSBqEI4BCyABRQRAIAJBvyQ2AhBBAkHZ3wAgAkEQahCOAQsgACABKAIoRwRAIAJBvyQ2AgBBAkGc2gAgAhCOAQsgASgCICIDBEAgAyABKAIkNgIkCyABKAIkIAM2AgAgACAAKAJMQQFrNgJMIAFBADYCKCABQgA3AiAgAEEANgJcIAAQPSACQTBqJAALWAECfyABKAIgIgIEQCACIAEoAiQ2AiQLIAEoAiQgAjYCACAAKAJQIQIgASAAQdAAaiIDNgIkIAEgAjYCICAAKAJQIgAEQCAAIAFBIGo2AiQLIAMgATYCAAupAQECfyAAIAAoAmAiAkEBajYCYCAAIAAoAlAiAQR/A0AgASgCCCICQQFxBEAgASgCBEEKa0ECTQRAIAEgASgCACgCIBEBACABKAIIIQILIAEgAkEEcQR/IAJBAnEEQCABECsgASABKAIIQX1xNgIICyABIAEoAgAoAggRAQAgASgCCEF7cQUgAgtBenE2AgggASgCICIBDQELCyAAKAJgQQFrBSACCzYCYAu0AwEFfyMAQTBrIgUkACACRQRAIAVBxis2AiBBAkHZ3wAgBUEgahCOAQsgACAAKAJgQQFqNgJgIAAgACgCACgCIBEBACAAKAJQIgMEQANAAkAgAy0ACEEQcUUNACADKAIgIgRFDQAgA0EsaiEHA0ACQCAEKAIIIgZBEHFFDQAgAy0ACEEEcQR/IAVBmCQ2AhQgBUHqEzYCEEEBQezGACAFQRBqEI4BIAQoAggFIAYLQQRxBEAgBUGYJDYCBCAFQeoTNgIAQQFBrMYAIAUQjgELIAMoAhAiBgRAIAYgBCgCEEYNAQsgBCgCSCADKAJEcUUEQCADKAJIIAQoAkRxRQ0BCyAHKgIAIAQqAjBeDQAgAyoCMCAEQSxqIgYqAgBdDQAgAyoCNCAEKgI4Xg0AIAMqAjggBCoCNF0NACADKgI8IARBQGsqAgBeDQAgAyoCQCAEKgI8XQ0AIAMgBCAGIAMoAgAoAgwRBQBFDQAgBCADIAcgBCgCACgCDBEFAEUNACABIAMgBCACEQQACyAEKAIgIgQNAAsLIAMoAiAiAw0ACwsgACAAKAJgQQFrNgJgIAVBMGokAAumAgECfyMAQSBrIgQkACAALQAIQQRxBEAgBEGYJDYCFCAEQeoTNgIQQQFB7MYAIARBEGoQjgELIAEtAAhBBHEEQCAEQZgkNgIEIARB6hM2AgBBAUGsxgAgBBCOAQsCQCAAKAIQIgUEQCAFIAEoAhBGDQELIAEoAkggACgCRHFFBEAgACgCSCABKAJEcUUNAQsgACoCLCABKgIwXg0AIAAqAjAgAUEsaiIFKgIAXQ0AIAAqAjQgASoCOF4NACAAKgI4IAEqAjRdDQAgACoCPCABQUBrKgIAXg0AIABBQGsqAgAgASoCPF0NACAAIAEgBSAAKAIAKAIMEQUARQ0AIAEgACAAQSxqIAEoAgAoAgwRBQBFDQAgAiAAIAEgAxEEAAsgBEEgaiQAC8UBAQJ/IwBBEGsiBSQAIAJBACADG0UEQCAFQfnQADYCAEECQdnfACAFEI4BCyAAIAAoAmBBAWo2AmAgACAAKAIAKAIgEQEAIAIoAggiBEEEcQRAIARBAnEEQCACECsgAiACKAIIQX1xNgIICyACIAIoAgAoAggRAQAgAiACKAIIQXtxNgIICyAAKAJQIgQEQANAIAQtAAhBEHEEQCAEIAIgASADEEULIAQoAiAiBA0ACwsgACAAKAJgQQFrNgJgIAVBEGokAAuAFgIefwZ9IwBBgAFrIgohCCAKJAAgAkUEQCAIQcYrNgJwQQJB2d8AIAhB8ABqEI4BCyAAKAJMQQJOBEAgACAAKAJgQQFqNgJgIAAgACgCACgCIBEBACAAKAJkIgxBAWshESAAKAJQIgMEQCAAKAJoIQkDQAJAIAMtAAhBEHFFDQAgCkFAaiIEIgokACAEIAM2AiBB/////wchBwJAIAMqAiwiIUMAAID/Xw0AIAMqAjAiIkMAAIB/YA0AIAMqAjQiI0MAAID/Xw0AIAMqAjgiJUMAAIB/YA0AIAMqAjwiJEMAAID/Xw0AIANBQGsqAgAiJkMAAIB/YA0AICYgJJMiJCAlICOTIiMgIiAhkyIiICIgI10bIiIgIiAkXRsgCEHsAGoQ9AMaIAgoAmwhBwsgCSAHIAwgByAMShsiB04EQCAEIAc2AgQgBCAONgIAIAQCfyAhRAAAAAAAAPA/IAcQ9QO2IiKVjiIhi0MAAABPXQRAICGoDAELQYCAgIB4CzYCCCAEAn8gAyoCMCAilY4iIYtDAAAAT10EQCAhqAwBC0GAgICAeAs2AgwgBAJ/IAMqAjQgIpWOIiGLQwAAAE9dBEAgIagMAQtBgICAgHgLNgIQIAQCfyADKgI4ICKVjiIhi0MAAABPXQRAICGoDAELQYCAgIB4CzYCFCAEAn8gAyoCPCAilY4iIYtDAAAAT10EQCAhqAwBC0GAgICAeAs2AhggA0FAayoCACEhIAQgBjYCJCAEAn8gISAilY4iIotDAAAAT10EQCAiqAwBC0GAgICAeAs2AhwgByARIAcgEUobIREgBkEBaiEGIAQhDgwBCyAEIA82AgAgBCEPCyADKAIgIgMNAAsLIAogBkEHakEDdSIbIAZsIhxBD2pBcHFrIgMiBCQAIANBACAcEO4DIR4CQCAGQQBMDQBBBCEFIAZBAUYNAEEFIQUgBkEESQ0AQQYhBSAGQQhJDQBBByEFIAZBEEkNAEEIIQUgBkEgSQ0AQQkhBSAGQcAASQ0AQQohBSAGQYABSQ0AQQshBSAGQf8BSQ0AQQwhBSAGQYAESQ0AQQ0hBSAGQYAISQ0AQQ4hBSAGQYAQSQ0AQQ8hBSAGQf4fSQ0AQRAhBSAGQf8/SQ0AQREhBSAGQYCAAUkNAEESIQUgBkGAgAJJDQBBEyEFIAZBgIAESQ0AQRQhBSAGQYCACEkNAEEVIQUgBkH//w9JDQBBFiEFIAZBgIAgSQ0AQRchBSAGQf//P0kNAEEYIQUgBkGAgIABSQ0AQRkhBSAGQfz//wFJDQBBGiEFIAZBgICABEkNAEEbIQUgBkH8//8HSQ0AQRwhBSAGQfn//w9JDQBBHSEFIAZBgICAIEkNAEEfQR4gBkH7//8/SxshBQsgBEEeIAUgBUEeTxtBAnRBsOQAaigCACITQQJ0QR5qQXBxayIDIgckACADQQBBASATIBNBAUwbQQJ0EO4DIR0CQAJAIA5FDQAgDiEJA0ACQCAJKAIIIg0gCSgCDCIESg0AIAkoAhAiEiAJKAIUIhBKDQADQCAJKAIYIgsgCSgCHCIFTARAIA1B5ABsIRogCSgCBEHoB2whFCASIQwDQCAMQQpsIBpqIQYgCyEEA0AgB0EgayIDIgckACADIAk2AhAgAyAENgIMIAMgDDYCCCADIA02AgQgAyAdIAQgBmogFGogE3BBAnRqIgooAgA2AgAgCiADNgIAIAQgBUghAyAEQQFqIQQgAw0ACyAMIBBIIQMgDEEBaiEMIAMNAAsgCSgCDCEECyAEIA1KIQMgDUEBaiENIAMNAAsLIAkoAgAiCQ0ACyAORQ0AIA4hBwNAIBEgBygCBCIDTgRAIAcoAgwhFSAHKAIQIRYgBygCFCEXIAcoAhghGCAHKAIcIRAgBygCCCEZA0AgAyEKAkAgFSAZSA0AIBYgF0oNACAQIBhIDQAgA0HoB2whHyAZIQwDQCAMQeQAbCAfaiEgIBYhCQNAICAgCUEKbGohGiAYIQYDQCAdIAYgGmogE3BBAnRqKAIAIgMEQANAAkAgAygCECIEIAdGDQAgBCgCBCAKRw0AIAMoAgQgDEcNACADKAIIIAlHDQAgAygCDCAGRw0AQQEgBygCJCINIAQoAiQiBCAEIA1IIgUbQQdxdCEUIAQgG2wgBEEDdSAFGyANQQN1IA0gG2wgBRtqIgRBAE4gBCAcSHFFBEAgCEHRGzYCZCAIQcYrNgJgQQFBnMkAIAhB4ABqEI4BCwJAIBQgBCAeaiIELQAAIg1xDQAgAygCECgCICEFIAcoAiAiCy0ACEEEcQRAIAhBmCQ2AlQgCEHqEzYCUEEBQezGACAIQdAAahCOAQsgBS0ACEEEcQRAIAhBmCQ2AkQgCEHqEzYCQEEBQazGACAIQUBrEI4BCyALKAIQIhIEQCASIAUoAhBGDQELIAUoAkggCygCRHFFBEAgCygCSCAFKAJEcUUNAQsgCyoCLCAFKgIwXg0AIAsqAjAgBUEsaiISKgIAXQ0AIAsqAjQgBSoCOF4NACALKgI4IAUqAjRdDQAgCyoCPCAFQUBrKgIAXg0AIAtBQGsqAgAgBSoCPF0NACALIAUgEiALKAIAKAIMEQUARQ0AIAUgCyALQSxqIAUoAgAoAgwRBQBFDQAgASALIAUgAhEEAAsgBCANIBRyOgAACyADKAIAIgMNAAsLIAYgEEYhAyAGQQFqIQYgA0UNAAsgCSAXRiEDIAlBAWohCSADRQ0ACyAMIBVGIQMgDEEBaiEMIANFDQALCyAKQQFqIQMgEEEBdSEQIBhBAXUhGCAXQQF1IRcgFkEBdSEWIBVBAXUhFSAZQQF1IRkgCiARRw0ACwsgBygCACIHDQALIA9FDQEDQCAPIQcDQCAHKAIgIQMgDigCICIELQAIQQRxBEAgCEGYJDYCNCAIQeoTNgIwQQFB7MYAIAhBMGoQjgELIAMtAAhBBHEEQCAIQZgkNgIkIAhB6hM2AiBBAUGsxgAgCEEgahCOAQsCQCAEKAIQIgoEQCAKIAMoAhBGDQELIAMoAkggBCgCRHFFBEAgBCgCSCADKAJEcUUNAQsgBCoCLCADKgIwXg0AIAQqAjAgA0EsaiIKKgIAXQ0AIAQqAjQgAyoCOF4NACAEKgI4IAMqAjRdDQAgBCoCPCADQUBrKgIAXg0AIARBQGsqAgAgAyoCPF0NACAEIAMgCiAEKAIAKAIMEQUARQ0AIAMgBCAEQSxqIAMoAgAoAgwRBQBFDQAgASAEIAMgAhEEAAsgBygCACIHDQALIA4oAgAiDg0ACwsgD0UNAANAIA8oAgAiB0UNAQNAIAcoAiAhAyAPKAIgIgQtAAhBBHEEQCAIQZgkNgIUIAhB6hM2AhBBAUHsxgAgCEEQahCOAQsgAy0ACEEEcQRAIAhBmCQ2AgQgCEHqEzYCAEEBQazGACAIEI4BCwJAIAQoAhAiCgRAIAogAygCEEYNAQsgAygCSCAEKAJEcUUEQCAEKAJIIAMoAkRxRQ0BCyAEKgIsIAMqAjBeDQAgBCoCMCADQSxqIgoqAgBdDQAgBCoCNCADKgI4Xg0AIAQqAjggAyoCNF0NACAEKgI8IANBQGsqAgBeDQAgBEFAayoCACADKgI8XQ0AIAQgAyAKIAQoAgAoAgwRBQBFDQAgAyAEIARBLGogAygCACgCDBEFAEUNACABIAQgAyACEQQACyAHKAIAIgcNAAsgDygCACIPDQALCyAAIAAoAmBBAWs2AmALIAhBgAFqJAALugEBAn8jAEEQayIFJAAgAkEAIAMbRQRAIAVB+dAANgIAQQJB2d8AIAUQjgELIAAgACgCYEEBajYCYCAAIAAoAgAoAiARAQAgAigCCCIEQQRxBEAgBEECcQRAIAIQKyACIAIoAghBfXE2AggLIAIgAigCACgCCBEBACACIAIoAghBe3E2AggLIAAoAlAiBARAA0AgBCACIAEgAxBFIAQoAiAiBA0ACwsgACAAKAJgQQFrNgJgIAVBEGokAAs5AQF/QeQAEI4CIgEgAEEAECwiAEIANwJcIABCATcCVCAAQgA3AkwgAEEKNgIEIABByOMANgIAIAELRQEBf0HsABCOAiIBIABBABAsIgBCADcCXCAAQgE3AlQgAEIANwJMIABC/f///68BNwJkIABBCzYCBCAAQfzjADYCACABC5kBAQJ/IwBBQGoiAyQAIABFBEAgA0GrETYCMEECQdnfACADQTBqEI4BCyABIAJMIgRFBEAgA0GrETYCIEECQaXYACADQSBqEI4BCyAAKAIEQQtHBEAgA0GrETYCEEECQcDaACADQRBqEI4BCyAERQRAIANBoRE2AgBBAkHZ3wAgAxCOAQsgACACNgJoIAAgATYCZCADQUBrJAALbAEBfyMAQSBrIgMkACAARQRAIANBvxE2AhBBAkHZ3wAgA0EQahCOAQsgACgCBEELRwRAIANBvxE2AgBBAkHA2gAgAxCOAQsgAQRAIAEgACgCZDYCAAsgAgRAIAIgACgCaDYCAAsgA0EgaiQAC08BAX8jAEEgayIBJAAgAEUEQCABQYoJNgIQQQJB2d8AIAFBEGoQjgELIAAQOkUEQCABQYoJNgIAQQJBxNsAIAEQjgELIAAQMSABQSBqJAALVQEBfyMAQSBrIgIkACAARQRAIAJBqRc2AhBBAkHZ3wAgAkEQahCOAQsgABA6RQRAIAJBqRc2AgBBAkHE2wAgAhCOAQsgACABQQBHNgJUIAJBIGokAAtUAQF/IwBBIGsiASQAIABFBEAgAUHTFzYCEEECQdnfACABQRBqEI4BCyAAEDpFBEAgAUHTFzYCAEECQcTbACABEI4BCyAAKAJUIQAgAUEgaiQAIAALgAEBAX8jAEEwayICJAAgAEUEQCACQcIuNgIgQQJB2d8AIAJBIGoQjgELIAAQOkUEQCACQcIuNgIQQQJBxNsAIAJBEGoQjgELAkAgAEUNACAAKAJgRQ0AIAJBwi42AgBBAkHm2gAgAhCOAQsgACABIAAoAgAoAhQRAAAgAkEwaiQAC4ABAQF/IwBBMGsiAiQAIABFBEAgAkHGJDYCIEECQdnfACACQSBqEI4BCyAAEDpFBEAgAkHGJDYCEEECQcTbACACQRBqEI4BCwJAIABFDQAgACgCYEUNACACQcYkNgIAQQJB5toAIAIQjgELIAAgASAAKAIAKAIYEQAAIAJBMGokAAthAQF/IwBBIGsiAyQAIABBACACG0UEQCADQc4rNgIQQQJB2d8AIANBEGoQjgELIAAQOkUEQCADQc4rNgIAQQJBxNsAIAMQjgELIAAgASACIAAoAgAoAiQRBAAgA0EgaiQAC5MBAQN/IwBBEGsiAiQAIABBlOMANgIAIAAoAmAEQCACQZIsNgIAQQJB5toAIAIQjgELIAAoAlAhAQJAIAAoAlQEQCABRQ0BA0AgASgCICEDIAEQMSADIgENAAsMAQsgAUUNAANAIAEoAiAhAyAAIAEgACgCACgCGBEAACADIgENAAsLIAAQLkHkABCPAiACQRBqJAALkQEBA38jAEEQayICJAAgAEGU4wA2AgAgACgCYARAIAJBkiw2AgBBAkHm2gAgAhCOAQsgACgCUCEBAkAgACgCVARAIAFFDQEDQCABKAIgIQMgARAxIAMiAQ0ACwwBCyABRQ0AA0AgASgCICEDIAAgASAAKAIAKAIYEQAAIAMiAQ0ACwsgABAuIQEgAkEQaiQAIAELkwEBA38jAEEQayICJAAgAEGU4wA2AgAgACgCYARAIAJBkiw2AgBBAkHm2gAgAhCOAQsgACgCUCEBAkAgACgCVARAIAFFDQEDQCABKAIgIQMgARAxIAMiAQ0ACwwBCyABRQ0AA0AgASgCICEDIAAgASAAKAIAKAIYEQAAIAMiAQ0ACwsgABAuQewAEI8CIAJBEGokAAszAQF/IABBhOYANgIAAkAgACgCTCIBRQ0AIAAoAlBFDQAgASABKAIAKAIEEQEACyAAEC4LDwAgABBWGiAAQZgBEI8CC2wBAn8gACgCTCIBRQRAIABBLGpBBhCGAg8LIAEoAhghAiAAEFkgACgCTCIBIABB2ABqNgIYIAEgASgCACgCCBEBACAAIAAoAkwiASkCLDcCLCAAIAEpAjQ3AjQgACABKQI8NwI8IAEgAjYCGAuABQIPfwN9IAAgACgCGCICQRhqIgMqAgAgACgCTCgCGCIBKgIIlCACKgIQIAEqAgCUIAJBFGoiBCoCACABKgIElJKSIhA4AlggAEHcAGoiBSACQShqIgcqAgAgASoCCJQgAkEgaiIIKgIAIAEqAgCUIAJBJGoiCSoCACABKgIElJKSIhE4AgAgAEHgAGoiBiACQThqIgoqAgAgASoCCJQgAkEwaiILKgIAIAEqAgCUIAJBNGoiDCoCACABKgIElJKSIhI4AgAgACAQIAIqAgCSOAJYIAUgAioCBCARkjgCACAGIAIqAgggEpI4AgAgACADKgIAIAFBMGoiBSoCAJQgAioCECABKgIQlCAEKgIAIAFBIGoiBioCAJSSkjgCaCAAIAMqAgAgAUE0aiINKgIAlCACKgIQIAFBFGoiDioCAJQgBCoCACABQSRqIg8qAgCUkpI4AmwgACADKgIAIAFBOGoiAyoCAJQgAioCECABQRhqIgIqAgCUIAQqAgAgAUEoaiIEKgIAlJKSOAJwIAAgByoCACAFKgIAlCAIKgIAIAEqAhCUIAkqAgAgBioCAJSSkjgCeCAAIAcqAgAgDSoCAJQgCCoCACAOKgIAlCAJKgIAIA8qAgCUkpI4AnwgACAHKgIAIAMqAgCUIAgqAgAgAioCAJQgCSoCACAEKgIAlJKSOAKAASAAIAoqAgAgBSoCAJQgCyoCACABKgIQlCAMKgIAIAYqAgCUkpI4AogBIAAgCioCACANKgIAlCALKgIAIA4qAgCUIAwqAgAgDyoCAJSSkjgCjAEgACAKKgIAIAMqAgCUIAsqAgAgAioCAJQgDCoCACAEKgIAlJKSOAKQAQvKAwEGfyMAQUBqIgYkACAEQTNMBEAgBkGqGTYCNCAGQZMeNgIwQQFB3ckAIAZBMGoQjgELIAAoAgRBB0cEQCAGQaoZNgIkIAZBkx42AiBBAUHmNCAGQSBqEI4BCwJAIAAoAkwiBUUEQAwBCyAFKAIoBEAgBkGTHjYCEEECQYTcACAGQRBqEI4BIAAoAkwhBQsgBSgCEAR/IAZBkx42AgBBAkHf1AAgBhCOASAAKAJMIgUoAhAFQQALIQggBSgCGCEJIAAtAAhBBHEEQCAAEFkgACgCTCEFCyAFIABB2ABqNgIYIAUgACgCEDYCECAFIAEgAiADIAQQKiEHAkAgACgCVEUNACAHQQBMDQAgA0EkaiEDQQAhAkEAIQUgB0EETwRAIAdBfHEhCkEAIQEDQCADIAQgBWxqIAA2AgAgAyAFQQFyIARsaiAANgIAIAMgBUECciAEbGogADYCACADIAVBA3IgBGxqIAA2AgAgBUEEaiEFIAFBBGoiASAKRw0ACwsgB0EDcSIBRQ0AA0AgAyAEIAVsaiAANgIAIAVBAWohBSACQQFqIgIgAUcNAAsLIAAoAkwiBSAINgIQIAUgCTYCGAsgBkFAayQAIAcLRgEBf0GYARCOAiIBIABBARAsIgBBADYCVCAAQgA3AkwgAEEHNgIEIABBhOYANgIAIABB2ABqQQQQhgIgAEHoAGoQ5AIgAQtiAQJ/IwBBEGsiAiQAAkAgAARAIAAoAgRBB0YNAQsgAkGtHjYCAEECQePXACACEI4BCwJAIAAoAkwiA0UNACAAKAJQRQ0AIAMgAygCACgCBBEBAAsgACABNgJMIAJBEGokAAtCAQF/IwBBEGsiASQAAkAgAARAIAAoAgRBB0YNAQsgAUHDHjYCAEECQePXACABEI4BCyAAKAJMIQAgAUEQaiQAIAALQAEBfyMAQRBrIgIkAAJAIAAEQCAAKAIEQQdGDQELIAJBkBc2AgBBAkHj1wAgAhCOAQsgACABNgJQIAJBEGokAAtCAQF/IwBBEGsiASQAAkAgAARAIAAoAgRBB0YNAQsgAUG6FzYCAEECQePXACABEI4BCyAAKAJQIQAgAUEQaiQAIAALiwQCCX0CfyMAQRBrIhEkACAAIAM2AhggACAFQQNtNgIUIABBFGoiEiEFIARBAEcgAUEAR3EEQCAFIAE2AgwgBSAENgIICyAGQQtLIAJBC0txBEAgEiACNgIUIBIgBjYCEAsgAEEBOgAsIBFCgICAgBA3AgAgEUKigICAkCA3AgggESIFQQE2AgwgBUKBgICA4AQ3AgQgBSASNgIAIAAgBRCMAxpDAACAfyEKQwAAgP8hDQJAIANBAEoEQEEAIQVDAACA/yELQwAAgH8hCEMAAIB/IQlDAACA/yEMA0AgASoCCCIOIAkgCSAOXhshCSABKgIEIg8gCCAIIA9eGyEIIAEqAgAiECAKIAogEF4bIQogDiANIA0gDl0bIQ0gDyALIAsgD10bIQsgECAMIAwgEF0bIQwgASACaiEBIAVBAWoiBSADRw0ACwwBC0MAAID/IQxDAACAfyEJQwAAgH8hCEMAAID/IQsLIABCADcCVCAAQQA2ApQBIAAgBzYCUCAAQgA3AlwgAEIANwJkIABCADcCbCAAQgA3AnQgAEIANwJ8IABCADcChAEgAEIANwKMASAAIAkgDZJDAAAAP5QiCTgCOCAAIAggC5JDAAAAP5QiCDgCNCAAIAwgCpJDAAAAP5QiCjgCMCAAIA0gCZM4AkggACALIAiTOAJEIAAgDCAKkzgCQCARQRBqJAALVAECf0GYARCOAiIBIgBCADcCBCAAQezoADYCACAAQgA3AgwgAEGU6gA2AgAgAEEUaiIAQgA3AgAgAEEBOgAYIABCjICAgMABNwIQIABCADcCCCABCycBAX8gAARAIAAoApQBIgEEQCABEIoECyAAEIoDGiAAQZgBEI8CCwtAAQF/IwBBEGsiCCQAIABFBEAgCEGw0gA2AgBBAkG33QAgCBCOAQsgACABIAIgAyAEIAUgBiAHEGAgCEEQaiQAC0ABAX8jAEEQayIHJAAgAEUEQCAHQbDSADYCAEECQbfdACAHEI4BCyAAIAEgAiADIAQgBSAGQQAQYCAHQRBqJAALCgBB6KMBELQDGgsKAEGwpAEQ2wMaCwoAQfSkARDbAxoLAgALCgBBtKgBEM4DGgsKAEHIqgEQ2wMaCwkAQZirARDiAwsJAEHAqwEQ4gMLCQBBlKwBEOIDCwkAQcisARDiAwsuACAAQbzmADYCACAAQfQAakE4EAsgAEHoAGpB2AAQCyAAQdwAakEsEAsgABAuCw8AIAAQbxogAEGEARCPAgu5AgICfw59IAAoAhgiASoCOCEFIAEqAjAhCCABKgI0IQkgASoCKCEDIAEqAiAhCiABKgIkIQsgACABKgIYIgQgACgCWCICKgI4IgyUIAEqAhAiBiACKgIwIg2UIAEqAhQiByACKgI0Ig6UkpIiECABKgIAkiAGIAIqAkAiD5SLIAcgAioCRCIGlIuSIAQgAioCSCIHlIuSIgSTOAIsIAAgBCAQIAEqAgCSkjgCMCAAIAMgDJQgCiANlCAOIAuUkpIiBCABKgIEkiAPIAqUiyAGIAuUi5IgByADlIuSIgOTOAI0IAAgAyAEIAEqAgSSkjgCOCAAIAUgDJQgCCANlCAOIAmUkpIiAyABKgIIkiAPIAiUiyAGIAmUi5IgByAFlIuSIgWTOAI8IABBQGsgBSADIAEqAgiSkjgCAAuzAgEDf0GEARCOAiIGIQcjAEEQayIFJAAgByAAQQEQLCIAQgA3AlwgAEG85gA2AgAgACABNgJYIABBCDYCBCAAQgA3AmQgAEIANwJsIABCADcCdCAAQQA2AnxBhKgBQcisATYCAEHEqgFBgQI7AQBB7KMBQeyjASgCAEECcjYCAEG0pAFBtKQBKAIAQRJyNgIAQfikAUH4pAEoAgBBAnI2AgBBuKgBQbioASgCAEF8cTYCAEHMqgFBzKoBKAIAQX1xNgIAIABBADoAggEgAEEAOwGAAUG0qAEQjgMiBwRAIAVB+AM2AgggBUGzGjYCBCAFQaPUADYCAEECIAcgBRCOAQtBzKoBQcyqASgCAEFucUEQcjYCACAFQRBqJAAgBiAENgJUIAYgAzYCUCAGIAI2AkwgBguWSQILfzl9IwBB0AZrIgUkACABEDchByABEDYhBkHgrAEgByoCADgCAEHkrAEgByoCBDgCAEHorAEgByoCCDgCAEHsrAEgByoCDDgCAEHwrAEgByoCEDgCAEH0rAEgByoCFDgCAEH4rAEgByoCGDgCAEH8rAEgByoCHDgCAEGArQEgByoCIDgCAEGErQEgByoCJDgCAEGIrQEgByoCKDgCAEGMrQEgByoCLDgCAEGQrQEgBioCADgCAEGgrQEgBioCBDgCAEGorQEgBioCCDgCACABQbCtARAQQbCtAUGwrQEqAgBDAAAAP5Q4AgBBtK0BQbStASoCAEMAAAA/lDgCAEG4rQFBuK0BKgIAQwAAAD+UOAIAIAAQNyEIIAAQNiEJQcStASAENgIAQcitASACNgIAQcytASADNgIAQdCtASAANgIAQdStASABNgIAQditAUH////7BzYCAEHArQFBADYCAEHgrQFBADYCAEHwrQFBADYCAEH4rQFBADYCACAFIAYqAgA4AuQCIAUgBioCBDgC6AIgBSAGKgIIOALsAiAFQbCtASoCADgC8AIgBUG0rQEqAgA4AvQCIAVBuK0BKgIAOAL4AiAFIAcqAgA4AvwCIAUgByoCBDgCiAMgBSAHKgIIOAKUAyAFIAcqAhA4AoADIAUgByoCFDgCjAMgBSAHKgIYOAKYAyAFIAcqAiA4AoQDIAUgByoCJDgCkAMgBSAHKgIoOAKcAyAFIAcqAgA4AqQCIAVBtAJqIgQgByoCBDgCACAFQcQCaiICIAcqAgg4AgAgBSAHKgIQOAKoAiAFIAcqAhQ4ArgCIAUgByoCGDgCyAIgBUGsAmoiAyAHKgIgOAIAIAVBvAJqIgogByoCJDgCACAFQcwCaiILIAcqAig4AgAgBUHUAmoiByAGKgIAOAIAIAUgBioCBDgC2AIgBioCCCEQIAVBADYCwAIgBUEANgLQAiAFQdwCaiIGIBA4AgAgBUGAgID8AzYC4AIgBSAEKQIANwPwASAFIAIpAgA3A4ACIAUgBykCADcDkAIgBUEANgKwAiAFIAMpAgA3A+gBIAUgCikCADcD+AEgBSALKQIANwOIAiAFIAYpAgA3A5gCIAUgBSkCpAI3A+ABIAVBoAFqIAVB4AFqEOUDAkAgAC0AgQEEQAJAAkAgACgCaCIEQQBKBEAgACgCcCEGQQAhBwNAIAYgB0HYAGxqKAJUIAFGDQIgB0EBaiIHIARHDQALCyAAQegAaiEEIAVByABqQQBB2AAQ7gMaIAVByABqEOEDIgdCADcCOCAHQc2Zs/wDNgJQIAdBADYCECAHQgA3AhQgB0IANwIwIAdBQGtCADcCACAHQgA3AhwgB0IANwIkIAdCgICAgICAgMA/NwJIIAdBgICA/AM2AiwgB0GAgID8AzYCPCAAKAJoIgZBAWohAgJAIAAoAmwgBkoEQCAEIAI2AgAMAQsgBCACQdgAEAwgBCgCAEEBayEGCyAAQfAAaiIEKAIAIAZB2ABsaiAHQdgAEOwDGiAHEOIDIAQoAgAgACgCaEHYAGxqQdgAayIHQc2Zs/wDNgJQIAcgATYCVAwBCyAGIAdB2ABsaiEHC0H4pAFB+KQBKAIAQQJyNgIAIAAoAlghBiAFIAgqAgA4AqQCIAUgCCoCBDgCtAIgBSAIKgIIOALEAiAFIAgqAhA4AqgCIAUgCCoCFDgCuAIgBSAIKgIYOALIAiAFIAgqAiA4AqwCIAUgCCoCJDgCvAIgBSAIKgIoOALMAiAFIAkqAgA4AtQCIAUgCSoCBDgC2AIgCSoCCCEQIAVBgICA/AM2AuACIAVBADYC0AIgBUEANgLAAiAFQQA2ArACIAUgEDgC3AIgByAFQeQCaiAGIAVBpAJqEI8DDAELQfikAUH4pAEoAgBBfXE2AgAgACgCWCEHIAUgCCoCADgCpAIgBSAIKgIEOAK0AiAFIAgqAgg4AsQCIAUgCCoCEDgCqAIgBSAIKgIUOAK4AiAFIAgqAhg4AsgCIAUgCCoCIDgCrAIgBSAIKgIkOAK8AiAFIAgqAig4AswCIAUgCSoCADgC1AIgBSAJKgIEOALYAiAJKgIIIRAgBUGAgID8AzYC4AIgBUEANgLQAiAFQQA2AsACIAVBADYCsAIgBSAQOALcAkHAqwEgBUHkAmogByAFQaQCahCPAwtBACEHQfikAS0AAEEEcQRAAkBBhKUBKAIAIgdFDQAgBygCBCIMRQ0AIAcoAgghDyAAKAJQIgcEQCAAIAEgDyAMIAcRBgALIAxBAEwNAEHArQEoAgAhBwNAIA8gDUECdGohDgJAIAAoAkwiBgRAIAAgASAOKAIAIAYRBQBFDQELIAAgDigCACAJIAggBUEQahApQditAUH////7BzYCAEGArgEgBSoCICI+IAUqAhAiJ5MiGjgCAEGErgEgBSoCJCI/IAUqAhQiMZMiFTgCAEGIrgEgBSoCKCJAIAUqAhgiN5MiEzgCAEGQrgEgBSoCMCJBICeTIhc4AgBBlK4BIAUqAjQiQiAxkyIWOAIAQZiuASAFKgI4IkMgN5MiGzgCAEGorgEgGyATkyIyOAIAQaSuASAWIBWTIjM4AgBBoK4BIBcgGpMiLTgCAEH8rQFBADYCAEHArgEgEyAXlCAbIBqUkyIQOAIAQbCuASAVIBuUIBYgE5STIhE4AgBByK4BIBogFpQgFyAVlJMiEjgCAAJAQbitASoCACIuIBJBiK0BKgIAIiiUIBFB6KwBKgIAIiOUIBBB+KwBKgIAIimUkpIiPYuUQbCtASoCACIkIBJBgK0BKgIAIh6UIBFB4KwBKgIAIh2UIBBB8KwBKgIAIiCUkpIiGIuUIBJBhK0BKgIAIiqUIBFB5KwBKgIAIiWUIBBB9KwBKgIAIiuUkpIiNItBtK0BKgIAIi+UkpIgEiA3QaitASoCACI5kyIflCARICdBkK0BKgIAIjqTIiGUIBAgMUGgrQEqAgAiO5MiIpSSkpIiFEMAAAAAXQ0AQQAhBgJ9Q///f38gEiASlCARIBGUIBAgEJSSkpEiJkMAAAAAXkUNABpD//9/f0MAAIA/ICaVIiYgFJQiFEP//39/XUUNABpBASEGQfytAUEBNgIAQditASAUOAIAQfCtASAmIBCMlDgCAEHgrQEgJiARjJQ4AgBB+K0BICYgEoyUOAIAIBQLIRwgJCAeIB+UIB0gIZQgICAilJKSIhAgECAeIBuUIB0gF5QgFiAglJKSIjiSIhEgECARXRsgHiATlCAdIBqUIBUgIJSSkiImIBCSIhIgESARIBJeGyAQIBJdG5MiFEMAAAAAXQ0AICQgECARIBAgEV4bIBIgESARIBJdGyAQIBJeG5IiEEMAAAAAXQ0AIB4hESAgIRIgHSEZIBAgFF0EQCARjCERIBKMIRIgHYwhGSAQIRQLIBQgHF0EQEHwrQEgEjgCAEHgrQEgGTgCAEH4rQEgETgCAEECIQZB/K0BQQI2AgBB2K0BIBQ4AgAgFCEcCyAvICogH5QgJSAhlCArICKUkpIiECAQICogG5QgJSAXlCAWICuUkpIiNZIiESAQIBFdGyAqIBOUICUgGpQgFSArlJKSIhkgEJIiEiARIBEgEl4bIBAgEl0bkyIUQwAAAABdDQAgLyAQIBEgECARXhsgEiARIBEgEl0bIBAgEl4bkiIQQwAAAABdDQAgKiERICshEiAlISwgECAUXQRAIBGMIREgEowhEiAljCEsIBAhFAsgFCAcXQRAQfCtASASOAIAQeCtASAsOAIAQfitASAROAIAQQMhBkH8rQFBAzYCAEHYrQEgFDgCACAUIRwLIC4gKCAflCAjICGUICkgIpSSkiIQIBAgKCAblCAjIBeUIBYgKZSSkiI2kiIRIBAgEV0bICggE5QgIyAalCAVICmUkpIiLCAQkiISIBEgESASXhsgECASXRuTIhRDAAAAAF0NACAuIBAgESAQIBFeGyASIBEgESASXRsgECASXhuSIhBDAAAAAF0NACAoIREgKSESICMhMCAQIBRdBEAgEYwhESASjCESICOMITAgECEUCyAUIBxdBEBB8K0BIBI4AgBB4K0BIDA4AgBB+K0BIBE4AgBBBCEGQfytAUEENgIAQditASAUOAIAIBQhHAsgLyAsiyJElCAZiyJFIC6UkiIsIB0gFZQgGiAglJMiEiAflCAgIBOUIBUgHpSTIhQgIZQgHiAalCATIB2UkyIZICKUkpIiECAYIBCSIhEgECARXSIEG5MiMEMAAAAAXQ0AICwgESAQIAQbkiIQQwAAAABdDQACQCAQIDBdRQRAIDAhEAwBCyASjCESIBmMIRkgFIwhFAsgIIwhLCAdjCEwIB6MITwCQCASIBKUIBQgFJQgGSAZlJKSkSIRQwAAAABeRQ0AIBBDAACAPyARlSIRlCIQQwAAwD+UIBxdRQ0AQQUhBkH8rQFBBTYCAEHYrQEgEDgCAEHwrQEgGSARlDgCAEHgrQEgFCARlDgCAEH4rQEgEiARlDgCACAQIRwLIC8gNosiRpQgNYsiRyAulJIiNSAdIBaUIBcgLJSSIhIgH5QgICAblCAWIDyUkiIUICGUIB4gF5QgGyAwlJIiGSAilJKSIhAgECAYkyIRIBAgEV0iBBuTIjZDAAAAAF0NACA1IBEgECAEG5IiEEMAAAAAXQ0AAkAgECA2XUUEQCA2IRAMAQsgEowhEiAZjCEZIBSMIRQLAkAgEiASlCAUIBSUIBkgGZSSkpEiEUMAAAAAXkUNACAQQwAAgD8gEZUiEZQiEEMAAMA/lCAcXUUNAEEGIQZB/K0BQQY2AgBB2K0BIBA4AgBB8K0BIBkgEZQ4AgBB4K0BIBQgEZQ4AgBB+K0BIBIgEZQ4AgAgECEcCyAvICggMpQgIyAtlCAzICmUkpKLIjaUICogMpQgJSAtlCAzICuUkpKLIkggLpSSIjUgHSAzlCAtICyUkiISIB+UICAgMpQgMyA8lJIiFCAhlCAeIC2UIDIgMJSSIhkgIpSSkiIQIBAgGJMiESAQIBFdIgQbkyIYQwAAAABdDQAgNSARIBAgBBuSIhBDAAAAAF0NAAJAIBAgGF1FBEAgGCEQDAELIBKMIRIgGYwhGSAUjCEUCwJAIBIgEpQgFCAUlCAZIBmUkpKRIhFDAAAAAF5FDQAgEEMAAIA/IBGVIhGUIhBDAADAP5QgHF1FDQBBByEGQfytAUEHNgIAQditASAQOAIAQfCtASAZIBGUOAIAQeCtASAUIBGUOAIAQfitASASIBGUOAIAIBAhHAsgJCBElCAmiyIsIC6UkiImICUgFZQgGiArlJMiEiAflCArIBOUIBUgKpSTIhQgIZQgKiAalCATICWUkyIYICKUkpIiECA0IBCSIhEgECARXSIEG5MiGUMAAAAAXQ0AICYgESAQIAQbkiIQQwAAAABdDQACQCAQIBldRQRAIBkhEAwBCyASjCESIBiMIRggFIwhFAsgK4whJiAljCEZICqMITUCQCASIBKUIBQgFJQgGCAYlJKSkSIRQwAAAABeRQ0AIBBDAACAPyARlSIRlCIQQwAAwD+UIBxdRQ0AQQghBkH8rQFBCDYCAEHYrQEgEDgCAEHwrQEgGCARlDgCAEHgrQEgFCARlDgCAEH4rQEgEiARlDgCACAQIRwLICQgRpQgOIsiPCAulJIiMCAlIBaUIBcgJpSSIhIgH5QgKyAblCAWIDWUkiIUICGUICogF5QgGyAZlJIiGCAilJKSIhAgECA0kyIRIBAgEV0iBBuTIjhDAAAAAF0NACAwIBEgECAEG5IiEEMAAAAAXQ0AAkAgECA4XUUEQCA4IRAMAQsgEowhEiAYjCEYIBSMIRQLAkAgEiASlCAUIBSUIBggGJSSkpEiEUMAAAAAXkUNACAQQwAAgD8gEZUiEZQiEEMAAMA/lCAcXUUNAEEJIQZB/K0BQQk2AgBB2K0BIBA4AgBB8K0BIBggEZQ4AgBB4K0BIBQgEZQ4AgBB+K0BIBIgEZQ4AgAgECEcCyAkIDaUIB4gMpQgHSAtlCAzICCUkpKLIjYgLpSSIjggJSAzlCAtICaUkiISIB+UICsgMpQgMyA1lJIiFCAhlCAqIC2UIDIgGZSSIhggIpSSkiIQIBAgNJMiESAQIBFdIgQbkyI0QwAAAABdDQAgOCARIBAgBBuSIhBDAAAAAF0NAAJAIBAgNF1FBEAgNCEQDAELIBKMIRIgGIwhGCAUjCEUCwJAIBIgEpQgFCAUlCAYIBiUkpKRIhFDAAAAAF5FDQAgEEMAAIA/IBGVIhGUIhBDAADAP5QgHF1FDQBBCiEGQfytAUEKNgIAQditASAQOAIAQfCtASAYIBGUOAIAQeCtASAUIBGUOAIAQfitASASIBGUOAIAIBAhHAsgJCBFlCAsIC+UkiIUICMgFZQgGiAplJMiEiAflCApIBOUIBUgKJSTIhUgIZQgKCAalCATICOUkyITICKUkpIiECA9IBCSIhEgECARXSIEG5MiGEMAAAAAXQ0AIBQgESAQIAQbkiIQQwAAAABdDQACQCAQIBhdRQRAIBghEAwBCyASjCESIBOMIRMgFYwhFQsgKYwhFCAjjCEYICiMITQCQCASIBKUIBUgFZQgEyATlJKSkSIRQwAAAABeRQ0AIBBDAACAPyARlSIRlCIQQwAAwD+UIBxdRQ0AQQshBkH8rQFBCzYCAEHYrQEgEDgCAEHwrQEgEyARlDgCAEHgrQEgFSARlDgCAEH4rQEgEiARlDgCACAQIRwLICQgR5QgPCAvlJIiJiAjIBaUIBcgFJSSIhIgH5QgKSAblCAWIDSUkiIVICGUICggF5QgGyAYlJIiEyAilJKSIhAgECA9kyIRIBAgEV0iBBuTIhZDAAAAAF0NACAmIBEgECAEG5IiEEMAAAAAXQ0AAkAgECAWXUUEQCAWIRAMAQsgEowhEiATjCETIBWMIRULAkAgEiASlCAVIBWUIBMgE5SSkpEiEUMAAAAAXkUNACAQQwAAgD8gEZUiEZQiEEMAAMA/lCAcXUUNAEEMIQZB/K0BQQw2AgBB2K0BIBA4AgBB8K0BIBMgEZQ4AgBB4K0BIBUgEZQ4AgBB+K0BIBIgEZQ4AgAgECEcCyAkIEiUIDYgL5SSIhYgIyAzlCAtIBSUkiISIB+UICkgMpQgMyA0lJIiFSAhlCAoIC2UIDIgGJSSIhMgIpSSkiIQIBAgPZMiESAQIBFdIgQbkyIbQwAAAABdDQAgFiARIBAgBBuSIhBDAAAAAF0NAAJAIBAgG11FBEAgGyEQDAELIBKMIRIgE4whEyAVjCEVCwJ/AkAgEiASlCAVIBWUIBMgE5SSkpEiEUMAAAAAXgRAIBBDAACAPyARlSIWlCIQQwAAwD+UIBxdDQELIAZFDQJB4K0BKgIAIRUgBkEFTwRAQfitASoCACEQQfCtASoCACERIAZBBWtB/wFxQQNwDAILIAZBAUYEQCAFIB0gFYwiGpQgIEHwrQEqAgAiEZSTIB5B+K0BKgIAIhKUkyIQOALABiAFICUgGpQgKyARlJMgKiASlJMiFTgCxAYgBSAjIBqUICkgEZSTICggEpSTIhM4AsgGIBOLIRMCQCAViyIVIBCLIhBeBEBBAUECIBMgFV0iBBshBkECQQEgBBshBEEAIQIMAQtBAkEBIBAgE14iAhshBCACQQFzQQF0IQYgAkECdCIDQbCtAWoqAgAhJCADQeCsAWoqAgAhHQsgBkECdCIGQYCtAWoqAgAhGyAGQfCsAWoqAgAhHiAEQQJ0IgRBgK0BaioCACEVIAJBAnQiAkGArQFqKgIAISAgBEHwrAFqKgIAIRMgAkHwrAFqKgIAIR8gBSAEQbCtAWoqAgAiECAEQeCsAWoqAgAiIZQiFiAkIB2UIh0gBkGwrQFqKgIAIheMIBcgBUHABmogBnIqAgBDAAAAAF4bIhcgBkHgrAFqKgIAlCA6ICeTkiInkiIikjgCsAYgBSAWICcgHZMiHZI4AqAGIAUgISAQjCIWlCInIB2SOAKQBiAFICcgIpI4AoAGIAUgECATlCIdICQgH5QiJyAXIB6UIDsgMZOSIh6SIjGSOAK0BiAFIB0gHiAnkyIekjgCpAYgBSAWIBOUIhMgHpI4ApQGIAUgEyAxkjgChAYgBSAQIBWUIhAgJCAglCITIBcgG5QgOSA3k5IiF5IiG5I4ArgGIAUgECAXIBOTIhOSOAKoBiAFIBYgFZQiECATkjgCmAYgBSAQIBuSOAKIBkEAIQYgBUEANgLMAyAFQQA2AvgEIAVCADcD8AQgBUEANgKIBSAFQgA3A4AFIAVBADYCmAUgBUIANwOQBSAFQQA2AugDIAVCADcD4AMgBUEANgL4AyAFQgA3A/ADIAVBADYCyAMgBUEANgKIBCAFQgA3A4AEIAVBADYCqAUgBUIANwOgBSAFQQA2ApgEIAVCADcDkAQgBUEANgK4BSAFQgA3A7AFIAVBADYCqAQgBUIANwOgBCAFQQA2AsgFIAVCADcDwAUgBUEANgK4BCAFQgA3A7AEIAVBADYC2AUgBUIANwPQBSAFQQA2AsgEIAVCADcDwAQgBUEANgLoBSAFQgA3A+AFIAVBADYC2AQgBUIANwPQBCAFQQA2AvgFIAVCADcD8AUgBUEANgLoBCAFQgA3A+AEIAVBsK4BKgIAjDgCsAMgBUHArgEqAgCMOAK0AyAFQciuASoCAIw4ArgDIAVBsANqENACIAVBADYC3AMgBSAFKgKwAzgC0AMgBSAFKQK0AzcC1AMgBUGABmpBBCAFQfAEaiAFQcwDaiAFQdADahB0IAVBwK4BKgIAIhAgBSoCKCAFKgIYkyIVlCAFKgIkIAUqAhSTIhNByK4BKgIAIheUkzgCsAMgBUGwrgEqAgAiFiATlCAQIAUqAiAgBSoCEJMiE5STOAK4AyAFIBcgE5QgFSAWlJM4ArQDIAVBsANqENACIAVBADYC3AMgBSAFKgKwAzgC0AMgBSAFKQK0AzcC1AMgBUHwBGogBSgCzAMgBUHgA2ogBUHIA2ogBUHQA2oQdCAFQcCuASoCACIQIAUqAjggBSoCKJMiFZQgBSoCNCAFKgIkkyITQciuASoCACIXlJM4ArADIAVBsK4BKgIAIhYgE5QgECAFKgIwIAUqAiCTIhOUkzgCuAMgBSAXIBOUIBUgFpSTOAK0AyAFQbADahDQAiAFIAUqArADIhM4AtADIAUgBSoCtAMiFzgC1AMgBSAFKgK4AyIVOALYAyAFIBUgBSoCGCAFKgI4kyIQlCATIAUqAhAgBSoCMJMiFZQgFyAFKgIUIAUqAjSTIhOUkpI4AtwDIAVB4ANqIAUoAsgDIAVB8ARqIAVBzANqIAVB0ANqEHQgBUHArgEqAgAiFyAQlCATQciuASoCACIWlJM4ArADIAVBsK4BKgIAIhsgE5QgFSAXlJM4ArgDIAUgFiAVlCAQIBuUkzgCtAMgBUGwA2oQ0AIgBUEANgLcAyAFIAUqArADOALQAyAFIAUpArQDNwLUAyAFQfAEaiAFKALMAyAFQeADaiAFQcgDaiAFQdADahB0IAUoAsgDIgJBAEwNAyASjCEVIBGMIRMDQCAFQeADaiAGQQR0aiIEKgIIIRAgBCoCBCERIAUgBCoCACISIAUqAhCSOAKgAyAFIBEgBSoCFJI4AqQDIAUgECAFKgIYkjgCqANByK0BKAIAQcytASgCAEHErQEoAgBB0K0BKAIAQdStASgCACAFQaADakMAAAAAIBUgEJQgGiASlCARIBOUkpIiECAQQwAAAABeG4wQdSAGQQFqIgYgAkcNAAsMAwtBASEDAkACfwJAAkAgBkECayICDgIDAAELQQIMAQtBAQshBkEAIQMLQfitASoCACETQfCtASoCACEXIAUgHzgCiAYgBSAiOAKEBiAFICE4AoAGIAUgQyA5kzgCqAYgBSBCIDuTOAKkBiAFIEEgOpM4AqAGIAUgQCA5kzgCmAYgBSA/IDuTOAKUBiAFID4gOpM4ApAGQQAhBCAFQQA2AvgEIAVCADcD8AQgBUEANgKIBSAFQgA3A4AFIAVBADYCmAUgBUIANwOQBSAFQQA2AqgFIAVCADcDoAUgBUEANgLoAyAFQgA3A+ADIAVBADYC+AMgBUIANwPwAyAFQQA2AogEIAVCADcDgAQgBUEANgKYBCAFQgA3A5AEIAVBADYCuAUgBUIANwOwBSAFQQA2AqgEIAVCADcDoAQgBUEANgLIBSAFQgA3A8AFIAVBADYCuAQgBUIANwOwBCAFQQA2AtgFIAVCADcD0AUgBUEANgLIBCAFQgA3A8AEIAVBADYC6AUgBUIANwPgBSAFQQA2AtgEIAVCADcD0AQgBUEANgL4BSAFQgA3A/AFIAVBADYC6AQgBUIANwPgBCAFIBOMOALIBiAFIBeMOALEBiAFIBWMOALABiAFIAJBAnRBsK0BaiICKgIAOALMBiAFQYAGakEDIAVB8ARqIAVBsANqIAVBwAZqEHQgA0ECdCIDQeCsAWoqAgAhECADQfCsAWoqAgAhESAFIANBgK0BaioCACISOALIBiAFIBE4AsQGIAUgEDgCwAYgBSADQbCtAWoqAgAiGjgCzAYgBUHwBGogBSgCsAMgBUHgA2ogBUGgA2ogBUHABmoQdCAFIBo4AswGIAUgEow4AsgGIAUgEYw4AsQGIAUgEIw4AsAGIAVB4ANqIAUoAqADIAVB8ARqIAVBsANqIAVBwAZqEHQgBkECdCIGQeCsAWoqAgAhECAGQRByQeCsAWoqAgAhESAFIAZBIHJB4KwBaioCACISOALIBiAFIBE4AsQGIAUgEDgCwAYgBSAGQbCtAWoqAgAiGjgCzAYgBUHwBGogBSgCsAMgBUHgA2ogBUGgA2ogBUHABmoQdCAFIBo4AswGIAUgEow4AsgGIAUgEYw4AsQGIAUgEIw4AsAGIAVB4ANqIAUoAqADIAVB8ARqIAVBsANqIAVBwAZqEHQgBSgCsAMiA0EATA0CA0AgBUHwBGogBEEEdGoiBioCCCEQIAYqAgQhESACKgIAIRIgBSAGKgIAIhpBkK0BKgIAkjgC0AMgBSARQaCtASoCAJI4AtQDIAUgEEGorQEqAgCSOALYA0HIrQEoAgBBzK0BKAIAQcStASgCAEHQrQEoAgBB1K0BKAIAIAVB0ANqQwAAAAAgEyAQlCAVIBqUIBcgEZSSkiASkyIQIBBDAAAAAF4bjBB1IARBAWoiBCADRw0ACwwCC0H8rQFBDTYCAEHYrQEgEDgCAEHwrQEgEyAWlCIROAIAQeCtASAVIBaUIhU4AgBB+K0BIBIgFpQiEDgCAEECCyEGIC8gL4wgECAqlCAVICWUICsgEZSSkkMAAAAAXhsiEiAqlCAkICSMIBAgHpQgFSAdlCAgIBGUkpJDAAAAAF4bIhMgHpQgOZKSIRYgLiAujCAQICiUIBUgI5QgKSARlJKSQwAAAABeGyIQICiUIREgEiArlCATICCUIDuSkiEVIBAgKZQhGyASICWUIBMgHZQgOpKSIRIgECAjlCEQAn8CQAJAAkAgBg4CAAECCyAFIBo4AvAEQYiuASEGQYSuAQwCCyAFIBc4AvAEQZiuASEGIEEhJyBCITEgQyE3QZSuAQwBCyAFIC04AvAEQaiuASEGID4hJyA/ITEgQCE3QaSuAQshBCARIBaSIRogGyAVkiEVIBAgEpIhEyAFIAQqAgA4AvQEIAUgBioCADgC+AQgBUHwBGoQ0AJDAAAAACEQQwAAAAAhEUMAAIA/QfytASgCAEEFa0EDbUECdCIGQYCtAWoqAgAiFyAFKgL4BCIWlCAGQeCsAWoqAgAiGyAFKgLwBCIdlCAGQfCsAWoqAgAiHiAFKgL0BCIglJKSIhIgEpSTIh9DAAAAAF4EQCASIBcgNyAakyIQlCAbICcgE5MiEZQgMSAVkyIhIB6UkpIiIpQgFiAQlCAdIBGUICEgIJSSkiIQk0MAAIA/IB+VIh+UIREgIiASIBCUkyAflCEQCyAFIBcgEJQgGpIgFiARlCA3kpJDAAAAP5Q4AugDIAUgHiAQlCAVkiAgIBGUIDGSkkMAAAA/lDgC5AMgBSAbIBCUIBOSIB0gEZQgJ5KSQwAAAD+UOALgA0HIrQEoAgBBzK0BKAIAQcStASgCAEHQrQEoAgBB1K0BKAIAIAVB4ANqQditASoCABB1CyAHQcCtASgCAE4NAEHIrQEvAQAhA0HErQEoAgAiBiEKQcytASgCACIEIQsDQCAOKAIAIQIgByADQf//A3FPBEAgBUH/IzYCBCAFQdfNADYCAEEBQZ/KACAFEI4BQcStASgCACEKQcytASgCACELQcitAS8BACEDCyAEIAYgB2xqIAI2AiwgCiEGIAshBCAHQQFqIgdBwK0BKAIASA0ACwsgDUEBaiINIAxHDQALC0HArQEoAgAhBwsgBUHQBmokACAHC/8CAgd/B30gA0EANgIAIAFBAEoEQCABQQFrIQcDQCAEKgIIIg0gACAFIgtBBHRqIggqAgiUIAQqAgAiDCAIKgIAlCAEKgIEIg4gCCoCBJSSkiEPIAAgB0EEdGoiBUEIaiEHIAVBBGohCSANIAUqAgiUIAwgBSoCACIQlCAOIAUqAgSUkpIgBCoCDCIMkiINQwAAAABgBEAgAiAGQQR0aiIKIBA4AgAgCiAJKgIAOAIEIAogByoCADgCCCADIAZBAWoiBjYCAAsCQCAMIA+SIgxDAAAAAF0gDUMAAAAAXnFFBEAgDUMAAAAAXUUNASAMQwAAAABeRQ0BCyAIKgIAIRAgBSoCACEOIAgqAgQhESAJKgIAIQ8gAiAGQQR0aiIFIAcqAgAiEiANIBIgCCoCCJOUIA0gDJMiDJWTOAIIIAUgDyANIA8gEZOUIAyVkzgCBCAFIA4gDSAOIBCTlCAMlZM4AgAgAyAGQQFqIgY2AgALIAsiB0EBaiIFIAFHDQALCwu8AwIEfwF9IwBBIGsiCCQAAkBBwK0BKAIAIgcgAEH//wNxIglGDQAgB0EASgRAQQAhAANAIAAgCU8EQCAIQf8jNgIUIAhB180ANgIQQQFBn8oAIAhBEGoQjgELAkAgBSoCCCABIAAgAmxqIgcqAgiTIgsgC5QgBSoCACAHKgIAkyILIAuUIAUqAgQgByoCBJMiCyALlJKSQwAAADRdRQ0AQfitASoCACAHKgIYlEHgrQEqAgAgByoCEJRB8K0BKgIAIAcqAhSUkpKLQ/7/fz9eRQ0AQQEhCiAHKgIgIAZdRQ0AIAcgBjgCIAsgAEEBaiIAQcCtASgCACIHSA0ACyAKDQELIAchACAHIAlPBEAgCEH/IzYCBCAIQdfNADYCAEEBQZ/KACAIEI4BQcCtASgCACEACyABIAIgB2xqIgcgBSoCADgCACAHIAUqAgQ4AgQgBSoCCCELIAdBADYCDCAHIAs4AgggB0HgrQEqAgA4AhAgB0HwrQEqAgA4AhRB+K0BKgIAIQsgByAENgIoIAcgAzYCJCAHIAY4AiAgB0EANgIcIAcgCzgCGEHArQEgAEEBajYCAAsgCEEgaiQAC9E3Ax19CX8BfiMAQaACayIjJABB0K4BIAA2AgBBzK4BIAE2AgBB4K4BIAEQNyIBKQIANwMAQYivASABKQIoNwMAQYCvASABKQIgNwMAQfiuASABKQIYNwMAQfCuASABKQIQNwMAQeiuASABKQIINwMAQZCvAUHMrgEoAgAQNiIBKQIANwMAQZivASABKQIINwMAQaCvAUHorgEqAgA4AgBBsK8BQfiuASoCADgCAEG4rwFBiK8BKgIAOAIAQcyuASgCAEG8rwFBwK8BEBhBwK8BQbyvASoCACIHIAeSQcCvASoCAJI4AgBB0K8BIAAQNyIBKQIANwMAQfivASABKQIoNwMAQfCvASABKQIgNwMAQeivASABKQIYNwMAQeCvASABKQIQNwMAQdivASABKQIINwMAQYCwASAAEDYiASkCADcDAEGIsAEgASkCCDcDAEGQsAEgBDYCAEGUsAEgAjYCAEGYsAEgAzYCAEGgsAFB////ezYCAEGcsAFBADYCAEGksAFBADYCAEGosAFBADYCAEGwsAFBADYCAEHAsAFBADYCAEHIsAFBADYCAEGQrwEpAwAhK0GYrwEqAgAhDEHgrgEqAgAhDUG8rwEqAgAhB0HArwEqAgAhCUHwrgEqAgAhCkGArwEqAgAhCEHkrgEqAgAhGEH0rgEqAgAhGUGErwEqAgAhGkHorgEqAgAhE0H4rgEqAgAhFSAjIgRBiK8BKgIAOAKMAiAEIBU4AogCIAQgEzgChAIgBCAaOAKAAiAEIBk4AvwBIAQgGDgC+AEgBCAIOAL0ASAEIAo4AvABIAQgCUMAAAA/lDgC6AEgBCAHOALkASAEIA04AuwBIAQgBzgC4AEgBCAMOALcASAEICs3AtQBIARB0K8BKgIAOAKUASAEQdSvASoCADgCpAEgBEHYrwEqAgA4ArQBIARB4K8BKgIAOAKYASAEQeSvASoCADgCqAEgBEHorwEqAgA4ArgBIARB8K8BKgIAOAKcASAEQfSvASoCADgCrAEgBEH4rwEqAgA4ArwBIARBgLABKgIAOALEASAEQYSwASoCADgCyAEgBEGIsAEqAgA4AswBIARBADYCsAEgBEEANgLAASAEQYCAgPwDNgLQASAEQQA2AqABQfikAQJ/IAAtAIEBBEACQAJAIAAoAmgiA0EASgRAIAAoAnAhAkEAIQFBzK4BKAIAISIDQCACIAFB2ABsaigCVCAiRg0CIAFBAWoiASADRw0ACwsgAEHoAGohAyAEQTxqQQBB2AAQ7gMaIARBPGoQ4QMiAUIANwI4IAFBzZmz/AM2AlAgAUEANgIQIAFCADcCFCABQgA3AjAgAUFAa0IANwIAIAFCADcCHCABQgA3AiQgAUKAgICAgICAwD83AkggAUGAgID8AzYCLCABQYCAgPwDNgI8IAAoAmgiAkEBaiEiAkAgACgCbCACSgRAIAMgIjYCAAwBCyADICJB2AAQDCADKAIAQQFrIQILIABB8ABqIgMoAgAgAkHYAGxqIAFB2AAQ7AMaIAEQ4gNBzK4BKAIAIQEgAygCACAAKAJoQdgAbGpB2ABrIgJBgICA/AM2AlAgAiABNgJUDAELIAIgAUHYAGxqIQILQfikASgCAEECcgwBC0HAqwEhAkH4pAEoAgBBfXELNgIAQQAhASACIARB1AFqIAAoAlggBEGUAWoQjwNB+KQBLQAAQQRxBEACQEGEpQEoAgAiAUUNACABKAIEIiVFDQAgASgCCCEnIAAoAlAiAQRAIABBzK4BKAIAICcgJSABEQYACyAjQZSwAS8BAEEsbEEeakHw//8DcWsiASQAQcywASABNgIAICVBAEwNACAAKAJYKAKUASEoQZywASgCACIjISYDQCAjQZSwAS8BAE8NASAnIClBAnRqIQICQAJAIAAoAkwiAUUNACAAQcyuASgCACACKAIAIAERBQANAEGcsAEoAgAhIwwBCyAAIAIoAgBBgLABQdCvASAEECkgKAR/ICggAigCAGotAAAFQf8BCyEBQdCwASAEKgIQIgcgBCoCACIMkzgCAEHgsAEgBCoCFCINIAQqAgQiCZM4AgBB6LABIAQqAhgiCiAEKgIIIgiTOAIAQfCwASAEKgIgIhMgB5MiGDgCAEGAsQEgBCoCJCIVIA2TIhk4AgBBiLEBIAQqAigiFiAKkyIaOAIAQZCxASAMIBOTOAIAQaCxASAJIBWTOAIAQaixASAIIBaTOAIAQbCxASAZIAggCpMiCpQgCSANkyINIBqUkzgCAEG0sQEgGiAMIAeTIgeUIAogGJSTOAIAQbixASAYIA2UIAcgGZSTOAIAQbCxARDQAgJAQbixASoCACIJQZivASoCACIHlEGwsQEqAgAiCkGQrwEqAgAiDJRBtLEBKgIAIghBlK8BKgIAIg2UkpIgBCoCCCIYIAmUIAQqAgAiGSAKlCAEKgIEIhogCJSSkpNDAAAAAF0NAEGgsAFB////ezYCAEHQsQEgGSAMkzgCAEHAsQFBADYCAEGgrwEqAgAhBUGwrwEqAgAhC0G4rwEqAgAhBkG8rwEqAgAhDkHArwEqAgAhEiAEKgIoIQ8gBCoCJCEdIAQqAiAhGyAEKgIYIRMgBCoCFCEVIAQqAhAhFiAEQgA3A5gCIARCADcDkAJB4LEBIBogDZM4AgBB6LEBIBggB5M4AgBB8LEBIBYgDJM4AgBBgLIBIBUgDZM4AgBBiLIBIBMgB5M4AgBBkLIBIBsgDJM4AgBBoLIBIB0gDZM4AgBBqLIBIA8gB5M4AgAgBCAJjDgCmAIgBCAIjDgClAIgBCAKjDgCkAIgBEGQAmpBAUEBEHdFDQACQCABQQFxIgNFDQAgBEG4rwEqAgAiCkHQsAEqAgAiCJRB6LABKgIAIhRBoK8BKgIAIhCUkyIJOAKUAiAEIBRBsK8BKgIAIhGUIApB4LABKgIAIhSUkyIKOAKQAiAEIBAgFJQgCCARlJMiCDgCmAIgCCAIlCAKIAqUIAkgCZSSkkO9N4Y1XkUNACAEQZACakECQQAQd0UNAQsCQCABQf8BcSIBQQJxIiJFDQAgBEG4rwEqAgAiCkHwsAEqAgAiCJRBiLEBKgIAIhRBoK8BKgIAIhCUkyIJOAKUAiAEIBRBsK8BKgIAIhGUIApBgLEBKgIAIhSUkyIKOAKQAiAEIBAgFJQgCCARlJMiCDgCmAIgCCAIlCAKIAqUIAkgCZSSkkO9N4Y1XkUNACAEQZACakEDQQAQd0UNAQsCQCABQQRxIiNFDQAgBEG4rwEqAgAiCkGQsQEqAgAiCJRBqLEBKgIAIhRBoK8BKgIAIhCUkyIJOAKUAiAEIBRBsK8BKgIAIhGUIApBoLEBKgIAIhSUkyIKOAKQAiAEIBAgFJQgCCARlJMiCDgCmAIgCCAIlCAKIAqUIAkgCZSSkkO9N4Y1XkUNACAEQZACakEEQQAQd0UNAQsgBiASQwAAAD+UIA6TIgiUIg4gB5IhCSALIAiUIhIgDZIhCiAFIAiUIhQgDJIhCAJAIANFDQAgBCAIIBmTIhFB4LABKgIAIgWUQdCwASoCACILIAogGpMiEJSTIh4gC5RB6LABKgIAIgYgECAGlCAFIAkgGJMiH5STIheUkyIQOAKUAiAEIAYgHyALlCAGIBGUkyIRlCAFIB6UkyIGOAKQAiAEIBcgBZQgCyARlJMiBTgCmAIgBSAFlCAGIAaUIBAgEJSSkkO9N4Y1XkUNACAEQZACakEFQQAQd0UNAQsCQCAiRQ0AIAQgCCAWkyIRQYCxASoCACIFlEHwsAEqAgAiCyAKIBWTIhCUkyIeIAuUQYixASoCACIGIBAgBpQgBSAJIBOTIh+UkyIXlJMiEDgClAIgBCAGIB8gC5QgBiARlJMiEZQgBSAelJMiBjgCkAIgBCAXIAWUIAsgEZSTIgU4ApgCIAUgBZQgBiAGlCAQIBCUkpJDvTeGNV5FDQAgBEGQAmpBBkEAEHdFDQELAkAgI0UNACAEIAggG5MiEUGgsQEqAgAiBZRBkLEBKgIAIgsgCiAdkyIQlJMiHiALlEGosQEqAgAiBiAQIAaUIAUgCSAPkyIflJMiF5STIhA4ApQCIAQgBiAfIAuUIAYgEZSTIhGUIAUgHpSTIgY4ApACIAQgFyAFlCALIBGUkyIFOAKYAiAFIAWUIAYgBpQgECAQlJKSQ703hjVeRQ0AIARBkAJqQQdBABB3RQ0BCyAHIA6TIQcgDSASkyENIAwgFJMhDAJAIANFDQAgBCAMIBmTIhJB4LABKgIAIgWUQdCwASoCACILIA0gGpMiDpSTIhQgC5RB6LABKgIAIgYgDiAGlCAFIAcgGJMiEJSTIhGUkyIOOAKUAiAEIAYgECALlCAGIBKUkyISlCAFIBSUkyIGOAKQAiAEIBEgBZQgCyASlJMiBTgCmAIgBSAFlCAGIAaUIA4gDpSSkkO9N4Y1XkUNACAEQZACakEIQQAQd0UNAQsCQCAiRQ0AIAQgDCAWkyISQYCxASoCACIFlEHwsAEqAgAiCyANIBWTIg6UkyIUIAuUQYixASoCACIGIA4gBpQgBSAHIBOTIhCUkyIRlJMiDjgClAIgBCAGIBAgC5QgBiASlJMiEpQgBSAUlJMiBjgCkAIgBCARIAWUIAsgEpSTIgU4ApgCIAUgBZQgBiAGlCAOIA6UkpJDvTeGNV5FDQAgBEGQAmpBCUEAEHdFDQELAkAgI0UNACAEIAwgG5MiEkGgsQEqAgAiBZRBkLEBKgIAIgsgDSAdkyIOlJMiFCALlEGosQEqAgAiBiAOIAaUIAUgByAPkyIQlJMiEZSTIg44ApQCIAQgBiAQIAuUIAYgEpSTIhKUIAUgFJSTIgY4ApACIAQgESAFlCALIBKUkyIFOAKYAiAFIAWUIAYgBpQgDiAOlJKSQ703hjVeRQ0AIARBkAJqQQpBABB3RQ0BCwJAIAFBCHEiA0UNACAEIBkgCJMiEkGwrwEqAgAiBZRBoK8BKgIAIgsgGiAKkyIOlJMiFCALlEG4rwEqAgAiBiAOIAaUIAUgGCAJkyIQlJMiEZSTIg44ApQCIAQgBiAQIAuUIAYgEpSTIhKUIAUgFJSTIgY4ApACIAQgESAFlCALIBKUkyIFOAKYAiAFIAWUIAYgBpQgDiAOlJKSQ703hjVeRQ0AIARBkAJqQQtBABB3RQ0BCwJAIAFBEHEiIkUNACAEIBYgCJMiEkGwrwEqAgAiBZRBoK8BKgIAIgsgFSAKkyIOlJMiFCALlEG4rwEqAgAiBiAOIAaUIAUgEyAJkyIQlJMiEZSTIg44ApQCIAQgBiAQIAuUIAYgEpSTIhKUIAUgFJSTIgY4ApACIAQgESAFlCALIBKUkyIFOAKYAiAFIAWUIAYgBpQgDiAOlJKSQ703hjVeRQ0AIARBkAJqQQxBABB3RQ0BCwJAIAFBIHEiAUUNACAEIBsgCJMiEkGwrwEqAgAiBZRBoK8BKgIAIgsgHSAKkyIOlJMiFCALlEG4rwEqAgAiBiAOIAaUIAUgDyAJkyIQlJMiEZSTIg44ApQCIAQgBiAQIAuUIAYgEpSTIhKUIAUgFJSTIgY4ApACIAQgESAFlCALIBKUkyIFOAKYAiAFIAWUIAYgBpQgDiAOlJKSQ703hjVeRQ0AIARBkAJqQQ1BABB3RQ0BCwJAIANFDQAgBCAaIAqTIgU4ApQCIAQgGSAIkyILOAKQAiAEIBggCZMiBjgCmAIgBiAGlCALIAuUIAUgBZSSkkO9N4Y1XkUNACAEQZACakEOQQAQd0UNAQsCQCAiRQ0AIAQgFSAKkyIFOAKUAiAEIBYgCJMiCzgCkAIgBCATIAmTIgY4ApgCIAYgBpQgCyALlCAFIAWUkpJDvTeGNV5FDQAgBEGQAmpBD0EAEHdFDQELAkAgAUUNACAEIB0gCpMiCjgClAIgBCAbIAiTIgg4ApACIAQgDyAJkyIJOAKYAiAJIAmUIAggCJQgCiAKlJKSQ703hjVeRQ0AIARBkAJqQRBBABB3RQ0BCwJAIANFDQAgBCAaIA2TIgk4ApQCIAQgGSAMkyIKOAKQAiAEIBggB5MiCDgCmAIgCCAIlCAKIAqUIAkgCZSSkkO9N4Y1XkUNACAEQZACakERQQAQd0UNAQsCQCAiRQ0AIAQgFSANkyIJOAKUAiAEIBYgDJMiCjgCkAIgBCATIAeTIgg4ApgCIAggCJQgCiAKlCAJIAmUkpJDvTeGNV5FDQAgBEGQAmpBEkEAEHdFDQELAkAgAUUNACAEIB0gDZMiDTgClAIgBCAbIAyTIgw4ApACIAQgDyAHkyIHOAKYAiAHIAeUIAwgDJQgDSANlJKSQ703hjVeRQ0AIARBkAJqQRNBABB3RQ0BC0HAsQEoAgBFDQBBsLEBKgIAIguMIgpBsLABKgIAIhJBvK8BKgIAIgeUQZCvASoCACIUkiIIQaCvASoCAEHArwEqAgBDAAAAP5QgB5MiCZQiE5MgGZMiBpRBwLABKgIAIhAgB5RBlK8BKgIAIhGSIg9BsK8BKgIAIAmUIh2TIBqTIhVBtLEBKgIAIgyUk0G4sQEqAgAiDUHIsAEqAgAiHiAHlEGYrwEqAgAiH5IiG0G4rwEqAgAgCZQiBZMgGJMiFpSTQwAAAACSIQcgCiATIAiSIBmTIgmUIB0gD5IgGpMiCCAMlJMgDSAFIBuSIBiTIhOUk0MAAAAAkiIPQwAAAABdIgEgB0MAAAAAXXENACANjCEdIAyMIRsCQAJAIA9DAAAAAF4iA0UNACAHQwAAAABeRQ0AIAYhBwwBCwJAIAMgB0MAAAAAXXENACABIAdDAAAAAF5xDQAgBiEHDAELIBMgEyAWkyAPlCAPIAeTIgeVkyEFIAggCCAVkyAPlCAHlZMhDiAJIAkgBpMgD5QgB5WTIQcgAQRAIAchCSAGIQcgDiEIIAUhEwwBCyAOIRUgBSEWCyALQeCwASoCACIFlEHQsAEqAgAiBiAblJIiFyAWlCAMQeiwASoCACIOlCAFIB2UkiIcIAeUIBUgDSAGlCAOIAqUkiIglJKSQ6zFJzeSIQ8gFyATlCAcIAmUIAggIJSSkkOsxSc3kiIXQwAAAABdIgEgD0MAAAAAXXENAAJAAkAgF0MAAAAAXiIDRQ0AIA9DAAAAAF5FDQAgByEcDAELAkAgAyAPQwAAAABdcQ0AIAEgD0MAAAAAXnENACAHIRwMAQsgEyATIBaTIBeUIBcgD5MiD5WTISAgCCAIIBWTIBeUIA+VkyEhIAkgCSAHkyAXlCAPlZMhHCABBEAgHCEJIAchHCAhIQggICETDAELICEhFSAgIRYLIAtBgLEBKgIAIg+UQfCwASoCACIXIBuUkiIHIBaUIAxBiLEBKgIAIiCUIA8gHZSSIg8gHJQgFSANIBeUICAgCpSSIheUkpIgDiAHlCAGIA+UIAUgF5SSkkOsxSe3kiIGkyEFIAcgE5QgDyAJlCAIIBeUkpIgBpMiB0MAAAAAXSIBIAVDAAAAAF1xDQACQAJAIAdDAAAAAF4iA0UNACAFQwAAAABeRQ0AIBwhBwwBCwJAIAMgBUMAAAAAXXENACABIAVDAAAAAF5xDQAgHCEHDAELIBMgEyAWkyAHlCAHIAWTIg+VkyEFIAggCCAVkyAHlCAPlZMhBiAJIAkgHJMgB5QgD5WTIQcgAQRAIAchCSAcIQcgBiEIIAUhEwwBCyAGIRUgBSEWCyALQaCxASoCACIPlEGQsQEqAgAiBSAblJIiGyAWlCAMQaixASoCACILlCAPIB2UkiIPIAeUIBUgDSAFlCALIAqUkiINlJKSQ6zFJzeSIQwgGyATlCAPIAmUIAggDZSSkkOsxSc3kiINQwAAAABdIgEgDEMAAAAAXXENAAJAAkAgDUMAAAAAXiIDRQ0AIAxDAAAAAF5FDQAgByEMDAELAkAgAyAMQwAAAABdcQ0AIAEgDEMAAAAAXnENACAHIQwMAQsgEyATIBaTIA2UIA0gDJMiDJWTIQogCCAIIBWTIA2UIAyVkyEPIAkgCSAHkyANlCAMlZMhDCABBEAgDCEJIAchDCAPIQggCiETDAELIA8hFSAKIRYLQZywASgCACIDQZSwAS8BACIiTw0AQcywASgCACIjIANBLGxqIgFDAAAAACAYIBOSIgcgH5MgHpQgGSAJkiINIBSTIBKUIBAgGiAIkiIJIBGTlJKSQaSwASoCAEGosAEqAgCTIgiTIgogCkMAAAAAXRs4AiAgAUGwsAEqAgA4AhAgAUHAsAEqAgA4AhRByLABKgIAIQogAUEBNgIoIAEgBzgCCCABIAk4AgQgASANOAIAIAEgCjgCGEGcsAEgA0EBaiIBNgIAIAEgIk8NACAjIAFBLGxqIgFDAAAAACAYIBaSIgcgH5MgHpQgGSAMkiIMIBSTIBKUIBAgGiAVkiINIBGTlJKSIAiTIgkgCUMAAAAAXRs4AiAgAUGwsAEqAgA4AhAgAUHAsAEqAgA4AhRByLABKgIAIQkgAUEBNgIoIAEgBzgCCCABIA04AgQgASAMOAIAIAEgCTgCGEGcsAEgA0ECajYCAAtBnLABKAIAIiMgJk0NACAjICZBf3NqISpBACEDQcywASgCACEiICMgJiIBa0EDcSImBEADQCAiIAFBLGxqIAIoAgA2AiQgAUEBaiEBIANBAWoiAyAmRw0ACwsgIyEmICpBA0kNAANAICIgAUEsbGoiAyACKAIANgIkIAMgAigCADYCUCADIAIoAgA2AnwgAyACKAIANgKoASABQQRqIgEgI0cNAAsLIClBAWoiKSAlRw0ACwtBACEqQQAhAEGcsAEoAgAiJSEBAkACQAJAICUOAgIBAAsgJUECSA0AICVBAmshI0HMsAEoAgAhJwNAICUgACIBQQFqIgBKBEAgJyABQSxsaiIiQShqISggIkEgaiEpICJBFGohJiAiQRhqIQMgIioCECEcICIqAgAhByAAIQIDQCAHICcgAkEsbGoiJCoCAJOLQxe30ThdBH8gIioCBCAkKgIEk4tDF7fROF0gIioCCCAkKgIIk4tDF7fROF1xBUEACyAcICQqAhCTi0MXt9E4XQR/ICYqAgAgJCoCFJOLQxe30ThdIAMqAgAgJCoCGJOLQxe30ThdcQVBAAtxBEAgKCAkQShqICQqAiAgKSoCAF4bQQA2AgALIAJBAWoiAiAlRw0ACwsgASAjRw0ACwtBkLABKAIAIShBmLABKAIAISlBzLABKAIAISdBlLABLwEAISJBACEBA0AgASAiTw0BICcgKkEsbGoiJCgCKEEBRgRAICkgASAobGoiAiAkKgIgOAIgIAIgJCoCEDgCECACICQqAhQ4AhQgAiAkKgIYOAIYIAIgJCoCADgCACACICQqAgQ4AgQgAiAkKgIIOAIIIAJB0K4BKAIANgIkIAJBzK4BKAIANgIoIAIgJCgCJDYCMCABQQFqIQELICpBAWoiKiAlRw0ACwsLIARBoAJqJAAgAQvbAwEIfQJ/AkAgACoCCCIDIAOUIAAqAgAiAyADlCAAKgIEIgMgA5SSkpFDrMUnN10NACAAENACQQBBqLIBKgIAIAAqAggiA5RBkLIBKgIAIAAqAgAiB5QgACoCBCIIQaCyASoCAJSSkiIEQYiyASoCACADlEHwsQEqAgAgB5QgCEGAsgEqAgCUkpIiBUHosQEqAgAgA5RB0LEBKgIAIAeUIAhB4LEBKgIAlJKSIgZD//9//yAGQ///f/9eGyIJIAUgCV4bIgkgBCAJXhsiCSAEIAUgBkP//39/IAZD//9/f10bIgYgBSAGXRsiBSAEIAVdGyIEkkMAAAA/lCIGiyIKQbivASoCACADlEGgrwEqAgAgB5RBsK8BKgIAIAiUkpKLQcCvASoCAEMAAAA/lEG8rwEqAgAiBZOUIAWSIAkgBJNDAAAAP5QiBZIiBF4NARogCiAEkyIEQaCwASoCAF5FDQBBpLABIAY4AgBBoLABIAQ4AgBBqLABIAU4AgBBsLABIAc4AgBBwLABIAg4AgBByLABIAM4AgBBwLEBIAE2AgAgAg0AIAZDAAAAAF1FDQBBwLABIAiMOAIAQbCwASAHjDgCAEHIsAEgA4w4AgBBpLABIAaMOAIAC0EBCwvoCwIQfxV9IwBB4ABrIgYkACAEQTNMBEAgBkGJGzYCVCAGQZYoNgJQQQFB58oAIAZB0ABqEI4BCyAAKAIEQQhHBEAgBkGJGzYCRCAGQZYoNgJAQQFBpjUgBkFAaxCOAQsgASgCBEEERwRAIAZBiRs2AjQgBkGWKDYCMEEBQdI2IAZBMGoQjgELAkAgAkH//wNxIgtFDQAgABA2IQkgABA3IQIgACgCWCgCFCIPQQBMDQBBkLMBIRBBlLMBIRFBoLMBIRJBmLMBIRNBjLMBIRQDQCAAKAJYIgUoAhwgBSgCJCANbGohDAJAIAUtACxFBEBBgLMBIAUoAiAiCiAFKAIoIgUgDCgCAGxqIggrAwC2IhU4AgBBhLMBIAgrAwi2IhY4AgBBiLMBIAgrAxC2Ihc4AgBBjLMBIAogBSAMKAIEbGoiCCsDALY4AgAgECAIKwMItjgCACARIAgrAxC2OAIAQZizASAKIAUgDCgCCGxqIgUrAwC2OAIAQZyzASAFKwMItjgCACASIAUrAxC2OAIAIBQhCiATIQgMAQsgBSgCICIOIAUoAigiBSAMKAIIbGohCCAOIAwoAgQgBWxqIQogDiAFIAwoAgBsaiIFKgIIIRcgBSoCBCEWIAUqAgAhFQsgASoCWCIeIAEqAlQiGyACKgIoIhkgF5QgAioCICIaIBWUIBYgAioCJCIclJKSIAkqAggiH5IiGJQgASoCTCIgIAIqAggiISAXlCACKgIAIiIgFZQgAioCBCIjIBaUkpIgCSoCACIkkiIdlCACKgIYIiUgF5QgAioCECIXIBWUIBYgAioCFCIVlJKSIAkqAgQiFpIiJiABKgJQIieUkpKTIihDAAAAAF4EQCAHIAtPBEAgBkH/IzYCJCAGQdfNADYCIEEBQZ/KACAGQSBqEI4BCyADIAQgB2xqIgUgGDgCCCAFICY4AgQgBSAdOAIAIAUgASoCTDgCECAFIAEqAlA4AhQgASoCVCEVIAUgADYCKCAFIAE2AiQgBSAoOAIgIAUgFTgCGCAHQQFqIgcgC04NAiABKgJUIRsgASoCUCEnIAEqAkwhICABKgJYIR4gCSoCCCEfIAkqAgQhFiAJKgIAISQgAioCKCEZIAIqAiQhHCACKgIgIRogAioCGCElIAIqAhAhFyACKgIIISEgAioCBCEjIAIqAgAhIiACKgIUIRULIB4gGyAZIAoqAggiGJQgGiAKKgIAIh2UIAoqAgQiJiAclJKSIB+SIiiUICAgISAYlCAiIB2UICMgJpSSkiAkkiIplCAlIBiUIBcgHZQgJiAVlJKSIBaSIhggJ5SSkpMiHUMAAAAAXgRAIAcgC08EQCAGQf8jNgIUIAZB180ANgIQQQFBn8oAIAZBEGoQjgELIAMgBCAHbGoiBSAoOAIIIAUgGDgCBCAFICk4AgAgBSABKgJMOAIQIAUgASoCUDgCFCABKgJUIRUgBSAANgIoIAUgATYCJCAFIB04AiAgBSAVOAIYIAdBAWoiByALTg0CIAEqAlQhGyABKgJQIScgASoCTCEgIAEqAlghHiAJKgIIIR8gCSoCBCEWIAkqAgAhJCACKgIoIRkgAioCJCEcIAIqAiAhGiACKgIYISUgAioCECEXIAIqAgghISACKgIEISMgAioCACEiIAIqAhQhFQsgHiAbIBkgCCoCCCIYlCAaIAgqAgAiGZQgCCoCBCIaIByUkpIgH5IiHJQgICAhIBiUICIgGZQgIyAalJKSICSSIhuUICUgGJQgFyAZlCAaIBWUkpIgFpIiFSAnlJKSkyIWQwAAAABeBEAgByALTwRAIAZB/yM2AgQgBkHXzQA2AgBBAUGfygAgBhCOAQsgAyAEIAdsaiIFIBw4AgggBSAVOAIEIAUgGzgCACAFIAEqAkw4AhAgBSABKgJQOAIUIAEqAlQhFSAFIAA2AiggBSABNgIkIAUgFjgCICAFIBU4AhggB0EBaiIHIAtODQILIA1BAWoiDSAPRw0ACwsgBkHgAGokACAHC4UcAgx/EX0jAEHQAWsiCCQAIAAQNiEQIAAQNyENIwBBEGsiBSQAAkAgAQRAIAEoAgRBBUYNAQsgBUHgIzYCAEECQajVACAFEI4BCyABKgJMIREgBUEQaiQAIAhBzAFqIQcgCEHIAWohBiMAQRBrIgUkAAJAIAEEQCABKAIEQQVGDQELIAVBvhA2AgBBAkGo1QAgBRCOAQsgByABLwEKQQFxNgIAIAYgASgCCEERdkEBcTYCACAFQRBqJAAjAEEQayIHJAACQCABIgUEQCAFKAIEQQVGDQELIAdB0Aw2AgBBAkGo1QAgBxCOAQsgBSgCCCEFIAdBEGokAEGsqAEgETgCAEGwqAEgBUESdkEBcToAAEGxqAEgCCgCyAFBAEc6AABBrKcBQaynASgCAEF+cSAIKALMAUEAR3I2AgAgCEGwAWohByAIQaABaiEGIwBBEGsiDiQAAkAgASIFBEAgBSgCBEEFRg0BCyAOQfwMNgIAQQJBqNUAIA4QjgELIAUtAAhBAnEEQCAFECsgBSAFKAIIQX1xNgIICyAHIAUoAhgiBSoCADgCACAHIAUqAgQ4AgQgByAFKgIIOAIIIAYgBSoCGDgCACAGIAUqAig4AgQgBiAFKgI4OAIIIA5BEGokACAIIAgpAqQBNwKYASAIIAgqArABOAKIASAIIAgpArQBNwKMASAIIAgqAqABOAKUASAAKAJYIQUgCCANKgIAOAJIIAggDSoCBDgCWCAIIA0qAgg4AmggCCANKgIQOAJMIAggDSoCFDgCXCAIIA0qAhg4AmwgCCANKgIgOAJQIAggDSoCJDgCYCAIIA0qAig4AnAgCCAQKgIAOAJ4IAggECoCBDgCfCAQKgIIIREgCEGAgID8AzYChAEgCEEANgJ0IAhBADYCZCAIIBE4AoABIAhBADYCVCAIQYgBaiEHIAhByABqIQZBsKcBIAU2AgBBtKcBIAUoAgQiDjYCAAJAIA5FDQAjAEFAaiIKJABBkKgBQQA2AgBBiKgBQgA3AgBBrKcBQaynASgCAEFzcTYCAAJAQYSoASgCACIJRQ0AIAkoAgRFDQAgCUEANgIECwJAIAYEQCAGKgIUIRQgBioCGCEXIAYqAgghGCAGKgIEIRUgBioCACEaIAYqAhAhG0HMpwEgBioCKCAHKgIUIhGUIAYqAiAgByoCDCISlCAGKgIkIAcqAhAiE5SSkjgCAEHIpwEgFyARlCAbIBKUIBQgE5SSkjgCAEHEpwEgGCARlCAaIBKUIBUgE5SSkjgCACAKIAYQ5QMgCioCNCEUIAoqAiQhFyAKKgIUIRggCioCMCEVIAoqAiAhGiAKKgIAIRsgCioCECEZIAoqAgQhFkHApwEgCioCOCAHKgIIIhEgCioCKJQgByoCACISIAoqAgiUIAcqAgQiEyAKKgIYlJKSkjgCAEG8pwEgFCARIBeUIBIgFpQgEyAYlJKSkjgCAEG4pwEgFSARIBqUIBIgG5QgEyAZlJKSkjgCAAwBC0HEpwEgBykCDDcCAEHMpwEgBygCFDYCAEG4pwEgBykCADcCAEHApwEgBygCCDYCAAsCQAJAQbCnASgCACIHRQRAQaynASgCACEGDAELQaynASgCACEGIActAAhBBHFFDQAgBkEQcQ0AQbSnASgCACIHKAIIIQkCQCAHLQAYRQRAQYCzASAHKAIMIgsgBygCFCIHIAkoAgBsaiIMKwMAtiIROAIAQYSzASAMKwMItiISOAIAQYizASAMKwMQtiITOAIAQYyzASALIAcgCSgCBGxqIgwrAwC2IhQ4AgBBkLMBIAwrAwi2IhY4AgBBlLMBIAwrAxC2Ihc4AgBBmLMBIAsgByAJKAIIbGoiBysDALYiGDgCAEGcswEgBysDCLYiFTgCAEGgswEgBysDELYiGTgCAAwBCyAHKAIMIgsgBygCFCIHIAkoAghsaiIMKgIIIRkgDCoCBCEVIAwqAgAhGCALIAcgCSgCAGxqIgwqAgghEyALIAkoAgQgB2xqIgcqAgghFyAMKgIEIRIgByoCBCEWIAwqAgAhESAHKgIAIRQLQQEhB0GMqAFBjKgBKAIAQQFqNgIAIBcgE5MiHUHEpwEqAgAiFyAVIBKTIhqUIBggEZMiG0HIpwEqAgAiGJSTIhyUIBQgEZMiHiAYIBkgE5MiGZQgGkHMpwEqAgAiFZSTIiCUIBYgEpMiHyAVIBuUIBkgF5STIhaUkpIhFAJAQbGoAS0AAARAIBRDvTeGNV0NA0H8pwFBwKcBKgIAIBOTIhMgHJRBuKcBKgIAIBGTIhwgIJQgFkG8pwEqAgAgEpMiEpSSkiIROAIAIBG8IglBAEgNAyAJIBS8Sw0DQYCoASAVIBwgH5QgHiASlJMiFpQgFyASIB2UIB8gE5STIhWUIBggEyAelCAdIByUkyITlJKSIhI4AgAgErxBAEgNAyARIBKSIBReDQNB+KcBIBkgFpQgGyAVlCAaIBOUkpIiEzgCACATvEEASA0DQYCoAUMAAIA/IBSVIhQgEpQ4AgBB/KcBIBQgEZQ4AgBB+KcBIBQgE5QiETgCACARvCEJDAELIBRDvTeGNV0gFEO9N4a1XnENAkH8pwFDAACAPyAUlSIhQcCnASoCACATkyITIByUQbinASoCACARkyIUICCUIBZBvKcBKgIAIBKTIhKUkpKUIhE4AgAgEbxBgICA/ANLDQJBgKgBICEgFSAUIB+UIB4gEpSTIhaUIBcgEiAdlCAfIBOUkyIVlCAYIBMgHpQgHSAUlJMiE5SSkpQiEjgCACASvEEASA0CIBEgEpJDAACAP14NAkH4pwEgISAZIBaUIBsgFZQgGiATlJKSlCIROAIAIBG8IglBAEgNAgsgCUGsqAEoAgBPDQFB9KcBQQA2AgBBrKcBIAZBBHI2AgBBkKgBQZCoASgCAEEBajYCAEGEqAEoAgAiBkUNAUGwqAEtAABBACAGKAIEIglBA0sbRQRAIAYoAgAgCUYEQCAGEOMDIAYoAgQhCUH4pwEqAgAhEQsgBiAJQQFqNgIEIAYoAggiCyAJQQJ0akEANgIAIAYoAgQiByAGKAIARgRAIAYQ4wMgBigCCCELIAYoAgQhBwsgBiAHQQFqNgIEIAsgB0ECdGogETgCAEH8pwEqAgAhEUEBIQcgBigCBCIJIAYoAgBGBEAgBhDjAyAGKAIIIQsgBigCBCEJCyAGIAlBAWo2AgQgCyAJQQJ0aiAROAIAQYCoASoCACERIAYoAgQiCSAGKAIARgRAIAYQ4wMgBigCCCELIAYoAgQhCQsgBiAJQQFqNgIEIAsgCUECdGogETgCAAwCCyAGKAIIIgZFDQEgESAGKgIEXUUNASAGQfSnASkCADcCACAGQfynASkCADcCCAwBCwJAIAZBAnFFDQALAkBBrKgBKAIAIgZB////+wdHBEBB3KcBQcSnASoCAEMAAAA/lCAGviIRlCISOAIAQeSnAUHMpwEqAgBDAAAAP5QgEZQiEzgCAEHgpwFByKcBKgIAQwAAAD+UIBGUIhE4AgBB6KcBIBJBuKcBKgIAkjgCAEHQpwEgEos4AgBB8KcBQcCnASoCACATkjgCAEHspwFBvKcBKgIAIBGSOAIAQdinASATizgCAEHUpwEgEYs4AgAMAQtB0KcBQcSnASoCAIs4AgBB1KcBQcinASoCAIs4AgBB2KcBQcynASoCAIs4AgALQQAhBwsgCkFAayQAIAcNACAFKAIIIgZBAXEhByAFKAIQIQUCQCAGQQJxBEAgBwRAQZSoASAFKQIMNwIAQZyoASAFKAIUNgIAQaioASAFKAIgNgIAQaCoASAFKQIYNwIAIAUoAgghBUGsqAEoAgBB////+wdHBEBBqKcBIAUQuAMMAwtBqKcBIAUQuQMMAgsgBSgCCCEFQayoASgCAEH////7B0cEQEGopwEgBRC6AwwCC0GopwEgBRC7AwwBCyAHBEBBlKgBIAUpAgw3AgBBnKgBIAUoAhQ2AgBBqKgBIAUoAiA2AgBBoKgBIAUpAhg3AgAgBSgCCCEFQayoASgCAEH////7B0cEQEGopwEgBRC8AwwCC0GopwEgBRC9AwwBCyAFKAIIIQVBrKgBKAIAQf////sHRwRAQainASAFEL4DDAELQainASAFEL8DCwsCQCAORQ0AQcysASgCACIFQQRJDQAgAkH//wNxIgZFDQAgBUECdiEJQdCsASgCACEOQQAhAgNAAkAgACgCVCIHBEAgACABIA4gAkEEdGoiBSgCACAFKgIIIAUqAgwgBxEpAEUNAQsgDiACQQR0aiIHKAIAIQUgACgCTCIKBEAgACABIAUgChEFAEUNAQsgBiAPTQRAIAhB/yM2AgQgCEHXzQA2AgBBAUGfygAgCBCOAQsgACAFIBAgDSAIQRBqECkgAyAEIA9saiIFIAgqAqABIAcqAgQiEZQgCCoCsAGSOAIAIAUgESAIKgKkAZQgCCoCtAGSOAIEIAgqArgBIRIgCCoCqAEhEyAFQQA2AgwgBSASIBMgEZSSOAIIIAgqAjghEyAIKgIYIRIgCCoCKCEWIAUgCCoCMCAIKgIQIhSTIhcgCCoCJCAIKgIUIhWTIhiUIAgqAiAgFJMiFCAIKgI0IBWTIhWUkzgCGCAFIBMgEpMiEyAUlCAWIBKTIhIgF5STOAIUIAUgFSASlCAYIBOUkzgCECAFQRBqENACIAUgATYCKCAFIAA2AiQgBSAROAIgIA9BAWohDwsgAkEBaiICIAlPDQEgBiAPRw0ACwsgCEHQAWokACAPC7UZAgp/Gn0jAEHgAWsiBSQAIAAQNiELIAAQNyEIIAEQNiEKIAEQ8wIhHyAFIAoqAgA4AtABIAUgCioCBDgC1AEgCioCCCEPIAUgHzgC3AEgBSAPOALYAQJAIAAtAIABBEACQAJAIAAoAlwiCUEASgRAIAAoAmQhBwNAIAcgBkEsbGooAiggAUYNAiAGQQFqIgYgCUcNAAsLIABB3ABqIQkgBUEANgKIASAFQgA3A4ABIAVCADcDeCAFQgA3A3AgBUIANwNoIAVCADcDYCAFQeAAahDhAyIGQgA3AhAgBkIANwIYIAZCgICAgNCZs8Y/NwIgIAAoAlwiB0EBaiEMAkAgACgCYCAHSgRAIAkgDDYCAAwBCyAJIAxBLBAMIAkoAgBBAWshBwsgAEHkAGoiCSgCACAHQSxsaiIHIAYpAgA3AgAgByAGKAIoNgIoIAcgBikCIDcCICAHIAYpAhg3AhggByAGKQIQNwIQIAcgBikCCDcCCCAGEOIDIAkoAgAgACgCXEEsbGpBLGsiBiABNgIoDAELIAcgBkEsbGohBgtBtKQBQbSkASgCAEECcjYCACAAKAJYIQcgBSAIKgIAOAKQASAFIAgqAgQ4AqABIAUgCCoCCDgCsAEgBSAIKgIQOAKUASAFIAgqAhQ4AqQBIAUgCCoCGDgCtAEgBSAIKgIgOAKYASAFIAgqAiQ4AqgBIAUgCCoCKDgCuAEgBSALKgIAOALAASAFIAsqAgQ4AsQBIAsqAgghDyAFQYCAgPwDNgLMASAFQQA2ArwBIAVBADYCrAEgBSAPOALIASAFQQA2ApwBIAYgBUHQAWogByAFQZABahDBAwwBC0G0pAFBtKQBKAIAQX1xNgIAIAAoAlghBiAFIAgqAgA4ApABIAUgCCoCBDgCoAEgBSAIKgIIOAKwASAFIAgqAhA4ApQBIAUgCCoCFDgCpAEgBSAIKgIYOAK0ASAFIAgqAiA4ApgBIAUgCCoCJDgCqAEgBSAIKgIoOAK4ASAFIAsqAgA4AsABIAUgCyoCBDgCxAEgCyoCCCEPIAVBgICA/AM2AswBIAVBADYCvAEgBUEANgKsASAFIA84AsgBIAVBADYCnAFBmKsBIAVB0AFqIAYgBUGQAWoQwQMLQQAhBwJAQbSkAS0AAEEEcUUNAEHApAEoAgAiBkUNACAGKAIEIg1FDQAgBigCCCEOIAAoAlAiBgRAIAAgASAOIA0gBhEGAAsgDUEATA0AIAJB//8DcSIMRQ0AQQAhCUEAIQYDQCAOIAZBAnRqIQcCQCAAKAJMIgIEQCAAIAEgBygCACACEQUARQ0BCyAAIAcoAgAgCyAIIAVBMGoQKSAFKgJAIiIgBSoCMCIakyIPIAUqAlQiIyAFKgI0IhuTIhCUIAUqAlAiJCAakyIRIAUqAkQiJSAbkyISlJMiGCAYIBiUIBIgBSoCWCImIAUqAjgiHpMiGJQgECAFKgJIIicgHpMiFJSTIhYgFpQgFCARlCAYIA+UkyIdIB2UkpKRIhOVIiAgCioCCCIZlCAWIBOVIiEgCioCACIWlCAKKgIEIhwgHSATlSIdlJKSICAgHpQgISAalCAbIB2UkpKTQwAAAABdDQAgHiAZkyITIBOUIBogFpMiGSAZlCAbIByTIhwgHJSSkiEXAkACQAJAAkAgFCAYlCAPIBGUIBIgEJSSkiIWIBMgGJQgGSARlCAQIByUkpIiFZQgEyAUlCAZIA+UIBIgHJSSkiITIBggGJQgESARlCAQIBCUkpIiEZSTIhggFiATlCAVIBQgFJQgDyAPlCASIBKUkpIiEpSTIhmSIBIgEZQgFiAWlJMiHIsiKF8EQCAYQwAAAABdBEAgGUMAAAAAXQRAIBNDAAAAAF0EQCATjCIPIBJgBEAgFyATIBOSIBKSkiEUDAcLIBMgDyASlSIPlCAXkiEUQwAAAAAhEAwHC0MAAAAAIQ8gFUMAAAAAYA0EIBWMIhAgEWAEQCAXIBUgFZIgEZKSIRRDAACAPyEQDAcLIBUgECARlSIQlCAXkiEUDAYLQwAAAAAhDyAVQwAAAABgDQMgFYwiECARYARAIBcgFSAVkiARkpIhFEMAAIA/IRAMBgsgFSAQIBGVIhCUIBeSIRQMBQsgGUMAAAAAXQRAQwAAAAAhECATQwAAAABgDQIgE4wiDyASYARAIBcgEyATkiASkpIhFEMAAIA/IQ8MBgsgEyAPIBKVIg+UIBeSIRQMBQtDAAAAACEPQ///f38hFEMAAAAAIRAgHEMAAAAAWw0EIBdDAACAPyAolSIQIBiUIg8gEyATkiASIA+UIBYgECAZlCIQlJKSlCAQIBUgFZIgFiAPlCARIBCUkpKUkpIhFAwECwJAIBhDAAAAAF0EQCARIBWSIg8gFiATkiIQXgRAIA8gEJMiDyARIBIgFiAWkpOSIhBgBEAgFyATIBOSIBKSkiEUDAYLIBcgDyAQlSIPIBMgE5IgEiAPlCAWQwAAgD8gD5MiEJSSkpQgECAVIBWSIBYgD5QgESAQlJKSlJKSIRQMBgsgD0MAAAAAXwRAIBcgFSAVkiARkpIhFAwCC0MAAAAAIQ8gFUMAAAAAYA0DIBUgFYwgEZUiEJQgF5IhFAwFCyAZQwAAAABdBEAgEiATkiIPIBYgFZIiEF4EQCAPIBCTIg8gESASIBYgFpKTkiIQYARAIBcgFSAVkiARkpIhFAwDCyAXQwAAgD8gDyAQlSIQkyIPIBMgE5IgEiAPlCAWIBCUkpKUIBAgFSAVkiAWIA+UIBEgEJSSkpSSkiEUDAYLIA9DAAAAAF8EQCAXIBMgE5IgEpKSIRQMBQtDAAAAACEQIBNDAAAAAGANAiATIBOMIBKVIg+UIBeSIRQMBQsgESAVkiAWkyATkyIPQwAAAABfBEAgFyAVIBWSIBGSkiEUDAELIBEgEiAWIBaSk5IiECAPXwRAIBcgEyATkiASkpIhFAwECyAXIA8gEJUiDyATIBOSIBIgD5QgFkMAAIA/IA+TIhCUkpKUIBAgFSAVkiAWIA+UIBEgEJSSkpSSkiEUDAQLQwAAgD8hEEMAAAAAIQ8MAwtDAAAAACEPIBchFAwCC0MAAAAAIRAgFyEUDAELQwAAAAAhEEMAAIA/IQ8LIBSLkSIRIB9fRQ0AQwAAAAAgHyARkyIRIBFDAAAAAF0bIRIgCSAMTwRAIAVB/yM2AiQgBUHXzQA2AiBBAUGfygAgBUEgahCOASAFKgJYISYgBSoCSCEnIAUqAjghHiAFKgJUISMgBSoCRCElIAUqAjQhGyAFKgJQISQgBSoCQCEiIAUqAjAhGgsgAyAEIAlsaiICICGMOAIQIAJBADYCDCACQQA2AhwgAiAgjDgCGCACIB2MOAIUIAIgJiAQlCAeQwAAgD8gD5MgEJMiEZQgDyAnlJKSIhg4AgggAiAjIBCUIBsgEZQgDyAllJKSIhQ4AgQgAiAkIBCUIBogEZQgDyAilJKSIhA4AgAgAiASIAoqAgggGJMiDyAglCAKKgIAIBCTIhAgIZQgHSAKKgIEIBSTIhGUkpIgDyAPlCAQIBCUIBEgEZSSkpGVlDgCICACIAcoAgA2AiwgCUEBaiEJCyAJIAxHIA0gBkEBaiIGSnENAAsgCUUEQEEAIQcMAQsgDEUEQCAFQf8jNgIUIAVB180ANgIQQQFBn8oAIAVBEGoQjgELQQEhByAJQQFHBEAgAyADKgIgIhIgAyoCEJQiDzgCECADQRRqIgYgEiAGKgIAlCIQOAIAIANBGGoiBiASIAYqAgCUIhE4AgAgA0EcaiIGIBIgBioCAJQiEjgCACADQRBqIQgCQCAJQQFMBEAgAyoCDCEYIAMqAgghFCADKgIEIRogAyoCACEbDAELQQEhCgNAIAogDE8EQCAFQf8jNgIEIAVB180ANgIAQQFBn8oAIAUQjgEgAyoCHCESIAMqAhghESADKgIUIRAgAyoCECEPCyADIAMgBCAKbGoiBioCACADKgIAkiIbOAIAIAMgBioCBCADKgIEkiIaOAIEIAMgBioCCCADKgIIkiIUOAIIIAMgBioCDCADKgIMkiIYOAIMIAMgBioCECAGKgIglCAPkiIPOAIQIAMgBioCFCAGKgIglCAQkiIQOAIUIAMgBioCGCAGKgIglCARkiIROAIYIAMgBioCHCAGKgIglCASkiISOAIcIApBAWoiCiAJRw0ACwsgAyAYIAmyIhKVOAIMIAMgFCASlTgCCCADIBogEpU4AgQgAyAbIBKVOAIAIAMgESARlCAPIA+UIBAgEJSSkiASlZE4AiAgCBDQAgsgAyABNgIoIAMgADYCJAsgBUHgAWokACAHC+Z0AzR/M30BfCMAQZAJayIFJAAgASgCWCgCUCElIAAoAlgoAlAhJiAAEDYhFCAAEDchECABEDYhFSABEDchEUG8sgEtAABFBEBBvLIBQQE6AABBrLIBQoCAgIAQNwIAC0G0sgEgACgCWDYCAEG4sgEgASgCWDYCACAFIBAqAgA4ApwIIAUgECoCBDgCrAggBSAQKgIIOAK8CCAFIBAqAhA4AqAIIAVBsAhqIBAqAhQ4AgAgBUHACGogECoCGDgCACAFIBAqAiA4AqQIIAVBtAhqIBAqAiQ4AgAgBUHECGogECoCKDgCACAFIBQqAgA4AswIIAVB0AhqIBQqAgQ4AgAgFCoCCCE5IAVB2AhqQYCAgPwDNgIAIAVByAhqQQA2AgAgBUG4CGpBADYCACAFQdQIaiA5OAIAIAVBADYCqAggBSARKgIAOALcByAFIBEqAgQ4AuwHIAUgESoCCDgC/AcgBSARKgIQOALgByAFIBEqAhQ4AvAHIAVBgAhqIBEqAhg4AgAgBSARKgIgOALkByAFIBEqAiQ4AvQHIAVBhAhqIBEqAig4AgAgBSAVKgIAOAKMCCAFQZAIaiAVKgIEOAIAIBUqAgghOSAFQZgIakGAgID8AzYCACAFQYgIakEANgIAIAVBADYC+AcgBUGUCGogOTgCACAFQQA2AugHAn8gBUGcCGohEiAFQdwHaiELAkBBtLIBKAIAIgdFDQBBuLIBKAIAIg1FDQAgBygCCCIPQQF2QQFxIiAgDSgCCCIXQQF2QQFxRw0AIA9BAXEiHSAXQQFxRw0AIAcoAgQhD0HYqAEgDSgCBCIXNgIAQdSoASAPNgIAIA9FDQAgF0UNACANKAIQIQ0gBygCECEHICAEQCAdBEAgEiALENADAkBBuKgBKAIAQQNxQQNGBEBBtKgBQayyASgCAEGwsgEoAgAQ0QNBuKgBLQAAQQRxDQELQeypASAHKQIMNwIAQfSpASAHKAIUNgIAQYCqASAHKAIgNgIAQfipASAHKQIYNwIAQYyqASANKAIUNgIAQYSqASANKQIMNwIAQZiqASANKAIgNgIAQZCqASANKQIYNwIAQbSoASAHKAIIIA0oAggQ0wNBuKgBLQAAQQRxRQ0AQayyAUHMqAEoAgAiBygCADYCAEGwsgEgBygCBDYCAAtBAQwDCyASIAsQ0AMCQEG4qAEoAgBBA3FBA0YEQEG0qAFBrLIBKAIAQbCyASgCABDRA0G4qAEtAABBBHENAQtBtKgBIAcoAgggDSgCCBDUA0G4qAEtAABBBHFFDQBBrLIBQcyoASgCACIHKAIANgIAQbCyASAHKAIENgIAC0EBDAILIB0EQCMAQTBrIg8kACASIAsQ0AMCQEG4qAEoAgBBA3FBA0YEQEG0qAFBrLIBKAIAQbCyASgCABDRA0G4qAEtAABBBHENAQtB7KkBIAcpAgw3AgBB9KkBIAcoAhQ2AgBBgKoBIAcoAiA2AgBB+KkBIAcpAhg3AgBBjKoBIA0oAhQ2AgBBhKoBIA0pAgw3AgBBmKoBIA0oAiA2AgBBkKoBIA0pAhg3AgBB/KkBKgIAITwgBygCCCIHLwEIIQtB+KkBKgIAIT4gBy8BBiESIA9BgKoBKgIAIAcvAQqzlDgCLCAPIDwgC7OUOAIoIA8gPiASs5Q4AiRB8KkBKgIAITxB7KkBKgIAIT4gBy4BACESIAcuAQIhCyAPQfSpASoCACAHLgEEspQ4AiAgDyA8IAuylDgCHCAPID4gErKUOAIYQZSqASoCACE8IA0oAggiDS8BCCELQZCqASoCACE+IA0vAQYhEiAPQZiqASoCACANLwEKs5Q4AhQgDyA8IAuzlDgCECAPID4gErOUOAIMQYiqASoCACE8QYSqASoCACE+IA0uAQAhCyANLgECIRIgD0GMqgEqAgAgDS4BBLKUOAIIIA8gPCASspQ4AgQgDyA+IAuylDgCAEG0qAEgByANIA9BJGogD0EYaiAPQQxqIA8Q1QNBuKgBLQAAQQRxRQ0AQayyAUHMqAEoAgAiBygCADYCAEGwsgEgBygCBDYCAAsgD0EwaiQAQQEMAgsgEiALENADQbioASgCAEEDcUEDRgRAQbSoAUGssgEoAgBBsLIBKAIAENEDQQEhHkG4qAEtAABBBHENAQtBtKgBIAcoAgggDSgCCBDSA0EBIR5BuKgBLQAAQQRxRQ0AQayyAUHMqAEoAgAiBygCADYCAEGwsgEgBygCBDYCAAsgHgshBiAFIBAqAgA4ApAHIAUgECoCBDgCoAcgBSAQKgIIOAKwByAFIBQqAgA4AsAHIAUgECoCEDgClAcgBSAQKgIUOAKkByAFIBAqAhg4ArQHIAUgFCoCBDgCxAcgBSAQKgIgOAKYByAFIBAqAiQ4AqgHIAUgECoCKDgCuAcgFCoCCCE5IAVBgICA/AM2AswHIAVBADYCvAcgBUEANgKsByAFQQA2ApwHIAUgOTgCyAcgBSARKgIAOALQBiAFIBEqAgQ4AuAGIAUgESoCCDgC8AYgBSAVKgIAOAKAByAFIBEqAhA4AtQGIAUgESoCFDgC5AYgBSARKgIYOAL0BiAFIBUqAgQ4AoQHIAUgESoCIDgC2AYgBSARKgIkOALoBiAFIBEqAig4AvgGIBUqAgghOSAFQYCAgPwDNgKMByAFQQA2AvwGIAVBADYC7AYgBUEANgLcBiAFIDk4AogHAkAgBkUNAEG4qAEtAABBBHFFDQBByKgBKAIAIgZBAkkNAEHMqAEoAgAhMSAFQQA2AswGIAVBkAdqIAVBkAFqEHwgBUHQBmogBUHQAGoQfCACQf//A3EiJ0UNACAFQeAFakEIciEyIAVB4AVqQQRyITMgBUGQBmpBCHIhNCAFQZAGakEEciE1IAVBwARqQQhyIRcgBUHABGpBBHIhHSAFQdAEakEIciEeIAVB0ARqQQRyISAgBUH8CGohKCAFQfgIaiEpIAVBGGohKiAFQRRqISsgBUHwCGohLCAFQewIaiEtIAVB5AhqIS4gBUHgCGohLyAFQYQJaiE2IAVBjAlqITcgBUGABmohGCAFQfAFaiEZIAVBsAZqIRogBUGgBmohG0EBIAZBAXYiFiAWQQFNGyE4Q28SgzkhR0EAIRYDQAJAIAUoAswGICdODQAgMSAWQQN0aiIKKAIEIQYgACAKKAIAIgsgFCAQIAVBkAZqECkgASAGIBUgESAFQeAFahApIAVBgICA/AM2AuwFIAVBgICA/AM2ApwGIAVBgICA/AM2AqwGIAVBgICA/AM2AvwFIAVBgICA/AM2ArwGIAVBgICA/AM2AowGIAUgBSoCoAYiRCAFKgKQBiI8kyI6IAUqArQGIkEgBSoClAYiPZMiO5QgBSoCsAYiSCA8kyI+IAUqAqQGIk8gPZMiRZSTIjk4AiggBSAFKgKoBiJUIAUqApgGIj+TIkIgPpQgBSoCuAYiUiA/kyI+IDqUkyI6OAIkIAUgRSA+lCA7IEKUkyI7OAIgQwAAAAAgOSAFKgLoBSJFlCA7IAUqAuAFIkKUIDogBSoC5AUiRpSSkiA5ID+UIDsgPJQgPSA6lJKSIj6TIkAgQIu7RI3ttaD3xrA+YxsiQEMAAAAAIDkgBSoCiAYiS5QgOyAFKgKABiJNlCA6IAUqAoQGIkqUkpIgPpMiQyBDi7tEje21oPfGsD5jGyJMlCFDIEBDAAAAACA5IAUqAvgFIkmUIDsgBSoC8AUiTpQgOiAFKgL0BSJTlJKSID6TIj4gPou7RI3ttaD3xrA+YxsiUJQiUUMAAAAAXiBDQwAAAABecQ0AQwAAAAAgTiBCkyJOIEogRpMiSpQgTSBCkyJNIFMgRpMiU5STIj4gP5QgUyBLIEWTIkuUIEogSSBFkyJJlJMiPyA8lCA9IEkgTZQgSyBOlJMiPJSSkiA+IEWUID8gQpQgRiA8lJKSIj2TIkUgRYu7RI3ttaD3xrA+YxsiRUMAAAAAID4gUpQgPyBIlCBBIDyUkpIgPZMiQiBCi7tEje21oPfGsD5jGyJGlCFCIEVDAAAAACA+IFSUID8gRJQgTyA8lJKSID2TIj0gPYu7RI3ttaD3xrA+YxsiPZQiREMAAAAAXiBCQwAAAABecQ0AIBhBAiA5ID+UID4gO5STiyJBIDogPpQgPCA5lJOLIjleIgogOyA8lCA/IDqUk4sgQSA5IAobXhtBAnQiCmoqAgAhOSAKIBlqKgIAITogBUHgBWogCnIqAgAhOwJAIAVBkAZqIBsgGiAFQZAGaiAKcioCACAKIBtqKgIAIAogGmoqAgAgRSA9IEYgRCBCIAVBiAlqIDcgBUEQaiAFQfQIahB9IgpFBEAgBUHgBWogGSAYIDsgOiA5IEAgUCBMIFEgQyAFQYAJaiA2IAVB6AhqIAVB3AhqEH0aIAUqAogJIjkgBSoCjAkiOiA5IDpeIg4bIj0gBSoChAkiOyAFKgKACSI8IDsgPF0iDBsiP10NAiA8IDsgDBsiOyA6IDkgDhsiOV0NAgJAIDkgP14EQAJAIA5FBEAgBUH0CGohCCAFKgIYIVUgBSoCFCFWIAUqAhAhVyApIQcgKCENIDsgPV0NAQwDCyAFQRBqIQggBSoC/AghVSAFKgL4CCFWIAUqAvQIIVcgKyEHICohDSA7ID1dRQ0CCyAsIC4gDBshDSAtIC8gDBshByAFQegIaiAFQdwIaiAMGyEIDAELAkAgDEUEQCAFQdwIaiEIIAUqAvAIIVUgBSoC7AghViAFKgLoCCFXIC8hByAuIQ0gOyA9Xg0BDAILIAVB6AhqIQggBSoC5AghVSAFKgLgCCFWIAUqAtwIIVcgLSEHICwhDSA7ID1eRQ0BCyAqICggDhshDSArICkgDhshByAFQRBqIAVB9AhqIA4bIQgLIAgqAgAhXyANKgIAIWAgByoCACFhDAELIAVBIGogBUGQBmogGyAaIAVB4AVqIBkgGBB+RQ0BCwJAICZFBEAgBSAFKgKwBiAFKgKQBiI8kyI5OAKwBSAFIAUqAqQGIAUqApQGIjuTIjo4AsQFIAUgBSoCtAYgO5MiOzgCtAUgBSAFKgKgBiA8kyI8OALABSAFIDwgO5QgOSA6lJM4AqgFIAUgBSoCuAYgBSoCmAYiP5MiPTgCuAUgBSAFKgKoBiA/kyI/OALIBSAFID8gOZQgPSA8lJM4AqQFIAUgOiA9lCA7ID+UkzgCoAUgBUGgBWoQ0AIMAQsgBSAmIAtBDGxqIgsqAgA4AsAFIAUgCyoCBDgCxAUgCyoCCCE5IAVBADYCzAUgBSA5OALIBSAFQaAFaiAQIAVBwAVqEIgCIAVBgICA/AM2AqwFCwJAICVFBEAgBSAFKgKABiAFKgLgBSI8kyI5OAKwBSAFIAUqAvQFIAUqAuQFIjuTIjo4AsQFIAUgBSoChAYgO5MiOzgCtAUgBSAFKgLwBSA8kyI8OALABSAFIDwgO5QgOSA6lJM4ApgFIAUgBSoCiAYgBSoC6AUiP5MiPTgCuAUgBSAFKgL4BSA/kyI/OALIBSAFID8gOZQgPSA8lJM4ApQFIAUgOiA9lCA7ID+UkzgCkAUgBUGQBWoQ0AIMAQsgBSAlIAZBDGxqIgYqAgA4ArAFIAUgBioCBDgCtAUgBioCCCE5IAVBADYCvAUgBSA5OAK4BSAFQZAFaiARIAVBsAVqEIgCIAVBgICA/AM2ApwFCwJ/AkACfwJAAkAgCkUEQCAFQYCAgPwDNgLcBSAFIFUgYJJDAAAAP5Q4AtgFIAUgViBhkkMAAAA/lDgC1AUgBSBXIF+SQwAAAD+UOALQBSAFQeAEaiAFQZABaiAFQdAFahCJAiAFQdAEaiAAKAJYQdQAaiAFQeAEahCJAiAFKgLUBCE5IAUqAtQFITogBSoC0AQhOyAFKgLQBSE8IAUqAtgEIT0gBSoC2AUhPyAFQeAEaiAFQdAAaiAFQdAFahCJAiAFQcAEaiABKAJYQdQAaiAFQeAEahCJAiAFKgLEBCE+IAUqAtQFIUYgBSoCwAQhQiAFKgLQBSFAIAUqAsgEIUUgBSoC2AUhQyAFQeAEaiAFQZABaiAFQZAGahCJAiAFQdAEaiAAKAJYQdQAaiAFQeAEahCJAiAFIAUqApgGIAUqAtgEkyBDIEWTIkWTIkM4ApgEIAUgBSoCkAYgBSoC0ASTIEAgQpMiQpMiQDgCkAQgBSAFKgKUBiAFKgLUBJMgRiA+kyJGkyJEOAKUBCAFKgKYBSFBIAUqApAFIUggBSoClAUhTyAFQeAEaiAFQZABaiAbEIkCIAVB0ARqIAAoAlhB1ABqIAVB4ARqEIkCIAUgBSoCqAYgBSoC2ASTIEWTIlQ4AqgEIAUgBSoCoAYgBSoC0ASTIEKTIlI4AqAEIAUgBSoCpAYgBSoC1ASTIEaTIks4AqQEIAUqApgFIU0gBSoCkAUhSiAFKgKUBSFJIAVB4ARqIAVBkAFqIBoQiQIgBUHQBGogACgCWEHUAGogBUHgBGoQiQIgBSAFKgK4BiAFKgLYBJMgRZMiTjgCuAQgBSAFKgKwBiAFKgLQBJMgQpMiUzgCsAQgBSAFKgK0BiAFKgLUBJMgRpMiTDgCtAQgBSoCmAUhUCAFKgKQBSFRIAUqApQFIVggBUHgBGogBUHQAGogBUHgBWoQiQIgBUHABGogASgCWEHUAGogBUHgBGoQiQIgBSAFKgLoBSAFKgLIBJMgPyA9kyI9kyJZOALoAyAFIAUqAuAFIAUqAsAEkyA8IDuTIj+TIjs4AuADIAUgBSoC5AUgBSoCxASTIDogOZMiPpMiPDgC5AMgBSoCqAUhWiAFKgKgBSFbIAUqAqQFIVwgBUHgBGogBUHQAGogGRCJAiAFQcAEaiABKAJYQdQAaiAFQeAEahCJAiAFIAUqAvgFIAUqAsgEkyA9kyJdOAL4AyAFIAUqAvAFIAUqAsAEkyA/kyJiOALwAyAFIAUqAvQFIAUqAsQEkyA+kyJjOAL0AyAFKgKoBSFkIAUqAqAFIWUgBSoCpAUhZiAFQeAEaiAFQdAAaiAYEIkCIAVBwARqIAEoAlhB1ABqIAVB4ARqEIkCIAUgBSoCkAWMIl44ApAFIAUgBSoClAWMImc4ApQFIAUgBSoCmAWMImg4ApgFIAUgBSoChAYgBSoCxASTID6TImk4AoQEIAUqAqQFITkgBSAFKgKABiAFKgLABJMgP5MiajgCgAQgBSoCoAUhOiAFIAUqAogGIAUqAsgEkyA9kyJrOAKIBCBDIEGUIEAgSJQgRCBPlJKSiyBUIE2UIFIgSpQgSyBJlJKSi5IgTiBQlCBTIFGUIEwgWJSSkouSIkC7RDqMMOKOeUU+ZCBZIFqUIDsgW5QgPCBclJKSiyBdIGSUIGIgZZQgYyBmlJKSi5IgayAFKgKoBSI7lCBqIDqUIGkgOZSSkouSIjy7RDqMMOKOeUU+ZHJFDQIgPCBAXkUNASAFIDo4AoAFIAVB4AVqIQ4gBUHgA2ohBiAFQZAGaiEIDAQLIAUqAqgFIAUqApgFIjmUIAUqAqAFIAUqApAFIjqUIAUqAqQFIAUqApQFIjuUkpKLu0QrhxbZzvfvP2RFDQUgBSAFKgKQBiAFKgLgBZJDAAAAAJIgBSoCoAYiPyAFKgLwBSI+kpIgBSoCsAYgBSoCgAaSkkMAAMBAlTgCICAFIAUqApQGIAUqAuQFkkMAAAAAkiAFKgKkBiJFIAUqAvQFIkKSkiAFKgK0BiAFKgKEBpKSQwAAwECVOAIkIAUqArgGIUYgBSoCiAYhQCAFKgKYBiFDIAUqAugFIUQgBSoCqAYhPCAFKgL4BSE9IAVBgICA/AM2AiwgBSBDIESSQwAAAACSIDwgPZKSIEYgQJKSQwAAwECVOAIoIAUgOzgChAUgBSA6OAKABSAFIDk4AogFIAIgAyAEIAAgASAFQSBqIAVBgAVqIDwgPZMgOZQgPyA+kyA6lCA7IEUgQpOUkpIiOYwgOSA5QwAAAABdGyAFQcwGahB/DAULIAUgXjgCgAUgBUGQBmohDiAFQeAFaiEIIAVBkARqDAELIEUgRZQgQiBClCBGIEaUkpKRID0gPZQgPyA/lCA+ID6UkpKRXgRAIAUgOjgCgAUgBUHgBWohDiAFQeADaiEGIAVBkAZqIQgMAgsgBSBeOAKABSAFQZAGaiEOIAVB4AVqIQggBUGQBGoLIQYgZyE5IGghOyBeITogNCELIDUMAQsgMiELIDMLIQwgBSA7OAKIBSAFIDk4AoQFQQEhCgJAIAUqAtgFIjwgCyoCAJMgO5QgBSoC0AUiQCAOKgIAkyA6lCAFKgLUBSJDIAwqAgCTIDmUkpIiQUMAAAAAYEUNACAGKgIIIDuUIAYqAgAgOpQgOSAGKgIElJKSiyJEQ3fMKzIgRCBEQ3fMKzJeGyBBIEFDAAAAAFsbIkEgQbtE/Knx0k1iUD9jGyBBIES7RPyp8dJNYjA/YxsiQUMAAAAAXkUNACBBIERfRQ0AIAggBUGABWogDhCAAUUNACACIAMgBCAAIAEgDiAFQYAFaiBBIAVBzAZqEH9BACEKIAUqAogFITsgBSoC2AUhPCAFKgKEBSE5IAUqAtQFIUMgBSoCgAUhOiAFKgLQBSFACwJAIDwgDioCGJMgO5QgQCAOKgIQkyA6lCBDIA4qAhSTIDmUkpIiQUMAAAAAYEUNACAGKgIYIDuUIAYqAhAgOpQgOSAGKgIUlJKSiyJEQ3fMKzIgRCBEQ3fMKzJeGyBBIEFDAAAAAFsbIkEgQbtE/Knx0k1iUD9jGyBBIES7RPyp8dJNYjA/YxsiQUMAAAAAXkUNACBBIERfRQ0AIAggBUGABWogDkEQaiILEIABRQ0AIAIgAyAEIAAgASALIAVBgAVqIEEgBUHMBmoQf0EAIQogBSoCiAUhOyAFKgLYBSE8IAUqAoQFITkgBSoC1AUhQyAFKgKABSE6IAUqAtAFIUALAkAgPCAOKgIokyA7lCBAIA4qAiCTIDqUIEMgDioCJJMgOZSSkiI8QwAAAABgRQ0AIAYqAiggO5QgBioCICA6lCA5IAYqAiSUkpKLIjlDd8wrMiA5IDlDd8wrMl4bIDwgPEMAAAAAWxsiOiA6u0T8qfHSTWJQP2MbIDogObtE/Knx0k1iMD9jGyI6QwAAAABeRQ0AIDkgOmBFDQAgCCAFQYAFaiAOQSBqIgYQgAFFDQAgAiADIAQgACABIAYgBUGABWogOiAFQcwGahB/DAELIApFDQAgBSAFQaAFaiAFQZAFaiAOIAVBkAZqRiIMGyITKgIAIjk4AoAFIAUgEyoCBCI6OAKEBSAFIBMqAggiOzgCiAUgBUGQBmogBUHgBWogDBshCUEBIQYCQCA7IAUqAtgFIjwgBUHgBWogBUGQBmogDBsiCCoCCJOUIDkgBSoC0AUiQCAIKgIAk5QgOiAFKgLUBSJDIAgqAgSTlJKSIkFDAAAAAGBFDQAgBUHgA2pBCHIgBUGQBGpBCHIgDBsqAgAgO5QgBUHgA2ogBUGQBGogDBsqAgAgOZQgOiAFQeADakEEciAFQZAEakEEciAMGyoCAJSSkosiREN3zCsyIEQgREN3zCsyXhsgQSBBQwAAAABbGyJBIEG7RPyp8dJNYlA/YxsgQSBEu0T8qfHSTWIwP2MbIkFDAAAAAF5FDQAgQSBEX0UNACAJIAVBgAVqIAgQgAFFDQAgAiADIAQgACABIAggBUGABWogQSAFQcwGahB/QQAhBiAFKgKIBSE7IAUqAtgFITwgBSoChAUhOiAFKgLUBSFDIAUqAoAFITkgBSoC0AUhQAsgGSAbIAwbISICQCA8IAVB+AVqIAVBqAZqIAwbKgIAkyA7lCBAIAgqAhCTIDmUIEMgBUH0BWogBUGkBmogDBsqAgCTIDqUkpIiQUMAAAAAYEUNACAFQfgDaiAFQagEaiAMGyoCACA7lCAFQfADaiAFQaAEaiAMGyoCACA5lCA6IAVB9ANqIAVBpARqIAwbKgIAlJKSiyJEQ3fMKzIgRCBEQ3fMKzJeGyBBIEFDAAAAAFsbIkEgQbtE/Knx0k1iUD9jGyBBIES7RPyp8dJNYjA/YxsiQUMAAAAAXkUNACBBIERfRQ0AIAkgBUGABWogIhCAAUUNACACIAMgBCAAIAEgIiAFQYAFaiBBIAVBzAZqEH9BACEGIAUqAogFITsgBSoC2AUhPCAFKgKEBSE6IAUqAtQFIUMgBSoCgAUhOSAFKgLQBSFACyAYIBogDBshIwJAIDwgBUGIBmogBUG4BmogDBsqAgCTIDuUIEAgCCoCIJMgOZQgQyAFQYQGaiAFQbQGaiAMGyoCAJMgOpSSkiI8QwAAAABgRQ0AIAVBiARqIAVBuARqIAwbKgIAIDuUIAVBgARqIAVBsARqIAwbKgIAIDmUIDogBUGEBGogBUG0BGogDBsqAgCUkpKLIjlDd8wrMiA5IDlDd8wrMl4bIDwgPEMAAAAAWxsiOiA6u0T8qfHSTWJQP2MbIDogObtE/Knx0k1iMD9jGyI6QwAAAABeRQ0AIDkgOmBFDQAgCSAFQYAFaiAjEIABRQ0AIAIgAyAEIAAgASAjIAVBgAVqIDogBUHMBmoQfwwBCyAGRQ0AIAUgBUGQBWogBUGgBWogDBsqAgAiOTgCgAUgBSAFQZAFakEEciAFQaAFakEEciAMGyoCACI6OAKEBSAFIAVBkAVqQQhyIAVBoAVqQQhyIAwbKgIAIjs4AogFIAUgCCoCECJBIAgqAgAiQJMiPDgCwAUgBSBAIAgqAiAiSJM4ArAFIAUgCCoCFCJPIAgqAgQiQ5MiQDgCxAUgBSBDIAgqAiQiVJM4ArQFIAUgCCoCGCJSIAgqAggiS5MiQzgCyAUgCCoCKCFEIAUgPCA6lCA5IECUkzgCGCAFIEMgOZQgOyA8lJM4AhQgBSBAIDuUIDogQ5STOAIQIAUgSyBEkzgCuAUgBUEQahDQAiAFIAUqAhQiQIw4AiQgBSAFKgIYIkOMOAIoIAUqArgFITkgBSoChAUhOiAFKgKIBSE7IAUqArQFITwgBSAFKgIQjCJLOAIgIAgqAhghTSAIKgIIIUogCCoCECFJIAgqAgAhTiAIKgIUIVMgCCoCBCFMIAUgPCA7lCA6IDmUkzgCECAFIE4gSZJDAAAAP5QgS5QgQCBMIFOSQwAAAD+UlJMgQyBKIE2SQwAAAD+UlJM4AiwgBSA6IAUqArAFIkCUIDwgBSoCgAUiOpSTOAIYIAUgOSA6lCA7IECUkzgCFCAFQRBqENACIAUgBSoCFCI7jDgCNCAFIAUqAhgiPIw4AjggBSoCgAUhOSAFKgKEBSE6IAUgBSoCEIwiQDgCMCAIKgIoIUMgCCoCCCFLIAgqAiAhTSAIKgIAIUogCCoCJCFJIAgqAgQhTiAFIDogSCBBkyJBlCA5IFQgT5MiSJSTOAIYIAUgSCAFKgKIBSJPlCA6IEQgUpMiRJSTOAIQIAUgRCA5lCBPIEGUkzgCFCAFIEogTZJDAAAAP5QgQJQgOyBOIEmSQwAAAD+UlJMgPCBLIEOSQwAAAD+UlJM4AjwgBUEQahDQAiAFIAUqAhQiOYw4AkQgBSAFKgIYIjqMOAJIIAUgBSoCEIwiOzgCQCAFIAgqAiAgCCoCEJJDAAAAP5QgO5QgOSAIKgIkIAgqAhSSQwAAAD+UlJMgOiAIKgIoIAgqAhiSQwAAAD+UlJM4AkwgCSAFQSBqIAVB3AJqEIEBQQAhCkEBIRxBfyAFKALcAyIGQQR0IAZB/////wBLGxCNBCEhAkACQAJAIAZBAEoEQANAIApBBHQiCyAFQdwCamoiBkGAgID8AzYCDCAFKgLYBSAGKgIIkyAFKgKIBZQgBSoC0AUgBioCAJMgBSoCgAWUIAUqAtQFIAYqAgSTIAUqAoQFlJKSITkgCyAhaiILQQhqIQcgC0EEaiENIAZBCGohHyAGQQRqISQCfSAFQZAGaiAORgRAIAVB4ARqIAVBkAFqIAYQiQIgBUHQBGogACgCWEHUAGogBUHgBGoQiQIgBioCACAFKgLQBJMgQpMhOiAgIQ8gRiE7IB4hEiBFDAELIAVB4ARqIAVB0ABqIAYQiQIgBUHABGogASgCWEHUAGogBUHgBGoQiQIgBioCACAFKgLABJMgP5MhOiAdIQ8gPiE7IBchEiA9CyE8IAsgOjgCACANICQqAgAgDyoCAJMgO5MiOzgCACAHIB8qAgAgEioCAJMgPJMiPDgCACA8IAUqAogFlCA6IAUqAoAFlCA7IAUqAoQFlJKSiyFHAkAgOUMAAAAAYEUNACBHQ3fMKzIgRyBHQ3fMKzJeGyA5IDlDAAAAAFsbIjkgObtE/Knx0k1iUD9jGyA5IEe7RPyp8dJNYjA/YxsiOSBHX0UNACACIAMgBCAAIAEgBiAFQYAFaiA5IAVBzAZqEH9BACEcCyAKQQFqIgogBSgC3ANIDQALIBxFDQELIAUgEyoCACI5OAKABSAFIBMqAgQiOjgChAUgBSATKgIIIjs4AogFIAUgCSoCECJBIAkqAgAiQJMiPDgCwAUgBSBAIAkqAiAiSJM4ArAFIAUgCSoCFCJPIAkqAgQiQ5MiQDgCxAUgBSBDIAkqAiQiVJM4ArQFIAUgCSoCGCJSIAkqAggiS5MiQzgCyAUgCSoCKCFEIAUgPCA6lCA5IECUkzgCGCAFIEMgOZQgOyA8lJM4AhQgBSBAIDuUIDogQ5STOAIQIAUgSyBEkzgCuAUgBUEQahDQAiAFIAUqAhQiQIw4AiQgBSAFKgIYIkOMOAIoIAUqArgFITkgBSoChAUhOiAFKgKIBSE7IAUqArQFITwgBSAFKgIQjCJLOAIgIAkqAhghTSAJKgIIIUogCSoCECFJIAkqAgAhTiAJKgIUIVMgCSoCBCFMIAUgPCA7lCA6IDmUkzgCECAFIE4gSZJDAAAAP5QgS5QgQCBMIFOSQwAAAD+UlJMgQyBKIE2SQwAAAD+UlJM4AiwgBSA6IAUqArAFIkCUIDwgBSoCgAUiOpSTOAIYIAUgOSA6lCA7IECUkzgCFCAFQRBqENACIAUgBSoCFCI7jDgCNCAFIAUqAhgiPIw4AjggBSoCgAUhOSAFKgKEBSE6IAUgBSoCEIwiQDgCMCAJKgIoIUMgCSoCCCFLIAkqAiAhTSAJKgIAIUogCSoCJCFJIAkqAgQhTiAFIDogSCBBkyJBlCA5IFQgT5MiSJSTOAIYIAUgSCAFKgKIBSJPlCA6IEQgUpMiRJSTOAIQIAUgRCA5lCBPIEGUkzgCFCAFIEogTZJDAAAAP5QgQJQgOyBOIEmSQwAAAD+UlJMgPCBLIEOSQwAAAD+UlJM4AjwgBUEQahDQAiAFIAUqAhQiOYw4AkQgBSAFKgIYIjqMOAJIIAUgBSoCEIwiOzgCQCAFIAkqAiAgCSoCEJJDAAAAP5QgO5QgOSAJKgIkIAkqAhSSQwAAAD+UlJMgOiAJKgIoIAkqAhiSQwAAAD+UlJM4AkwgCCAFQSBqIAVB2AFqEIEBQQAhCkEBITBBfyAFKALYAiIGQQR0IAZB/////wBLGxCNBCEcIAZBAEoEQANAIApBBHQiCyAFQdgBamoiBkGAgID8AzYCDCAFKgLYBSAGKgIIkyAFKgKIBZQgBSoC0AUgBioCAJMgBSoCgAWUIAUqAtQFIAYqAgSTIAUqAoQFlJKSITkgCyAcaiILQQhqIQcgC0EEaiENIAZBCGohHyAGQQRqISQCfSAMRQRAIAVB4ARqIAVBkAFqIAYQiQIgBUHQBGogACgCWEHUAGogBUHgBGoQiQIgBioCACAFKgLQBJMgQpMhOiAgIQ8gRiE7IB4hEiBFDAELIAVB4ARqIAVB0ABqIAYQiQIgBUHABGogASgCWEHUAGogBUHgBGoQiQIgBioCACAFKgLABJMgP5MhOiAdIQ8gPiE7IBchEiA9CyE8IAsgOjgCACANICQqAgAgDyoCAJMgO5MiOzgCACAHIB8qAgAgEioCAJMgPJMiPDgCACA8IAUqAogFlCA6IAUqAoAFlCA7IAUqAoQFlJKSiyFHAkAgOUMAAAAAYEUNACBHQ3fMKzIgRyBHQ3fMKzJeGyA5IDlDAAAAAFsbIjkgObtE/Knx0k1iUD9jGyA5IEe7RPyp8dJNYjA/YxsiOSBHX0UNACACIAMgBCAAIAEgBiAFQYAFaiA5IAVBzAZqEH9BACEwCyAKQQFqIgogBSgC2AJIDQALIDBFDQMLID0gRZMhTCA/IEKTIVAgPiBGkyFRIAUgBSoCkAUiOSAFKgKgBSI6IAwbIj44AoAFIAUgBSoClAUiOyAFKgKkBSI8IAwbIkU4AoQFIAUgBSoCmAUiPSAFKgKoBSI/IAwbIkI4AogFIAVBkARqIAVB4ANqIAwbIQcCQCA/ID2UIDogOZQgPCA7lJKSi7tEexSuR+F6hD9jRQ0AIEwgTJQgUCBQlCBRIFGUkpKRu0Q6jDDijnlFPmMEQCBCIEyUID4gUJQgUSBFlJKSiyI5u0QR6i2BmZdxPWRFDQQgBUGABWoQ0AIgAiADIAQgACABIAVB0AVqIAVBgAVqIDkgBUHMBmoQfwwECyAFIDogO5QgOSA8lJM4AiggBSA/IDmUID0gOpSTOAIkIAUgPCA9lCA7ID+UkzgCICAFQSBqENACIAUgBSoCICI5OAKABSAFIAUqAiQiOjgChAUgBSAFKgIoIjs4AogFAn0gOyAIKgIIIkMgCSoCCCJCk5QgOSAIKgIAIkQgCSoCACI/k5QgOiAIKgIEIkEgCSoCBCJGk5SSkiI9i0MAAIB/XUUEQEMAAIB/IT0gBSoCGCFFIAUqAhQMAQsgByoCCCA7lCAHKgIAIDmUIDogByoCBJSSkoshRyBCIUUgRgshPiAIKgIYIkggQpMgO5QgCCoCECJPID+TIDmUIAgqAhQiVCBGkyA6lJKSIkCLIlIgPYsiPF0EQCAHKgIIIDuUIAcqAgAgOZQgOiAHKgIElJKSiyFHIEIhRSBGIT4gQCE9IFIhPAsgPCAIKgIoIlIgQpMgO5QgCCoCICJLID+TIDmUIAgqAiQiTSBGkyA6lJKSIkCLIkpeBEAgByoCCCA7lCAHKgIAIDmUIDogByoCBJSSkoshRyBCIUUgRiE+IEAhPSBKITwLIDwgQyAJKgIYIkKTIDuUIEQgCSoCECJGkyA5lCBBIAkqAhQiQJMgOpSSkiJKiyJJXgRAIAcqAhggO5QgByoCECA5lCA6IAcqAhSUkpKLIUcgQiFFIEAhPiBGIT8gSiE9IEkhPAsgPCBIIEKTIDuUIE8gRpMgOZQgVCBAkyA6lJKSIkqLIkleBEAgByoCGCA7lCAHKgIQIDmUIDogByoCFJSSkoshRyBCIUUgQCE+IEYhPyBKIT0gSSE8CyA8IFIgQpMgO5QgSyBGkyA5lCBNIECTIDqUkpIiSosiSV4EQCAHKgIYIDuUIAcqAhAgOZQgOiAHKgIUlJKSiyFHIEIhRSBAIT4gRiE/IEohPSBJITwLIDwgQyAJKgIoIkKTIDuUIEQgCSoCICJGkyA5lCBBIAkqAiQiQJMgOpSSkiJDiyJEXgRAIAcqAiggO5QgByoCICA5lCA6IAcqAiSUkpKLIUcgQiFFIEAhPiBGIT8gQyE9IEQhPAsgPCBIIEKTIDuUIE8gRpMgOZQgVCBAkyA6lJKSIkOLIkReBEAgByoCKCA7lCAHKgIgIDmUIDogByoCJJSSkoshRyBCIUUgQCE+IEYhPyBDIT0gRCE8CyA8IFIgQpMgO5QgSyBGkyA5lCBNIECTIDqUkpIiQ4teBEAgByoCKCA7lCAHKgIgIDmUIDogByoCJJSSkoshRyBCIUUgRiE/IEMhPSBAIT4LIAUgRTgCGCAFID44AhQgBSA/OAIQID1DAAAAAF0EQCAFIDuMOAKIBSAFIDqMOAKEBSAFIDmMOAKABSA9jCE9CyA9QwAAAABeRQ0AID0gR19FDQAgAiADIAQgACABIAVBEGogBUGABWogPSAFQcwGahB/DAMLIBogGCAMGyEfIBsgGSAMGyEMIAUCfSAOIAVBkAZqRyINRQRAIAUgUYw4AiQgBSBQjDgCICBMjAwBCyAFIFE4AiQgBSBQOAIgIEwLOAIoIAVBIGoQ0AIgCCoCGCJYIAgqAggiQ5MiTyAFKgIgIkUgCCoCJCJZIAgqAgQiRJMiOZQgCCoCICJaIAgqAgAiQZMiOiAFKgIkIkKUkyJUlCAIKgIQIlsgQZMiUiBCIAgqAigiXCBDkyI7lCA5IAUqAigiRpSTIkuUIAgqAhQiXSBEkyJNIEYgOpQgOyBFlJMiSpSSkiI5uyJsRPyp8dJNYlC/ZCBsRPyp8dJNYlA/Y3EhC0MAAIA/IDmVIUBDAACAfyFIQQAhBiAFKgIYIUkgBSoCFCFOA0ACQCALDQAgQCAJIAZBBHQiDmoiCioCCCI6IEOTIj0gVJQgCioCACI7IEGTIj8gS5QgSiAKKgIEIjwgRJMiPpSSkpQiOUMAAAAAXQ0AIDlDAACAP14NACAHIA5qIQoCQCBAIEYgPyBNlCBSID6Uk5QgRSA+IE+UIE0gPZSTlCBCID0gUpQgTyA/lJOUkpKUIj1DAAAAAF0gOSA9kkMAAIA/XnIiDg0AIEMgOpMgRpQgQSA7kyBFlCBEIDyTIEKUkpIiOYsgSItdRQ0AIAoqAgggRpQgCioCACBFlCBCIAoqAgSUkpKLIUcgOiFJIDwhTiA7IVMgOSFICwJAIA4NACBYIDqTIEaUIFsgO5MgRZQgXSA8kyBClJKSIjmLIEiLXUUNACAKKgIIIEaUIAoqAgAgRZQgQiAKKgIElJKSiyFHIDohSSA8IU4gOyFTIDkhSAsgDg0AIFwgOpMgRpQgWiA7kyBFlCBZIDyTIEKUkpIiOYsgSItdRQ0AIAoqAgggRpQgCioCACBFlCBCIAoqAgSUkpKLIUcgOiFJIDwhTiA7IVMgOSFICyAGQQFqIgZBA0cNAAsgBSBJOAIYIAUgTjgCFCAFIFM4AhACQCBIQwAAAABeRQ0AIEcgSGBFDQAgAiADIAQgACABIAVBEGogBUEgaiBIIAVBzAZqEH8MAwsCQCAFKgKoBSBMlCAFKgKgBSBQlCBRIAUqAqQFlJKSi7tEexSuR+F6hD9jRQ0AIAUqApgFIEyUIAUqApAFIFCUIFEgBSoClAWUkpKLu0R7FK5H4XqEP2NFDQAgBQJ9IA1FBEAgBSBRjDgCJCAFIFCMOAIgIEyMDAELIAUgUTgCJCAFIFA4AiAgTAs4AiggBUEgahDQAkEAIQpBASEHIAUoAtwDIg5BAEoEQANAAkAgBSoC2AUgCkEEdCILIAVB3AJqaiIGKgIIkyAFKgIoIjqUIAUqAtAFIAYqAgCTIAUqAiAiO5QgBSoC1AUgBioCBJMgBSoCJCI8lJKSIjlDAAAAAGBFDQAgCyAhaiILKgIIIDqUIAsqAgAgO5QgCyoCBCA8lJKSiyJHIDkgR7tE/Knx0k1iMD9jGyA5IDm7RPyp8dJNYlA/YxsiOSBHX0UNACACIAMgBCAAIAEgBiAFQSBqIDkgBUHMBmoQf0EAIQcgBSgC3AMhDgsgCkEBaiIKIA5IDQALIAdFDQQLQQAhCkEBIQcgBSgC2AIiDkEATA0AA0ACQCAFKgLYBSAKQQR0IgsgBUHYAWpqIgYqAgiTIAUqAigiOpQgBSoC0AUgBioCAJMgBSoCICI7lCAFKgLUBSAGKgIEkyAFKgIkIjyUkpIiOUMAAAAAYEUNACALIBxqIgsqAgggOpQgCyoCACA7lCALKgIEIDyUkpKLIkcgOSBHu0T8qfHSTWIwP2MbIDkgObtE/Knx0k1iUD9jGyI5IEdfRQ0AIAIgAyAEIAAgASAGIAVBIGogOSAFQcwGahB/QQAhByAFKALYAiEOCyAKQQFqIgogDkgNAAsgB0UNAwsgTCBMlCBQIFCUIFEgUZSSkpG7RPFo44i1+OQ+YwRAQQEhBgJAQ6zFpzYgBSoC2AUiOSAJKgIIkyAFKgKIBSI6lCAFKgLQBSI7IAkqAgCTIAUqAoAFIjyUIAUqAtQFIj0gCSoCBJMgBSoChAUiP5SSkiI+ID5DAAAAAFsbIj5DAAAAAF5FDQAgPrtE/Knx0k1iMD9lRQ0AIAIgAyAEIAAgASAJIAVBgAVqID4gBUHMBmoQf0EAIQYgBSoCiAUhOiAFKgLYBSE5IAUqAoQFIT8gBSoC1AUhPSAFKgKABSE8IAUqAtAFITsLAkBDrMWnNiA5IAkqAhiTIDqUIDsgCSoCEJMgPJQgPSAJKgIUkyA/lJKSIj4gPkMAAAAAWxsiPkMAAAAAXkUNACA+u0T8qfHSTWIwP2VFDQAgAiADIAQgACABIAwgBUGABWogPiAFQcwGahB/QQAhBiAFKgKIBSE6IAUqAtgFITkgBSoChAUhPyAFKgLUBSE9IAUqAoAFITwgBSoC0AUhOwsCQEOsxac2IDkgCSoCKJMgOpQgOyAJKgIgkyA8lCA9IAkqAiSTID+UkpIiOSA5QwAAAABbGyI5QwAAAABeRQ0AIDm7RPyp8dJNYjA/ZUUNACACIAMgBCAAIAEgHyAFQYAFaiA5IAVBzAZqEH8MBAsgBkUNAyAFIBMqAgAiOTgCgAUgBSATKgIEIjo4AoQFIAUgEyoCCCI7OAKIBUEBIQYCQEOsxac2IDsgBSoC2AUiPCAIKgIIk5QgOSAFKgLQBSI9IAgqAgCTlCA6IAUqAtQFIj8gCCoCBJOUkpIiPiA+QwAAAABbGyI+QwAAAABeRQ0AID67RPyp8dJNYjA/ZUUNACACIAMgBCAAIAEgCCAFQYAFaiA+IAVBzAZqEH9BACEGIAUqAogFITsgBSoC2AUhPCAFKgKEBSE6IAUqAtQFIT8gBSoCgAUhOSAFKgLQBSE9CwJAQ6zFpzYgPCAIKgIYkyA7lCA9IAgqAhCTIDmUID8gCCoCFJMgOpSSkiI+ID5DAAAAAFsbIj5DAAAAAF5FDQAgPrtE/Knx0k1iMD9lRQ0AIAIgAyAEIAAgASAiIAVBgAVqID4gBUHMBmoQf0EAIQYgBSoCiAUhOyAFKgLYBSE8IAUqAoQFITogBSoC1AUhPyAFKgKABSE5IAUqAtAFIT0LAkBDrMWnNiA8IAgqAiiTIDuUID0gCCoCIJMgOZQgPyAIKgIkkyA6lJKSIjkgOUMAAAAAWxsiOUMAAAAAXkUNACA5u0T8qfHSTWIwP2VFDQAgAiADIAQgACABICMgBUGABWogOSAFQcwGahB/DAQLIAZFDQMLIAUoAswGIgtBAEwNAUMAAAAAITtDAACAfyE6QQAhCiAFKgL4BCE8IAUqAvQEIT0gBSoC8AQhPwNAIAogJ08EQCAFQf8jNgIEIAVB180ANgIAQQFBn8oAIAUQjgELIDogAyAEIApsaiIGKgIIIAUqAtgFkyI5IDmUIAYqAgAgBSoC0AWTIjkgOZQgBioCBCAFKgLUBZMiOSA5lJKSIjleBEAgBioCFIwhPSAGKgIgITsgBioCEIwhPyA5ITogBioCGIwhPAsgCkEBaiIKIAtHDQALIAUgPDgC+AQgBSA9OAL0BCAFID84AvAEIDtDAAAAAF5FDQEgAiADIAQgACABIAVB0AVqIAVB8ARqIDsgBUHMBmoQfwwCCyAhEIoEDAILIAUgBSoCqAUiOSAFKgKYBSI6IEwgOZQgUCAFKgKgBSI5lCBRIAUqAqQFIjuUkpIgTCA6lCBQIAUqApAFIjqUIFEgBSoClAUiPJSSkl0iBhs4AvgEIAUgOyA8IAYbOAL0BCAFIDkgOiAGGzgC8AQgAiADIAQgACABIAVB0AVqIAVB8ARqQ6zFpzYgBUHMBmoQfwsgIRCKBCAcEIoECyAWQQFqIhYgOEcNAAsgBSgCzAYhFgsgBUGQCWokACAWC7wHAhB9AX8jAEEQayISJAAgACoCCCIGIAAqAhwiB5QgACoCGCIDIAAqAgwiCJSTIAAqAiAiCSAAKgI0IgqUIAAqAjAiCyAAKgIkIgSUk5QgACoCBCIMIAOUIAAqAhQiAiAGlJMgCSAAKgI8Ig2UIAsgACoCLCIOlJOUIAAqAgAiDyAHlCAAKgIQIhAgCJSTIAQgACoCOCIRlCAKIAAqAigiBZSTlCAPIAKUIBAgDJSTIAUgDZQgESAOlJOUIAQgDZQgCiAOlJMgDyADlCAQIAaUk5STkpIgDCAHlCACIAiUkyAJIBGUIAsgBZSTlJOSIgZDAAAAAFsEQCASQYPPADYCAEECQdnfACASEI4BIAAqAiQhBCAAKgIYIQMgACoCKCEFIAAqAhQhAgsgAUMAAIA/IAaVIgYgAiAFlCAEIAOUk5Q4AgAgASAGIAAqAiQgACoCCJQgACoCBCAAKgIolJOUOAIEIAAqAhghAyAAKgIEIQQgACoCFCECIAAqAgghBSABQQA2AgwgASAGIAQgA5QgAiAFlJOUOAIIIAEgBiAAKgIYIAAqAiCUIAAqAiggACoCEJSTlDgCECABIAYgACoCKCAAKgIAlCAAKgIIIAAqAiCUk5Q4AhQgACoCECEDIAAqAgghBCAAKgIYIQIgACoCACEFIAFBADYCHCABIAYgBCADlCACIAWUk5Q4AhggASAGIAAqAhAgACoCJJQgACoCICAAKgIUlJOUOAIgIAEgBiAAKgIgIAAqAgSUIAAqAgAgACoCJJSTlDgCJCAAKgIUIQMgACoCACEEIAAqAhAhAiAAKgIEIQUgAUEANgIsIAEgBiAEIAOUIAIgBZSTlDgCKCABIAYgACoCGCAAKgIkIgMgACoCMCIElCAAKgI0IgIgACoCICIFlJOUIAAqAhAgACoCKCIHIAKUIAAqAjgiAiADlJOUIAAqAhQgBSAClCAEIAeUk5SSkpQ4AjAgASAGIAAqAiggACoCBCIDIAAqAjAiBJQgACoCNCICIAAqAgAiBZSTlCAAKgIgIAAqAggiByAClCAAKgI4IgIgA5STlCAAKgIkIAUgApQgBCAHlJOUkpKUOAI0IAAqAjghCSAAKgIwIQogACoCFCEDIAAqAgQhBCAAKgI0IQsgACoCACECIAAqAhghBSAAKgIQIQcgACoCCCEIIAFBgICA/AM2AjwgASAGIAkgBCAHlCADIAKUk5QgCiAIIAOUIAUgBJSTlCALIAIgBZQgByAIlJOUkpKUOAI4IBJBEGokAAvzCAECfQJ/IAlDAAAAAF4EQCALIAMgBZMgCCAIIAaTlSIGlCAFkjgCACACKgIIIQMgACoCCCEJIAIqAgQhCiAAKgIEIQ8gDSACKgIAIhAgBiAAKgIAIBCTlJI4AgAgDSAGIA8gCpOUIAIqAgSSOAIEIA0gBiAJIAOTlCACKgIIkjgCCCAMIAQgBZMgCCAIIAeTlSIIlCAFkjgCACAIIAEqAgggAioCCJOUIQUgCCABKgIEIAIqAgSTlCEHIAIqAgAiBCAIIAEqAgAgBJOUkiEIIAJBCGohDSACQQRqDAELIApDAAAAAF4EQCALIAMgBJMgByAHIAaTlSIGlCAEkjgCACABKgIIIQMgACoCCCEJIAEqAgQhCiAAKgIEIQ8gDSABKgIAIhAgBiAAKgIAIBCTlJI4AgAgDSAGIA8gCpOUIAEqAgSSOAIEIA0gBiAJIAOTlCABKgIIkjgCCCAMIAUgBJMgByAHIAiTlSIIlCAEkjgCACAIIAIqAgggASoCCJOUIQUgCCACKgIEIAEqAgSTlCEHIAEqAgAiBCAIIAIqAgAgBJOUkiEIIAFBCGohDSABQQRqDAELIAcgCJRDAAAAAF5FIAZDAAAAAFtxRQRAIAsgBCADkyAGIAYgB5OVIgeUIAOSOAIAIAAqAgghBCABKgIIIQkgACoCBCEKIAEqAgQhDyANIAAqAgAiECAHIAEqAgAgEJOUkjgCACANIAcgDyAKk5QgACoCBJI4AgQgDSAHIAkgBJOUIAAqAgiSOAIIIAwgBSADkyAGIAYgCJOVIgiUIAOSOAIAIAggAioCCCAAKgIIk5QhBSAIIAIqAgQgACoCBJOUIQcgACoCACIEIAggAioCACAEk5SSIQggAEEIaiENIABBBGoMAQsgB0MAAAAAXARAIAsgAyAEkyAHIAcgBpOVIgaUIASSOAIAIAEqAgghAyAAKgIIIQkgASoCBCEKIAAqAgQhDyANIAEqAgAiECAGIAAqAgAgEJOUkjgCACANIAYgDyAKk5QgASoCBJI4AgQgDSAGIAkgA5OUIAEqAgiSOAIIIAwgBSAEkyAHIAcgCJOVIgiUIASSOAIAIAggAioCCCABKgIIk5QhBSAIIAIqAgQgASoCBJOUIQcgASoCACIEIAggAioCACAEk5SSIQggAUEIaiENIAFBBGoMAQsgCEMAAAAAWwRAQQEPCyALIAMgBZMgCCAIIAaTlSIGlCAFkjgCACACKgIIIQMgACoCCCEJIAIqAgQhCiAAKgIEIQ8gDSACKgIAIhAgBiAAKgIAIBCTlJI4AgAgDSAGIA8gCpOUIAIqAgSSOAIEIA0gBiAJIAOTlCACKgIIkjgCCCAMIAQgBZMgCCAIIAeTlSIIlCAFkjgCACAIIAEqAgggAioCCJOUIQUgCCABKgIEIAIqAgSTlCEHIAIqAgAiBCAIIAEqAgAgBJOUkiEIIAJBCGohDSACQQRqCyECIA4gCDgCACAOIAcgAioCAJI4AgQgDiAFIA0qAgCSOAIIQQAL/Q8CIH0DfyAAKgIIiyEHIAQCfyAAKgIAiyIQIAAqAgSLIgheBEBBAkEBIAcgEF0iJxsMAQtBAUECIAcgCF4bCyIpQQJ0IgBqKgIAIg0gACAFaioCACIVkyIKIAEgJ0ECdCIoaioCACITIAQgKGoqAgAiDpMiDJQgACABaioCACIUIA2TIhEgDiAFIChqKgIAIhaTIg+UkyEIAkACQAJAAkAgACACaioCACIcIBSTIhAgD5QgCiACIChqKgIAIh0gE5MiHpSTIgdDAAAAAF5FDQAgCEMAAAAAYEUNACAHIAhgDQELIAdDAAAAAF1FDQEgCEMAAAAAX0UNASAHIAhfRQ0BCyAeIBGUIAwgEJSTIQggB0MAAAAAXgRAIAhDAAAAAGBFDQFBASEAIAcgCGBFDQEMAgsgCEMAAAAAX0UNAEEBIQAgByAIXw0BCyAVIAYgKUECdGoqAgAiF5MiDCATIBaTIhiUIBQgFZMiGyAWIAYgJ0ECdGoqAgAiGZMiEZSTIQgCQAJAAkAgECARlCAMIB6MIiGUkiIHQwAAAABeRQ0AIAhDAAAAAGBFDQAgByAIYA0BCyAHQwAAAABdRQ0BIAhDAAAAAF9FDQEgByAIX0UNAQsgHiAblCAYIBCUkyEIIAdDAAAAAF4EQCAIQwAAAABgRQ0BQQEhACAHIAhgRQ0BDAILIAhDAAAAAF9FDQBBASEAIAcgCF8NAQsgFyANkyIYIBMgGZMiCZQgFCAXkyIaIBkgDpMiG5STIQgCQAJAAkAgECAblCAYICGUkiIHQwAAAABeRQ0AIAhDAAAAAGBFDQAgByAIYA0BCyAHQwAAAABdRQ0BIAhDAAAAAF9FDQEgByAIX0UNAQsgHiAalCAJIBCUkyEIIAdDAAAAAF4EQCAIQwAAAABgRQ0BQQEhACAHIAhgRQ0BDAILIAhDAAAAAF9FDQBBASEAIAcgCF8NAQsgCiAdIA6TIguUIBwgDZMiEiAPjCIjlJIhCQJAAkACQCADIClBAnRqKgIAIh8gHJMiCCAPlCAKIAMgJ0ECdGoqAgAiICAdkyIalJMiB0MAAAAAXkUNACAJQwAAAABgRQ0AIAcgCWANAQsgB0MAAAAAXUUNASAJQwAAAABfRQ0BIAcgCV9FDQELIBogEpQgCyAIlJMhCSAHQwAAAABeBEAgCUMAAAAAYEUNAUEBIQAgByAJYEUNAQwCCyAJQwAAAABfRQ0AQQEhACAHIAlfDQELIAwgHSAWkyILlCAcIBWTIhIgEYwiJJSSIQkCQAJAAkAgCCARlCAMIBqMIiKUkiIHQwAAAABeRQ0AIAlDAAAAAGBFDQAgByAJYA0BCyAHQwAAAABdRQ0BIAlDAAAAAF9FDQEgByAJX0UNAQsgGiASlCALIAiUkyEJIAdDAAAAAF4EQCAJQwAAAABgRQ0BQQEhACAHIAlgRQ0BDAILIAlDAAAAAF9FDQBBASEAIAcgCV8NAQsgGCAdIBmTIguUIBwgF5MiEiAbjCIllJIhCQJAAkACQCAIIBuUIBggIpSSIgdDAAAAAF5FDQAgCUMAAAAAYEUNACAHIAlgDQELIAdDAAAAAF1FDQEgCUMAAAAAX0UNASAHIAlfRQ0BCyAaIBKUIAsgCJSTIQkgB0MAAAAAXgRAIAlDAAAAAGBFDQFBASEAIAcgCWBFDQEMAgsgCUMAAAAAX0UNAEEBIQAgByAJXw0BCyAKICAgDpMiEpQgHyANkyImICOUkiELAkACQAJAIBQgH5MiCSAPlCAKIBMgIJMiD5STIgdDAAAAAF5FDQAgC0MAAAAAYEUNACAHIAtgDQELIAdDAAAAAF1FDQEgC0MAAAAAX0UNASAHIAtfRQ0BCyAPICaUIBIgCZSTIQogB0MAAAAAXgRAIApDAAAAAGBFDQFBASEAIAcgCmBFDQEMAgsgCkMAAAAAX0UNAEEBIQAgByAKXw0BCyAMICAgFpMiC5QgHyAVkyISICSUkiEKAkACQAJAIAkgEZQgDCAPjCIRlJIiB0MAAAAAXkUNACAKQwAAAABgRQ0AIAcgCmANAQsgB0MAAAAAXUUNASAKQwAAAABfRQ0BIAcgCl9FDQELIA8gEpQgCyAJlJMhCiAHQwAAAABeBEAgCkMAAAAAYEUNAUEBIQAgByAKYEUNAQwCCyAKQwAAAABfRQ0AQQEhACAHIApfDQELIBggICAZkyIMlCAfIBeTIgsgJZSSIQoCQAJAAkAgCSAblCAYIBGUkiIHQwAAAABeRQ0AIApDAAAAAGBFDQAgByAKYA0BCyAHQwAAAABdRQ0BIApDAAAAAF9FDQEgByAKX0UNAQsgDyALlCAMIAmUkyEKIAdDAAAAAF4EQCAKQwAAAABgRQ0BQQEhACAHIApgRQ0BDAILIApDAAAAAF9FDQBBASEAIAcgCl8NAQsgFSANkyIHIBOUIBQgFiAOkyIKlJMgDSAKlCAHIA6Uk5IiDCAXIBWTIgcgE5QgFCAZIBaTIgqUkyAVIAqUIAcgFpSTkpRDAAAAAF4EQEEBIQAgDCANIBeTIgcgE5QgFCAOIBmTIgqUkyAXIAqUIAcgGZSTkpRDAAAAAF4NAQsgHiAUlCAQIBOUkyAQIA6UIA0gIZSSkiIHIAggDpQgDSAilJIgHCAalCAIIB2Uk5KUQwAAAABeBEBBASEAIAcgCSAOlCANIBGUkiAfIA+UIAkgIJSTkpRDAAAAAF4NAQtBACEACyAAC+EDAgR/AX0jAEEgayIKJAACQCAHQwAAAABdDQAgCCgCACIJIABB//8DcSILRg0AIAlBAEoEQEEAIQADQCAAIAtPBEAgCkH/IzYCFCAKQdfNADYCEEEBQZ/KACAKQRBqEI4BCwJAIAUqAgggASAAIAJsaiIJKgIIkyINIA2UIAUqAgAgCSoCAJMiDSANlCAFKgIEIAkqAgSTIg0gDZSSkkMAAAA0XUUNACAGKgIIIAkqAhiUIAYqAgAgCSoCEJQgBioCBCAJKgIUlJKSi0P+/38/XkUNAEEBIQwgCSoCICAHXUUNACAJIAc4AiAgCSAGKgIAjDgCECAJIAYqAgSMOAIUIAYqAgghDSAJQQA2AhwgCSANjDgCGAsgAEEBaiIAIAgoAgAiCUgNAAsgDA0BCyAJIQAgCSALTwRAIApB/yM2AgQgCkHXzQA2AgBBAUGfygAgChCOASAIKAIAIQALIAEgAiAJbGoiCSAFKgIAOAIAIAkgBSoCBDgCBCAFKgIIIQ0gCUEANgIMIAkgDTgCCCAJIAYqAgCMOAIQIAkgBioCBIw4AhQgBioCCCENIAkgBDYCKCAJIAM2AiQgCSAHOAIgIAlBADYCHCAJIA2MOAIYIAggAEEBajYCAAsgCkEgaiQAC7wCAw59AX8BfAJAIAAqAhggACoCCCIFkyIJIAEqAgAiCiAAKgIkIAAqAgQiA5MiB5QgACoCICAAKgIAIgaTIgggASoCBCILlJMiD5QgACoCECAGkyIMIAsgACoCKCAFkyIElCAHIAEqAggiDZSTIgeUIAAqAhQgA5MiDiANIAiUIAQgCpSTIgiUkpIiBLsiEkT8qfHSTWJQv2QgEkT8qfHSTWJQP2NxDQBDAACAPyAElSIQIAIqAgggBZMiBCAPlCACKgIAIAaTIgYgB5QgCCACKgIEIAOTIgOUkpKUIgVDAAAAAF0NACAFQwAAgD9eDQAgECANIAYgDpQgDCADlJOUIAogAyAJlCAOIASUk5QgCyAEIAyUIAkgBpSTlJKSlCIDQwAAAABdQX9zIAUgA5JDAACAP15FcSERCyARC8EMAwd/BX0BfCMAQaABayIFJAAgAiAAKgIAOAIAIAIgACoCBDgCBCACIAAqAgg4AgggAiAAKgIQOAIQIAIgACoCFDgCFCACIAAqAhg4AhggAiAAKgIgOAIgIAIgACoCJDgCJCACIAAqAig4AihBAyEAA0AgACEHQQAhAAJAIAdBAEwNACABIAlBBHRqIgAqAgghCiAAKgIEIQwgACoCACENIAAqAgwiDou7IQ9BfyEDQQAhAEEAIQhBACEGA0AgBUGAAWogAEECdGogD0Q6jDDijnlFPqIgCiACIABBBHRqIgQqAgiUIA0gBCoCAJQgDCAEKgIElJKSIA6Tu6C2Igs4AgAgACADIANBAEgbIAMgC0MAAAAAYCIEGyEDIAQgBmohBiAIIARBAXNqIQggAEEBaiIAIAdHDQALIAdBACAGGyEAIAZFDQAgCEUNAAJAAkACQCADQQBMBEBBACEAAkADQCAFQYABaiAAQQJ0aioCACILQwAAAABgRQ0BIAUgAEEEdCIEaiIDIAIgBGoiBCoCADgCACADIAQqAgQ4AgQgAyAEKgIIOAIIIAMgBCoCDDgCDCAAQQFqIgAgB0cNAAsgBUGAAWogB0ECdGoqAgAhCyAHIQALIAUgAEEEdCIGaiIDIAsgCyAFQYABaiAAQQFrIgRBAnRqKgIAk5UiCyACIARBBHRqIgQqAgAgAiAGaiIGKgIAIgqTlCAKkjgCACADIAsgBCoCBCAGKgIEIgqTlCAKkjgCBCADIAsgBCoCCCAGKgIIIgqTlCAKkjgCCCADIAsgBCoCDCAGKgIMIgqTlCAKkjgCDCAAQQFqIQQgACEDIAAgB0gNAQwCCyAFIAVBgAFqIANBAnRqKgIAIgsgCyAFQYABaiADQQFrIgBBAnRqKgIAk5UiCyACIABBBHRqIgAqAgAgAiADQQR0aiIEKgIAIgqTlCAKkjgCACAFIAsgACoCBCAEKgIEIgqTlCAKkjgCBCAFIAsgACoCCCAEKgIIIgqTlCAKkjgCCCAFIAsgACoCDCAEKgIMIgqTlCAKkjgCDEEAIQhBASEGAkAgAyAHTg0AA0AgBUGAAWogA0ECdGoqAgBDAAAAAGBFBEAgAyEIDAILIAUgBkEEdGoiACACIANBBHRqIgQqAgA4AgAgACAEKgIEOAIEIAAgBCoCCDgCCCAAIAQqAgw4AgwgBkEBaiEGIANBAWoiAyAHRw0ACyAHIQMLIAUgBkEEdGoiACAFQYABaiAIQQJ0aioCACILIAsgBUGAAWogAyAHIAMgB0gbQQFrIgNBAnRqKgIAk5UiCyACIANBBHRqIgMqAgAgAiAIQQR0aiIEKgIAIgqTlCAKkjgCACAAIAsgAyoCBCAEKgIEIgqTlCAKkjgCBCAAIAsgAyoCCCAEKgIIIgqTlCAKkjgCCCAAIAsgAyoCDCAEKgIMIgqTlCAKkjgCDCAGQQFqIQAMAgsDQCAFQYABaiADQQJ0aioCACILQwAAAABdBEAgByADQQFqIgNHDQEMAgsLIAUgBEEEdGoiBCALIAsgBUGAAWogA0EBayIGQQJ0aioCAJOVIgsgAiAGQQR0aiIGKgIAIAIgA0EEdGoiCCoCACIKk5QgCpI4AgAgBCALIAYqAgQgCCoCBCIKk5QgCpI4AgQgBCALIAYqAgggCCoCCCIKk5QgCpI4AgggBCALIAYqAgwgCCoCDCIKk5QgCpI4AgwgAEECaiEAIAMgB04NAQNAIAVBgAFqIANBAnRqKgIAQwAAAABgRQ0CIAUgAEEEdGoiBCACIANBBHRqIgYqAgA4AgAgBCAGKgIEOAIEIAQgBioCCDgCCCAEIAYqAgw4AgwgAEEBaiEAIANBAWoiAyAHSA0ACwwBCyAFIARBBHRqIgMgBSoCgAEiCyALIAVBgAFqIAdBAWsiBEECdGoqAgCTlSILIAIgBEEEdGoiBCoCACACKgIAIgqTlCAKkjgCACADIAsgBCoCBCACKgIEIgqTlCAKkjgCBCADIAsgBCoCCCACKgIIIgqTlCAKkjgCCCADIAsgBCoCDCACKgIMIgqTlCAKkjgCDCAAQQJqIQALIAIgBSAAQQR0EOwDGgsgAiAANgKAASAJQQFqIglBA0cNAAsgBUGgAWokAAuYAgIFfQF/IAAqAgggAioCCJMiBSAFlCAAKgIAIgYgAioCAJMiBSAFlCAAKgIEIAIqAgSTIgcgB5SSkpEiByABIAOSIgheBH8gCgUCQCAHQwAAAABfBEAgBCAGOAIAIAQgACoCBDgCBCAAKgIIIQMgBEEANgIYIARCgICA/AM3AhAgBCADOAIIDAELIAQgBUMAAIA/IAeVIgaUIgU4AhAgBCAGIAAqAgQgAioCBJOUIgk4AhQgBCAGIAAqAgggAioCCJOUIgY4AhggBCAFIAMgAZMgB5NDAAAAP5QiA5QgACoCAJI4AgAgBCAJIAOUIAAqAgSSOAIEIAQgBiADlCAAKgIIkjgCCCAIIAeTIQgLIAQgCDgCIEEBCwuEAgIJfQF/IAIqAgwiAyACKgIIIgUgASoCCCIIlCACKgIAIgYgASoCACIJlCACKgIEIgogASoCBCILlJKSkiEEAkAgBSAAKgIIIgeUIAYgACoCACIFlCAKIAAqAgQiBpSSkiADkiIDQwAAAABdBEBBACECIARDAAAAAF0NAQtBASECIANDAAAAAF4gBEMAAAAAXnENACAEQwAAAABdIANDAAAAAF5xIANDAAAAAF0iDCAEQwAAAABecXJFDQAgACABIAwbIgEgByADIAcgCJOUIAMgBJMiBJWTOAIIIAEgBiADIAYgC5OUIASVkzgCBCABIAUgAyAFIAmTlCAElZM4AgALIAILqQUCCX8HfSMAQSBrIgYkACAAKAIEQQZHBEAgBkG6GDYCFCAGQewnNgIQQQFB8jMgBkEQahCOAQsgASgCBEEERwRAIAZBuhg2AgQgBkHsJzYCAEEBQdI2IAYQjgELIAEqAlQgACgCGCIFKgI4IAAoAlAiCSoCCCIOlCAFKgIwIAkqAgAiD5QgCSoCBCIQIAUqAjSUkpIgBSoCCJIiEZQgASoCTCISIAUqAhggDpQgBSoCECAPlCAFKgIUIBCUkpIgBSoCAJIiE5QgBSoCKCAOlCAFKgIgIA+UIBAgBSoCJJSSkiAFKgIEkiIOIAEqAlCUkpIgASoCWJMiFEMAAAAAXwRAIAMgEjgCECADIAEqAlA4AhQgASoCVCEPIAMgATYCKCADIAA2AiQgAyAUjDgCICADIBE4AgggAyAOOAIEIAMgEzgCACADIA84AhhBASEHC0EBIQogACgCXCILQQFLBEAgAkH//wNxIQwDQCAUIAEqAlQgBSoCOCAJIApBDGxqIgIqAggiDpQgBSoCMCACKgIAIg+UIAIqAgQiECAFKgI0lJKSIAUqAgiSIhGUIAEqAkwiEiAFKgIYIA6UIAUqAhAgD5QgBSoCFCAQlJKSIAUqAgCSIhOUIAUqAiggDpQgBSoCICAPlCAQIAUqAiSUkpIgBSoCBJIiDyABKgJQlJKSIAEqAliTIg6UQwAAAABfIQ0CQCAOQwAAAABfRQ0AIAcgDE8NACADIAQgB2xqIgIgEjgCECACIAEqAlA4AhQgASoCVCEQIAIgATYCKCACIAA2AiQgAiAOjDgCICACIBE4AgggAiAPOAIEIAIgEzgCACACIBA4AhggB0EBaiEHCyAIIA1yIQggCkEBaiIKIAtHDQALIAdBACAIQQFxGyEICyAGQSBqJAAgCAv5DAILfyR9IwBBMGsiByQAIAAoAgQEQCAHQboYNgIUIAdB1Qs2AhBBAUGZNiAHQRBqEI4BCyABKAIEQQZHBEAgB0G6GDYCBCAHQdULNgIAQQFBuTMgBxCOAQsgACgCGCEGAn8CfQJ/IAEoAlgiCEUEQEMAAIB/ISBBAAwBCyAGKgIIIAEoAhgiAioCCJMhGyAGKgIEIAIqAgSTISkgBioCACACKgIAkyEqIAEoAlQhDEMAAIB/ISBBASEEA0ACQCABKAIYIgIqAjggASgCTCAOQQR0aiIFKgIIIhCUIAIqAjAgBSoCACITlCAFKgIEIhEgAioCNJSSkiIhIBuUIAIqAhggEJQgAioCECATlCACKgIUIBGUkpIiIiAqlCApIAIqAiggEJQgAioCICATlCARIAIqAiSUkpIiE5SSkiAFKgIMkyIQQwAAAABeBEBBACEEIBAgACoCTF1FDQEgB0EgaiEJIAwiAkEEaiEFIAIoAgAhDUEAIQICQAJAA0AgAiIIIA1GDQIgASgCGCICKgIIIhIgAioCOCIVIAEoAlAiCiAFIAhBAmogDXBBAnRqKAIAQQxsaiILKgIIIhaUIAIqAjAiFyALKgIAIhGUIAIqAjQiHCALKgIEIh2UkpKSIBUgCiAFIAhBAnRqKAIAQQxsaiILKgIIIhiUIBcgCyoCACIZlCALKgIEIhQgHJSSkiASkiIakyIrIAYqAggiLCAakyItlCACKgIAIh4gAioCGCIfIBaUIAIqAhAiJCARlCACKgIUIiUgHZSSkpIgHyAYlCAkIBmUICUgFJSSkiAekiIjkyIuIAYqAgAiLyAjkyIwlCAGKgIEIjEgAioCKCImIBiUIAIqAiAiJyAZlCAUIAIqAiQiGZSSkiACKgIEIhSSIhiTIjIgFCAmIBaUICcgEZQgGSAdlJKSkiAYkyIzlJKSISgCQCASIBUgCiAFIAhBAWoiAkEAIAIgDUcbQQJ0aigCAEEMbGoiCioCCCIWlCAXIAoqAgAiFZQgHCAKKgIEIheUkpKSIhEgGpMiHCAtlCAeIB8gFpQgJCAVlCAlIBeUkpKSIh0gI5MiHiAwlCAUICYgFpQgJyAVlCAZIBeUkpKSIhUgGJMiFiAylJKSIhRDAAAAAF9FDQAgKEMAAAAAX0UNACAJIBg4AgQgCSAjOAIADAILICsgLCARkyISlCAuIC8gHZMiF5QgMSAVkyIZIDOUkpIhHwJAIBwgEpQgHiAXlCAWIBmUkpIiEkMAAAAAYEUNACASIB9gRQ0AIAkgFTgCBCAJIB04AgAgESEaDAILIBJDAAAAAF9FDQAgFEMAAAAAYEUNACAUIB+UICggEpSTQwAAAABfRQ0ACyAJIBYgFCAUIBKTlSISlCAYkjgCBCAJIB4gEpQgI5I4AgAgHCASlCAakiEaCyAJIBo4AggLIAggDU8EQCADICI4AhAgAyAhOAIYIAMgEzgCFCADIAAoAhgiAioCACAiIAAqAkyUkzgCACADIAIqAgQgEyAAKgJMlJM4AgQgAyACKgIIICEgACoCTJSTOAIIIAAqAkwgEJMMBQsgACgCGCIGKgIIIAcqAiiTIhAgEJQgBioCACAHKgIgkyITIBOUIAYqAgQgByoCJJMiESARlJKSIiIgACoCTCIhICGUXUUEQCABKAJYIQgMAgsgAyAQICKRIhuVIhA4AhggAyARIBuVIhE4AhQgAyATIBuVIhM4AhAgAyAGKgIAIBMgACoCTJSTOAIAIAMgBioCBCARIAAqAkyUkzgCBCADIAYqAgggECAAKgJMlJM4AgggACoCTCAbkwwECyAEIQJBACEEIAJFDQBBASEEICAgEIsiEF5FDQAgECEgIA4hDwsgDCgCAEECdCAMakEEaiEMIA5BAWoiDiAISQ0AC0EAIARFDQIaIA9BAnQLIQUgAyABKAIYIgIqAhggASgCTCAFQQJ0aiIFKgIIlCACKgIQIAUqAgCUIAIqAhQgBSoCBJSSkjgCECADIAIqAiggBSoCCJQgAioCICAFKgIAlCACKgIkIAUqAgSUkpI4AhQgAyACKgI4IAUqAgiUIAIqAjAgBSoCAJQgAioCNCAFKgIElJKSOAIYIAMgBioCADgCACADIAYqAgQ4AgQgAyAGKgIIOAIIICAgACoCTJILIRAgAyABNgIoIAMgADYCJCADIBA4AiBBAQshAiAHQTBqJAAgAgthACMAQSBrIgIkACAAKAIEQQZHBEAgAkG6GDYCFCACQc0KNgIQQQFB8jMgAkEQahCOAQsgASgCBEEBRwRAIAJBuhg2AgQgAkHNCjYCAEEBQc0yIAIQjgELIAJBIGokAEEAC2EAIwBBIGsiAiQAIAAoAgRBBkcEQCACQboYNgIUIAJBgCk2AhBBAUHyMyACQRBqEI4BCyABKAIEQQJHBEAgAkG6GDYCBCACQYApNgIAQQFBijcgAhCOAQsgAkEgaiQAQQALkSECJX0SfyMAQSBrIgIkACAAKAIEQQZHBEAgAkG6GDYCFCACQcALNgIQQQFB8jMgAkEQahCOAQsgASgCBEEGRwRAIAJBuhg2AgQgAkHACzYCAEEBQbkzIAIQjgELIAEhMCADITMgBCE4IwBBMGsiKiQAAkACQCAAIisoAlhFBEBDAACA/yEXDAELQfSHASgCACEvICsoAlQhMUMAAID/IRcDQCAqICsoAhgiACoCGCA0QQR0IgEgKygCTGoiAyoCCJQgACoCECADKgIAlCAAKgIUIAMqAgSUkpI4AiAgKiAAKgIoIAMqAgiUIAAqAiAgAyoCAJQgACoCJCADKgIElJKSOAIkICogACoCOCADKgIIlCAAKgIwIAMqAgCUIAAqAjQgAyoCBJSSkjgCKCAqQSBqENACICogKygCTCABaioCDCAqKgIoIgogKygCGCIAKgIIlCAqKgIgIgggACoCAJQgKioCJCIJIAAqAgSUkpKSOAIsICogCiArKAJQIiwqAgiUIAggLCoCAJQgCSAsKgIElJKSIgU4AhggKiAFOAIcICsoAlwiLUECTwRAIAAqAjghDiAAKgI0IQ8gACoCMCEQIAAqAighESAAKgIkIRIgACoCICETIAAqAhghFCAAKgIUIRUgACoCCCEWIAAqAgQhCyAAKgIAIQwgACoCECENQQEhAANAICpBHGohAQJAIAogDiAsIABBDGxqIgMqAggiBZQgECADKgIAIgaUIAMqAgQiByAPlJKSIBaSlCAIIBQgBZQgDSAGlCAVIAeUkpIgDJKUIAkgESAFlCATIAaUIAcgEpSSkiALkpSSkiIFICoqAhxdRQRAICpBGGohASAFICoqAhheRQ0BCyABIAU4AgALIABBAWoiACAtRw0ACwsgMCgCGCEAICogCiAwKAJQIiwqAgiUIAggLCoCAJQgCSAsKgIElJKSIgU4AhAgKiAFOAIUIDAoAlwiLUECTwRAIAAqAjghDiAAKgI0IQ8gACoCMCEQIAAqAighESAAKgIkIRIgACoCICETIAAqAhghFCAAKgIUIRUgACoCCCEWIAAqAgQhCyAAKgIAIQwgACoCECENQQEhAANAICpBFGohAQJAIAogDiAsIABBDGxqIgMqAggiBZQgECADKgIAIgaUIAMqAgQiByAPlJKSIBaSlCAIIBQgBZQgDSAGlCAVIAeUkpIgDJKUIAkgESAFlCATIAaUIAcgEpSSkiALkpSSkiIFICoqAhRdRQRAICpBEGohASAFICoqAhBeRQ0BCyABIAU4AgALIABBAWoiACAtRw0ACyAqKgIQIQULICogKioCGCIGICoqAhwiB5O7OQMAIwBBEGsiASQAIAEgKjYCDCAvQenhACAqQbUBQQAQ/QMgAUEQaiQAIAUgB10NAiAGICoqAhQiB10NAgJAIAUgBl5FDQAgBiAHXkUNACAGIAeTIRcgKioCKCEYICoqAiQhGSAqKgIgIRogMSE2CyAxKAIAQQJ0IDFqQQRqITEgNEEBaiI0ICsoAlhJDQALCyAwKAJYIjkEQCAwKAIYIgQqAjghDiAEKgI0IQ8gBCoCMCEQIAQqAighESAEKgIkIRIgBCoCICETIAQqAhghFCAEKgIUIRUgMCgCXCExIDAoAlAhLCArKAJQIS0gKygCGCEvIDAoAkwhMiAEKgIQIRYgKygCXCI0QQJJITcDQCAqIBQgMiAuQQR0aiIAKgIIlCAWIAAqAgCUIBUgACoCBJSSkiIKOAIgICogESAAKgIIlCATIAAqAgCUIBIgACoCBJSSkiIIOAIkICogDiAAKgIIlCAQIAAqAgCUIA8gACoCBJSSkiIJOAIoICogACoCDCAJIAQqAgiUIAogBCoCAJQgCCAEKgIElJKSkjgCLCAqIAkgLSoCCJQgCiAtKgIAlCAIIC0qAgSUkpIiBTgCGCAqIAU4AhwgN0UEQCAvKgIIIQsgLyoCBCEMIC8qAgAhDSAvKgI4IRsgLyoCNCEcIC8qAjAhHSAvKgIoIR4gLyoCJCEfIC8qAiAhICAvKgIYISEgLyoCFCEiIC8qAhAhI0EBIQADQCAqQRxqIQECQCAJIBsgLSAAQQxsaiIDKgIIIgWUIB0gAyoCACIGlCADKgIEIgcgHJSSkiALkpQgCiAhIAWUICMgBpQgIiAHlJKSIA2SlCAIIB4gBZQgICAGlCAHIB+UkpIgDJKUkpIiBSAqKgIcXUUEQCAqQRhqIQEgBSAqKgIYXkUNAQsgASAFOAIACyAAQQFqIgAgNEcNAAsLICogCSAsKgIIlCAKICwqAgCUIAggLCoCBJSSkiIFOAIQICogBTgCFCAxQQJPBEAgBCoCCCELIAQqAgQhDCAEKgIAIQ1BASEAA0AgKkEUaiEBAkAgCSAOICwgAEEMbGoiAyoCCCIFlCAQIAMqAgAiBpQgAyoCBCIHIA+UkpIgC5KUIAogFCAFlCAWIAaUIBUgB5SSkiANkpQgCCARIAWUIBMgBpQgByASlJKSIAySlJKSIgUgKioCFF1FBEAgKkEQaiEBIAUgKioCEF5FDQELIAEgBTgCAAsgAEEBaiIAIDFHDQALICoqAhAhBQsgBSAqKgIcXQ0CICoqAhggKioCFF0NAiAuQQFqIi4gOUcNAAsLICsoAngiBCArQfwAaiI7RwRAIDBB/ABqITcgKygCGCIyKgI4IRsgMioCNCEcIDIqAjAhHSAyKgIoIR4gMioCJCEfIDIqAiAhICAyKgIYISEgMioCFCEiIDAoAlwhNCAwKAJQIS0gMCgCGCEuIDAoAnghOiArKAJQITEgMioCECEjICsoAlwiL0ECSSE5A0AgNyA6RwRAIC4qAjghDiAuKgI0IQ8gLioCMCEQIC4qAighESAuKgIkIRIgLioCICETIC4qAhghFCAuKgIUIRUgLioCECEWIB4gMSAEKAIUQQxsaiIAKgIIIgWUICAgACoCACIGlCAfIAAqAgQiB5SSkiAeIDEgBCgCEEEMbGoiACoCCCIKlCAgIAAqAgAiCJQgACoCBCIJIB+UkpKTIiSMISUgISAFlCAjIAaUICIgB5SSkiAhIAqUICMgCJQgIiAJlJKSkyImjCEnIBsgBZQgHSAGlCAcIAeUkpIgGyAKlCAdIAiUIAkgHJSSkpMiKIwhKSA6IQEDQCAtIAEoAhRBDGxqIgAqAgghBSAAKgIAIQYgACoCBCEHIC0gASgCEEEMbGoiACoCCCEIIAAqAgAhCSAAKgIEIQsgKkEANgIsICogJiARIAWUIBMgBpQgEiAHlJKSIBEgCJQgEyAJlCALIBKUkpKTIgyUIBQgBZQgFiAGlCAVIAeUkpIgFCAIlCAWIAmUIBUgC5SSkpMiDSAllJIiCjgCKCAqICggDZQgDiAFlCAQIAaUIA8gB5SSkiAOIAiUIBAgCZQgCyAPlJKSkyIFICeUkiIIOAIkICogJCAFlCAMICmUkiIJOAIgICogCiAxKgIIlCAJIDEqAgCUIDEqAgQgCJSSkiIFOAIYICogBTgCHCA5RQRAIDIqAgghCyAyKgIEIQwgMioCACENQQEhAANAICpBHGohLAJAIAogGyAxIABBDGxqIgMqAggiBZQgHSADKgIAIgaUIAMqAgQiByAclJKSIAuSlCAJICEgBZQgIyAGlCAiIAeUkpIgDZKUIAggHiAFlCAgIAaUIAcgH5SSkiAMkpSSkiIFICoqAhxdRQRAICpBGGohLCAFICoqAhheRQ0BCyAsIAU4AgALIABBAWoiACAvRw0ACwsgKiAKIC0qAgiUIAkgLSoCAJQgCCAtKgIElJKSIgU4AhAgKiAFOAIUIDRBAk8EQCAuKgIIIQsgLioCBCEMIC4qAgAhDUEBIQADQCAqQRRqISwCQCAKIA4gLSAAQQxsaiIDKgIIIgWUIBAgAyoCACIGlCADKgIEIgcgD5SSkiALkpQgCSAUIAWUIBYgBpQgFSAHlJKSIA2SlCAIIBEgBZQgEyAGlCAHIBKUkpIgDJKUkpIiBSAqKgIUXUUEQCAqQRBqISwgBSAqKgIQXkUNAQsgLCAFOAIACyAAQQFqIgAgNEcNAAsgKioCECEFCyAFICoqAhxdDQQgKioCGCAqKgIUXQ0EAkAgASIDKAIEIgAEQANAIAAiASgCACIADQAMAgsACwNAIAMoAggiASgCACADRyEAIAEhAyAADQALCyABIDdHDQALCwJAIAQoAgQiAwRAA0AgAyIAKAIAIgMNAAwCCwALA0AgBCgCCCIAKAIAIARHIQMgACEEIAMNAAsLIAAhBCAAIDtHDQALCyAzIBo4AhAgMyAYOAIYIDMgGTgCFCAzICsoAhgiAEEYaiItKgIAICsoAlAiLCA2KAIEQQxsaiIDKgIIlCAAKgIQIAMqAgCUIABBFGoiMSoCACADKgIElJKSIgU4AgAgMyAAQShqIjQqAgAgAyoCCJQgAEEgaiIvKgIAIAMqAgCUIABBJGoiNSoCACADKgIElJKSIgY4AgQgMyAAQThqIgQqAgAgAyoCCJQgAEEwaiIuKgIAIAMqAgCUIABBNGoiMioCACADKgIElJKSIgc4AgggMyAFIAAqAgCSOAIAIDMgACoCBCAGkjgCBCAAKgIIIQUgMyArNgIoIDMgMDYCJCAzIBc4AiAgMyAFIAeSOAIIIDMgOGoiAyAYOAIYIAMgGTgCFCADIBo4AhAgAyAtKgIAICwgNigCCEEMbGoiASoCCJQgACoCECABKgIAlCAxKgIAIAEqAgSUkpIiBTgCACADIDQqAgAgASoCCJQgLyoCACABKgIAlCA1KgIAIAEqAgSUkpIiBjgCBCADIAQqAgAgASoCCJQgLioCACABKgIAlCAyKgIAIAEqAgSUkpIiBzgCCCADIAUgACoCAJI4AgAgAyAAKgIEIAaSOAIEIAAqAgghBSADICs2AiggAyAwNgIkIAMgFzgCICADIAUgB5I4AgggMyA4QQF0aiIDIBg4AhggAyAZOAIUIAMgGjgCECADIC0qAgAgLCA2KAIMQQxsaiIBKgIIlCAAKgIQIAEqAgCUIDEqAgAgASoCBJSSkiIFOAIAIAMgNCoCACABKgIIlCAvKgIAIAEqAgCUIDUqAgAgASoCBJSSkiIGOAIEIAMgBCoCACABKgIIlCAuKgIAIAEqAgCUIDIqAgAgASoCBJSSkiIHOAIIIAMgBSAAKgIAkjgCACADIAAqAgQgBpI4AgQgACoCCCEFIAMgKzYCKCADIDA2AiQgAyAXOAIgIAMgBSAHkjgCCEEDITUgNigCACItQQNNDQADQCAzIDUgOGxqIgMgGjgCECADIBg4AhggAyAZOAIUIAMgACoCGCAsIDYgNUEBaiI1QQJ0aigCAEEMbGoiASoCCJQgACoCECABKgIAlCAAKgIUIAEqAgSUkpIiBTgCACADIAAqAiggASoCCJQgACoCICABKgIAlCAAKgIkIAEqAgSUkpIiBjgCBCADIAAqAjggASoCCJQgACoCMCABKgIAlCAAKgI0IAEqAgSUkpIiBzgCCCADIAUgACoCAJI4AgAgAyAAKgIEIAaSOAIEIAAqAgghBSADICs2AiggAyAwNgIkIAMgFzgCICADIAUgB5I4AgggLSA1Sw0ACwsgKkEwaiQAIAJBIGokACA1C84FAgd9Bn8jAEEwayICJAAgBEEzTARAIAJBuhg2AiQgAkGuCzYCIEEBQd3JACACQSBqEI4BCyAAKAIEQQVHBEAgAkG6GDYCFCACQa4LNgIQQQFBlzIgAkEQahCOAQsgASgCBEEGRwRAIAJBuhg2AgQgAkGuCzYCAEEBQbkzIAIQjgELIAMgATYCKCADIAA2AiQCQAJAAkAgASgCWCIORQRAIANBgICA/Ac2AiAMAQsgASgCTCEPIAAoAhgiBCoCCCEHIAQqAgQhCCAEKgIAIQUCfQJAA0AgDyANQQR0aiIEKgIIIAeUIAQqAgAgBZQgBCoCBCAIlJKSIAQqAgyTQwAAAABgDQEgDUEBaiINIA5HDQALQwAAgL8MAQtDAACAPwshCSADQYCAgPwHNgIgIA4NAQtDAACAfyEKDAELIAAoAhghDCABKAJMIRBBACENQwAAgH8hCgNAAkAgCSAQIA1BBHRqIgEqAggiBSAMKgIwlCABKgIAIgggDCoCGCILlCABKgIEIgcgDCoCJJSSkpRDAAAAtF1FDQAgCSAFIAwqAgiUIAggDCoCACIFlCAHIAwqAgSUkpIgASoCDJOUIgZDAAAAAGBFDQAgBiAAKgJMX0UNACAGIApdRQ0AIAMgBiALlCAFkiIFOAIAIAMgBiAMKgIolCAMKgIEkiIIOAIEIAMgBiAMKgI4lCAMKgIIkiIHOAIIQQAhBEEBIRECQANAAkAgBCANRwRAIBAgBEEEdGoiDyoCCCAHlCAPKgIAIAWUIA8qAgQgCJSSkiABKgIMk0MAAAA0Xg0BCyAEQQFqIgQgDkkhESAEIA5HDQEMAgsLIBENAQsgAyAJIAEqAgCUOAIQIAMgCSABKgIElDgCFCABKgIIIQUgAyAGOAIgIAMgCSAFlDgCGCAGIQoLIA1BAWoiDSAORw0ACwsgACoCTCEFIAJBMGokACAFIApgC+cBAgF/CX0gACgCGCIBKgI4IQUgASoCMCEGIAEqAjQhByABKgIoIQMgASoCICEIIAEqAiQhCSAAIAEqAgAgASoCGCAAKgJQIgSUi0MAAAA/lCABKgIQIAAqAkwiApSLIAIgASoCFJSLkpIiCpM4AiwgACAKIAEqAgCSOAIwIAAgASoCBCAEIAOUi0MAAAA/lCACIAiUiyACIAmUi5KSIgOTOAI0IAAgAyABKgIEkjgCOCAAIAEqAgggBCAFlItDAAAAP5QgAiAGlIsgAiAHlIuSkiICkzgCPCAAQUBrIAIgASoCCJI4AgALbAECf0HUABCOAiEEIwBBEGsiAyQAIAQgAEEBECwiAEHs5gA2AgAgAUMAAAAAXiACQwAAAABecUUEQCADQaMWNgIAQQJB2d8AIAMQjgELIAAgAjgCUCAAIAE4AkwgAEEDNgIEIANBEGokACAEC00BAX8jAEEQayIDJAACQCAABEAgACgCBEEDRg0BCyADQdAQNgIAQQJBz9YAIAMQjgELIAEgACoCTDgCACACIAAqAlA4AgAgA0EQaiQAC7sCAQJ/IwBBIGsiBSQAQfCHASgCACIEEPADGkH0hwEoAgAQ8AMaAkAgAARAIAUgADYCFCAFIAE2AhAgBEHg4QAgBUEQahDxAwwBCyAFIAE2AgAgBEHa4QAgBRDxAwsgBCACIANBtQFBtgEQ/QMCQAJAIAQoAkwiAUEATgRAIAFFDQFBiLQBKAIAIAFB/////3txRw0BCwJAIAQoAlBBCkYNACAEKAIUIgEgBCgCEEYNACAEIAFBAWo2AhQgAUEKOgAADAILIAQQ8wMMAQsgBEHMAGoiACIBIAEoAgAiAUH/////AyABGzYCAAJAAkAgBCgCUEEKRg0AIAQoAhQiASAEKAIQRg0AIAQgAUEBajYCFCABQQo6AAAMAQsgBBDzAwsgACgCABogAEEANgIACyAEEPADGiAFQSBqJAALPgEBfyMAQRBrIgMkACADIAI2AgxBwLIBKAIAIgMEQCAAIAEgAiADEQQAEAAACyAAQevNACABIAIQjQEQAAALQwECfyMAQRBrIgMkACADIAI2AgwCQEHEsgEoAgAiBARAIAAgASACIAQRBAAMAQsgAEGSKyABIAIQjQELIANBEGokAAsEACAAC4EDAgJ/AX0CfyAAKAI4RQRAIAJBACACQQBKGyICIAAoAjAiA0EBayACIANIGyEDIAFBACABQQBKGyIBIAAoAiwiAkEBayABIAJIGwwBCyACIAAoAjBBAWsiA28iAkEfdSADcSACaiEDIAEgACgCLCICQQFrIgRvIgFBH3UgBHEgAWoLIQECQAJAAkACQAJAAkACQCAAKAI8DgUBAgMEBQALQciyASoCACEFDAULQciyASAAKAJEIAEgAyAAKAJIEQoAIgU4AgAMBAtBzLIBIAAoAkAiBDYCAEHIsgEgBCACIANsIAFqai0AALMiBTgCAAwDC0HQsgEgACgCQCIENgIAQciyASAEIAIgA2wgAWpBAXRqLgEAsiIFOAIADAILQdSyASAAKAJAIgQ2AgBByLIBIAQgAiADbCABakECdGoqAgAiBTgCAAwBC0HYsgEgACgCQCIENgIAQciyASAEIAIgA2wgAWpBA3RqKwMAtiIFOAIACyAFIAAqAiSUIAAqAiiSC9gFAgR/FX0gACgCCEEIcSECIABBQGsCfSAAKAJMIgEoAjhFBEAgAgRAIAAoAhgiAioCOCEQIAIqAjAhDSACKgI0IREgAioCKCEIIAIqAiAhBiACKgIkIQcgACACKgIAIAIqAhgiBSABKgIUIgmUIgogBSAJjCIUlCISIAogEl0iAxsiGCACKgIQIgwgASoCECIFlCILIAwgBYwiFZQiDCALIAxdIgQbIhMgAioCFCIOIAEqAhwiFpQiDyAOIAEqAhgiF5QiDiAOIA9eIgEbIhkgEyAZXRsiEyATIBheG5I4AiwgACACKgIAIAwgCyAEGyILIA4gDyABGyIMIAsgDF4bIgsgEiAKIAMbIgogCiALXRuSOAIwIAAgAioCBCAJIAiUIgogCCAUlCIIIAggCl4iARsiDCAFIAaUIhIgBiAVlCIGIAYgEl4iAxsiDyAHIBaUIgsgFyAHlCIHIAcgC14iBBsiDiAOIA9eGyIPIAwgD10bkjgCNCAAIAIqAgQgBiASIAMbIgYgByALIAQbIgcgBiAHXhsiBiAIIAogARsiCCAGIAheG5I4AjggACACKgIIIAkgEJQiCSAQIBSUIhAgCSAQXSIBGyIGIAUgDZQiBSANIBWUIg0gBSANXSIDGyIHIBEgFpQiCCAXIBGUIhEgCCARXSIEGyIKIAcgCl0bIgcgBiAHXRuSOAI8IAIqAgggDSAFIAMbIgUgESAIIAQbIg0gBSANXhsiBSAQIAkgARsiCSAFIAleG5IMAgsgACABKgIQjDgCLCAAIAEqAhA4AjAgACABKgIYOAI0IAAgASoCHDgCOCAAIAEqAhSMOAI8IAEqAhQMAQsgAEKAgID8j4CAwP8ANwIsAkAgAgRAIABBgICAfDYCPCAAQoCAgPyPgIDA/wA3AjQMAQsgACABKgIYOAI0IAEqAhwhCSAAQYCAgHw2AjwgACAJOAI4C0MAAIB/CzgCAAsGACAAEC4LDwAgABAuGiAAQdAAEI8CCwgAQcwAEI0EC9wDAQF/IwBBQGoiCyQAIABFBEAgC0H+IjYCMEECQdndACALQTBqEI4BCyACRQRAIAtB7Rs2AiQgC0H+IjYCIEEBQa86IAtBIGoQjgELIAVBAUwEQCALQe0bNgIUIAtB/iI2AhBBAUGtwwAgC0EQahCOAQsgBkEBTARAIAtB7Rs2AgQgC0H+IjYCAEEBQfvCACALEI4BCyAAIAI2AkggACABNgJEIABBADYCPCMAQUBqIgEkACADQwAAAABeRQRAIAFB7Rs2AjQgAUGLMTYCMEEBQY7NACABQTBqEI4BCyAEQwAAAABeRQRAIAFB7Rs2AiQgAUGLMTYCIEEBQdnMACABQSBqEI4BCyAFQQBMBEAgAUHtGzYCFCABQYsxNgIQQQFBgMgAIAFBEGoQjgELIAZBAEwEQCABQe0bNgIEIAFBizE2AgBBAUHOxwAgARCOAQsgACAIOAIoIAAgBzgCJCAAIAQ4AgQgACADOAIAIAAgBjYCMCAAIAU2AiwgACAJOAIgIAAgCjYCOCAAIARDAAAAP5Q4AhQgACADQwAAAD+UOAIQIAAgBCAGQQFrspU4AgwgACADIAVBAWuylTgCCCABQUBrJAAgAEKAgID8j4CAwP8ANwIYIAtBQGskAAtZAgF/AX0jAEEQayIDJAAgAEUEQCADQbsTNgIAQQJB/90AIAMQjgELIAAgAiAAKgIkIgSUIAAqAigiApI4AhwgACACIAEgBJSSIAAqAiCTOAIYIANBEGokAAvpAQEDfyMAQRBrIgMkAAJAIABFBEAgA0GmCTYCAEECQdndACADEI4BDAELIwBBEGsiAiQAIAAiASgCQEUEQCACQe0bNgIEIAJBkzE2AgBBAUHAPCACEI4BCwJAIAEoAjRFDQACQAJAAkACQAJAIAEoAjxBAWsOBAABAgMFC0HcsgEgASgCQCIBNgIAIAENAwwEC0HgsgEgASgCQCIBNgIAIAENAgwDC0HksgEgASgCQCIBNgIAIAENAQwCC0HosgEgASgCQCIBNgIAIAFFDQELIAEQigQLIAJBEGokACAAEIoECyADQRBqJAALKwEBf0HQABCOAiIDIAAgAhAsIgIgATYCTCACQQk2AgQgAkGg5wA2AgAgAwsOACABIAAgAiADIAQQeQvfLwIefyp9IwBB0ABrIhIkACAEQTNMBEAgEkHtGzYCJCASQbQsNgIgQQFB3ckAIBJBIGoQjgELIAAoAgRBCUcEQCASQe0bNgIUIBJBtCw2AhBBAUH+NyASQRBqEI4BCyABKAIYIgcqAjghLiAHKgI0ITAgByoCMCExIAcqAighOiAHKgIkITsgByoCICFCIAcqAhghQyAHKgIUIUQgByoCECFFIAcqAgghRiAHKgIEIUwgByoCACFHIBJBQGsgASkCPDcDACASIAEpAjQ3AzggEiABKQIsNwMwIAEoAgghIiBGISQgRyEjIAAtAAhBCHEEQCAAKAIYIgYqAjAhIyAGKgIgISYgBioCNCEnIAYqAhQhKSAGKgIkISUgBioCCCEqIAYqAgAhKyAGKgIEIS8gBioCECEsIAcgBioCOCIkIC6UIAYqAhgiKCBDlCA6IAYqAigiLZSSkjgCOCAHICQgMJQgKCBElCA7IC2UkpI4AjQgByAkIDGUICggRZQgQiAtlJKSOAIwIAcgJyAulCApIEOUIDogJZSSkjgCKCAHICcgMJQgKSBElCA7ICWUkpI4AiQgByAnIDGUICkgRZQgQiAllJKSOAIgIAcgIyAulCAsIEOUIDogJpSSkjgCGCAHICMgMJQgLCBElCA7ICaUkpI4AhQgByAjIDGUICwgRZQgQiAmlJKSOAIQIAcgJCBGICqTIiqUICggRyArkyIrlCAtIEwgL5MiKJSSkiIkOAIIIAcgJyAqlCApICuUICggJZSSkjgCBCAHICMgKpQgLCArlCAoICaUkpIiIzgCAAsgByAAKAJMIgYqAhAgI5I4AgAgByAGKgIUICSSOAIIIAEgASgCACgCCBEBAAJ/IAFBQGsqAgAiJyAAKAJMIgYqAgwiJJWOIiOLQwAAAE9dBEAgI6gMAQtBgICAgHgLIRoCfyABKgIwIikgBioCCCIjlY4iJotDAAAAT10EQCAmqAwBC0GAgICAeAshEQJ/IAEqAjwiJiAklY4iJItDAAAAT10EQCAkqAwBC0GAgICAeAshHAJ/IAEqAiwiJSAjlY4iJItDAAAAT10EQCAkqAwBC0GAgICAeAshEyABQSxqIR0gGkEBaiEVIBFBAWohGAJAIAYoAjhFBEBBACEHIBNBACATQQBKGyITIBggBigCLEEBayIYIBEgGEgbIhhODQEgHEEAIBxBAEobIhwgFSAGKAIwQQFrIhEgESAaShsiFU4NAQsCQCABKAIEQQVGDQAgASoCOCEkICUgKZJDAAAAP5QiKSElIwBBIGsiCyQAICYgJ5JDAAAAP5QiJiInAn8gJyAGKgIMIiOVjiIoi0MAAABPXQRAICioDAELQYCAgIB4CyIMsiAjlJMgI5UhJyAlAn8gJSAGKgIIIiiVjiIli0MAAABPXQRAICWoDAELQYCAgIB4CyIIsiAolJMgKJUiJUMAAAA0kkMAAAAAYCAlQwAAALSSQwAAgD9fcUUEQCALQe0bNgIUIAtB5gw2AhBBAUGCzAAgC0EQahCOAQsgJ0MAAAC0kkMAAIA/XyAnQwAAADSSQwAAAABgcUUEQCALQe0bNgIEIAtB5gw2AgBBAUGrywAgCxCOAQsCfSAlICeSQwAAgD9dBEAgBiAIIAwQkQEhIyAGIAhBAWogDBCRASEoIAYgCCAMQQFqEJEBICOTICeUICMgKCAjkyAllJKSDAELIAYgCEEBaiIKIAxBAWoiDhCRASEjIAYgCiAMEJEBISggBiAIIA4QkQEgI5NDAACAPyAlk5QgIyAoICOTQwAAgD8gJ5OUkpILIScgC0EgaiQAICcgJJMiI0MAAAAAXkUNACADICM4AiAgASoCOCABKgI0k0MAAAA/lCInICNdBEAgAyAnOAIgCyADIAE2AiggAyAANgIkIANCgICAgICAgMC/fzcCECADICY4AgggAyAkOAIEIAMgKTgCACADQQA2AhhBASEHDAELQQAhByATIBhODQAgFSAcTA0AIAIgAkGAgHxxQQFyIAJB//8DcRsiGkH//wNxIREDQCAcIQYDQCATIQogBiEOIAEhECAaIQggAyAEIAdsaiENQQAhAkEAIQxBACEXIwBBwAlrIgUkAAJAIBEgB2siC0UNACAIQYCAfHEhCUEUIRlBASEbQQEhD0EAIQgCQAJAAkACQAJAAkACQAJAAkACQCABKAIEDgkAAQIDBgkEBgUGC0ERIQhBCiEZQc0AIRcMBwtBEiEIQQwhGUHOACEXDAYLQRMhCEEQIRlBzwAhFwwFC0EVIQhBHyEZDAMLQSUhCEEgIRkMAgtB0AAhCEEbIRkMAQsgBUHtGzYCBCAFQa0MNgIAQQFBrMcAIAUQjgFBACEbDAILQQAhDwwBC0EAIRtBACEPCyAJQQpyIRYgACgCTCIJKgIMITMgCSoCCCE9IAkgCiAOEJEBISUgACgCTCIJKgIMIT4gCSoCCCEnIAkgCkEBaiICIA4QkQEhJCAAKAJMIgkqAgghKSAJKgIMISogCSAKIA5BAWoiFBCRASEmIAAoAkwiCSoCDCErIAkqAgghLCAJIAIgFBCRASE0IAUgPiAOsiI8lCIjIDMgPJQiSJM4AqgFIAUgJCAlkzgCpAUgBSAnIAKyIj6UIicgPSAKsiIzlCJJkzgCoAUgBUGgBWoQ0AIgBSAqIBSyIj2UIi0gSJM4ApgFIAUgJiAlkzgClAUgBSApIDOUIjggSZM4ApAFICsgPZQiPyAtkyIpICkgKZQgLCA+lCJAIDiTIisgK5QgNCAmkyIqICqUkpKRIkqVISkgKiBKlSEqICsgSpUhKyA/ICOTIiwgLCAslCBAICeTIi8gL5QgNCAkkyIyIDKUkpKRIkuVISwgMiBLlSEyIC8gS5UhLyAFQZAFahDQAiAPQQFxRQRAIAAoAkwiCSoCCCE1IAkqAgwhQSAJIApBAmoiAiAOEJEBITYgACgCTCIJKgIIITcgCSoCDCE5IAkgCiAOQQJqIg4QkQEhKCAFID8gSJM4AugEIAUgNCAlkzgC5AQgBSBAIEmTOALgBCAFQeAEahDQAiAFIEEgPJQgLZM4AogFIAUgNiAmkzgChAUgBSA1IAKylCA4kzgCgAUgBUGABWoQ0AIgBSAjIDkgDrKUkzgC+AQgBSAkICiTOAL0BCAFICcgNyAzlJM4AvAEIAVB8ARqENACIAUgJiAkkyI1IC0gI5MiNiA2lCA4ICeTIjcgN5QgNSA1lJKSkSI1lSJBIAUqAugEIjmUIAUqAuQEIiggNiA1lSI2lJM4ArAEIAUgKCA3IDWVIjeUIAUqAuAEIiggQZSTOAK4BCAFIDYgKJQgOSA3lJM4ArQEIAVBsARqENACIAUgLyAFKgKEBSI5lCAFKgKABSIoIDKUkzgCyAQgBSAsICiUIAUqAogFIiggL5STOALEBCAFIDIgKJQgOSAslJM4AsAEIAVBwARqENACIAUgKyAFKgL0BCI5lCAFKgLwBCIoICqUkzgC2AQgBSApICiUIAUqAvgEIiggK5STOALUBCAFICogKJQgOSAplJM4AtAEIAVB0ARqENACIAVBEGogNRDaAiIOICcgJCAjIDcgQSA2ENwCIA4gECAWIAVBsAVqQTQgCBEDACECIA4gOCAmIC0gN4wgQYwgNowQ3AIgDiAQIBYgBUGQA2pBNCAIEQMAIRQgBUHAAmogSxDaAiIKICcgJCAjIC8gMiAsENwCIAogECAWIAVB5AVqQTQgCBEDACEeIAogQCA0ID8gL4wgMowgLIwQ3AIgCiAQIBYgBUHEA2pBNCAIEQMAIR8gBUHwAWogShDaAiIJIDggJiAtICsgKiApENwCIAkgECAWIAVBmAZqQTQgCBEDACEgIAkgQCA0ID8gK4wgKowgKYwQ3AIgAiAUcSECIAkgECAWIAVB+ANqQTQgCBEDACEhAn8CQAJAIBtFBEAgAgRAIA0gBSoCsAUgBSoCkAOSQwAAAD+UIiQ4AgAgDSAFKgK0BSAFKgKUA5JDAAAAP5QiJjgCBCANIAUqArgFIAUqApgDkkMAAAA/lCIjOAIIIA0gBSoCsASMOAIQIA0gBSoCtASMOAIUIA0gBSoCuASMOAIYIA0gECAkICYgIyAXEREAOAIgQQAhFEEBIQJBASIMIAtBAUYNBBoLIB4gH3ENASAMIQgMAgsCQCACRQRAQQAhDwwBCyANIAUqArAFIAUqApADkkMAAAA/lDgCACANIAUqArQFIAUqApQDkkMAAAA/lDgCBCANIAUqArgFIAUqApgDkkMAAAA/lDgCCCANIAUqArAEjDgCECANQRRqIgwgBSoCtASMOAIAIA1BGGoiDyAFKgK4BIw4AgBBACEUIAVBoAFqQwAAekQQ2gIiAiANKgIAIA0qAgQgDSoCCCANKgIQjCAMKgIAjCAPKgIAjBDcAkEAIQ8gAiAQIBYgBUHsAGpBNCAIEQMABEAgDSAFKgKMATgCIEEBIQ8LIAIQLhogCyAPIAsiAkYNAxoLIB4gH3EEQCANIAQgD2xqIgIgBSoC5AUgBSoCxAOSQwAAAD+UOAIAIAIgBSoC6AUgBSoCyAOSQwAAAD+UOAIEIAIgBSoC7AUgBSoCzAOSQwAAAD+UOAIIIAIgBSoCwASMOAIQIAJBFGoiGyAFKgLEBIw4AgAgAkEYaiIXIAUqAsgEjDgCAEEAIRQgBUGgAWpDAAB6RBDaAiIMIAIqAgAgAioCBCACKgIIIAIqAhCMIBsqAgCMIBcqAgCMENwCIAwgECAWIAVB7ABqQTQgCBEDAARAIAIgBSoCjAE4AiAgD0EBaiEPCyAMEC4aIAsgDyALIgJGDQMaCyAgICFxBEAgDSAEIA9saiICIAUqApgGIAUqAvgDkkMAAAA/lDgCACACIAUqApwGIAUqAvwDkkMAAAA/lDgCBCACIAUqAqAGIAUqAoAEkkMAAAA/lDgCCCACIAUqAtAEjDgCECACQRRqIhsgBSoC1ASMOAIAIAJBGGoiFyAFKgLYBIw4AgBBACEUIAVBoAFqQwAAekQQ2gIiDCACKgIAIAIqAgQgAioCCCACKgIQjCAbKgIAjCAXKgIAjBDcAiAMIBAgFiAFQewAakE0IAgRAwAEQCACIAUqAowBOAIgIA9BAWohDwsgDBAuGiALIA8gCyICRg0DGgtBASEUIAshAiAPDAILIA0gBCAMbGoiCCAFKgLkBSAFKgLEA5JDAAAAP5QiJDgCACAIIAUqAugFIAUqAsgDkkMAAAA/lCImOAIEIAggBSoC7AUgBSoCzAOSQwAAAD+UIiM4AgggCCAFKgLABIw4AhAgCCAFKgLEBIw4AhQgCCAFKgLIBIw4AhggCCAQICQgJiAjIBcREQA4AiBBACEUIAsgCyICIAxBAWoiCEYNARoLICAgIXEEQCANIAQgCGxqIgIgBSoCmAYgBSoC+AOSQwAAAD+UIiQ4AgAgAiAFKgKcBiAFKgL8A5JDAAAAP5QiJjgCBCACIAUqAqAGIAUqAoAEkkMAAAA/lCIjOAIIIAIgBSoC0ASMOAIQIAIgBSoC1ASMOAIUIAIgBSoC2ASMOAIYIAIgECAkICYgIyAXEREAOAIgQQAhFCALIAsiAiAIQQFqIghGDQEaC0EBIRQgCAshDCAJEC4aIAoQLhogDhAuGiAURQ0BCyAFIAUqApQFIiQgBSoCqAUiJpQgBSoCpAUiIyAFKgKYBSInlJM4AsACIAUgIyAFKgKQBSItlCAkIAUqAqAFIiOUkzgCyAIgBSAnICOUICYgLZSTOALEAiAFQcACahDQAiAFIAUqAsgCIiQgSJQgBSoCwAIiJiBJlCAlIAUqAsQCIiOUkpIiJTgCzAICQCAQIAVBkANqQQAgJiAjICQgJRDTAiIUIBYgBUGwBWpBNCAZEQMAIglBAEoEQCA8jCEtIDOMITggACgCTCEIQQAhDgNAAkAgBUGwBWogDkE0bGoiCioCACImIAgqAggiJCAzlCAkQwAAAACUIiWTXQ0AICYgJCA+lCAlkl4NACAKKgIIIiMgCCoCDCIlIDyUICVDAAAAAJQiJ5NdDQAgIyAlID2UICeSXg0AIDggJJQgJpIgJJUgLSAllCAjkiAllZJDAACAP14NACANIAQgDGxqIgIgJjgCACAKKgIEISQgAiAjOAIIIAIgJDgCBCACIAoqAhCMOAIQIAIgCioCFIw4AhQgAiAKKgIYjDgCGCACIAoqAiA4AiAgDEEBaiIMIAtHDQAgCyECDAMLIA5BAWoiDiAJRw0ACwsgBSAvICqUICsgMpSTOALIAiAFICwgK5QgKSAvlJM4AsQCIAUgMiAplCAqICyUkzgCwAIgBUHAAmoQ0AIgBSAFKgLIAiIkID+UIAUqAsACIiYgQJQgNCAFKgLEAiIllJKSIiM4AswCAkAgECAFQRBqQQAgJiAlICQgIxDTAiIPIBYgBUGwBWpBNCAZEQMAIglBAEwEQCAMIQIMAQsgPIwhNCAzjCEpIAAoAkwhCEEAIQ4gDCECA0ACQCAFQbAFaiAOQTRsaiIKKgIAIiYgCCoCCCIkIDOUICRDAAAAAJQiJZNdDQAgJiAkID6UICWSXg0AIAoqAggiIyAIKgIMIiUgPJQgJUMAAAAAlCInk10NACAjICUgPZQgJ5JeDQAgKSAklCAmkiAklSA0ICWUICOSICWVkkMAAIA/XQ0AIA0gAiAEbGoiECAmOAIAIAoqAgQhJCAQICM4AgggECAkOAIEIBAgCioCEIw4AhAgECAKKgIUjDgCFCAQIAoqAhiMOAIYIBAgCioCIDgCICACQQFqIgIgC0cNACALIQIMAgsgDkEBaiIOIAlHDQALCyAPEC4aCyAUEC4aCyAFQcAJaiQAIAIgB2ohByAGQQFqIgYgFUcNAAsgE0EBaiITIBhHDQALIAcgEUoEQCASQe0bNgIEIBJBtCw2AgBBAUHLMSASEI4BCyAHQQBMDQAgB0EDcSEaQQAhE0EAIQYgB0EBa0EDTwRAIAdBfHEhGEEAIRUDQCADIAQgBmxqIhEgATYCKCARIAA2AiQgAyAGQQFyIARsaiIRIAE2AiggESAANgIkIAMgBkECciAEbGoiESABNgIoIBEgADYCJCADIAZBA3IgBGxqIhEgATYCKCARIAA2AiQgBkEEaiEGIBVBBGoiFSAYRw0ACwsgGkUNAANAIAMgBCAGbGoiFSABNgIoIBUgADYCJCAGQQFqIQYgE0EBaiITIBpHDQALCyABKAIYIgYgRTgCECAGIEY4AgggBiBMOAIEIAYgRzgCACAGIC44AjggBiAwOAI0IAYgMTgCMCAGIDo4AiggBiA7OAIkIAYgQjgCICAGIEM4AhggBiBEOAIUIB0gEkFAaykDADcCECAdIBIpAzg3AgggHSASKQMwNwIAIAEgIjYCCAJAIAAtAAhBCHEEQCAHQQBMDQEgACgCGCEGIAAoAkwhE0EAIQADQCADIAAgBGxqIgEgBioCGCABKgIIIBMqAhSTIi6UIAYqAhAgASoCACATKgIQkyIwlCABKgIEIjEgBioCFJSSkiI6OAIAIAEgBioCKCAulCAGKgIgIDCUIDEgBioCJJSSkiI7OAIEIAEgBioCOCAulCAGKgIwIDCUIDEgBioCNJSSkiIuOAIIIAEgOiAGKgIAkjgCACABIDsgBioCBJI4AgQgASAuIAYqAgiSOAIIIAEgBioCGCABQRhqIhUqAgAiLpQgBioCECABKgIQIjCUIAFBFGoiESoCACIxIAYqAhSUkpI4AhAgESAuIAYqAiiUIDAgBioCIJQgMSAGKgIklJKSOAIAIBUgLiAGKgI4lCAwIAYqAjCUIDEgBioCNJSSkjgCACAAQQFqIgAgB0cNAAsMAQsgB0EATA0AIAdBAXEhESAAKAJMIQZBACEBIAdBAUcEQCAHQX5xIRVBACETA0AgAyABIARsaiIAIAAqAgAgBioCEJM4AgAgACAAKgIIIAYqAhSTOAIIIAMgAUEBciAEbGoiACAAKgIAIAYqAhCTOAIAIAAgACoCCCAGKgIUkzgCCCABQQJqIQEgE0ECaiITIBVHDQALCyARRQ0AIAMgASAEbGoiBCAEKgIAIAYqAhCTOAIAIAQgBCoCCCAGKgIUkzgCCAsgEkHQAGokACAHC4wKAgl9Cn8gAigCGCERIAAoAiQhDwJAIAAqAgQiBkMAAAAAXkUEQCAPRQ0BCyACQRRBECAFG2ooAgAhEyACQQxBCCAFG2ooAgAiEiADIBFsIhBBAnQiFGogBCoCADgCACASIBBBAWoiFUECdCIWaiAEKgIEOAIAIBIgEEECaiIXQQJ0IhhqIAQqAgg4AgACQCABKAIsIhFFDQAgEyAUaiAEKgIAjDgCACATIBZqIAQqAgSMOAIAIBMgGGogBCoCCIw4AgAgBQ0AIAEoAiAiEioCmAEhCCARKgKYASEHIAQqAgAhCSACKAIMIhMgEEECdCIUaiARKgKcASASKgKcAZNDAAAAP5QiCyAEKgIIIgyUIAQqAgQiDSARKgKgASASKgKgAZNDAAAAP5QiDpSTIgo4AgAgEyAVQQJ0IhFqIA4gCZQgDCAHIAiTQwAAAD+UIgeUkyIIOAIAIBMgF0ECdCISaiAHIA2UIAkgC5STIgk4AgAgAigCFCIQIBRqIAo4AgAgECARaiAIOAIAIBAgEmogCTgCAAsCQAJAAkACQAJAIA8EQCAGQwAAAABeRQ0FIAAqAgggACoCDFsNBSACKAIgIANBAnRqIAAqAhQ4AgAgACoCBCEGIAAqAgAiB0MAAAAAXg0BIAaMIAYgB0MAAAAAWxsgBiAPQQJGGyEGDAILIAZDAAAAAF5FDQQgA0ECdCIPIAIoAiBqIAAqAhQ4AgAgAigCHCAPaiAAKgIAOAIAIAIoAiQgD2ogACoCBIw4AgAgAigCKCAPaiAAKgIEOAIADAQLIAaMIQYgD0EBRg0BCyAPQQJHDQEgB0MAAAAAXUUNAQsgBiAAKgIQlCEGCyAEKgIIIAaMIgeUIQsgBCoCBCAHlCEMIAQqAgAgB5QhDSABKAIgIQ8gBQRAIA8gDSAMIAsQnwIgASgCLCIPRQ0BIA8gBiAEKgIAlCAGIAQqAgSUIAYgBCoCCJQQnwIMAQsgDyANIAwgCxCeAiABKAIsIg9FDQAgDyAGIAQqAgCUIAYgBCoCBJQgBiAEKgIIlBCeAiABKAIgIAogB5QiBiAIIAeUIgogCSAHlCIIEJ8CIAEoAiwgBiAKIAgQnwILQQEhECAAKAIkIhFFDQAgA0ECdCIPIAIoAhxqIgMgACoCGCACKgIAjJQgACoCKJQ4AgAgAigCICAPaiAAKgIcOAIAIAAqAgggACoCDFsEQCACKAIkIA9qQYCAgHw2AgAgAigCKCAPakGAgID8BzYCAEEBDwsgAigCJCAPakMAAAAAQwAAgP8gEUEBRiISGzgCACACKAIoIA9qQwAAgH9DAAAAACASGzgCACAAKgIgIgdDAAAAAF5FDQAgASgCICEAIAEoAiwhAiAEKgIIIQogBCoCBCEIIAQqAgAhCQJ9An8gBQRAIAAqAoACIAqUIAAqAvgBIAmUIAAqAvwBIAiUkpIiBiACRQ0CGiACKgL4ASAJlCAIIAIqAvwBlJIhCCACQYACagwBCyAAKgLwASAKlCAAKgLoASAJlCAAKgLsASAIlJKSIgYgAkUNARogAioC6AEgCZQgCCACKgLsAZSSIQggAkHwAWoLIQAgBiAAKgIAIAqUIAiSkwshBiARQQFGBEAgBkMAAAAAXUUNASAGIAeMlCIGIAMqAgBeRQ0BIAMgBjgCAEEBDwsgBkMAAAAAXkUNACAGIAeMlCIGIAMqAgBdRQ0AIAMgBjgCAAsgEAtnAQF/IwBBIGsiBCQAIABFBEAgBEGWFDYCEEECQd7VACAEQRBqEI4BCyAAKAIUQeCNAUcEQCAEQZYUNgIAQQJBidgAIAQQjgELIAAgASACIAMgAEHQAGogAEHgAGoQngEgBEEgaiQAC8ECAgF/A30gACgCICIGBEAgBCAGKgLIASADIAYqAqABkyIHlCAGKgKoASABIAYqApgBkyIIlCACIAYqApwBkyIJIAYqArgBlJKSOAIAIAQgBioCzAEgB5QgBioCrAEgCJQgCSAGKgK8AZSSkjgCBCAEIAYqAtABIAeUIAYqArABIAiUIAkgBioCwAGUkpI4AggCQCAAKAIsIgYEQCAFIAYqAsgBIAMgBioCoAGTIgOUIAYqAqgBIAEgBioCmAGTIgGUIAIgBioCnAGTIgIgBioCuAGUkpI4AgAgBSAGKgLMASADlCAGKgKsASABlCACIAYqArwBlJKSOAIEIAYqAtABIAOUIAYqArABIAGUIAIgBioCwAGUkpIhAwwBCyAFIAI4AgQgBSABOAIACyAFIAM4AggLIARBADYCDCAFQQA2AgwLrAQCBH8DfSMAQTBrIgMkACAARQRAIANBqhQ2AiBBAkHe1QAgA0EgahCOAQsgAUUEQCADQaoUNgIQQQJB+dUAIANBEGoQjgELIAAoAhRB4I0BRwRAIANBqhQ2AgBBAkGJ2AAgAxCOAQsCQCAALQAYQQJxBEAgACgCLCICBEAgASACKgKwASAAQegAaiIEKgIAlCACKgKoASAAKgJglCACKgKsASAAQeQAaiIFKgIAlJKSIgY4AgAgASACKgLAASAEKgIAlCACKgK4ASAAKgJglCACKgK8ASAFKgIAlJKSIgc4AgQgASACKgLQASAEKgIAlCACKgLIASAAKgJglCACKgLMASAFKgIAlJKSIgg4AgggASAGIAIqApgBkjgCACABIAcgAioCnAGSOAIEIAEgCCACKgKgAZI4AggMAgsgASAAKgJgOAIAIAEgACoCZDgCBCABIAAqAmg4AggMAQsgACgCICICRQ0AIAEgAioCsAEgAEHYAGoiBCoCAJQgAioCqAEgACoCUJQgAioCrAEgAEHUAGoiBSoCAJSSkiIGOAIAIAEgAioCwAEgBCoCAJQgAioCuAEgACoCUJQgAioCvAEgBSoCAJSSkiIHOAIEIAEgAioC0AEgBCoCAJQgAioCyAEgACoCUJQgAioCzAEgBSoCAJSSkiIIOAIIIAEgBiACKgKYAZI4AgAgASAHIAIqApwBkjgCBCABIAggAioCoAGSOAIICyADQTBqJAALGAAgAEHQAGpBBBCGAiAAQeAAakEEEIYCCw0AIAFCg4CAgDA3AgALHQAgACgCICAAKAIsIAEgAEHQAGogAEHgAGoQowELvwUCB38NfSACKAIYIQUgAigCCCIGQYCAgPwDNgIAIAYgBUEBakECdCIIakGAgID8AzYCACAGIAVBAXQiB0ECakECdCIJakGAgID8AzYCACAAKgKwASERIAAqAqgBIRIgACoCrAEhDyAAKgLAASEQIAAqArgBIRMgACoCvAEhFCACKAIMIgYgACoC0AEgAyoCCCINlCAAKgLIASADKgIAIgyUIAMqAgQiDiAAKgLMAZSSkiIVOAIEIAYgECANlCATIAyUIA4gFJSSkiIQjDgCCCAGIAVBAnQiA2ogFYw4AgAgBiAFQQJqQQJ0IgpqIBEgDZQgEiAMlCAPIA6UkpIiDTgCACAGIAVBA3RqIBA4AgAgBiAHQQFyQQJ0IgtqIA2MOAIAAn0gAQRAIAIoAhAiBUGAgID8ezYCACAFIAhqQYCAgPx7NgIAIAUgCWpBgICA/Hs2AgAgASoCsAEhEyABKgKoASEUIAEqAqwBIRYgASoC0AEhDyABKgLIASEXIAEqAswBIRggAigCFCIFIAEqAsABIAQqAggiDJQgASoCuAEgBCoCACIOlCAEKgIEIhEgASoCvAGUkpIiEjgCCCAFIA8gDJQgFyAOlCARIBiUkpIiD4w4AgQgAyAFaiAPOAIAIAUgCmogEyAMlCAUIA6UIBYgEZSSkiIOjDgCACAFIAdBAnRqIBKMOAIAIAUgC2ogDjgCACACKAIcIgUgAioCACACKgIElCIMIA4gASoCmAGSIA2TIAAqApgBk5Q4AgAgBSAMIBIgASoCnAGSIBCTIAAqApwBk5Q4AgQgDyABKgKgAZIMAQsgAigCHCIFIAIqAgAgAioCBJQiDCAEKgIAIA2TIAAqApgBk5Q4AgAgBSAMIAQqAgQgEJMgACoCnAGTlDgCBCAEKgIICyENIAUgDCANIBWTIAAqAqABk5Q4AggLyAEBA38jAEEgayIEJAAgAEUEQCAEQfAUNgIQQQJB3tUAIARBEGoQjgELIAAoAhRB9I0BRwRAIARB8BQ2AgBBAkHH2QAgBBCOAQsgACABIAIgAyAAQdAAaiAAQeAAahCeAQJAIAAoAiAiBUUNACAAKAIsIgYEQCAAQZABaiAFQdgBaiAGQdgBahDrAgwBCyAAIAUqAtgBOAKQASAAIAUqAtwBjDgClAEgACAFKgLgAYw4ApgBIAAgBSoC5AGMOAKcAQsgBEEgaiQAC7MEAgV/Bn0jAEEgayIHJAAgAEUEQCAHQaMSNgIQQQJB3tUAIAdBEGoQjgELIAAoAhRB9I0BRwRAIAdBoxI2AgBBAkHH2QAgBxCOAQsgAEHwAGohCCAAQYABaiEGIwBBEGsiBSQAAkAgACgCIEUNACAFQQA2AgwgBSADOAIIIAUgAjgCBCAFIAE4AgAgBRDQAiAIBEAgCCAAKAIgIgQqAsgBIAUqAggiCZQgBCoCqAEgBSoCACIKlCAEKgK4ASAFKgIEIguUkpI4AgAgCCAJIAQqAswBlCAKIAQqAqwBlCALIAQqArwBlJKSOAIEIAQqAtABIQwgBCoCsAEhDSAEKgLAASEOIAhBADYCDCAIIAwgCZQgDSAKlCALIA6UkpI4AggLIAZFDQACQCAAKAIsIgQEQCAGIAQqAsgBIAUqAggiA5QgBCoCqAEgBSoCACIClCAEKgK4ASAFKgIEIgGUkpI4AgAgBiADIAQqAswBlCACIAQqAqwBlCABIAQqArwBlJKSOAIEIAMgBCoC0AGUIAIgBCoCsAGUIAEgBCoCwAGUkpIhAwwBCyAGIAI4AgQgBiABOAIACyAGQQA2AgwgBiADOAIICyAFQRBqJAACQCAAKAIgIgRFDQAgACgCLCIFBEAgAEGQAWogBEHYAWogBUHYAWoQ6wIMAQsgACAEKgLYATgCkAEgACAEKgLcAYw4ApQBIAAgBCoC4AGMOAKYASAAIAQqAuQBjDgCnAELIAdBIGokAAusBAIEfwN9IwBBMGsiAyQAIABFBEAgA0GFFTYCIEECQd7VACADQSBqEI4BCyABRQRAIANBhRU2AhBBAkH51QAgA0EQahCOAQsgACgCFEH0jQFHBEAgA0GFFTYCAEECQcfZACADEI4BCwJAIAAtABhBAnEEQCAAKAIsIgIEQCABIAIqArABIABB6ABqIgQqAgCUIAIqAqgBIAAqAmCUIAIqAqwBIABB5ABqIgUqAgCUkpIiBjgCACABIAIqAsABIAQqAgCUIAIqArgBIAAqAmCUIAIqArwBIAUqAgCUkpIiBzgCBCABIAIqAtABIAQqAgCUIAIqAsgBIAAqAmCUIAIqAswBIAUqAgCUkpIiCDgCCCABIAYgAioCmAGSOAIAIAEgByACKgKcAZI4AgQgASAIIAIqAqABkjgCCAwCCyABIAAqAmA4AgAgASAAKgJkOAIEIAEgACoCaDgCCAwBCyAAKAIgIgJFDQAgASACKgKwASAAQdgAaiIEKgIAlCACKgKoASAAKgJQlCACKgKsASAAQdQAaiIFKgIAlJKSIgY4AgAgASACKgLAASAEKgIAlCACKgK4ASAAKgJQlCACKgK8ASAFKgIAlJKSIgc4AgQgASACKgLQASAEKgIAlCACKgLIASAAKgJQlCACKgLMASAFKgIAlJKSIgg4AgggASAGIAIqApgBkjgCACABIAcgAioCnAGSOAIEIAEgCCACKgKgAZI4AggLIANBMGokAAuDAgEEfyMAQTBrIgMkACAARQRAIANBthI2AiBBAkHe1QAgA0EgahCOAQsgAUUEQCADQbYSNgIQQQJB+dUAIANBEGoQjgELIAAoAhRB9I0BRwRAIANBthI2AgBBAkHH2QAgAxCOAQsgACgCICICBEAgASACKgKwASAAQfgAaiIEKgIAlCACKgKoASAAKgJwlCACKgKsASAAQfQAaiIFKgIAlJKSOAIAIAEgAioCwAEgBCoCAJQgAioCuAEgACoCcJQgAioCvAEgBSoCAJSSkjgCBCABIAIqAtABIAQqAgCUIAIqAsgBIAAqAnCUIAIqAswBIAUqAgCUkpI4AggLIANBMGokAAv6AQECfyMAQSBrIgQkACAARQRAIARB6R82AhBBAkHe1QAgBEEQahCOAQsgACgCFEH0jQFHBEAgBEHpHzYCAEECQcfZACAEEI4BCyAAQaABaiEDAkACQAJAAkACQAJAAkACQAJAAkAgAQ4JAAEIAgMEBQYHCQsgAEGoAWohAwwHCyAAQawBaiEDDAYLIAJDAAAAAGBFDQYgAEGkAWohAwwFCyACQwAAAABgRQ0FIAJDAACAP19FDQUgAEGwAWohAwwECyAAQcABaiEDDAMLIABBtAFqIQMMAgsgAEG4AWohAwwBCyAAQbwBaiEDCyADIAI4AgALIARBIGokAAvOAQIBfwF9IwBBIGsiAiQAIABFBEAgAkH9HzYCEEECQd7VACACQRBqEI4BCyAAKAIUQfSNAUcEQCACQf0fNgIAQQJBx9kAIAIQjgELAkACfwJAAkACQAJAAkACQAJAAkACQCABDgkAAQIDBAUGBwgKCyAAQagBagwICyAAQawBagwHCyAAQaABagwGCyAAQaQBagwFCyAAQbABagwECyAAQcABagwDCyAAQbQBagwCCyAAQbgBagwBCyAAQbwBagsqAgAhAwsgAkEgaiQAIAMLigECAn8BfSMAQSBrIgEkACAARQRAIAFBjCo2AhBBAkHZ3wAgAUEQahCOAQsgACgCFEH0jQFHBEAgAUGMKjYCAEECQcfZACABEI4BCyAAKAIgIgIEfSACIAAoAiwgAEHwAGogAEGQAWoQqwEiA4wgAyAALQAYQQJxGwVDAAAAAAshAyABQSBqJAAgAwvFAQMBfwR9AXwjAEEgayIEJAACQCABBEAgBCAAQdgBaiABQdgBahDrAiAEQRBqIAQgAxDsAgwBCyAEQRBqIABB2AFqIAMQ7QILIAQqAhwiBSAFlCAEKgIUIgYgBpQgBCoCGCIHIAeUkpKRIAQqAhAiCCAIjCAFIAIqAgiUIAYgAioCAJQgByACKgIElJKSQwAAAABgGxDmAyEFIARBIGokACAFIAWSIgW7IglEGC1EVPshGcCgtiAFIAlEGC1EVPshCUBkG4wLpQICAn8FfSMAQSBrIgIkACAARQRAIAJB8CU2AhBBAkHZ3wAgAkEQahCOAQsgACgCFEH0jQFHBEAgAkHwJTYCAEECQeTZACACEI4BCyAAKAIgIgEEfSABKgLQASAAKgJ4IgOUIAEqAsgBIAAqAnAiBJQgACoCdCIFIAEqAswBlJKSIgYgASoCgAKUIAEqArABIAOUIAEqAqgBIASUIAEqAqwBIAWUkpIiByABKgL4AZQgASoCwAEgA5QgASoCuAEgBJQgBSABKgK8AZSSkiIEIAEqAvwBlJKSIQMgACgCLCIBBEAgAyAGIAEqAoAClCAHIAEqAvgBlCAEIAEqAvwBlJKSkyEDCyADjCADIAAtABhBAnEbBUMAAAAACyEDIAJBIGokACADC64BAgF/AX0gAEHQAGpBBBCGAiAAQeAAakEEEIYCIABB8ABqQQQQhgIgAEGAgID8AzYCcCAAQYABakEEEIYCIABBgICA/AM2AoABIABBkAFqQQQQhgIgAEGAgID8AzYCsAEgAEKAgID8j4CAwP8ANwKoASAAQgA3AqABIAAgACgCACIBKgIkIgI4ArQBIAAgASoCIDgCuAEgACACOAK8ASAAQQA2AsgBIABCADcCwAELwAEBAn0gAUEFNgIEIAFBBkEFIAAqAqQBQwAAAABeGzYCAAJAAkAgACoCqAEiA7tEGC1EVPshCcBmIAAqAqwBIgK7RBgtRFT7IQlAZXJFDQAgAiADYEUNACAAKAIgIAAoAiwgAEHwAGogAEGQAWoQqwEhAgJAIAIgACoCqAEiA18EQCAAQQE2AsQBDAELIAAqAqwBIgMgAl9FDQIgAEECNgLEAQsgACACIAOTOALIASABQQY2AgALDwsgAEEANgLEAQvZBQIKfwd9IwBBMGsiAiQAIABBIGoiAygCACAAQSxqIgYoAgAgASAAQdAAaiAAQeAAahCjASACIAMoAgAiAyoCsAEgACoCeCIMlCADKgKoASAAKgJwIg2UIAMqAqwBIAAqAnQiDpSSkjgCICACIAwgAyoCwAGUIA0gAyoCuAGUIA4gAyoCvAGUkpI4AiQgAiAMIAMqAtABlCANIAMqAsgBlCAOIAMqAswBlJKSOAIoIAJBIGogAkEQaiACENICIAEoAgwiAyABKAIYIgRBA2wiBUECdCIHaiACKgIQOAIAIAMgBUEBakECdCIIaiACKgIUOAIAIAMgBUECakECdCIJaiACKgIYOAIAIAMgBEEEdGogAioCADgCACADIARBAnQiBUEBckECdCIKaiACKgIEOAIAIAMgBUECckECdCILaiACKgIIOAIAAn0gBigCACIDBEAgASgCFCIEIAdqIAIqAhCMOAIAIAQgCGogAioCFIw4AgAgBCAJaiACKgIYjDgCACAEIAVBAnRqIAIqAgCMOAIAIAQgCmogAioCBIw4AgAgBCALaiACKgIIjDgCACADKgLQASAAKgKIASIOlCADKgLIASAAKgKAASIPlCAAKgKEASIQIAMqAswBlJKSIQwgAyoCwAEgDpQgAyoCuAEgD5QgECADKgK8AZSSkiENIAMqArABIA6UIAMqAqgBIA+UIAMqAqwBIBCUkpIMAQsgACoCiAEhDCAAKgKEASENIAAqAoABCyEOIAEoAhwiAyABKgIAIAEqAgSUIg8gAioCICIQIA2UIA4gAioCJCIRlJMiEiACKgIYlCARIAyUIA0gAioCKCIRlJMiDSACKgIQlCARIA6UIAwgEJSTIgwgAioCFJSSkpQ4AgwgAyAPIBIgAioCCJQgDSACKgIAlCAMIAIqAgSUkpKUOAIQIABBoAFqIAAgAUEFIAJBIGpBARCcARogAkEwaiQAC8IDAgN/EX0jAEEgayIDJAAgAEUEQCADQfocNgIQQQJB3tUAIANBEGoQjgELIAAoAhRBiI4BRwRAIANB+hw2AgBBAkHw1gAgAxCOAQsgACoCeCEEIAAqAlghBiAAKgJUIQcgACgCICIBKgLQASEMIAEqAswBIQ0gASoCyAEhDiABKgLAASEPIAEqArwBIRAgASoCuAEhESABKgKwASESIAEqAqwBIRMgASoCqAEhFCAAKgJQIQgCQCAAKAIsIgJFBEAgASoCnAEgACoCdJMhCSABKgKYASAAKgJwkyEFIAEqAqABIQoMAQsgASoCoAEgAioC0AEgBJQgAioCyAEgACoCcCIFlCAAKgJ0IgsgAioCzAGUkpKTIQogASoCnAEgAioCwAEgBJQgAioCuAEgBZQgCyACKgK8AZSSkpMgAioCnAGTIQkgASoCmAEgAioCsAEgBJQgAioCqAEgBZQgAioCrAEgC5SSkpMgAioCmAGTIQUgAioCoAEhBAsgA0EgaiQAIAwgBpQgDiAIlCAHIA2UkpIgCiAEk5QgEiAGlCAUIAiUIBMgB5SSkiAFlCAPIAaUIBEgCJQgByAQlJKSIAmUkpILigICAn8FfSMAQSBrIgIkACAARQRAIAJB1CU2AhBBAkHe1QAgAkEQahCOAQsgACgCFEGIjgFHBEAgAkHUJTYCAEECQfDWACACEI4BCyAAKAIgIgEqAtABIAAqAlgiA5QgASoCyAEgACoCUCIElCAAKgJUIgUgASoCzAGUkpIiBiABKgLwAZQgASoCsAEgA5QgASoCqAEgBJQgASoCrAEgBZSSkiIHIAEqAugBlCABKgLAASADlCABKgK4ASAElCAFIAEqArwBlJKSIgQgASoC7AGUkpIhAyAAKAIsIgEEQCADIAYgASoC8AGUIAcgASoC6AGUIAQgASoC7AGUkpKTIQMLIAJBIGokACADC5cEAgN/A30jAEEwayIFJAAgAEUEQCAFQfsRNgIQQQJB3tUAIAVBEGoQjgELIAAoAhRBiI4BRwRAIAVB+xE2AgBBAkHw1gAgBRCOAQsCQCAAKAIgRQRADAELIAVBADYCLCAFIAM4AiggBSACOAIkIAUgATgCICAFQSBqENACIAAgACgCICIEKgLIASAFKgIoIgOUIAQqAqgBIAUqAiAiApQgBCoCuAEgBSoCJCIBlJKSOAJQIAAgAyAEKgLMAZQgAiAEKgKsAZQgASAEKgK8AZSSkjgCVCAEKgLQASEHIAQqArABIQggBCoCwAEhCSAAQQA2AlwgACAHIAOUIAggApQgASAJlJKSOAJYCyAAAn0gACgCLCIGBEAgAEHgAGogBEHYAWogBkHYAWoQ6wIgACAAKAIsIgQqAsgBIAAoAiAiBioCoAEgBCoCoAGTIgOUIAQqAqgBIAYqApgBIAQqApgBkyIClCAEKgK4ASAGKgKcASAEKgKcAZMiAZSSkjgCcCAAIAQqAswBIAOUIAQqAqwBIAKUIAEgBCoCvAGUkpI4AnQgBCoC0AEgA5QgBCoCsAEgApQgASAEKgLAAZSSkgwBCyAAIAQqAtgBOAJgIAAgBCoC3AGMOAJkIAAgBCoC4AGMOAJoIAAgBCoC5AGMOAJsIAAgBCoCmAE4AnAgACAEKgKcATgCdCAEKgKgAQs4AnggBUEwaiQAC4MCAQR/IwBBMGsiAyQAIABFBEAgA0GPEjYCIEECQd7VACADQSBqEI4BCyABRQRAIANBjxI2AhBBAkH51QAgA0EQahCOAQsgACgCFEGIjgFHBEAgA0GPEjYCAEECQfDWACADEI4BCyAAKAIgIgIEQCABIAIqArABIABB2ABqIgQqAgCUIAIqAqgBIAAqAlCUIAIqAqwBIABB1ABqIgUqAgCUkpI4AgAgASACKgLAASAEKgIAlCACKgK4ASAAKgJQlCACKgK8ASAFKgIAlJKSOAIEIAEgAioC0AEgBCoCAJQgAioCyAEgACoCUJQgAioCzAEgBSoCAJSSkjgCCAsgA0EwaiQAC/oBAQJ/IwBBIGsiBCQAIABFBEAgBEGPHzYCEEECQd7VACAEQRBqEI4BCyAAKAIUQYiOAUcEQCAEQY8fNgIAQQJB8NYAIAQQjgELIABBgAFqIQMCQAJAAkACQAJAAkACQAJAAkACQCABDgkAAQgCAwQFBgcJCyAAQYgBaiEDDAcLIABBjAFqIQMMBgsgAkMAAAAAYEUNBiAAQYQBaiEDDAULIAJDAAAAAGBFDQUgAkMAAIA/X0UNBSAAQZABaiEDDAQLIABBoAFqIQMMAwsgAEGUAWohAwwCCyAAQZgBaiEDDAELIABBnAFqIQMLIAMgAjgCAAsgBEEgaiQAC84BAgF/AX0jAEEgayICJAAgAEUEQCACQaQfNgIQQQJB3tUAIAJBEGoQjgELIAAoAhRBiI4BRwRAIAJBpB82AgBBAkHw1gAgAhCOAQsCQAJ/AkACQAJAAkACQAJAAkACQAJAIAEOCQABAgMEBQYHCAoLIABBiAFqDAgLIABBjAFqDAcLIABBgAFqDAYLIABBhAFqDAULIABBkAFqDAQLIABBoAFqDAMLIABBlAFqDAILIABBmAFqDAELIABBnAFqCyoCACEDCyACQSBqJAAgAwuMAQIBfwF9IABB0ABqQQQQhgIgAEGAgID8AzYCUCAAQeAAakEEEIYCIABB8ABqQQQQhgIgAEGAgID8AzYCkAEgAEKAgID8j4CAwP8ANwKIASAAQgA3AoABIAAgACgCACIBKgIkIgI4ApQBIAAgASoCIDgCmAEgACACOAKcASAAQQA2AqgBIABCADcCoAELmgECAn0BfyABQQU2AgQgAUEGQQUgACoChAFDAAAAAF4bNgIAIABBADYCpAECQCAAKgKIASICQwAAgP9eIAAqAowBIgNDAACAf11yRQ0AIAIgA19FDQBBASEEIAAQsAEiAyAAKgKIASICX0UEQEECIQQgAyAAKgKMASICYEUNAQsgACAENgKkASAAIAMgApM4AqgBIAFBBjYCAAsL4QgCC38HfSMAQTBrIgIkACABKAIYIQMgACgCICEEIAAoAiwiBQR/IAUqAqABIAQqAqABkyEQIAUqApwBIAQqApwBkyERIAUqApgBIAQqApgBkyEPIAVBqAFqBUEACyEHIANBAnQhBSADQQNsIQggACABIABB4ABqQQAQuQEgAiAEKgKwASAAKgJYIg2UIAQqAqgBIAAqAlAiEpQgBCoCrAEgACoCVCIOlJKSOAIgIAIgDSAEKgLAAZQgEiAEKgK4AZQgDiAEKgK8AZSSkjgCJCACIA0gBCoC0AGUIBIgBCoCyAGUIA4gBCoCzAGUkpI4AiggAkEgaiACQRBqIAIQ0gICQCAAKAIsIgxFBEAgBUECciEGIAVBAXIhCSAIQQJqIQogCEEBaiELDAELIAIqAhghDSABKAIMIgkgA0EMbCIKaiIGIA8gAioCFCISlCACKgIQIg4gEZSTQwAAAD+UIhM4AgggBiAQIA6UIA0gD5STQwAAAD+UIg44AgQgBiARIA2UIBIgEJSTQwAAAD+UIg04AgAgASgCFCILIApqIgYgEzgCCCAGIA44AgQgBiANOAIAIAIqAgghDSAJIANBBHQiBmoiAyAPIAIqAgQiEpQgAioCACIOIBGUk0MAAAA/lCITOAIIIAMgECAOlCANIA+Uk0MAAAA/lCIOOAIEIAMgESANlCASIBCUk0MAAAA/lCINOAIAIAYgC2oiAyATOAIIIAMgDjgCBCADIA04AgAgASgCECIDIAhBAnRqIAIqAhCMOAIAIAMgCEEBaiILQQJ0aiACKgIUjDgCACADIAhBAmoiCkECdGogAioCGIw4AgAgAyAFQQJ0aiACKgIAjDgCACADIAVBAXIiCUECdGogAioCBIw4AgAgAyAFQQJyIgZBAnRqIAIqAgiMOAIACyABKAIIIgMgCEECdGogAioCEDgCACADIAtBAnRqIAIqAhQ4AgAgAyAKQQJ0aiACKgIYOAIAIAMgBUECdGogAioCADgCACADIAlBAnRqIAIqAgQ4AgAgAyAGQQJ0aiACKgIIOAIAIAEqAgAgASoCBJQhDQJ9IAwEQCABKAIcIgMgDSACKgIYIAcqAiggACoCeCISlCAHKgIgIAAqAnAiDpQgACoCdCITIAcqAiSUkpIgEJIiEJQgAioCECAHKgIIIBKUIAcqAgAgDpQgByoCBCATlJKSIA+SIg+UIAIqAhQgByoCGCASlCAHKgIQIA6UIBMgByoCFJSSkiARkiIRlJKSlDgCDCACKgIIIBCUIAIqAgAgD5QgESACKgIElJKSDAELIAEoAhwiAyANIAIqAhggACoCeCAEKgKgAZMiD5QgAioCECAAKgJwIAQqApgBkyIRlCACKgIUIAAqAnQgBCoCnAGTIhCUkpKUOAIMIAIqAgggD5QgAioCACARlCAQIAIqAgSUkpILIQ8gAyANIA+UOAIQIABBgAFqIAAgAUEFIAJBIGpBABCcARogAkEwaiQAC8wDAgd/Cn0jAEEgayIEJAAgASgCDCIFIAEoAhgiBiADbCIHQQJ0IghqQYCAgPwDNgIAIAUgBiAHakEBakECdCIJakGAgID8AzYCACAFIAYgA0ECaiIHbEECakECdCIGakGAgID8AzYCAAJAIAAoAiwiCgRAIAEoAhQiBSAIakGAgID8ezYCACAFIAlqQYCAgPx7NgIAIAUgBmpBgICA/Hs2AgAgBCAAKAIgQdgBaiAKQdgBahDrAiAEQRBqIAQgAhDsAgwBCyAEQRBqIAAoAiBB2AFqIAIQ7QILIAAoAiAiACoC0AEhDyAAKgLIASEQIAAqAswBIREgACoCsAEhEiAAKgKoASETIAAqAqwBIRQgASgCHCIFIANBAnRqIgMgACoCwAECfSAEKgIQQwAAAABdRQRAIAQqAhghCyAEKgIUIQwgBCoCHAwBCyAEKgIYjCELIAQqAhSMIQwgBCoCHIwLIg6UIAAqArgBIAyUIAsgACoCvAGUkpIgASoCACABKgIElCINIA2SIg2UOAIEIAMgEiAOlCATIAyUIBQgC5SSkiANlDgCACAFIAdBAnRqIA8gDpQgECAMlCALIBGUkpIgDZQ4AgAgBEEgaiQAC94BAgJ9An8CfwJAAkAgACoCWCICQwAAAABdRQRAIAAtAFRBAXFFDQIgAiEDDAELIABBADYCWEEBIQRBACAALQBUQQFxRQ0CGgtBAkEBIANDAAAAAF4bIQQgACoCXCICQwAAAABdBEAgAEEANgJcIANDAACAf1sMAgsgBCACQwAAAABeaiEEIANDAACAf1sgAkMAAIB/XA0BGkECQQEgA0MAAIB/WxsMAQtBA0EBIAJDAAAAAF4bIQRBACACQwAAgH9cDQAaQQILIQUgACAENgJQIAEgBTYCBCABIAQ2AgAL8g0CCn8OfSMAQTBrIgIkACAAKgKQASEPAn0gAC0AGEECcQRAIAAqApQBjCEQIA+MIQ8gACoCmAGMDAELIAAqApQBIRAgACoCmAELIRMgASgCGCEHIAJBADYCLCACIBM4AiggAiAQOAIkIAIgDzgCICAAKgKAASEQIAAoAiAiAyoCmAEhESAAKgKEASETIAMqApwBIQ0gACoCiAEhEiADKgKgASEMIAEoAggiBCAPOAIAIAQgAioCJDgCBCAEIAIqAig4AgggASgCDCIIIBMgDZMiDyACKgIolCACKgIkIBIgDJMiE5STOAIAIAggEyACKgIgIg2UIAIqAiggECARkyIQlJM4AgQgCCAQIAIqAiSUIA0gD5STOAIIIAAoAiwiBgRAIAYqApwBIREgBioCoAEhEiAGKgKYASEMIAAqAoABIQ4gACoChAEhFCAAKgKIASEVIAEoAhAiBSANjDgCACAFIAIqAiSMOAIEIAUgAioCKIw4AgggASgCFCIFIBQgEZMiESACKgIolCACKgIkIBUgEpMiEpSTjDgCACAFIBIgAioCICIUlCACKgIoIA4gDJMiDZSTjDgCBCAFIA0gAioCJJQgFCARlJOMOAIICyABKAIcIgkgACgCACIKKgJEIgwgAEHoAGogAUEEaiAAKAJUIgVBCHEbKgIAIAEqAgCUQwAAAAAgACoCoAEgCioCSJMiDiAOQwAAAABdG5QiDiAMIA5dGzgCACAFQRBxBEAgASgCICAAKgJsOAIACwJAIAVBBHFFDQAgBCoCCCADKgLwAZQgBCoCACADKgLoAZQgBCoCBCADKgLsAZSSkiAIKgIIIAMqAoAClCAIKgIAIAMqAvgBlCAIKgIEIAMqAvwBlJKSkiEMIAYEQCAMIAEoAhAiAyoCCCAGKgLwAZQgAyoCACAGKgLoAZQgAyoCBCAGKgLsAZSSkiABKAIUIgMqAgggBioCgAKUIAMqAgAgBioC+AGUIAMqAgQgBioC/AGUkpKSkiEMCyAAKgJkIg5DAAAAAGBFDQAgDiAMjF1FDQAgDCAAKgJgjJQiDCAJKgIAXkUNACAJIAw4AgALIAEoAiRBADYCACABKAIoQYCAgPwHNgIAAkAgACgCUEECSA0AIBCMIQ4gD4whFCATjCEVAkAgBUECcQRAIAIgACoCtAEiDDgCECACIAAqArgBIhc4AhQgAiAAKgK8ASIYOAIYIAIgFyACKgIgIhmUIAwgAioCJCIWlJM4AgggAiAWIBiUIBcgAioCKCIWlJM4AgAgAiAWIAyUIBggGZSTOAIEDAELIAJBIGogAkEQaiACENICIAAoAiwhBiABKAIMIQggASgCCCEEIAIqAhAhDAsgBCAHQQJ0IgNqIAw4AgAgBCAHQQFqQQJ0IgpqIAIqAhQ4AgAgBCAHQQJqQQJ0IglqIAIqAhg4AgAgAyAIaiIFIA8gAioCGJQgAioCFCAVlJI4AgAgBSATIAIqAhCUIAIqAhggDpSSOAIEIAUgECACKgIUlCACKgIQIBSUkjgCCCAGBEAgASgCECIFIANqIAIqAhCMOAIAIAUgCmogAioCFIw4AgAgBSAJaiACKgIYjDgCACABKAIUIANqIgMgESACKgIYlCACKgIUIBKUk4w4AgAgAyASIAIqAhCUIAIqAhggDZSTjDgCBCADIA0gAioCFJQgAioCECARlJOMOAIICyAAKAJUIgNBIHEEQCABKAIcIAAqAnA4AgQLIAEoAiQiCiAAQdgAaiIFKgIAjDgCBCABKAIoIgkgBSoCADgCBCADQYAgcQRAIAEoAixBADYCBCAAKAJUIQMLIANBgAFxBEAgASgCICAAKgJ4OAIECyAAKAJQQQNIDQAgBCAHQQF0IgdBAnQiBWogAioCADgCACAEIAdBAXJBAnQiC2ogAioCBDgCACAEIAdBAmpBAnQiB2ogAioCCDgCACAFIAhqIgQgDyACKgIIlCACKgIEIBWUkjgCACAEIBMgAioCAJQgAioCCCAOlJI4AgQgBCAQIAIqAgSUIAIqAgAgFJSSOAIIIAYEQCABKAIQIgQgBWogAioCAIw4AgAgBCALaiACKgIEjDgCACAEIAdqIAIqAgiMOAIAIAEoAhQgBWoiBCARIAIqAgiUIAIqAgQgEpSTjDgCACAEIBIgAioCAJQgAioCCCANlJOMOAIEIAQgDSACKgIElCACKgIAIBGUk4w4AggLIANBwABxBEAgASgCHCAAKgJ0OAIICyAKIABB3ABB2AAgA0EBcRtqIgQqAgCMOAIIIAkgBCoCADgCCCADQYDAAHEEfyABKAIsQQA2AgggACgCVAUgAwtBgAJxRQ0AIAEoAiAgACoCfDgCCAsgAkEwaiQAC2wBAX8jAEEgayIEJAAgAEUEQCAEQZoVNgIQQQJB3tUAIARBEGoQjgELIAAoAhRBsI4BRwRAIARBmhU2AgBBAkHF3gAgBBCOAQsgACABIAIgAyAAQdAAaiAAQeAAahCeASAAEL0BIARBIGokAAvrBQIKfxF9IwBBEGsiAyQAAkAgACgCICIBRQ0AIAEqAtABIAAqAngiDpQgASoCyAEgACoCcCILlCAAKgJ0IgwgASoCzAGUkpIhESABKgLAASAOlCABKgK4ASALlCAMIAEqArwBlJKSIQ8gACoCiAEhDSAAKAIsIgIqAtABIRMgACoChAEhECACKgLMASEUIAIqAsgBIRUgACoCgAEhEiACKgLAASEWIAIqArwBIRcgAioCuAEhGCACKgKwASEZIAIqAqwBIRogAioCqAEhGwJAIAEqArABIA6UIAEqAqgBIAuUIAEqAqwBIAyUkpIiDkMAAAAAXA0AIA9DAAAAAFwNACARQwAAAABbDQELIBMgDZQgFSASlCAQIBSUkpIhDCAWIA2UIBggEpQgECAXlJKSIQsCQCAZIA2UIBsgEpQgGiAQlJKSIg1DAAAAAFwNACALQwAAAABcDQAgDEMAAAAAWw0BCwJAIA0gDlwNACALIA9cDQAgDCARWw0BCyADIAwgESAMlCAOIA2UIA8gC5SSkiIQIBGUkzgCCCADIAsgECAPlJM4AgQgAyANIBAgDpSTOAIAIAMQ0AIgACAAKAIgIgFByAFqIgIqAgAgAyoCCCILlCABQagBaiIEKgIAIAMqAgAiDJQgAUG4AWoiBSoCACADKgIEIg2UkpI4ApgBIAAgCyABQcwBaiIGKgIAlCAMIAFBrAFqIgcqAgCUIA0gAUG8AWoiCCoCAJSSkjgCnAEgACALIAFB0AFqIgkqAgCUIAwgAUGwAWoiCioCAJQgDSABQcABaiIBKgIAlJKSOAKgASAAIAIqAgAgDiANlCAMIA+UkyIQlCAEKgIAIA8gC5QgDSARlJMiD5QgESAMlCALIA6UkyIOIAUqAgCUkpI4AqgBIAAgBioCACAQlCAHKgIAIA+UIA4gCCoCAJSSkjgCrAEgACAJKgIAIBCUIAoqAgAgD5QgDiABKgIAlJKSOAKwAQsgA0EQaiQAC9EEAgt/B30jAEEwayIFJAAgAEUEQCAFQdjRADYCEEECQd7VACAFQRBqEI4BCyAAKAIUQbCOAUcEQCAFQdjRADYCAEECQcXeACAFEI4BCyAAKAIgBEAgBUEANgIsIAUgAzgCKCAFIAI4AiQgBSABOAIgIAVBIGoQ0AIgACAAKAIgIgRByAFqIgYqAgAgBSoCKCIBlCAEQagBaiIHKgIAIAUqAiAiD5QgBEG4AWoiCCoCACAFKgIkIhCUkpIiAzgCcCAAIAEgBEHMAWoiCSoCAJQgDyAEQawBaiIKKgIAlCAQIARBvAFqIgsqAgCUkpIiAjgCdCAEQdABaiIMKgIAIREgBEGwAWoiDSoCACESIARBwAFqIg4qAgAhEyAAQQA2AnwgACARIAGUIBIgD5QgECATlJKSIgE4AnggACAMKgIAIAGUIAYqAgAgA5QgAiAJKgIAlJKSIg8gACgCLCIEKgLQASAAKgKIASIQlCAEKgLIASAAKgKAASIRlCAAKgKEASISIAQqAswBlJKSIhOUIA0qAgAgAZQgByoCACADlCACIAoqAgCUkpIiFCAEKgKwASAQlCAEKgKoASARlCAEKgKsASASlJKSIhWUIA4qAgAgAZQgCCoCACADlCACIAsqAgCUkpIiAyAEKgLAASAQlCAEKgK4ASARlCASIAQqArwBlJKSIgKUkpI4ApABIAAgFCAClCAVIAOUkyIBIAGUIAMgE5QgAiAPlJMiAyADlCAPIBWUIBMgFJSTIgMgA5SSkpE4ApQBCyAAEL0BIAVBMGokAAvRBAILfwd9IwBBMGsiBSQAIABFBEAgBUGJ0AA2AhBBAkHe1QAgBUEQahCOAQsgACgCFEGwjgFHBEAgBUGJ0AA2AgBBAkHF3gAgBRCOAQsgACgCLARAIAVBADYCLCAFIAM4AiggBSACOAIkIAUgATgCICAFQSBqENACIAAgACgCLCIEQcgBaiIGKgIAIAUqAigiAZQgBEGoAWoiByoCACAFKgIgIg+UIARBuAFqIggqAgAgBSoCJCIQlJKSIgM4AoABIAAgASAEQcwBaiIJKgIAlCAPIARBrAFqIgoqAgCUIBAgBEG8AWoiCyoCAJSSkiICOAKEASAEQdABaiIMKgIAIREgBEGwAWoiDSoCACESIARBwAFqIg4qAgAhEyAAQQA2AnwgACARIAGUIBIgD5QgECATlJKSIgE4AogBIAAgACgCICIEKgLQASAAKgJ4Ig+UIAQqAsgBIAAqAnAiEJQgACoCdCIRIAQqAswBlJKSIhIgDCoCACABlCAGKgIAIAOUIAIgCSoCAJSSkiITlCAEKgKwASAPlCAEKgKoASAQlCAEKgKsASARlJKSIhQgDSoCACABlCAHKgIAIAOUIAIgCioCAJSSkiIVlCAEKgLAASAPlCAEKgK4ASAQlCARIAQqArwBlJKSIg8gDioCACABlCAIKgIAIAOUIAIgCyoCAJSSkiIDlJKSOAKQASAAIBQgA5QgFSAPlJMiAiAClCAPIBOUIAMgEpSTIgMgA5QgEiAVlCATIBSUkyIDIAOUkpKROAKUAQsgABC9ASAFQTBqJAAL0gMBAn8jAEEgayIEJAAgAEUEQCAEQZEgNgIQQQJB3tUAIARBEGoQjgELIAAoAhRBsI4BRwRAIARBkSA2AgBBAkHF3gAgBBCOAQsCQAJAIAFBgP4DcUGAAkYEQCAAQeQBaiEDAkACQAJAAkACQAJAAkACQCABQf8BcQ4JAAEJAgMEBQYHCgsgAEHsAWohAwwICyAAQfABaiEDDAcLIAJDAAAAAGBFDQcgAEHoAWohAwwGCyACQwAAAABgRQ0GIAJDAACAP19FDQYgAEH0AWohAwwFCyAAQYQCaiEDDAQLIABB+AFqIQMMAwsgAEH8AWohAwwCCyAAQYACaiEDDAELAkACQAJAIAFBCWsOAgABAgsgAEGQAmohAwwCCyAAQZQCaiEDDAELIABBuAFqIQMCQAJAAkACQAJAAkACQAJAIAEOCQABCAIDBAUGBwkLIABBwAFqIQMMBwsgAEHEAWohAwwGCyACQwAAAABgRQ0GIABBvAFqIQMMBQsgAkMAAAAAYEUNBSACQwAAgD9fRQ0FIABByAFqIQMMBAsgAEHYAWohAwwDCyAAQcwBaiEDDAILIABB0AFqIQMMAQsgAEHUAWohAwsgAyACOAIACyAEQSBqJAALrAQCBH8DfSMAQTBrIgMkACAARQRAIANBsBU2AiBBAkHe1QAgA0EgahCOAQsgAUUEQCADQbAVNgIQQQJB+dUAIANBEGoQjgELIAAoAhRBsI4BRwRAIANBsBU2AgBBAkHF3gAgAxCOAQsCQCAALQAYQQJxBEAgACgCLCICBEAgASACKgKwASAAQegAaiIEKgIAlCACKgKoASAAKgJglCACKgKsASAAQeQAaiIFKgIAlJKSIgY4AgAgASACKgLAASAEKgIAlCACKgK4ASAAKgJglCACKgK8ASAFKgIAlJKSIgc4AgQgASACKgLQASAEKgIAlCACKgLIASAAKgJglCACKgLMASAFKgIAlJKSIgg4AgggASAGIAIqApgBkjgCACABIAcgAioCnAGSOAIEIAEgCCACKgKgAZI4AggMAgsgASAAKgJgOAIAIAEgACoCZDgCBCABIAAqAmg4AggMAQsgACgCICICRQ0AIAEgAioCsAEgAEHYAGoiBCoCAJQgAioCqAEgACoCUJQgAioCrAEgAEHUAGoiBSoCAJSSkiIGOAIAIAEgAioCwAEgBCoCAJQgAioCuAEgACoCUJQgAioCvAEgBSoCAJSSkiIHOAIEIAEgAioC0AEgBCoCAJQgAioCyAEgACoCUJQgAioCzAEgBSoCAJSSkiIIOAIIIAEgBiACKgKYAZI4AgAgASAHIAIqApwBkjgCBCABIAggAioCoAGSOAIICyADQTBqJAALhgIBBH8jAEEwayIDJAAgAEUEQCADQe3RADYCIEECQd7VACADQSBqEI4BCyABRQRAIANB7dEANgIQQQJB+dUAIANBEGoQjgELIAAoAhRBsI4BRwRAIANB7dEANgIAQQJBxd4AIAMQjgELIAAoAiAiAgRAIAEgAioCsAEgAEH4AGoiBCoCAJQgAioCqAEgACoCcJQgAioCrAEgAEH0AGoiBSoCAJSSkjgCACABIAIqAsABIAQqAgCUIAIqArgBIAAqAnCUIAIqArwBIAUqAgCUkpI4AgQgASACKgLQASAEKgIAlCACKgLIASAAKgJwlCACKgLMASAFKgIAlJKSOAIICyADQTBqJAALiQIBBH8jAEEwayIDJAAgAEUEQCADQZ7QADYCIEECQd7VACADQSBqEI4BCyABRQRAIANBntAANgIQQQJB+dUAIANBEGoQjgELIAAoAhRBsI4BRwRAIANBntAANgIAQQJBxd4AIAMQjgELIAAoAiwiAgRAIAEgAioCsAEgAEGIAWoiBCoCAJQgAioCqAEgACoCgAGUIAIqAqwBIABBhAFqIgUqAgCUkpI4AgAgASACKgLAASAEKgIAlCACKgK4ASAAKgKAAZQgAioCvAEgBSoCAJSSkjgCBCABIAIqAtABIAQqAgCUIAIqAsgBIAAqAoABlCACKgLMASAFKgIAlJKSOAIICyADQTBqJAAL6QICAX8BfSMAQSBrIgIkACAARQRAIAJBpiA2AhBBAkHe1QAgAkEQahCOAQsgACgCFEGwjgFHBEAgAkGmIDYCAEECQcXeACACEI4BCwJAAn8gAUGA/gNxQYACRgRAAkACQAJAAkACQAJAAkACQAJAIAFB/wFxDgkAAQIDBAUGBwgLCyAAQewBagwJCyAAQfABagwICyAAQeQBagwHCyAAQegBagwGCyAAQfQBagwFCyAAQYQCagwECyAAQfgBagwDCyAAQfwBagwCCyAAQYACagwBCwJAAkACQAJAAkACQAJAAkACQAJAAkAgAQ4LAgMEBQYHCAkKAAEMCyAAQZACagwKCyAAQZQCagwJCyAAQcABagwICyAAQcQBagwHCyAAQbgBagwGCyAAQbwBagwFCyAAQcgBagwECyAAQdgBagwDCyAAQcwBagwCCyAAQdABagwBCyAAQdQBagsqAgAhAwsgAkEgaiQAIAML6wICA38FfSMAQSBrIgMkACAARQRAIANB5tIANgIQQQJB3tUAIANBEGoQjgELIAAoAhRBsI4BRwRAIANB5tIANgIAQQJBxd4AIAMQjgELIAAoAiAiAQR9IAAqArABIAEqAtABIAAoAiwiAioC0AEgACoCiAEiBJQgAioCyAEgACoCgAEiBZQgACoChAEiBiACKgLMAZSSkiIHlCABKgKwASACKgKwASAElCACKgKoASAFlCACKgKsASAGlJKSIgiUIAIqAsABIASUIAIqArgBIAWUIAYgAioCvAGUkpIiBCABKgLAAZSSkiIFlCAAKgKoASABKgLIASAHlCABKgKoASAIlCAEIAEqArgBlJKSIgaUIAEqAswBIAeUIAEqAqwBIAiUIAQgASoCvAGUkpIiBCAAKgKsAZSSkiAAKgKgASAFlCAAKgKYASAGlCAEIAAqApwBlJKSEOYDjAVDAAAAAAshBCADQSBqJAAgBAuVAgICfwV9IwBBIGsiAiQAIABFBEAgAkHcJjYCEEECQd7VACACQRBqEI4BCyAAKAIUQbCOAUcEQCACQdwmNgIAQQJBxd4AIAIQjgELAkAgACgCICIBRQRADAELIAEqAtABIAAqAngiA5QgASoCyAEgACoCcCIElCAAKgJ0IgUgASoCzAGUkpIiBiABKgKAApQgASoCsAEgA5QgASoCqAEgBJQgASoCrAEgBZSSkiIHIAEqAvgBlCABKgLAASADlCABKgK4ASAElCAFIAEqArwBlJKSIgQgASoC/AGUkpIhAyAAKAIsIgFFDQAgAyAGIAEqAoAClCAHIAEqAvgBlCAEIAEqAvwBlJKSkyEDCyACQSBqJAAgAwuRAgIDfwV9IwBBIGsiAiQAIABFBEAgAkGlJjYCEEECQd7VACACQRBqEI4BCyAAKAIUQbCOAUcEQCACQaUmNgIAQQJBxd4AIAIQjgELAkAgACgCICIDRQ0AIAAoAiwiAUUNACABKgLQASAAKgKIASIElCABKgLIASAAKgKAASIFlCAAKgKEASIGIAEqAswBlJKSIgcgAyoCgAKUIAEqArABIASUIAEqAqgBIAWUIAEqAqwBIAaUkpIiCCADKgL4AZQgASoCwAEgBJQgASoCuAEgBZQgBiABKgK8AZSSkiIEIAMqAvwBlJKSIAcgASoCgAKUIAggASoC+AGUIAQgASoC/AGUkpKTIQQLIAJBIGokACAEC8UCAgJ9AX8gAEHQAGpBBBCGAiAAQeAAakEEEIYCIABB8ABqQQQQhgIgAEGAgID8AzYCcCAAQYABakEEEIYCIABCADcCkAEgAEGAgID8AzYChAEgAEGYAWpBBBCGAiAAQYCAgPwDNgKYASAAQagBakEEEIYCIABBgICA/AM2AsgBIABCgICA/I+AgMD/ADcCwAEgAEIANwK4ASAAQYCAgPwDNgKsASAAIAAoAgAiAyoCJCIBOALMASAAIAMqAiAiAjgC0AEgACACOAL8ASAAIAI4ApACIAAgATgC+AEgACABOAKAAiAAIAE4ApQCIABCgICA/I+AgMD/ADcC7AEgAEEANgKMAiAAQgA3AoQCIABBgICA/AM2AvQBIABBADYC6AEgAEIANwLgASAAIAE4AtQBIABCADcC2AEgACAAKAIYQQRyNgIYC9MDAgJ/B30gAUKEgICAwAA3AgACfwJAAkACQCAAKgLEASIIu0QYLURU+yEJQGVFIAAqAsABIgW7RBgtRFT7IQnAZkF/c3ENACAFIAhfRQ0AIAAqArABIAAoAiAiAioC0AEgACgCLCIDKgLQASAAKgKIASIElCADKgLIASAAKgKAASIGlCAAKgKEASIHIAMqAswBlJKSIgmUIAIqArABIAMqArABIASUIAMqAqgBIAaUIAMqAqwBIAeUkpIiCpQgAyoCwAEgBJQgAyoCuAEgBpQgByADKgK8AZSSkiIEIAIqAsABlJKSIgaUIAAqAqgBIAIqAsgBIAmUIAIqAqgBIAqUIAQgAioCuAGUkpIiB5QgAioCzAEgCZQgAioCrAEgCpQgBCACKgK8AZSSkiIEIAAqAqwBlJKSIAAqAqABIAaUIAAqApgBIAeUIAQgACoCnAGUkpIQ5gOMIgQgBV8EQCAAQQE2AtwBDAILIAQgCGAEQCAAQQI2AtwBIAghBQwCCyAAQQA2AtwBC0EFIAAqArwBQwAAAABeRQ0CGgwBCyAAIAQgBZM4AuABCyABQQU2AgBBBgshAiAAQQA2AogCIAAqAugBQwAAAABeBEAgASACNgIACwuaEAIMfxZ9IwBB0ABrIgIkACACIABBIGoiBygCACIDKgKwASAAKgJ4IhKUIAMqAqgBIAAqAnAiE5QgAyoCrAEgACoCdCIRlJKSIhg4AhAgAiASIAMqAsABlCATIAMqArgBlCARIAMqArwBlJKSIhk4AhQgAiASIAMqAtABlCATIAMqAsgBlCARIAMqAswBlJKSIho4AhggAiAAQSxqIgUoAgAiAyoCsAEgACoCiAEiEpQgAyoCqAEgACoCgAEiE5QgAyoCrAEgACoChAEiEZSSkiIbOAIAIAIgEiADKgLAAZQgEyADKgK4AZQgESADKgK8AZSSkiIcOAIEIAMqAsgBIQ8gAyoCzAEhECADKgLQASEOIAIgGCAclCAbIBmUkyIfOAIoIAIgDiASlCAPIBOUIBEgEJSSkiIdOAIIIAIgGiAblCAdIBiUkyIgOAIkIAIgGSAdlCAcIBqUkyIhOAIgIAJBIGoQ0AIgACoCkAIhFSABKAIYIQQgAkEQaiACQUBrIAJBMGoQ0gIgASgCCCIDIAIqAhA4AgAgAyACKgIUOAIEIAMgAioCGDgCCCADIARBAnQiBmogAioCQDgCACADIARBAWpBAnQiCWogAioCRDgCACADIARBAmpBAnQiCmogAioCSDgCACADIARBA3QiC2ogAioCMDgCACADIARBAXQiCEEBckECdCIMaiACKgI0OAIAIAMgCEECakECdCINaiACKgI4OAIAIAcoAgAiAyoCqAEhDiADKgKsASEWIAMqArABIRQgASgCDCIHIAMqAsABIAAqAlgiEZQgAyoCuAEgACoCUCIPlCAAKgJUIhAgAyoCvAGUkpIiEiACKgIYlCACKgIUIAMqAtABIBGUIAMqAsgBIA+UIBAgAyoCzAGUkpIiE5STOAIAIAcgEyACKgIQIheUIAIqAhggFCARlCAOIA+UIBYgEJSSkiIRlJM4AgQgByARIAIqAhSUIBcgEpSTOAIIIAYgB2oiBCASIAIqAkiUIAIqAkQgE5STOAIAIAQgEyACKgJAlCACKgJIIBGUkzgCBCAEIBEgAioCRJQgAioCQCASlJM4AgggByALaiIEIBIgAioCOJQgAioCNCATlJM4AgAgBCATIAIqAjCUIAIqAjggEZSTOAIEIAQgESACKgI0lCACKgIwIBKUkzgCCCAFKAIAIgQEQCABKAIQIgUgAioCEIw4AgAgBSACKgIUjDgCBCAFIAIqAhiMOAIIIAUgBmogAioCQIw4AgAgBSAJaiACKgJEjDgCACAFIApqIAIqAkiMOAIAIAUgCEECdCIIaiACKgIwjDgCACAFIAxqIAIqAjSMOAIAIAUgDWogAioCOIw4AgAgBCoCqAEhFyAEKgKsASEeIAQqArABISIgASgCFCIFIAQqAsABIAAqAmgiDpQgBCoCuAEgACoCYCIWlCAAKgJkIhQgBCoCvAGUkpIiECACKgIYlCACKgIUIAQqAtABIA6UIAQqAsgBIBaUIBQgBCoCzAGUkpIiD5STjDgCACAFIA8gAioCECIjlCACKgIYICIgDpQgFyAWlCAeIBSUkpIiDpSTjDgCBCAFIA4gAioCFJQgIyAQlJOMOAIIIAUgBmoiBiAQIAIqAkiUIAIqAkQgD5STjDgCACAGIA8gAioCQJQgAioCSCAOlJOMOAIEIAYgDiACKgJElCACKgJAIBCUk4w4AgggBSAIaiIFIBAgAioCOJQgAioCNCAPlJOMOAIAIAUgDyACKgIwlCACKgI4IA6Uk4w4AgQgBSAOIAIqAjSUIAIqAjAgEJSTjDgCCAsgASoCACIUIAEqAgSUIRYgFSAUlCEVIBEgAyoCmAGSIREgEyADKgKgAZIhEyASIAMqApwBkiESAn0gBARAIAEoAhwiAyAVIAIqAhgiHiAPIAQqAqABkiIUlCACKgIQIg8gDiAEKgKYAZIiDpQgECAEKgKcAZIiFyACKgIUIhCUkpIgHiATlCAPIBGUIBIgEJSSkpOUOAIAIAMgFiACKgJIIg8gFJQgAioCQCIQIA6UIBcgAioCRCIVlJKSIA8gE5QgECARlCASIBWUkpKTlDgCBCACKgI4Ig8gFJQgAioCMCIQIA6UIBcgAioCNCIOlJKSDAELIAEoAhwiAyAVIAIqAhgiDyAAQegAaiIFKgIAlCACKgIQIhAgACoCYJQgAioCFCIOIABB5ABqIgYqAgCUkpIgDyATlCAQIBGUIBIgDpSSkpOUOAIAIAMgFiACKgJIIg8gBSoCAJQgAioCQCIQIAAqAmCUIAIqAkQiDiAGKgIAlJKSIA8gE5QgECARlCASIA6UkpKTlDgCBCACKgI4Ig8gBSoCAJQgAioCMCIQIAAqAmCUIAIqAjQiDiAGKgIAlJKSCyEVIAMgFiAVIA8gE5QgECARlCASIA6UkpKTlDgCCCAHIAEoAhhBA2wiBUECdCIGaiACKgIgOAIAIAcgBUEBakECdCIIaiACKgIkOAIAIAcgBUECakECdCIFaiACKgIoOAIAIAQEQCABKAIUIgQgBmogAioCIIw4AgAgBCAIaiACKgIkjDgCACAEIAVqIAIqAiiMOAIACyADIAEqAgAgASoCBJQgACoCkAEgHyAflCAhICGUICAgIJSSkpGUIBogHZQgGCAblCAZIByUkpIgACoClAGUk5Q4AgwgAEHkAWogACABIABBuAFqIAAgAUEEIAJBEGpBARCcAUEEciACQQEQnAEaIAEoAiAgACoClAI4AgAgAkHQAGokAAtsAQF/IwBBIGsiBCQAIABFBEAgBEG+FDYCEEECQd7VACAEQRBqEI4BCyAAKAIUQcSOAUcEQCAEQb4UNgIAQQJBzNgAIAQQjgELIAAgASACIAMgAEHQAGogAEHgAGoQngEgABDMASAEQSBqJAALowMCAn8IfSMAQUBqIgIkAAJAIAAoAiAiAUUNACABKgLQASAAKgJ4IgWUIAEqAsgBIAAqAnAiA5QgACoCdCIEIAEqAswBlJKSIQcgASoCwAEgBZQgASoCuAEgA5QgBCABKgK8AZSSkiEIIAJBEGogASoCsAEgBZQgASoCqAEgA5QgASoCrAEgBJSSkiIFIAggBwJ9IAAoAiwiAQRAIAEqAtABIAAqAogBIgaUIAEqAsgBIAAqAoABIgmUIAAqAoQBIgogASoCzAGUkpIhAyABKgLAASAGlCABKgK4ASAJlCAKIAEqArwBlJKSIQQgASoCsAEgBpQgASoCqAEgCZQgASoCrAEgCpSSkgwBCyAAKgKIASEDIAAqAoQBIQQgACoCgAELIgYgBCADEOkCIAIgAkEQahDuAiAAQZABaiAAKAIgQdgBaiACEOsCIAJBEGogBiAEIAMgBSAIIAcQ6QIgAiACQRBqEO4CIAAoAiwiAUUEQCAAIAIpAwg3AqgBIAAgAikDADcCoAEMAQsgAEGgAWogAUHYAWogAhDrAgsgAkFAayQAC/EDAgJ/A30jAEEwayIEJAAgAEUEQCAEQajRADYCEEECQd7VACAEQRBqEI4BCyAAKAIUQcSOAUcEQCAEQajRADYCAEECQczYACAEEI4BCwJAIAAtABhBAnEEQCAAKAIgRQ0BIARBADYCLCAEIAM4AiggBCACOAIkIAQgATgCICAEQSBqENACAkAgACgCLCIFBEAgACAFKgLIASAEKgIoIgOUIAUqAqgBIAQqAiAiApQgBSoCuAEgBCoCJCIBlJKSOAKAASAAIAMgBSoCzAGUIAIgBSoCrAGUIAEgBSoCvAGUkpI4AoQBIAMgBSoC0AGUIAIgBSoCsAGUIAEgBSoCwAGUkpIhAwwBCyAAIAE4AoABIAAgAjgChAELIABBADYCjAEgACADOAKIAQwBCyAAKAIgRQ0AIARBADYCLCAEIAM4AiggBCACOAIkIAQgATgCICAEQSBqENACIAAgACgCICIFKgLIASAEKgIoIgOUIAUqAqgBIAQqAiAiApQgBSoCuAEgBCoCJCIBlJKSOAJwIAAgAyAFKgLMAZQgAiAFKgKsAZQgASAFKgK8AZSSkjgCdCAFKgLQASEGIAUqArABIQcgBSoCwAEhCCAAQQA2AnwgACAGIAOUIAcgApQgASAIlJKSOAJ4CyAAEMwBIARBMGokAAvxAwICfwN9IwBBMGsiBCQAIABFBEAgBEHZzwA2AhBBAkHe1QAgBEEQahCOAQsgACgCFEHEjgFHBEAgBEHZzwA2AgBBAkHM2AAgBBCOAQsCQCAALQAYQQJxBEAgACgCIEUNASAEQQA2AiwgBCADOAIoIAQgAjgCJCAEIAE4AiAgBEEgahDQAiAAIAAoAiAiBSoCyAEgBCoCKCIDlCAFKgKoASAEKgIgIgKUIAUqArgBIAQqAiQiAZSSkjgCcCAAIAMgBSoCzAGUIAIgBSoCrAGUIAEgBSoCvAGUkpI4AnQgBSoC0AEhBiAFKgKwASEHIAUqAsABIQggAEEANgJ8IAAgBiADlCAHIAKUIAEgCJSSkjgCeAwBCyAAKAIgRQ0AIARBADYCLCAEIAM4AiggBCACOAIkIAQgATgCICAEQSBqENACAkAgACgCLCIFBEAgACAFKgLIASAEKgIoIgOUIAUqAqgBIAQqAiAiApQgBSoCuAEgBCoCJCIBlJKSOAKAASAAIAMgBSoCzAGUIAIgBSoCrAGUIAEgBSoCvAGUkpI4AoQBIAMgBSoC0AGUIAIgBSoCsAGUIAEgBSoCwAGUkpIhAwwBCyAAIAE4AoABIAAgAjgChAELIABBADYCjAEgACADOAKIAQsgABDMASAEQTBqJAALrAQCBH8DfSMAQTBrIgMkACAARQRAIANB1xQ2AiBBAkHe1QAgA0EgahCOAQsgAUUEQCADQdcUNgIQQQJB+dUAIANBEGoQjgELIAAoAhRBxI4BRwRAIANB1xQ2AgBBAkHM2AAgAxCOAQsCQCAALQAYQQJxBEAgACgCLCICBEAgASACKgKwASAAQegAaiIEKgIAlCACKgKoASAAKgJglCACKgKsASAAQeQAaiIFKgIAlJKSIgY4AgAgASACKgLAASAEKgIAlCACKgK4ASAAKgJglCACKgK8ASAFKgIAlJKSIgc4AgQgASACKgLQASAEKgIAlCACKgLIASAAKgJglCACKgLMASAFKgIAlJKSIgg4AgggASAGIAIqApgBkjgCACABIAcgAioCnAGSOAIEIAEgCCACKgKgAZI4AggMAgsgASAAKgJgOAIAIAEgACoCZDgCBCABIAAqAmg4AggMAQsgACgCICICRQ0AIAEgAioCsAEgAEHYAGoiBCoCAJQgAioCqAEgACoCUJQgAioCrAEgAEHUAGoiBSoCAJSSkiIGOAIAIAEgAioCwAEgBCoCAJQgAioCuAEgACoCUJQgAioCvAEgBSoCAJSSkiIHOAIEIAEgAioC0AEgBCoCAJQgAioCyAEgACoCUJQgAioCzAEgBSoCAJSSkiIIOAIIIAEgBiACKgKYAZI4AgAgASAHIAIqApwBkjgCBCABIAggAioCoAGSOAIICyADQTBqJAALrwQCBH8DfSMAQTBrIgMkACAARQRAIANBs9AANgIgQQJB3tUAIANBIGoQjgELIAFFBEAgA0Gz0AA2AhBBAkH51QAgA0EQahCOAQsgACgCFEHEjgFHBEAgA0Gz0AA2AgBBAkHM2AAgAxCOAQsCQCAALQAYQQJxBEAgACgCICICRQ0BIAEgAioCsAEgAEHYAGoiBCoCAJQgAioCqAEgACoCUJQgAioCrAEgAEHUAGoiBSoCAJSSkiIGOAIAIAEgAioCwAEgBCoCAJQgAioCuAEgACoCUJQgAioCvAEgBSoCAJSSkiIHOAIEIAEgAioC0AEgBCoCAJQgAioCyAEgACoCUJQgAioCzAEgBSoCAJSSkiIIOAIIIAEgBiACKgKYAZI4AgAgASAHIAIqApwBkjgCBCABIAggAioCoAGSOAIIDAELIAAoAiwiAgRAIAEgAioCsAEgAEHoAGoiBCoCAJQgAioCqAEgACoCYJQgAioCrAEgAEHkAGoiBSoCAJSSkiIGOAIAIAEgAioCwAEgBCoCAJQgAioCuAEgACoCYJQgAioCvAEgBSoCAJSSkiIHOAIEIAEgAioC0AEgBCoCAJQgAioCyAEgACoCYJQgAioCzAEgBSoCAJSSkiIIOAIIIAEgBiACKgKYAZI4AgAgASAHIAIqApwBkjgCBCABIAggAioCoAGSOAIIDAELIAEgACoCYDgCACABIAAqAmQ4AgQgASAAKgJoOAIICyADQTBqJAALzAMBBH8jAEEwayIDJAAgAEUEQCADQcDRADYCIEECQd7VACADQSBqEI4BCyABRQRAIANBwNEANgIQQQJB+dUAIANBEGoQjgELIAAoAhRBxI4BRwRAIANBwNEANgIAQQJBzNgAIAMQjgELAkAgAQJ9IAAtABhBAnEEQCAAKAIsIgIEQCABIAIqArABIABBiAFqIgQqAgCUIAIqAqgBIAAqAoABlCACKgKsASAAQYQBaiIFKgIAlJKSOAIAIAEgAioCwAEgBCoCAJQgAioCuAEgACoCgAGUIAIqArwBIAUqAgCUkpI4AgQgAioC0AEgBCoCAJQgAioCyAEgACoCgAGUIAIqAswBIAUqAgCUkpIMAgsgASAAKgKAATgCACABIAAqAoQBOAIEIAAqAogBDAELIAAoAiAiAkUNASABIAIqArABIABB+ABqIgQqAgCUIAIqAqgBIAAqAnCUIAIqAqwBIABB9ABqIgUqAgCUkpI4AgAgASACKgLAASAEKgIAlCACKgK4ASAAKgJwlCACKgK8ASAFKgIAlJKSOAIEIAIqAtABIAQqAgCUIAIqAsgBIAAqAnCUIAIqAswBIAUqAgCUkpILOAIICyADQTBqJAALzAMBBH8jAEEwayIDJAAgAEUEQCADQfHPADYCIEECQd7VACADQSBqEI4BCyABRQRAIANB8c8ANgIQQQJB+dUAIANBEGoQjgELIAAoAhRBxI4BRwRAIANB8c8ANgIAQQJBzNgAIAMQjgELAkAgAQJ9IAAtABhBAnEEQCAAKAIgIgJFDQIgASACKgKwASAAQfgAaiIEKgIAlCACKgKoASAAKgJwlCACKgKsASAAQfQAaiIFKgIAlJKSOAIAIAEgAioCwAEgBCoCAJQgAioCuAEgACoCcJQgAioCvAEgBSoCAJSSkjgCBCACKgLQASAEKgIAlCACKgLIASAAKgJwlCACKgLMASAFKgIAlJKSDAELIAAoAiwiAgRAIAEgAioCsAEgAEGIAWoiBCoCAJQgAioCqAEgACoCgAGUIAIqAqwBIABBhAFqIgUqAgCUkpI4AgAgASACKgLAASAEKgIAlCACKgK4ASAAKgKAAZQgAioCvAEgBSoCAJSSkjgCBCACKgLQASAEKgIAlCACKgLIASAAKgKAAZQgAioCzAEgBSoCAJSSkgwBCyABIAAqAoABOAIAIAEgACoChAE4AgQgACoCiAELOAIICyADQTBqJAALqwMBAn8jAEEgayIEJAAgAEUEQCAEQbkfNgIQQQJB3tUAIARBEGoQjgELIAAoAhRBxI4BRwRAIARBuR82AgBBAkHM2AAgBBCOAQsCQAJAIAFBgP4DcUGAAkYEQCAAQdwBaiEDAkACQAJAAkACQAJAAkACQCABQf8BcQ4JAAEJAgMEBQYHCgsgAEHkAWohAwwICyAAQegBaiEDDAcLIAJDAAAAAGBFDQcgAEHgAWohAwwGCyACQwAAAABgRQ0GIAJDAACAP19FDQYgAEHsAWohAwwFCyAAQfwBaiEDDAQLIABB8AFqIQMMAwsgAEH0AWohAwwCCyAAQfgBaiEDDAELIABBsAFqIQMCQAJAAkACQAJAAkACQAJAIAEOCQABCAIDBAUGBwkLIABBuAFqIQMMBwsgAEG8AWohAwwGCyACQwAAAABgRQ0GIABBtAFqIQMMBQsgAkMAAAAAYEUNBSACQwAAgD9fRQ0FIABBwAFqIQMMBAsgAEHQAWohAwwDCyAAQcQBaiEDDAILIABByAFqIQMMAQsgAEHMAWohAwsgAyACOAIACyAEQSBqJAAL0QICAX8BfSMAQSBrIgIkACAARQRAIAJB0R82AhBBAkHe1QAgAkEQahCOAQsgACgCFEHEjgFHBEAgAkHRHzYCAEECQczYACACEI4BCwJAAn8gAUGA/gNxQYACRgRAAkACQAJAAkACQAJAAkACQAJAIAFB/wFxDgkAAQIDBAUGBwgLCyAAQeQBagwJCyAAQegBagwICyAAQdwBagwHCyAAQeABagwGCyAAQewBagwFCyAAQfwBagwECyAAQfABagwDCyAAQfQBagwCCyAAQfgBagwBCwJAAkACQAJAAkACQAJAAkACQCABDgkAAQIDBAUGBwgKCyAAQbgBagwICyAAQbwBagwHCyAAQbABagwGCyAAQbQBagwFCyAAQcABagwECyAAQdABagwDCyAAQcQBagwCCyAAQcgBagwBCyAAQcwBagsqAgAhAwsgAkEgaiQAIAMLcgIBfwF9IwBBIGsiASQAIABFBEAgAUHN0gA2AhBBAkHe1QAgAUEQahCOAQsgACgCFEHEjgFHBEAgAUHN0gA2AgBBAkHM2AAgARCOAQsCfSAALQAYQQJxBEAgABDWAQwBCyAAENcBCyECIAFBIGokACACC/QDAwJ/CH0BfCMAQeAAayICJAAgACgCICIBBH0gASoC0AEgACoCeCIDlCABKgLIASAAKgJwIgSUIAAqAnQiBSABKgLMAZSSkiEGIAEqAsABIAOUIAEqArgBIASUIAUgASoCvAGUkpIhCiABKgKwASADlCABKgKoASAElCABKgKsASAFlJKSIQMgAkEwagJ9IAAoAiwiAQRAIAEqAtABIAAqAogBIgeUIAEqAsgBIAAqAoABIgiUIAAqAoQBIgkgASoCzAGUkpIhBCABKgLAASAHlCABKgK4ASAIlCAJIAEqArwBlJKSIQUgASoCsAEgB5QgASoCqAEgCJQgASoCrAEgCZSSkgwBCyAAKgKIASEEIAAqAoQBIQUgACoCgAELIAUgBCADIAogBhDpAiACQSBqIAJBMGoQ7gIgAiAAKAIsIgEEfyACQRBqIAFB2AFqIAJBIGoQ6wIgAkEQagUgAkEgagsgAEGgAWoQ7AIgAioCDCIDIAOUIAIqAgQiBCAElCACKgIIIgUgBZSSkpEgAioCACIGIAaMIAMgACoCiAGUIAQgACoCgAGUIAUgACoChAGUkpJDAAAAAGAbEOYDIgMgA5IiA7siC0QYLURU+yEZwKC2IAMgC0QYLURU+yEJQGQbBUMAAAAACyEDIAJB4ABqJAAgAwvhAwMCfwV9AXwjAEHgAGsiAiQAIAAoAiAiAQR9IAEqAtABIAAqAngiA5QgASoCyAEgACoCcCIElCAAKgJ0IgUgASoCzAGUkpIhBiABKgLAASADlCABKgK4ASAElCAFIAEqArwBlJKSIQcgAkEwaiABKgKwASADlCABKgKoASAElCABKgKsASAFlJKSIAcgBgJ9IAAoAiwiAQRAIAEqAtABIAAqAogBIgOUIAEqAsgBIAAqAoABIgaUIAAqAoQBIgcgASoCzAGUkpIhBCABKgLAASADlCABKgK4ASAGlCAHIAEqArwBlJKSIQUgASoCsAEgA5QgASoCqAEgBpQgASoCrAEgB5SSkgwBCyAAKgKIASEEIAAqAoQBIQUgACoCgAELIAUgBBDpAiACQSBqIAJBMGoQ7gIgAkEQaiAAKAIgQdgBaiACQSBqEOsCIAIgAkEQaiAAQZABahDsAiACKgIMIgMgA5QgAioCBCIEIASUIAIqAggiBSAFlJKSkSACKgIAIgYgBowgAyAAKgJ4lCAEIAAqAnCUIAUgACoCdJSSkkMAAAAAYBsQ5gMiAyADkiIDuyIIRBgtRFT7IRnAoLYgAyAIRBgtRFT7IQlAZBuMBUMAAAAACyEDIAJB4ABqJAAgAwtyAgF/AX0jAEEgayIBJAAgAEUEQCABQc3QADYCEEECQd7VACABQRBqEI4BCyAAKAIUQcSOAUcEQCABQc3QADYCAEECQczYACABEI4BCwJ9IAAtABhBAnEEQCAAENcBDAELIAAQ1gELIQIgAUEgaiQAIAILvgMCA38FfSMAQSBrIgMkACAARQRAIANBvyY2AhBBAkHe1QAgA0EQahCOAQsgACgCFEHEjgFHBEAgA0G/JjYCAEECQczYACADEI4BCwJ9QwAAAAAgACgCICIBRQ0AGgJ9IAAtABhBAnEEQCAAKAIsIgIEQCACKgLQASAAKgKIASIElCACKgLIASAAKgKAASIFlCAAKgKEASIGIAIqAswBlJKSIQcgAioCwAEgBJQgAioCuAEgBZQgBiACKgK8AZSSkiEIIAIqArABIASUIAIqAqgBIAWUIAIqAqwBIAaUkpIMAgsgACoCiAEhByAAKgKEASEIIAAqAoABDAELIAEqAtABIAAqAngiBJQgASoCyAEgACoCcCIFlCAAKgJ0IgYgASoCzAGUkpIhByABKgLAASAElCABKgK4ASAFlCAGIAEqArwBlJKSIQggASoCsAEgBJQgASoCqAEgBZQgASoCrAEgBpSSkgshBSAHIAEqAoAClCAFIAEqAvgBlCAIIAEqAvwBlJKSIgQgACgCLCIARQ0AGiAEIAcgACoCgAKUIAUgACoC+AGUIAggACoC/AGUkpKTCyEEIANBIGokACAEC74DAgN/BX0jAEEgayIDJAAgAEUEQCADQYgmNgIQQQJB3tUAIANBEGoQjgELIAAoAhRBxI4BRwRAIANBiCY2AgBBAkHM2AAgAxCOAQsCfUMAAAAAIAAoAiAiAUUNABoCfSAALQAYQQJxBEAgASoC0AEgACoCeCIElCABKgLIASAAKgJwIgWUIAAqAnQiBiABKgLMAZSSkiEHIAEqAsABIASUIAEqArgBIAWUIAYgASoCvAGUkpIhCCABKgKwASAElCABKgKoASAFlCABKgKsASAGlJKSDAELIAAoAiwiAgRAIAIqAtABIAAqAogBIgSUIAIqAsgBIAAqAoABIgWUIAAqAoQBIgYgAioCzAGUkpIhByACKgLAASAElCACKgK4ASAFlCAGIAIqArwBlJKSIQggAioCsAEgBJQgAioCqAEgBZQgAioCrAEgBpSSkgwBCyAAKgKIASEHIAAqAoQBIQggACoCgAELIQUgByABKgKAApQgBSABKgL4AZQgCCABKgL8AZSSkiIEIAAoAiwiAEUNABogBCAHIAAqAoAClCAFIAAqAvgBlCAIIAAqAvwBlJKSkwshBCADQSBqJAAgBAuIAgICfQF/IABB0ABqQQQQhgIgAEHgAGpBBBCGAiAAQfAAakEEEIYCIABBgICA/AM2AnAgAEGAAWpBBBCGAiAAQYCAgPwDNgKEASAAQZABakEEEIYCIABBoAFqQQQQhgIgAEGAgID8AzYCwAEgAEKAgID8j4CAwP8ANwK4ASAAQgA3ArABIAAgACgCACIDKgIkIgE4AsQBIAAgAyoCICICOALIASAAIAI4AvQBIAAgATgC8AEgACABOAL4ASAAQoCAgPyPgIDA/wA3AuQBIABBADYChAIgAEIANwL8ASAAQYCAgPwDNgLsASAAQQA2AuABIABCADcC2AEgACABOALMASAAQgA3AtABC5UDAgR9A38gAUKEgICAwAA3AgAgACoC6AEiA7tEGC1EVPshCUBlIAAqAuQBIgK7RBgtRFT7IQnAZnIgAiADX3EhByAAKgK0AUMAAAAAXiEGIAAqAuABIQUCQAJAAkAgACoCvAEiA7tEGC1EVPshCUBlIAAqArgBIgK7RBgtRFT7IQnAZnIgAiADX3EiCCAHckUNACAAENcBIQIgABDWASEDAkAgCEUNACACIAAqArgBIgRfBEAgACACIASTOALYAUEBIQYgAEEBNgLUAQwBCyACIAAqArwBIgRgBEAgAEECNgLUASAAIAIgBJM4AtgBQQEhBgwBCyAAQQA2AtQBCyAHRQ0AAkACQCADIAAqAuQBIgJfBEAgAEEBNgKAAgwBCyAAKgLoASICIANfRQ0BIABBAjYCgAILIAAgAyACkzgChAIgASgCACAGaiEADAILIABBADYCgAILIAYEQCABIAEoAgBBAWoiADYCACAFQwAAAABeDQEMAgsgBUMAAAAAXkUNASABKAIAIQALIAEgAEEBajYCAAsLiwUCBX8IfSMAQTBrIgMkACAAQSBqIgIoAgAgAEEsaiIEKAIAIAEgAEHQAGogAEHgAGoQowEgAyACKAIAIgIqArABIAAqAngiCpQgAioCqAEgACoCcCIHlCACKgKsASAAKgJ0IgiUkpIiCzgCICADIAogAioCwAGUIAcgAioCuAGUIAggAioCvAGUkpIiDTgCJCADIAogAioC0AGUIAcgAioCyAGUIAggAioCzAGUkpIiCjgCKAJ9IAQoAgAiAgRAIAIqAtABIAAqAogBIgmUIAIqAsgBIAAqAoABIgyUIAAqAoQBIg4gAioCzAGUkpIhByACKgLAASAJlCACKgK4ASAMlCAOIAIqArwBlJKSIQggAioCsAEgCZQgAioCqAEgDJQgAioCrAEgDpSSkgwBCyAAKgKIASEHIAAqAoQBIQggACoCgAELIQkgAyAIOAIUIAMgCTgCECADIAc4AhggAyALIAggCiAHlCALIAmUIA0gCJSSkiIMIA2UkyIIlCAJIAwgC5STIgkgDZSTOAIIIAMgCiAJlCAHIAwgCpSTIgcgC5STOAIEIAMgDSAHlCAIIAqUkzgCACADENACIAEoAgwiAiABKAIYQQNsIgRBAnQiBWogAyoCADgCACACIARBAWpBAnQiBmogAyoCBDgCACACIARBAmpBAnQiBGogAyoCCDgCACAMjCELIAAoAiwEQCABKAIUIgIgBWogAyoCAIw4AgAgAiAGaiADKgIEjDgCACACIARqIAMqAgiMOAIACyABKAIcIAEqAgAgASoCBJQgC5Q4AgwgAEHcAWogACABIABBsAFqIAAgAUEEIANBIGpBARCcAUEEciADQRBqQQEQnAEaIANBMGokAAt8AQF/IwBBIGsiAiQAIABBACABQQRJG0UEQCACQe8SNgIQQQJB2d8AIAJBEGoQjgELIAAoAhRB2I4BRwRAIAJB7xI2AgBBAkGw1gAgAhCOAQsgAEEDQQMgAUEAIAFBAEobIgEgAUEDTxsgACgCVEEBRhs2AlAgAkEgaiQAC80EAQN/IwBBMGsiCCQAAkACQCAARQ0AIAFBAksNACACQQNJDQELIAhB0xE2AiBBAkHZ3wAgCEEgahCOAQsgACgCFEHYjgFHBEAgCEHTETYCEEECQbDWACAIQRBqEI4BCwJAIAAoAiwiBg0AAkAgAkEBRgRAQZDfACEHIAAoAhhBAnENAQtBACEGIAJBAkcNAUHj3gAhByAAKAIYQQJxDQELIAhB0xE2AgBBAiAHIAgQjgEgACgCLCEGCyAAQQIgAUEAIAFBAEobIgEgAUECTxsiAUECdGogAkEBIAYbIAIgAkECRhsiAjYCWAJAIAJBAEoEQCAAIAFBBHRqQeQAaiEHIAJBAUYEQCAHIAAoAiAiAioCyAEgBZQgAioCqAEgA5QgAioCuAEgBJSSkjgCACAHIAIqAswBIAWUIAIqAqwBIAOUIAIqArwBIASUkpI4AgQgByACKgLQASAFlCACKgKwASADlCACKgLAASAElJKSOAIIDAILIAYEQCAHIAYqAsgBIAWUIAYqAqgBIAOUIAYqArgBIASUkpI4AgAgByAGKgLMASAFlCAGKgKsASADlCAGKgK8ASAElJKSOAIEIAcgBioC0AEgBZQgBioCsAEgA5QgBioCwAEgBJSSkjgCCAwCCyAHIAM4AgAgACABQQR0aiICQQA2AnAgAiAFOAJsIAIgBDgCaAwBCyAAIAFBBHRqIgIgBTgCbCACIAQ4AmggAiADOAJkCyAAIAFBBHRqQeQAahDQAiAAKAJUQQFGBEAgABDgAQsgCEEwaiQAC+4GAhJ/Cn0CQCAAKAIgIgFFDQAgACgCLCICRQ0AIAAgAUHIAWoiAyoCACACQdABaiIEKgIAIAAqAowBIhOUIAJByAFqIgUqAgAgACoChAEiFJQgACoCiAEiFSACQcwBaiIGKgIAlJKSIhaUIAFBqAFqIgcqAgAgAkGwAWoiCCoCACATlCACQagBaiIJKgIAIBSUIAJBrAFqIgoqAgAgFZSSkiIXlCACQcABaiILKgIAIBOUIAJBuAFqIgwqAgAgFJQgFSACQbwBaiICKgIAlJKSIhMgAUG4AWoiDSoCAJSSkjgCpAIgACABQcwBaiIOKgIAIBaUIAFBrAFqIg8qAgAgF5QgEyABQbwBaiIQKgIAlJKSOAKoAiAAIAFB0AFqIhEqAgAgFpQgAUGwAWoiEioCACAXlCATIAFBwAFqIgEqAgCUkpI4AqwCIAAgBSoCACARKgIAIAAqAmwiE5QgAyoCACAAKgJkIhSUIAAqAmgiFSAOKgIAlJKSIhaUIAkqAgAgEioCACATlCAHKgIAIBSUIA8qAgAgFZSSkiIXlCABKgIAIBOUIA0qAgAgFJQgFSAQKgIAlJKSIhMgDCoCAJSSkjgCtAIgACAGKgIAIBaUIAoqAgAgF5QgEyACKgIAlJKSOAK4AiAAIAQqAgAgFpQgCCoCACAXlCATIAsqAgCUkpI4ArwCDwsgACABQcgBaiICKgIAIAAqAowBIhOUIAFBqAFqIgMqAgAgACoChAEiFJQgACoCiAEiFSABQbgBaiIEKgIAlJKSOAKkAiAAIBMgAUHMAWoiBSoCAJQgFCABQawBaiIGKgIAlCAVIAFBvAFqIgcqAgCUkpI4AqgCIAAgEyABQdABaiIIKgIAlCAUIAFBsAFqIgkqAgCUIBUgAUHAAWoiASoCAJSSkjgCrAIgACoCkAEhFiACKgIAIRcgBSoCACEYIAgqAgAhGSAEKgIAIRogByoCACEbIAEqAgAhHCAAIAkqAgAgACoCbCITlCADKgIAIAAqAmQiFJQgBioCACAAKgJoIhWUkpIgACoCtAKSOAK0AiAAQbgCaiIBIBwgE5QgGiAUlCAVIBuUkpIgASoCAJI4AgAgAEG8AmoiASAZIBOUIBcgFJQgFSAYlJKSIAEqAgCSOAIAIABBwAJqIgAgFiAAKgIAkjgCAAuBAQEBfyMAQSBrIgMkACAAQQAgAUEDSRtFBEAgA0HiKTYCEEECQdnfACADQRBqEI4BCyAAKAIUQdiOAUcEQCADQeIpNgIAQQJBsNYAIAMQjgELIAAoAlRFBEAgAEEDIAFBACABQQBKGyIBIAFBA08bQQJ0aiACOAKYAgsgA0EgaiQAC6sCAQR/IwBBIGsiBSQAIABFBEAgBUHlHjYCEEECQdnfACAFQRBqEI4BCyAAKAIUQdiOAUcEQCAFQeUeNgIAQQJBsNYAIAUQjgELIABBAiABQQh1IgNBACADQQBKGyIDIANBAk8bIgZBLGxqIgRBlAFqIQMCQAJAAkACQAJAAkACQAJAAkACQCABQf8BcQ4JAAEIAgMEBQYHCQsgBEGcAWohAwwHCyAEQaABaiEDDAYLIAJDAAAAAGBFDQYgACAGQSxsakGYAWohAwwFCyACQwAAAABgRQ0FIAJDAACAP19FDQUgACAGQSxsakGkAWohAwwECyAEQbQBaiEDDAMLIARBqAFqIQMMAgsgBEGsAWohAwwBCyAEQbABaiEDCyADIAI4AgALIAVBIGokAAtrAQF/IwBBIGsiAiQAIABFBEAgAkGeKzYCEEECQdnfACACQRBqEI4BCyAAKAIUQdiOAUcEQCACQZ4rNgIAQQJBsNYAIAIQjgELIAAgATYCVCABQQFGBEAgAEEDNgJQIAAQ4AELIAJBIGokAAtZAQF/IwBBIGsiASQAIABFBEAgAUGGEzYCEEECQdnfACABQRBqEI4BCyAAKAIUQdiOAUcEQCABQYYTNgIAQQJBsNYAIAEQjgELIAAoAlAhACABQSBqJAAgAAuwBAIEfwF9IwBBIGsiBCQAIABBACABQQNJG0UEQCAEQecRNgIQQQJB2d8AIARBEGoQjgELIAAoAhRB2I4BRwRAIARB5xE2AgBBAkGw1gAgBBCOAQtBAiEGAn0gAEECIAFBACABQQBKGyIBIAFBAk8bIgNBAnRqKAJYIgFBAEoEQCABQQFGBEAgAiAAKAIgIgEqArABIAAgA0EEdGoiAEHsAGoiAyoCAJQgASoCqAEgAEHkAGoiBSoCAJQgASoCrAEgAEHoAGoiACoCAJSSkjgCACACIAEqAsABIAMqAgCUIAEqArgBIAUqAgCUIAEqArwBIAAqAgCUkpI4AgQgASoC0AEgAyoCAJQgASoCyAEgBSoCAJQgASoCzAEgACoCAJSSkgwCCyAAKAIsIgEEQCACIAEqArABIAAgA0EEdGoiAEHsAGoiAyoCAJQgASoCqAEgAEHkAGoiBSoCAJQgASoCrAEgAEHoAGoiACoCAJSSkjgCACACIAEqAsABIAMqAgCUIAEqArgBIAUqAgCUIAEqArwBIAAqAgCUkpI4AgQgASoC0AEgAyoCAJQgASoCyAEgBSoCAJQgASoCzAEgACoCAJSSkgwCCyACIAAgA0EEdGoiACoCZDgCACACIAAqAmg4AgQgAiAAKgJsOAIIQQMhBiAAKgJwDAELIAIgACADQQR0aiIAKgJkOAIAIAIgACoCaDgCBCAAKgJsCyEHIAIgBkECdGogBzgCACAEQSBqJAALeQEBfyMAQSBrIgIkACAAQQAgAUEDSRtFBEAgAkGLIjYCEEECQdnfACACQRBqEI4BCyAAKAIUQdiOAUcEQCACQYsiNgIAQQJBsNYAIAIQjgELIABBAiABQQAgAUEAShsiASABQQJPG0ECdGooAlghACACQSBqJAAgAAt8AgF/AX0jAEEgayICJAAgAEEAIAFBA0kbRQRAIAJB9yk2AhBBAkHZ3wAgAkEQahCOAQsgACgCFEHYjgFHBEAgAkH3KTYCAEECQbDWACACEI4BCyAAQQMgAUEAIAFBAEobIgEgAUEDTxtBAnRqKgKYAiEDIAJBIGokACADCxEAQQBB9CxBABCOAUMAAAAAC6MCAgJ/AX0jAEEgayIDJAAgAEUEQCADQfoeNgIQQQJB2d8AIANBEGoQjgELIAAoAhRB2I4BRwRAIANB+h42AgBBAkGw1gAgAxCOAQtBAiABQQh1IgJBACACQQBKGyICIAJBAk8bIQICQAJ/AkACQAJAAkACQAJAAkACQAJAIAFB/wFxDgkAAQIDBAUGBwgKCyAAIAJBLGxqQZwBagwICyAAIAJBLGxqQaABagwHCyAAIAJBLGxqQZQBagwGCyAAIAJBLGxqQZgBagwFCyAAIAJBLGxqQaQBagwECyAAIAJBLGxqQbQBagwDCyAAIAJBLGxqQagBagwCCyAAIAJBLGxqQawBagwBCyAAIAJBLGxqQbABagsqAgAhBAsgA0EgaiQAIAQLWQEBfyMAQSBrIgEkACAARQRAIAFBsis2AhBBAkHZ3wAgAUEQahCOAQsgACgCFEHYjgFHBEAgAUGyKzYCAEECQbDWACABEI4BCyAAKAJUIQAgAUEgaiQAIAAL6QYCB38GfSAAKAJUQQFHBEAgACgCUCIIQQBKBEADQAJAAkACQAJAIAAgA0ECdGooAlhBAWsOAgABAgsgASADQQR0IgVqIgQgACgCICICKgKwASAAIAVqIgVB7ABqIgYqAgCUIAIqAqgBIAVB5ABqIgcqAgCUIAIqAqwBIAVB6ABqIgUqAgCUkpI4AgAgBCACKgLAASAGKgIAlCACKgK4ASAHKgIAlCACKgK8ASAFKgIAlJKSOAIEIAQgAioC0AEgBioCAJQgAioCyAEgByoCAJQgAioCzAEgBSoCAJSSkjgCCAwCCyAAKAIsIgJFDQEgASADQQR0IgVqIgQgAioCsAEgACAFaiIFQewAaiIGKgIAlCACKgKoASAFQeQAaiIHKgIAlCACKgKsASAFQegAaiIFKgIAlJKSOAIAIAQgAioCwAEgBioCAJQgAioCuAEgByoCAJQgAioCvAEgBSoCAJSSkjgCBCAEIAIqAtABIAYqAgCUIAIqAsgBIAcqAgCUIAIqAswBIAUqAgCUkpI4AggMAQsgASADQQR0IgRqIgIgACAEaiIEKgJkOAIAIAIgBCoCaDgCBCACIAQqAmw4AggLIANBAWoiAyAIRw0ACwsPCyABIAAoAiAiAyoCsAEgAEHsAGoiAioCAJQgAyoCqAEgACoCZJQgAyoCrAEgAEHoAGoiBCoCAJSSkiILOAIAIAEgAyoCwAEgAioCAJQgAyoCuAEgACoCZJQgAyoCvAEgBCoCAJSSkiIMOAIEIAEgAyoC0AEgAioCAJQgAyoCyAEgACoCZJQgAyoCzAEgBCoCAJSSkiINOAIIIAECfSAAKAIsIgMEQCABIAMqArABIABBjAFqIgIqAgCUIAMqAqgBIABBhAFqIgQqAgCUIAMqAqwBIABBiAFqIgAqAgCUkpIiCTgCICABIAMqAsABIAIqAgCUIAMqArgBIAQqAgCUIAMqArwBIAAqAgCUkpIiCjgCJCADKgLQASACKgIAlCADKgLIASAEKgIAlCADKgLMASAAKgIAlJKSDAELIAEgACoChAEiCTgCICABIAAqAogBIgo4AiQgACoCjAELIg44AiggASAJIAyUIAsgCpSTOAIYIAEgDiALlCANIAmUkzgCFCABIAogDZQgDCAOlJM4AhAgAUEQahDQAgv/AgIBfwF9IABBADYCWCAAQgA3AlAgAEHkAGpBBBCGAiAAQYCAgPwDNgKkASAAQoCAgPyPgIDA/wA3ApwBIABCADcClAEgACAAKAIAIgEqAiQiAjgCqAEgACABKgIgOAKsASAAQQA2AlwgACACOAKwASAAQQA2ApgCIABCADcCtAEgAEEANgK8ASAAQfQAakEEEIYCIABBgICA/AM2AtABIABCgICA/I+AgMD/ADcCyAEgAEIANwLAASAAIAAoAgAiASoCJCICOALUASAAIAEqAiA4AtgBIABBADYCYCAAIAI4AtwBIABBADYCnAIgAEIANwLgASAAQQA2AugBIABBhAFqQQQQhgIgAEGAgID8AzYC/AEgAEKAgID8j4CAwP8ANwL0ASAAQgA3AuwBIAAgACgCACIBKgIkIgI4AoACIAAgASoCIDgChAIgACACOAKIAiAAQQA2AqACIABCADcCjAIgAEEANgKUAiAAQaQCakEEEIYCIABBtAJqQQQQhgILggYCBX8RfSMAQTBrIgMkACABQgA3AgAgACgCVEEBRgRAIAAgAxDrASAAKgKsAiEKIAAqAqgCIQ0gACgCICICKgLQASETIAIqAswBIRQgAioCyAEhFSACKgLAASEJIAIqArwBIQ8gAioCuAEhCyACKgKwASEMIAIqAqwBIRYgAioCqAEhFyAAKgKkAiEHAn0gACgCLCICBEAgAioC0AEgACoCvAIiCJQgAioCyAEgACoCtAIiDpQgACoCuAIiECACKgLMAZSSkiERIAIqAsABIAiUIAIqArgBIA6UIBAgAioCvAGUkpIhEiACKgKwASAIlCACKgKoASAOlCACKgKsASAQlJKSDAELIAAqArwCIREgACoCuAIhEiAAKgK0AgshECAAIAMqAigiCCADKgIAIg4gCSAKlCALIAeUIA0gD5SSkiILlCAMIAqUIBcgB5QgFiANlJKSIgwgAyoCBCIPlJOUIAMqAiAiCSAPIBMgCpQgFSAHlCANIBSUkpIiB5QgCyADKgIIIg2Uk5QgAyoCJCIKIA0gDJQgByAOlJOUkpIgCCAHlCAJIAyUIAsgCpSSkhDmA4w4ApgCIAAgCCANlCAJIA6UIA8gCpSSkiAIIA4gAyoCFCIHlCAPIAMqAhAiC5STlCAJIA8gAyoCGCIMlCAHIA2Uk5QgCiANIAuUIAwgDpSTlJKSEOYDjDgCnAIgACARIAyUIBAgC5QgEiAHlJKSIBEgCyAKlCAJIAeUk5QgECAHIAiUIAogDJSTlCASIAwgCZQgCCALlJOUkpIQ5gOMOAKgAgtBACECIAAoAlAiBkEASgRAA0ACQAJAAkACQCAAIAJBLGxqIgQqApwBIgggACACQQJ0aioCmAIiCWAEQCAEQQE2ArgBDAELIARBuAFqIQUgBCoCoAEiCCAJX0UNASAFQQI2AgALIAQgCSAIkzgCvAEMAQsgBUEANgIAIAQqApgBQwAAAABeRQ0BCyABIAEoAgBBAWo2AgALIAJBAWoiAiAGRw0ACwsgA0EwaiQAC7ECAgN/Bn0jAEHgAGsiAiQAIAAgAkEwahDrASACIAJB0ABqNgIsIAIgAkFAazYCKCACIAJBMGo2AiQgACgCVEEBRgRAIAIgAioCNCIGIAIqAkgiB5QgAioCRCIIIAIqAjgiBZSTOAIQIAIgCCACKgIwIgqUIAYgAioCQCIJlJM4AhggAiAFIAmUIAcgCpSTOAIUIAIgCCACKgJYIgaUIAcgAioCVCIFlJM4AgAgAiAJIAWUIAggAioCUCIFlJM4AgggAiAHIAWUIAYgCZSTOAIEIAIgAkEQajYCLCACIAI2AiQLIAAoAlBBAEoEQANAIAAgA0EsbGpBlAFqIAAgASAEIAJBJGogA0ECdGooAgBBARCcASAEaiEEIANBAWoiAyAAKAJQSA0ACwsgAkHgAGokAAvyAgIDfwN9IwBBIGsiAiQAIABFBEAgAkHILDYCEEECQd7VACACQRBqEI4BCyAAKAIUQeyOAUcEQCACQcgsNgIAQQJBnN0AIAIQjgELAkAgACgCICIBRQ0AIAAoAiwiAwRAIABB0ABqIAFB2AFqIANB2AFqEOsCIAAgACgCICIBKgLIASABKgKgASAAKAIsIgMqAqABkyIElCABKgKoASABKgKYASADKgKYAZMiBZQgASoCuAEgASoCnAEgAyoCnAGTIgaUkpI4AmAgACABKgLMASAElCABKgKsASAFlCAGIAEqArwBlJKSOAJkIAAgASoC0AEgBJQgASoCsAEgBZQgBiABKgLAAZSSkjgCaAwBCyAAIAEqAtgBOAJQIAAgASoC3AGMOAJUIAAgASoC4AGMOAJYIAAgASoC5AGMOAJcIAAgASoCmAE4AmAgACABKgKcATgCZCAAIAEqAqABOAJoIAAgASoCpAE4AmwLIAJBIGokAAsYACAAQeAAakEEEIYCIABB0ABqQQQQhgILDgAgAUKGgICA4AA3AgALhQQCB38KfSABKAIYIQMgACABIABB0ABqQQMQuQEgASgCCCICQYCAgPwDNgIAIAIgA0EBakECdCIGakGAgID8AzYCACACIANBAXQiB0ECakECdCIIakGAgID8AzYCACAAKAIgIQIgACgCLCIFBEAgAioCsAEhDiACKgKoASEPIAIqAqwBIRAgAioC0AEhCyACKgLIASERIAIqAswBIRIgASgCDCIEIAIqAsABIAAqAmgiCZQgAioCuAEgACoCYCIKlCAAKgJkIgwgAioCvAGUkpIiDTgCCCAEIAsgCZQgESAKlCAMIBKUkpIiC4w4AgQgBCADQQJ0aiIAIA4gCZQgDyAKlCAQIAyUkpIiCYw4AgggACALOAIAIAQgB0ECdCIAaiANjDgCACAEIABBBHJqIAk4AgAgASgCECIAQYCAgPx7NgIAIAAgBmpBgICA/Hs2AgAgACAIakGAgID8ezYCACABKAIcIgAgASoCACABKgIElCIKIAUqApgBIAIqApgBkyAJkpQ4AgAgACAKIAUqApwBIAIqApwBkyANkpQ4AgQgACAKIAUqAqABIAIqAqABkyALkpQ4AggPCyABKAIcIgMgASoCACABKgIElCIJIAAqAmAgAioCmAGTlDgCACADIAkgACoCZCACKgKcAZOUOAIEIAMgCSAAKgJoIAIqAqABk5Q4AggLCQAgAUIANwIACwwAQQBBli1BABCOAQu+CgIKfwF9IwBBEGsiEyQAAkACQCAKIAtKDQAgCSAMSg0AIAkgC0wNACAJIApMDQAgCUEATA0AIAogC3JBAE4NAQsgE0GFGTYCBCATQdkeNgIAQQFBlMIAIBMQjgELAkAgCiALRg0AIAkhEiMAQRBrIhQkAAJAAkAgCiALTg0AIAkgDEoNACAJIAtMDQAgCSAKTA0AIABFDQAgCUEATA0AIAogC3JBAE4NAQsgFEGRETYCAEECQdnfACAUEI4BCwJAAkAgCyAKQQFqIglKBEAgCyAKa0ECayEVIAAgCkECdCIRaigCACEPIAkhDCAKQX9zIAtqIhZBA3EiFwRAA0AgDyAMQQJ0IhBqIAAgEGooAgAgEWoqAgA4AgAgDEEBaiEMIA5BAWoiDiAXRw0ACwsgFUECSwRAA0AgDyAMQQJ0Ig5qIApBAnQiECAAIA5qKAIAaioCADgCACAPIA5BBGoiEWogACARaigCACAQaioCADgCACAPIA5BCGoiEWogACARaigCACAQaioCADgCACAPIA5BDGoiDmogACAOaigCACAQaioCADgCACAMQQRqIgwgC0cNAAsLIAkgC0gNAQsgACALQQJ0aigCACEMDAELIAAgC0ECdGooAgAhDCAWQQNxIhAEQEEAIQ8DQCAAIAlBAnQiDmooAgAgCkECdGogDCAOaioCADgCACAJQQFqIQkgD0EBaiIPIBBHDQALCyAVQQNJDQADQCAKQQJ0Ig4gACAJQQJ0Ig9qKAIAaiAMIA9qKgIAOAIAIAAgD0EEaiIQaigCACAOaiAMIBBqKgIAOAIAIAAgD0EIaiIQaigCACAOaiAMIBBqKgIAOAIAIAAgD0EMaiIPaigCACAOaiAMIA9qKgIAOAIAIAlBBGoiCSALRw0ACwsgACAKQQJ0Ig5qIhEoAgAiDyALQQJ0IhBqIA4gD2oiCSoCADgCACAJIAwgDmoiDioCADgCACAOIAwgEGoqAgA4AgAgACAQaiEOAkAgDQRAIBEgDDYCACAOIA82AgAMAQsgFCASQQJ0IhBBHmpBcHFrIgkkACAJIA8gEBDsAyEJIA8gDCAQEOwDGiAOKAIAIAkgEBDsAxoLAkAgC0EBaiIMIBJODQAgEkECayEPIAtBf3MgEmpBAXEEQCAAIAxBAnRqKAIAIgwgCkECdGoiDioCACEYIA4gDCALQQJ0aiIMKgIAOAIAIAwgGDgCACALQQJqIQwLIAsgD0YNAANAIAAgDEECdGoiDygCACIOIApBAnQiEGoiCSoCACEYIAkgDiALQQJ0IhFqIg4qAgA4AgAgDiAYOAIAIA8oAgQiDyAQaiIOKgIAIRggDiAPIBFqIg8qAgA4AgAgDyAYOAIAIAxBAmoiDCASRw0ACwsgFEEQaiQAIAEgCkECdCIKaiIJKgIAIRggCSABIAtBAnQiC2oiDCoCADgCACAMIBg4AgAgAiAKaiIJKgIAIRggCSACIAtqIgwqAgA4AgAgDCAYOAIAIAMgCmoiCSoCACEYIAkgAyALaiIMKgIAOAIAIAwgGDgCACAEIApqIgkqAgAhGCAJIAQgC2oiDCoCADgCACAMIBg4AgAgBSAKaiIJKgIAIRggCSAFIAtqIgwqAgA4AgAgDCAYOAIAIAYgCmoiCSgCACEMIAkgBiALaiIGKAIANgIAIAYgDDYCACAHIApqIgkoAgAhDCAJIAcgC2oiBygCADYCACAHIAw2AgAgCEUNACAIIApqIgooAgAhCSAKIAggC2oiCygCADYCACALIAk2AgALIBNBEGokAAvZDwETfyMAQSBrIg4kAAJAAkACQCAAKAJMIgVBAEwNACAAKAJIIQcCQANAAkAgASAHIANBAnRqKAIARgRAIAAoAgwhDCAAKAIoIQogACgCLCEPIAAoAgAhBiAAKAIEIQkjAEEwayIIIQ0gCCQAAkACQAJAIAYgCUoNACAFIAZKDQAgAyAFTg0AIANBAEgNACAFQQBMDQAgCkUNACAMRQ0AIAdFDQAgD0UNACAGQQBKDQELIA1B0yQ2AiBBAkHZ3wAgDUEgahCOASAFQQBMDQELA0AgByACQQJ0aigCACIEQQBOIAQgBkhxRQRAIA1Bpxg2AhQgDUHTJDYCEEEBQd/DACANQRBqEI4BCyACQQFqIgIgBUcNAAsLAkAgBUEBayISIANGDQACQCADRQRAIAggBUECdEEeakFwcWsiCyQAIAsgBUEATAR9QwAAwH8FIAVBAXEhEyAHKAIAIQICQCASRQRAQQAhBgwBCyAFQX5xIRBBACEGA0AgCyAGQQJ0IghqIAwgByAIaigCACIEIAIgAiAESBtBAnRqKAIAIAQgAiACIARKG0ECdGoqAgCMOAIAIAsgCEEEciIEaiAMIAQgB2ooAgAiBCACIAIgBEgbQQJ0aigCACAEIAIgAiAEShtBAnRqKgIAjDgCACAGQQJqIQYgEUECaiIRIBBHDQALCyATBEAgCyAGQQJ0IgRqIAwgBCAHaigCACIEIAIgAiAESBtBAnRqKAIAIAQgAiACIARKG0ECdGoqAgCMOAIACyALKgIAQwAAgD+SCzgCACAKIA8gCyAFIAkQjQIMAQsgCCADQQJ0QR5qQXBxayIIIgIkACACIAUgA2siEUECdEEeakFwcWsiCyQAAkAgA0EATA0AIAMgCWwhBEEAIQIgA0EBRwRAIANBfnEhFEEAIQYDQCAIIAJBAnQiEGogCiACIARqQQJ0aioCACAPIBBqKgIAlTgCACAIIAJBAXIiEEECdCITaiAKIAQgEGpBAnRqKgIAIA8gE2oqAgCVOAIAIAJBAmohAiAGQQJqIgYgFEcNAAsLIANBAXFFDQAgCCACQQJ0IgZqIAogAiAEakECdGoqAgAgBiAPaioCAJU4AgALIAsgEUEATAR9QwAAwH8FIAcgA0ECdGohEEEAIQIDQCALIAJBAnRqIAogAiADaiIEIAlsQQJ0aiAIIAMQByAMIAcgBEECdGooAgAiBCAQKAIAIgYgBCAGShtBAnRqKAIAIAQgBiAEIAZIG0ECdGoqAgCTOAIAIAJBAWoiAiARRw0ACyALKgIAQwAAgD+SCzgCACADQQJ0IgIgCiADIAlsQQJ0amogAiAPaiALIBEgCRCNAgsCQAJAIApFDQAgBUEATA0AIAMgBU4NACADQQBIDQAgBSAJTA0BCyANQbsgNgIAQQJB2d8AIA0QjgELIAMgEk4NAEEAIQICQCADQQBMBEAgA0F/cyAFakECdCEEDAELIANBA3EhDCAKIANBAnRqIQcgA0F/cyAFakECdCEEIANBAWtBA08EQCADQXxxIQtBACEGA0AgByACIAlsQQJ0aiIIIAhBBGogBBDtAyAHIAJBAXIgCWxBAnRqIgggCEEEaiAEEO0DIAcgAkECciAJbEECdGoiCCAIQQRqIAQQ7QMgByACQQNyIAlsQQJ0aiIIIAhBBGogBBDtAyACQQRqIQIgBkEEaiIGIAtHDQALCyAMBEBBACEGA0AgByACIAlsQQJ0aiIIIAhBBGogBBDtAyACQQFqIQIgBkEBaiIGIAxHDQALCyAFQQJrIQYgA0ECdCEHIAMiAkF/cyAFakEBcQRAIAogAiAJbEECdGoiAiACIAlBAnRqIAcQ7AMaIANBAWohAgsgAyAGRg0AA0AgCiACIAlsQQJ0aiIGIAYgCUECdCIIaiAHEOwDGiAKIAJBAWogCWxBAnRqIgYgBiAIaiAHEOwDGiACQQJqIgIgEkcNAAsLIAVBAmshByADIgJBf3MgBWpBAXEEQCAKIAIgCWxBAnRqIAJBAnRqIgIgAiAJQQJ0akEEaiAEEOwDGiADQQFqIQILIAMgB0cEQANAIANBAnQiByAKIAIgCWxBAnRqaiIFIAUgCUECdCIGakEEaiAEEOwDGiAKIAJBAWogCWxBAnRqIAdqIgcgBiAHakEEaiAEEOwDGiACQQJqIgIgEkcNAAsLIA8gA0ECdGoiAiACQQRqIAQQ7QMLIA1BMGokACAAKAJMIgVBAEwEQEEAIQcMAgsgBUEBayEEIAAoAkghAkEAIQcDQCAEIAIgB0ECdGoiBigCAEYEQCAGIAIgA0ECdGoiAigCADYCACADIAAoAkwiBUEBa04NAyACIAJBBGogBSADQX9zakECdBDtAyAAKAJMIQUMAwsgB0EBaiIHIAVHDQALDAMLIANBAWoiAyAFRw0BDAQLCyAFIAdKDQELIA5BhRk2AhQgDkGyzgA2AhBBAUH2PyAOQRBqEI4BIAAoAkwhBQsgAyAFSA0BCyAOQYUZNgIEIA5Bss4ANgIAQQFBncAAIA4QjgEgACgCTCEFCyAAKAIMIAAoAhQgACgCGCAAKAIcIAAoAiAgACgCJCAAKAJEIAAoAjwgACgCQCAAKAIAIAEgBUEBayAAKAIEQQEQ9QEgACAAKAJMQQFrNgJMIAAgACgCUEEBajYCUCAOQSBqJAALqwQCAX8OfSMAQZABayIBJAACfwJAIAAqAgBDAAAAAF8EQCABQSc2AiggAUHNGDYCJCABQfMiNgIgQQJBpzAgAUEgahCPAQwBCyAAQRRqEIsCRQRAIAFBKzYCCCABQc0YNgIEIAFB8yI2AgBBAkHtLyABEI8BDAELIAFBMGpBDBCGAiABIAAqAgwiBIwiBzgCNCAAKgIIIQIgASAEOAJAIAEgAjgCOCABIAAqAgQiAzgCVCABIAOMOAJIIAEqAjAhBiABIAKMIgg4AlAgASAAKgIAIgUgAiAIlCIJIAYgBpQgBCAHlCIKkpKUIAAqAhSSOAJgIAEgBSACIAOUIgsgBiAHlCAEIAEqAkQiB5QiDJOSlCAAKgIYkjgCZCABIAUgAiABKgJYIgiUIg0gBiAClCIOIAQgA5QiD5KSlCAAKgIckjgCaCABIAUgCyAEIAaUIAySkpQgACoCJJI4AnAgASAFIAogByAHlJIgAyADlCIGk5QgACoCKJI4AnQgASAFIAQgApQiAiAHIAOUIgSTIAggA5QiA5OUIAAqAiySOAJ4IAEgBSAPIA6TIA2TlCAAKgI0kjgCgAEgASAFIAMgAiAEkpKUIAAqAjiSOAKEASABIAUgCCAIlCAJIAaTkpQgACoCPJI4AogBQQEgAUHgAGoQiwINARogAUHEADYCGCABQc0YNgIUIAFB8yI2AhBBAkHMLiABQRBqEI8BC0EACyEAIAFBkAFqJAAgAAtIAQF/IwBBEGsiASQAIABFBEAgAUGgHDYCAEECQdnfACABEI4BCyAAQQA2AgAgAEEEakEEEIYCIABBFGpBDBCGAiABQRBqJAALwAEBAX8jAEEgayILJAAgAARAIABBADYCACAAQQRqQQQQhgIgAEEUakEMEIYCIAAgBzgCPCAAIAY4AiggACAFOAIUIAAgBDgCDCAAIAM4AgggACACOAIEIAAgATgCACAAIAo4AiwgACAJOAIcIAAgCDgCGCAAIAo4AjggACAJOAI0IAAgCDgCJCAAEPcBGiALQSBqJAAPCyALQdsONgIQQQJB2d8AIAtBEGoQjgEgC0GgHDYCAEECQdnfACALEI4BAAurAQIBfwF8IwBBIGsiAyQAIABFBEAgA0HJIjYCEEECQdnfACADQRBqEI4BIANBoBw2AgBBAkHZ3wAgAxCOAQALIABBADYCACAAQQRqQQQQhgIgAEEUakEMEIYCIAAgArsiBESBHI5AUsEQQKIgBKIgBKIgAbuitiIBOAIAIAAgAUPNzMw+lCAClCAClCICOAI8IAAgAjgCKCAAIAI4AhQgABD3ARogA0EgaiQAC48BAQF/IwBBIGsiAyQAIAAEQCAAQQA2AgAgAEEEakEEEIYCIABBFGpBDBCGAiAAIAFDzczMPpQgApQgApQiAjgCPCAAIAI4AiggACACOAIUIAAgATgCACAAEPcBGiADQSBqJAAPCyADQckiNgIQQQJB2d8AIANBEGoQjgEgA0GgHDYCAEECQdnfACADEI4BAAvJAgMCfwJ8AX0jAEEwayIFJAAgAEUEQCAFQaApNgIgQQJB2d8AIAVBIGoQjgELIAJBAWtBA08EQCAFQaApNgIQQQJBxtcAIAVBEGoQjgELIABFBEAgBUGgHDYCAEECQdnfACAFEI4BCyAAQQA2AgAgAEEEakEEEIYCIABBFGoiBkEMEIYCIAAgA7siB0QYLURU+yEJQKIgB6IgBLuiIAG7IgiitiIBIAdEgRyOQFLBEECiIAeiIAeiIAiitiIJkjgCACAAIAEgA0MAAIA+lCADlCAEQ6uqqj2UIASUkpQgBEMAAIA+lCAElCADQ83MzD6UIAOUIANDAADAPpQgBJSSkiAJlJIiBDgCPCAAIAQ4AiggACAEOAIUIAJBFGwgBmpBFGsgAUMAAAA/lCAJQ83MzD6UkiADlCADlDgCACAAEPcBGiAFQTBqJAAL8wEBAX8jAEEQayIFJAAgAEMAAIA/IAIgAyAEEPwBIABFBEAgBUGHDDYCAEECQdnfACAFEI4BCyAAKgIAIQQgACABOAIAIAAgASAElSIBIAAqAhSUOAIUIABBGGoiAiABIAIqAgCUOAIAIABBHGoiAiABIAIqAgCUOAIAIABBJGoiAiABIAIqAgCUOAIAIABBKGoiAiABIAIqAgCUOAIAIABBLGoiAiABIAIqAgCUOAIAIABBNGoiAiABIAIqAgCUOAIAIABBOGoiAiABIAIqAgCUOAIAIABBPGoiAiABIAIqAgCUOAIAIAAQ9wEaIAVBEGokAAvlAQICfwF9IwBBEGsiAyQAIABFBEAgA0GHDDYCAEECQdnfACADEI4BCyAAKgIAIQQgACABOAIAIAAgASAElSIBIAAqAhSUOAIUIABBGGoiAiABIAIqAgCUOAIAIABBHGoiAiABIAIqAgCUOAIAIABBJGoiAiABIAIqAgCUOAIAIABBKGoiAiABIAIqAgCUOAIAIABBLGoiAiABIAIqAgCUOAIAIABBNGoiAiABIAIqAgCUOAIAIABBOGoiAiABIAIqAgCUOAIAIABBPGoiAiABIAIqAgCUOAIAIAAQ9wEaIANBEGokAAsqAQF8IAAgA7siBUQYLURU+yEJQKIgBaIgBLuiIAG7orYgAiADIAQQgAIL3gEBAn8jAEEwayIFJAAgAEUEQCAFQbMiNgIgQQJB2d8AIAVBIGoQjgELIAJBAWtBA08EQCAFQbMiNgIQQQJBxtcAIAVBEGoQjgELIABFBEAgBUGgHDYCAEECQdnfACAFEI4BCyAAQQA2AgAgAEEEakEEEIYCIABBFGoiBkEMEIYCIAAgATgCACAAIAMgA5QiA0MAAIA+lCAEQ6uqqj2UIASUkiABlCIEOAI8IAAgBDgCKCAAIAQ4AhQgAkEUbCAGakEUayABQwAAAD+UIAOUOAIAIAAQ9wEaIAVBMGokAAu3AQIBfwF9IwBBIGsiBSQAIABFBEAgBUGiIjYCEEECQdnfACAFQRBqEI4BIAVBoBw2AgBBAkHZ3wAgBRCOAQALIABBADYCACAAQQRqQQQQhgIgAEEUakEMEIYCIAAgAiADlCAElCABlCIBOAIAIAAgAiAClCICIAMgA5QiBpIgAUMAAEBBlSIDlDgCPCAAIAIgBCAElCIEkiADlDgCKCAAIAYgBJIgA5Q4AhQgABD3ARogBUEgaiQAC6wBAgF/AX0jAEEgayIFJAAgAARAIABBADYCACAAQQRqQQQQhgIgAEEUakEMEIYCIAAgAUMAAEBBlSIGIAIgApQiAiADIAOUIgOSlDgCPCAAIAYgAiAEIASUIgSSlDgCKCAAIAYgAyAEkpQ4AhQgACABOAIAIAAQ9wEaIAVBIGokAA8LIAVBoiI2AhBBAkHZ3wAgBUEQahCOASAFQaAcNgIAQQJB2d8AIAUQjgEAC6cFAgR/FX0jAEHwAGsiBCQAIABFBEAgBEG5JTYCAEECQdnfACAEEI4BCyAEQRBqQQwQhgIgBCAAQQxqIgYqAgAiCow4AhQgAEEIaiIHKgIAIQkgBCAKOAIgIAQgCTgCGCAEIAAqAgQiCDgCNCAEIAmMOAIwIAQgCIw4AiggBEFAa0EMEIYCIAQgCCABkiIIOAJkIAQgCIw4AlggBCAKIAOSIgo4AlAgBCAJIAKSIgk4AkggBCoCQCELIAQqAmghECAEKgIoIREgBCoCFCEMIAQqAhghDiAEKgIQIQ0gBCoCOCESIAQgCowiFzgCRCAEIAmMIhU4AmAgBCoCNCEYIAQqAiQhEyAEKgJUIRQgBCoCICEZIAQqAjAhFiAAQRxqIgUgACoCACIPIA4gEpQgDSAOlCAMIBGUkpIgCSAQlCALIAmUIAogCJSSkpOUIAUqAgCSIho4AgAgACAPIA4gFpQiFiANIA2UIAwgGZQiG5KSIAkgFZQiFSALIAuUIAogF5QiHJKSk5QgACoCFJI4AhQgAEEYaiIFIA8gDiAYlCANIAyUIAwgE5SSkiAJIAiUIAsgF5QgFCAKlJOSk5QgBSoCAJIiCzgCACAAQShqIgUgDyARIBiUIgwgGyATIBOUkpIgHCAUIBSUkiAIIAiUIg2Tk5QgBSoCAJI4AgAgAEEsaiIFIA8gESASlCAZIA6UIBMgEZSSkiAKIAmUIBQgCJSTIAggEJSTk5QgBSoCAJIiCDgCACAAIBo4AjQgACALOAIkIAAgCDgCOCAAQTxqIgUgDyASIBKUIBYgDJKSIBAgEJQgFSANk5KTlCAFKgIAkjgCACAAIAAqAgQgAZI4AgQgByAHKgIAIAKSOAIAIAYgBioCACADkjgCACAAEPcBGiAEQfAAaiQAC58GAhV9CX8jAEEQayIYJAAgAEUEQCAYQa0lNgIAQQJB2d8AIBgQjgELIAEqAighBSABKgIgIQYgASoCJCEHIAEqAhghAiABKgIQIQggASoCFCEJIAAgASoCCCIDIAMgAEE8aiIbKgIAIguUIABBNGoiFyoCACIMIAEqAgAiBJQgASoCBCIKIABBOGoiGSoCACINlJKSIg6UIAQgAEEcaiIcKgIAIg8gA5QgBCAAKgIUIhCUIABBGGoiHSoCACIRIAqUkpIiEpQgCiAAQSxqIh4qAgAiEyADlCAAQSRqIhoqAgAiAyAElCAKIABBKGoiHyoCACIElJKSIhSUkpI4AhQgHSABKgIIIAsgApQgDCAIlCAJIA2UkpIiCpQgASoCACAPIAKUIBAgCJQgESAJlJKSIhWUIBMgApQgAyAIlCAJIASUkpIiAiABKgIElJKSIhY4AgAgHCABKgIIIAsgBZQgDCAGlCAHIA2UkpIiCJQgASoCACAPIAWUIBAgBpQgESAHlJKSIgmUIBMgBZQgAyAGlCAHIASUkpIiBSABKgIElJKSIgY4AgAgGiABKgIYIA6UIAEqAhAgEpQgFCABKgIUlJKSOAIAIB8gASoCGCAKlCABKgIQIBWUIAIgASoCFJSSkjgCACAeIAEqAhggCJQgASoCECAJlCAFIAEqAhSUkpIiBzgCACAXIAEqAiggDpQgASoCICASlCAUIAEqAiSUkpI4AgAgGSABKgIoIAqUIAEqAiAgFZQgAiABKgIklJKSOAIAIAEqAighAiABKgIgIQMgASoCJCEEIBkgBzgCACAXIAY4AgAgGiAWOAIAIBsgAiAIlCADIAmUIAUgBJSSkjgCACABKgIIIQIgASoCACEIIAEqAgQhCSABKgIYIQMgASoCECEEIAEqAhQhCiAAQQxqIhcgASoCKCAXKgIAIgWUIAEqAiAgACoCBCIGlCAAQQhqIhcqAgAiByABKgIklJKSOAIAIBcgAyAFlCAEIAaUIAcgCpSSkjgCACAAIAIgBZQgCCAGlCAJIAeUkpI4AgQgABD3ARogGEEQaiQAC6sDAgJ/A30jAEEQayIDJAAgAEEAIAEbRQRAIANBuS42AgBBAkHZ3wAgAxCOAQsgAEMAAIA/IAAqAgAiBCABKgIAIgaSlSIFIAAqAgQgBJQgASoCBCAGlJKUOAIEIABBCGoiAiAFIAQgAioCAJQgASoCCCABKgIAlJKUOAIAIABBDGoiAiAFIAQgAioCAJQgASoCDCABKgIAlJKUOAIAIAAgBCABKgIAkjgCACAAIAEqAhQgACoCFJI4AhQgAEEYaiICIAEqAhggAioCAJI4AgAgAEEcaiICIAEqAhwgAioCAJI4AgAgAEEgaiICIAEqAiAgAioCAJI4AgAgAEEkaiICIAEqAiQgAioCAJI4AgAgAEEoaiICIAEqAiggAioCAJI4AgAgAEEsaiICIAEqAiwgAioCAJI4AgAgAEEwaiICIAEqAjAgAioCAJI4AgAgAEE0aiICIAEqAjQgAioCAJI4AgAgAEE4aiICIAEqAjggAioCAJI4AgAgAEE8aiICIAEqAjwgAioCAJI4AgAgAEFAayIAIAFBQGsqAgAgACoCAJI4AgAgA0EQaiQAC0oBAX8jAEEQayICJAAgAEEAIAFBAE4bRQRAIAJBrRw2AgBBAkHZ3wAgAhCOAQsgAUEASgRAIABBACABQQJ0EO4DGgsgAkEQaiQAC9kBAQR/IwBBEGsiBSQAIABBACABQQBOG0UEQCAFQY8lNgIAQQJB2d8AIAUQjgELAkAgAUEATA0AAkAgAUEHcSIGRQRAIAEhAwwBCyABIQMDQCAAIAI4AgAgA0EBayEDIABBBGohACAEQQFqIgQgBkcNAAsLIAFBCEkNAANAIAAgAjgCHCAAIAI4AhggACACOAIUIAAgAjgCECAAIAI4AgwgACACOAIIIAAgAjgCBCAAIAI4AgAgAEEgaiEAIANBCWshBCADQQhrIQMgBEF+SQ0ACwsgBUEQaiQAC8oBAgd/AX1BAyEHIwBBEGsiAyQAAkACQCAARQ0AIAFFDQAgAkUNAAwBCyADQZvTADYCAEECQdnfACADEI4BCwNAQQAhBANAIAIgBEECdGohBUMAAAAAIQogASEGQQMhCEEAIQkDQCAIQQFrIQggBioCACAFKgIAlCAKkiEKIAVBBGohBSAGQQRqIQYgCUEBaiIJQQNHDQALIAAgCjgCACAAQQRqIQAgBEEBaiIEQQFHDQALIAFBEGohASAHQQFrIgcNAAsgA0EQaiQAC+MBAgZ/AX0jAEEQayIGJAACQAJAIABFDQAgAUUNACACRQ0ADAELIAZBkdEANgIAQQJB2d8AIAYQjgELA0BBACEDA0BBACEEQwAAAAAhCUEAIQcDQCABIARBAXIiCEECdCAFakECdGoqAgAgAiADIAhqQQJ0aioCAJQgASAEQQJ0IAVqQQJ0aioCACACIAMgBGpBAnRqKgIAlCAJkpIhCSAEQQJqIQQgB0ECaiIHQQRHDQALIAAgAyAFakECdGogCTgCACADQQFqIgNBAUcNAAsgBUEBaiIFQQRHDQALIAZBEGokAAuoBAIBfQx/IwBBEGsiAyEKIAMkACAARQRAIApBwgk2AgBBAkHZ3wAgChCOAQsgA0EgayIMJAAgACEIA0ACQCAAIARBBHRqIQVBACEGAkAgBARAIAAhCwNAIAUqAgAhAQJAIAZFDQBBACEJIAshAiAIIQMgBiEHIAZBA3EiDQRAA0AgB0EBayEHIAEgAyoCACACKgIAlJMhASACQQRqIQIgA0EEaiEDIAlBAWoiCSANRw0ACwsgBkEESQ0AA0AgASADKgIAIAIqAgCUkyADKgIEIAIqAgSUkyADKgIIIAIqAgiUkyADKgIMIAIqAgyUkyEBIAJBEGohAiADQRBqIQMgB0EEayIHDQALCyAFIAEgDCAGQQJ0aioCAJQ4AgAgBUEEaiEFIAtBEGohCyAGQQFqIgYgBEcNAAsgBSoCACEBIARFDQFBACEHIAghAiAEIgNBA3EiCQRAA0AgA0EBayEDIAEgAioCACIBIAGUkyEBIAJBBGohAiAHQQFqIgcgCUcNAAsLIARBBEkNAQNAIAEgAioCACIBIAGUkyACKgIEIgEgAZSTIAIqAggiASABlJMgAioCDCIBIAGUkyEBIAJBEGohAiADQQRrIgMNAAsMAQsgBSoCACEBCyABQwAAAABfBEBBACECDAELIAUgAZEiATgCACAMIARBAnRqQwAAgD8gAZU4AgAgCEEQaiEIQQEhAiAEQQFqIgRBA0cNAQsLIApBEGokACACC0oBAn8jAEEQayIBIQIgASQAIABFBEAgAkGZJTYCAEECQdnfACACEI4BCyABQUBqIgEkACABIABBMBDsAxCKAiEAIAJBEGokACAAC+wCAQh/IwBBIGsiCCQAAkACQCADQQBMDQAgAkUNACABRQ0AIABFDQAgAyAETA0BCyAIQczNADYCEEECQdnfACAIQRBqEI4BCyAAIAIgAyAEEAkCQAJAIAJFDQAgAUUNACADQQBODQELIAhB3yo2AgBBAkHZ3wAgCBCOAQsCQCADQQBMDQAgA0EETwRAIANBfHEhDANAIAIgB0ECdCIGaiIFIAEgBmoqAgAgBSoCAJQ4AgAgAiAGQQRyIgVqIgogASAFaioCACAKKgIAlDgCACACIAZBCHIiBWoiCiABIAVqKgIAIAoqAgCUOAIAIAIgBkEMciIGaiIFIAEgBmoqAgAgBSoCAJQ4AgAgB0EEaiEHIAlBBGoiCSAMRw0ACwsgA0EDcSIFRQ0AA0AgAiAHQQJ0IgZqIgkgASAGaioCACAJKgIAlDgCACAHQQFqIQcgC0EBaiILIAVHDQALCyAAIAIgAyAEEAogCEEgaiQAC7AHAgp/CH0jAEEQayIFIQwgBSQAAkACQCADIARKDQAgAEUNACABRQ0AIAJFDQAgA0EASg0BCyAMQefOADYCAEECQdnfACAMEI4BCwJAIANBAkgNACAFIANBAnRBHmpBcHEiCGsiCSIFJABBASEGIANBAWsiB0EBcSENIAUgCGsiCiQAIANBAmsiDgRAIAdBfnEhC0EAIQgDQCAKIAZBAnQiBWogAiAFaioCALtEzTt/Zp6g5j+itiIPOAIAIAUgCWogDzgCACAKIAVBBGoiBWogAiAFaioCALtEzTt/Zp6g5j+itiIPOAIAIAUgCWogDzgCACAGQQJqIQYgCEECaiIIIAtHDQALCyANBEAgCiAGQQJ0IgVqIAIgBWoqAgC7RM07f2aeoOY/orYiDzgCACAFIAlqIA84AgALIANBAkgNAEMAAIA/IAEqAgAiDyAPIAIqAgBDAAAAP5QiEEMAAIA/krtEzTt/Zp6g5j+itiIRIBGUlEMAAIA/kiIWlSIVIBGUIBBDAACAv5K7RM07f2aeoOY/orYiE5QiEJMhDyAQIBGUIBOTIRBBASEFIAdBAXEhDSARjCERIA4EQCAHQX5xIQdBACEGA0AgCSAFQQJ0IgJqIgggESAAIAQgBWxBAnRqKgIAIhKUIAgqAgAiFJI4AgAgAiAKaiAPIBSUIBAgEpSSOAIAIAkgBUEBaiICQQJ0IghqIgsgESAAIAIgBGxBAnRqKgIAIhKUIAsqAgAiFJI4AgAgCCAKaiAPIBSUIBAgEpSSOAIAIAVBAmohBSAGQQJqIgYgB0cNAAsLIA0EQCAJIAVBAnQiBmoiAiARIAAgBCAFbEECdGoqAgAiEpQgAioCACIRkjgCACAGIApqIA8gEZQgECASlJI4AgALQQEhByADQQFMDQBDAACAPyATIBOUIBWUkyEVA0AgASAHIgtBAnQiBWoiBiAVIhEgFiIQIAYqAgAiEiAQIBIgBSAJaioCACIPIA+UlJIiFpUiFJQiEiARIBIgBSAKaioCACIQIBCUlJMiFZUiE5Q4AgAgAyAHQQFqIgdKBEAgDyAUlCERIBMgEIwiEpQhFCAPjCETIAchBQNAIAkgBUECdCIGaiICIBMgACAEIAVsIAtqQQJ0aiIIKgIAIg+UIAIqAgCSIhA4AgAgBiAKaiIGIBIgDyARIBCUkiIPlCAGKgIAkiIQOAIAIAggFCAQlCAPkjgCACAFQQFqIgUgA0cNAAsLIAMgB0cNAAsLIAxBEGokAAsdAQF/QeyyASgCACIBBEAgACABEQIADwsgABCJBAskAQF/IAAEQEH0sgEoAgAiAgRAIAAgASACEQAADwsgABCKBAsLkAUCBH8BfSMAQUBqIgMkAAJAIAAEQEHQAhCOAiIBQSBqEPgBIAFCADcCBCABIAA2AgAgAUIANwIMDAELIANByCU2AjBBAkHZ3wAgA0EwahCOAUHQAhCOAiIBQSBqEPgBIAFBADYCECABQgA3AgggAUIANwIACyABQQA2AhwgAUIANwIUIAFBIGpDAACAP0MAAAAAQwAAAABDAAAAAEMAAIA/QwAAgD9DAACAP0MAAAAAQwAAAABDAAAAABD5ASABQeQAakEMEIYCIAFBgICA/AM2ApQBIAFBgICA/AM2AowBIAFBgICA/AM2AnggAUGAgID8AzYCZCABQZgBakEEEIYCIAFB2AFqQQQQhgIgAUGAgID8AzYC2AEgAUGoAWoQ5AIgAUHoAWpBBBCGAiABQfgBakEEEIYCIAFBiAJqQQQQhgIgAUGYAmpBBBCGAiABQagCakEEEIYCIAAoAgAhAiABIAA2AgggASACNgIEIAAoAgAiAgRAIAIgAUEEajYCCAsgACABNgIAIAAgACgCCEEBajYCCCABKAIAIgBFBEAgA0GXDjYCIEECQdnfACADQSBqEI4BCyABIAApAig3ArgCIAFBwAJqIgQgACkCMDcCACABKAIYIQICQAJAIAAoAjhFBEAgASACQWtxNgIYAkAgASgCACICBEAgASACKAI0IgA2AsQCDAELIANB7g42AhBBAkHZ3wAgA0EQahCOASABQTQoAgAiADYCxAIgASgCACICRQ0DCyABIAIqAjAiBTgCwAIMAQsgASACQRByNgIYIAQqAgAhBSABKALEAiEACyABIAU4AsgCIAEgADYCzAIgA0FAayQAIAEPCyADQdQoNgIAQQJB2d8AIAMQjgEAC5MDAQd/IwBBEGsiBSQAIABFBEAgBUHPCDYCAEECQdnfACAFEI4BCyAAKAIcIgIEQANAIAIoAhQhASACQQAQMiABIQIgAQ0ACwsgACgCFCIGBEADQCAGIgEoAgAiAkEcaiIDIAEgA0ZBDGxqQQA2AgQgASgCCCEGIAFBADYCCAJAIAIoAiAiB0UNACAHKAIUIgFFDQACQCACIAEoAgBHBEAgASEDA0AgAygCCCIBRQ0DIAMhBCABIQMgASgCACACRw0ACwwBC0EAIQQLIARBCGogB0EUaiAEGyABKAIINgIACwJAIAIoAiwiBEUNACAEKAIUIgFFDQACQCACIAEoAgBGBEBBACEDDAELA0AgASIDKAIIIgFFDQIgASgCACACRw0ACwsgA0EIaiAEQRRqIAMbIAEoAgg2AgALIAJCADcCLCACQgA3AiAgBg0ACwsgACgCBCICBEAgAiAAKAIINgIICyAAKAIIIAI2AgAgAEIANwIEIAAoAgAiAiACKAIIQQFrNgIIIABB0AIQjwIgBUEQaiQAC18BAX8jAEEQayIEJAAgAEUEQCAEQbYcNgIAQQJB2d8AIAQQjgELIAAgATgCmAEgACADOAKgASAAIAI4ApwBIAAoAhwiAARAA0AgABA9IAAoAhQiAA0ACwsgBEEQaiQAC5kBAQF/IwBBIGsiAiQAIABBACABG0UEQCACQZIdNgIAQQJB2d8AIAIQjgELIAJBEGogARDuAiACQRBqENECIAAgAioCEDgC2AEgACACKgIUOALcASAAIAIqAhg4AuABIAAgAioCHDgC5AEgAEGoAWogAEHYAWoQ5wIgACgCHCIABEADQCAAED0gACgCFCIADQALCyACQSBqJAALjgEBAX8jAEEQayICJAAgAEEAIAEbRQRAIAJB1h02AgBBAkHZ3wAgAhCOAQsgACABKgIAOALYASAAIAEqAgQ4AtwBIAAgASoCCDgC4AEgACABKgIMOALkASAAQdgBaiIBENECIABBqAFqIAEQ5wIgACgCHCIABEADQCAAED0gACgCFCIADQALCyACQRBqJAALRQEBfyMAQRBrIgQkACAARQRAIARBpSE2AgBBAkHZ3wAgBBCOAQsgACABOALoASAAIAM4AvABIAAgAjgC7AEgBEEQaiQAC0UBAX8jAEEQayIEJAAgAEUEQCAEQf8gNgIAQQJB2d8AIAQQjgELIAAgATgC+AEgACADOAKAAiAAIAI4AvwBIARBEGokAAszAQF/IwBBEGsiASQAIABFBEAgAUHYHDYCAEECQdnfACABEI4BCyABQRBqJAAgAEGYAWoLMwEBfyMAQRBrIgEkACAARQRAIAFBtB02AgBBAkHZ3wAgARCOAQsgAUEQaiQAIABBqAFqCzMBAX8jAEEQayIBJAAgAEUEQCABQekdNgIAQQJB2d8AIAEQjgELIAFBEGokACAAQdgBagszAQF/IwBBEGsiASQAIABFBEAgAUG3ITYCAEECQdnfACABEI4BCyABQRBqJAAgAEHoAWoLMwEBfyMAQRBrIgEkACAARQRAIAFBkiE2AgBBAkHZ3wAgARCOAQsgAUEQaiQAIABB+AFqC9oHAg5/AX0jAEEwayIFJAAgAEEAIAEbRQRAIAVBwQ42AiBBAkHZ3wAgBUEgahCOAQsgARD3AUUEQCAFQcEbNgIUIAVBwQ42AhBBAUHryAAgBUEQahCOAQsgAEEgaiABQcQAEOwDGiAAQTRqIQgjAEEgayIDIQsgAyQAAkACQCAAQeQAaiIBRQ0AIAhFDQAMAQsgC0GeCzYCEEECQdnfACALQRBqEI4BCyADQUBqIgMkACADIAhBMBDsAyEGIANBIGsiDyQAAkAgBhCKAkUEQEEAIQMMAQsgAUUEQCALQa0cNgIAQQJB2d8AIAsQjgELIAFBAEEwEO4DGkEAIQgDQCAPQQBBDBDuAyIJIAhBAnRqQYCAgPwDNgIAQQAhByMAQRBrIgIhDiACJAACQAJAIAZFDQAgCUUNAAwBCyAOQdIJNgIAQQJB2d8AIA4QjgELIAJBIGsiDCQAA0ACQCAHRQRAQwAAAAAhEAwBCyAHQQJ0IQQCQCAHQQFGBEBBACECQwAAAAAhEAwBCyAHQf7///8HcSEKQQAhAkMAAAAAIRBBACENA0AgBiACQQFyIgMgBGpBAnRqKgIAIAwgA0ECdGoqAgCUIAYgAiAEakECdGoqAgAgDCACQQJ0aioCAJQgEJKSIRAgAkECaiECIA1BAmoiDSAKRw0ACwsgB0EBcUUNACAGIAIgBGpBAnRqKgIAIAwgAkECdGoqAgCUIBCSIRALIAwgB0ECdCICaiACIAlqKgIAIBCTIAYgB0EUbGoqAgCVOAIAIAdBAWoiB0EDRw0AC0EAIQpBAyEEA0AgBCIDQQFrIQRDAAAAACEQAkAgA0EDTg0AIAMhAiAKQQFxBEAgBiACQQJ0IARqQQJ0aioCACAJIAJBAnRqKgIAlEMAAAAAkiEQIAJBAWohAgsgCkEBRg0AA0AgBiACQQFqIg1BAnQgBGpBAnRqKgIAIAkgDUECdGoqAgCUIAYgAkECdCAEakECdGoqAgAgCSACQQJ0aioCAJQgEJKSIRAgAkECaiICQQNHDQALCyAJIARBAnQiAmogAiAMaioCACAQkyAGIARBFGxqKgIAlTgCACAKQQFqIQogA0EBSg0ACyAOQRBqJABBACEDQQAhAgNAIAEgA0ECdCAIakECdGogCSADQQJ0aioCADgCACADQQFqIQMgAkEBaiICQQNHDQALQQEhAyAIQQFqIghBA0cNAAsLIAtBIGokACADRQRAIAVBsQM2AgggBUHBGzYCBCAFQcEONgIAQQJB0DAgBRCPASABEOQCCyAAQwAAgD8gACoCIJU4ApQBIAVBMGokAAtAAQF/IwBBEGsiAiQAIABBACABG0UEQCACQc4ONgIAQQJB2d8AIAIQjgELIAEgAEEgakHEABDsAxogAkEQaiQAC2IBAn8jAEEQayIEJAAgAEUEQCAEQYQsNgIAQQJB2d8AIAQQjgELIAAgACoCiAIgAZI4AogCIABBjAJqIgUgBSoCACACkjgCACAAQZACaiIAIAAqAgAgA5I4AgAgBEEQaiQAC2IBAn8jAEEQayIEJAAgAEUEQCAEQYAlNgIAQQJB2d8AIAQQjgELIAAgACoCmAIgAZI4ApgCIABBnAJqIgUgBSoCACACkjgCACAAQaACaiIAIAAqAgAgA5I4AgAgBEEQaiQAC7MBAQJ/IwBBEGsiBCQAIABFBEAgBEHzKzYCAEECQdnfACAEEI4BCyAAIAAqArABIAOUIAAqAqgBIAGUIAAqAqwBIAKUkpIgACoCiAKSOAKIAiAAQYwCaiIFIAAqAsABIAOUIAAqArgBIAGUIAAqArwBIAKUkpIgBSoCAJI4AgAgAEGQAmoiBSAAKgLQASADlCAAKgLIASABlCAAKgLMASAClJKSIAUqAgCSOAIAIARBEGokAAuzAQECfyMAQRBrIgQkACAARQRAIARB7iQ2AgBBAkHZ3wAgBBCOAQsgACAAKgKwASADlCAAKgKoASABlCAAKgKsASAClJKSIAAqApgCkjgCmAIgAEGcAmoiBSAAKgLAASADlCAAKgK4ASABlCAAKgK8ASAClJKSIAUqAgCSOAIAIABBoAJqIgUgACoC0AEgA5QgACoCyAEgAZQgACoCzAEgApSSkiAFKgIAkjgCACAEQRBqJAALzQEBAn8jAEEQayIIJAAgAEUEQCAIQbIPNgIAQQJB2d8AIAgQjgELIAAgACoCiAIgAZI4AogCIABBjAJqIgcgByoCACACkjgCACAAQZACaiIHIAcqAgAgA5I4AgAgACAAKgKYAiAFIAAqApwBkyIFIAOUIAYgACoCoAGTIgYgApSTkjgCmAIgAEGcAmoiByAGIAGUIAQgACoCmAGTIgYgA5STIAcqAgCSOAIAIABBoAJqIgAgBiAClCAFIAGUkyAAKgIAkjgCACAIQRBqJAALiwICAn8CfSMAQRBrIggkACAARQRAIAhB3g82AgBBAkHZ3wAgCBCOAQsgACAAKgKIAiABkjgCiAIgAEGMAmoiByAHKgIAIAKSOAIAIABBkAJqIgcgByoCACADkjgCACAAIAAqAsABIAaUIAAqArgBIASUIAAqArwBIAWUkpIiCSADlCAAKgLQASAGlCAAKgLIASAElCAAKgLMASAFlJKSIgogApSTIAAqApgCkjgCmAIgAEGcAmoiByAKIAGUIAAqArABIAaUIAAqAqgBIASUIAAqAqwBIAWUkpIiBiADlJMgByoCAJI4AgAgAEGgAmoiACAGIAKUIAkgAZSTIAAqAgCSOAIAIAhBEGokAAuqAgICfwJ9IwBBEGsiCCQAIABFBEAgCEGcDzYCAEECQdnfACAIEI4BCyAAIAAqArABIAOUIAAqAqgBIAGUIAAqAqwBIAKUkpIiCSAAKgKIApI4AogCIABBjAJqIgcgACoCwAEgA5QgACoCuAEgAZQgACoCvAEgApSSkiIKIAcqAgCSOAIAIABBkAJqIgcgACoC0AEgA5QgACoCyAEgAZQgACoCzAEgApSSkiIDIAcqAgCSOAIAIAAqApgBIQIgACAAKgKYAiAFIAAqApwBkyIBIAOUIAogBiAAKgKgAZMiBpSTkjgCmAIgAEGcAmoiByAGIAmUIAMgBCACkyIClJMgByoCAJI4AgAgAEGgAmoiACACIAqUIAkgAZSTIAAqAgCSOAIAIAhBEGokAAvQAgICfwp9IwBBEGsiCCQAIABFBEAgCEHFDzYCAEECQdnfACAIEI4BCyAAIAAqArABIgsgA5QgACoCqAEiDCABlCAAKgKsASINIAKUkpIiCSAAKgKIApI4AogCIABBjAJqIgcgACoCwAEiDiADlCAAKgK4ASIPIAGUIAAqArwBIhAgApSSkiIKIAcqAgCSOAIAIABBkAJqIgcgACoC0AEiESADlCAAKgLIASISIAGUIAAqAswBIgEgApSSkiIDIAcqAgCSOAIAIAAgDiAGlCAPIASUIBAgBZSSkiICIAOUIAogESAGlCASIASUIAEgBZSSkiIBlJMgACoCmAKSOAKYAiAAQZwCaiIHIAEgCZQgAyALIAaUIAwgBJQgDSAFlJKSIgaUkyAHKgIAkjgCACAAQaACaiIAIAYgCpQgCSAClJMgACoCAJI4AgAgCEEQaiQACzMBAX8jAEEQayIBJAAgAEUEQCABQeUrNgIAQQJB2d8AIAEQjgELIAFBEGokACAAQYgCagszAQF/IwBBEGsiASQAIABFBEAgAUHfJDYCAEECQdnfACABEI4BCyABQRBqJAAgAEGYAmoLwgECAX8GfSMAQRBrIgUkACAARQRAIAVBiA82AgBBAkHZ3wAgBRCOAQsgACoC0AEhBiAAKgLIASEHIAAqAswBIQggACoCwAEhCSAAKgK4ASEKIAAqArwBIQsgBCAAKgKwASADlCAAKgKoASABlCAAKgKsASAClJKSIAAqApgBkjgCACAEIAkgA5QgCiABlCALIAKUkpIgACoCnAGSOAIEIAQgBiADlCAHIAGUIAggApSSkiAAKgKgAZI4AgggBUEQaiQAC6oCAgN/DH0jAEEQayIFJAAgAEUEQCAFQesgNgIAQQJB2d8AIAUQjgELIAAqArABIQogACoCqAEhCyAAKgKsASEMIAAqAtABIQggACoCyAEhCSAAKgLMASENIAAqAsABIQ4gACoCuAEhDyAAKgK8ASEQIAQgACoC6AEiETgCACAEIAAqAuwBIhI4AgQgBCAAKgLwASITOAIIIAQgESAAQfwBaiIGKgIAIAggA5QgCSABlCANIAKUkpIiCJQgDiADlCAPIAGUIBAgApSSkiIJIABBgAJqIgcqAgCUk5I4AgAgBCASIAcqAgAgCiADlCALIAGUIAwgApSSkiIDlCAIIAAqAvgBlJOSOAIEIAQgEyAAKgL4ASAJlCADIAYqAgCUk5I4AgggBUEQaiQAC0wBAn8jAEEQayIBJAAgAEUEQCABQYUONgIAQQJB2d8AIAEQjgELIAAoAhQiAARAA0AgAkEBaiECIAAoAggiAA0ACwsgAUEQaiQAIAILZQECfyMAQRBrIgMkACAARQRAIANBkww2AgBBAkHZ3wAgAxCOAQsCf0EAIAAoAhQiAEUNABoDQCABIAJGBEAgACgCAAwCCyACQQFqIQIgACgCCCIADQALQQALIQIgA0EQaiQAIAILUgEBfyMAQRBrIgEkACAARQRAIAFB0yo2AgBBAkHZ3wAgARCOAQsgACAAKAIYQXtxNgIYIAAgACgCxAI2AswCIAAgACoCwAI4AsgCIAFBEGokAAs6AQF/IwBBEGsiASQAIABFBEAgAUHGKjYCAEECQdnfACABEI4BCyAAIAAoAhhBBHI2AhggAUEQaiQACz8BAX8jAEEQayIBJAAgAEUEQCABQbMtNgIAQQJB2d8AIAEQjgELIAAoAhghACABQRBqJAAgAEF/c0ECdkEBcQtLAQF/IwBBEGsiAiQAAn8gAARAIAAgAUHgjQEQsAIMAQsgAkHaIDYCAEECQdnfACACEI4BQQAgAUHgjQEQsAILIQAgAkEQaiQAIAALlAQBBX8jAEEgayIFJAAgAEEAIAIbRQRAIAVBwRs2AhQgBUGhDDYCEEEBQd07IAVBEGoQjgELAkAgAQRAIAFBBGohBiACKAIAIgdB6v8ATwRAQQBB7CpBABCOAQsCQAJ/IAYoAgBFBEAgBkGAgAEQjgIiAzYCACAGIAM2AgQgA0EANgIAIANBB2pBD3IgA2tBAWoMAQsgBigCBCIDKAIEIgQgB2pBgIABTQ0BIAMoAgAiA0UEQEGAgAEQjgIhAyAGKAIEIgQgAzYCACADQQA2AgAgBCgCACEDCyAGIAM2AgQgA0EHakEPciADa0EBagshBCADIAQ2AgQLIAMgBCAHaiADakEBa0EPciADa0EBajYCBCADIARqIQMgASABKAIAQQFqNgIADAELIAIoAgAQjgIhAwsgAEEAIAMbRQRAIAVBwRs2AgQgBUHFDDYCAEEBQZA7IAUQjgELIANCADcCBCADIAA2AgAgA0IANwIMIANCADcCFCADQgA3AiwgAyADNgIoIANCADcCICADIAM2AhwgA0E4akEGEIYCIAAoAgQhBCADIABBBGo2AgggAyAENgIEIAAoAgQiBARAIAQgA0EEajYCCAsgACADNgIEIAAgACgCDEEBajYCDCADIAI2AhQgAQRAIAMgAygCGEEBcjYCGAsgAigCBCIABEAgAyAAEQEACyADQQA2AjQgBUEgaiQAIAMLSwEBfyMAQRBrIgIkAAJ/IAAEQCAAIAFB9I0BELACDAELIAJBgCs2AgBBAkHZ3wAgAhCOAUEAIAFB9I0BELACCyEAIAJBEGokACAAC0sBAX8jAEEQayICJAACfyAABEAgACABQYiOARCwAgwBCyACQd4WNgIAQQJB2d8AIAIQjgFBACABQYiOARCwAgshACACQRBqJAAgAAtOAQF/IwBBEGsiAyQAIABBACACG0UEQCADQYgNNgIAQQJB2d8AIAMQjgELIAAgAUGcjgEQsAIiAEHUAGogAkHwABDsAxogA0EQaiQAIAALTAEBfyMAQRBrIgIkAAJ/IAAEQCAAIAFBsI4BELACDAELIAJB5tAANgIAQQJB2d8AIAIQjgFBACABQbCOARCwAgshACACQRBqJAAgAAtLAQF/IwBBEGsiAiQAAn8gAARAIAAgAUHEjgEQsAIMAQsgAkHdIjYCAEECQdnfACACEI4BQQAgAUHEjgEQsAILIQAgAkEQaiQAIAALSwEBfyMAQRBrIgIkAAJ/IAAEQCAAIAFB7I4BELACDAELIAJB1yw2AgBBAkHZ3wAgAhCOAUEAIAFB7I4BELACCyEAIAJBEGokACAAC0sBAX8jAEEQayICJAACfyAABEAgACABQYCPARCwAgwBCyACQckgNgIAQQJB2d8AIAIQjgFBACABQYCPARCwAgshACACQRBqJAAgAAtLAQF/IwBBEGsiAiQAAn8gAARAIAAgAUHYjgEQsAIMAQsgAkGDFDYCAEECQdnfACACEI4BQQAgAUHYjgEQsAILIQAgAkEQaiQAIAALwwIBBX8jAEEQayIEJAAgAEUEQCAEQdwINgIAQQJB2d8AIAQQjgELIAAtABhBAXFFBEACQCAAKAIgIgVFDQAgBSgCFCIBRQ0AAkAgACABKAIARgRADAELIAEhAgNAIAIoAggiAUUNAiACIQMgASECIAEoAgAgAEcNAAsLIANBCGogBUEUaiADGyABKAIINgIACwJAIAAoAiwiA0UNACADKAIUIgFFDQACQCAAIAEoAgBGBEBBACECDAELA0AgASICKAIIIgFFDQIgASgCACAARw0ACwsgAkEIaiADQRRqIAIbIAEoAgg2AgALIABCADcCLCAAQgA3AiAgACgCBCIBBEAgASAAKAIINgIICyAAKAIIIAE2AgAgAEIANwIEIAAoAgAiASABKAIMQQFrNgIMIAAgACgCFCgCABCPAgsgBEEQaiQACyUBAX9BFBCOAiIAQQRqIgFCADcCACABQgA3AgggAEEANgIAIAALaQEDfyMAQRBrIgEkAAJAIABFBEAgAUHqCDYCAEECQdnfACABEI4BQQAQvAIMAQsgABC8AiAAQQRqKAIAIgIEQANAIAIoAgAhAyACQYCAARCPAiADIgINAAsLIABBFBCPAgsgAUEQaiQAC4wFAQt/IwBBEGsiASEHIAEkACAARQRAIAdBgAg2AgBBAkHZ3wAgBxCOAQsgASAAKAIAQQJ0QR5qQXBxayIIJAACfyAAQQRqIgUiAkEINgIMIAIgAigCACIENgIIQQAgBEUNABogAiAEQQdqQQ9yIgIgBGtBAWo2AgwgAkEBagshAQJAIAAoAgBBAEwNAANAIAggA0ECdGogATYCACABKAIUKAIAIQRBACEGAkAgBSgCCCICRQ0AIAUgBSgCDCACIARqakEBa0EPciACa0EBaiIENgIMIAIoAgQgBE0EQCAFIAIoAgAiAjYCCCACRQ0BIAUgAkEHakEPciACa0EBaiIENgIMCyACIARqIQYLIAYhASADQQFqIgMgACgCACIGSA0ACyAGQQBMDQADQCAIIAZBAWsiCkECdGoiCygCACIBKAIABEACQCABKAIgIglFDQAgCSgCFCIDRQ0AAkAgASADKAIARwRAIAMhAgNAIAIoAggiA0UNAyACIQQgAyICKAIAIAFHDQALDAELQQAhBAsgBEEIaiAJQRRqIAQbIAMoAgg2AgALAkAgASgCLCIERQ0AIAQoAhQiA0UNAAJAIAEgAygCAEYEQEEAIQIMAQsDQCADIgIoAggiA0UNAiADKAIAIAFHDQALCyACQQhqIARBFGogAhsgAygCCDYCAAsgAUIANwIsIAFCADcCICALKAIAIgEoAgQiAwRAIAMgASgCCDYCCAsgASgCCCADNgIAIAFCADcCBCABKAIAIgEgASgCDEEBazYCDAsgBkEBSiEBIAohBiABDQALCyAAQQA2AgAgBSAFKAIAIgU2AgQgBQRAIAUgBUEHakEPciAFa0EBajYCBAsgB0EQaiQAC7UEAQV/IwBBQGoiBSQAIABFBEAgBUHyIzYCMEECQd7VACAFQTBqEI4BCwJAAkACQAJAAkAgAUUNACABIAJHDQAgBUHyIzYCIEECQaXeACAFQSBqEI4BIAAoAgAhAwwBCyAAKAIAIQMgAQ0ADAELQQEhBCABKAIAIANHDQELIAJFDQEgAigCACADRg0BCyAFQfIjNgIQQQJBxdwAIAVBEGoQjgELAkAgAkEARyAERg0AIAAoAhhBBHFFDQAgBUHyIzYCAEECQazUACAFEI4BCwJAAkAgACgCICIHRQRAIAAoAiwNAQwCCyAHKAIUIgNFDQACQCAAIAMoAgBGBEAMAQsgAyEEA0AgBCgCCCIDRQ0CIAQhBiADIQQgAygCACAARw0ACwsgBkEIaiAHQRRqIAYbIAMoAgg2AgALIAAoAiwiBkUNACAGKAIUIgNFDQACQCAAIAMoAgBGBEBBACEEDAELA0AgAyIEKAIIIgNFDQIgAygCACAARw0ACwsgBEEIaiAGQRRqIAQbIAMoAgg2AgALIAAoAhghAwJAAkACQCABRQRAIABBADYCLCAAIAI2AiAgACADQQJyNgIYIAJFDQEgACACKAIUNgIwIAIgAEEoajYCFAwCCyAAIAI2AiwgACABNgIgIAAgA0F9cTYCGCAAIAEoAhQ2AjAgASAAQShqNgIUIAJFDQEgACACKAIUNgIkIAIgAEEcajYCFAwCCyAAQQA2AjALIABBADYCJAsgBUFAayQACzkBAX8jAEEQayIBJAAgAEUEQCABQbwnNgIAQQJB2d8AIAEQjgELIAAoAhQoAhAhACABQRBqJAAgAAtSAQJ/IwBBEGsiAiQAIABFBEAgAkHuCTYCAEECQdnfACACEI4BCyABQQFNBEAgAEEBIAFrIAEgAC0AGEECcRtBDGxqKAIgIQMLIAJBEGokACADC2EBAn8jAEEQayICJAAgAEEAIAEbRQRAIAJBiC02AgBBAkHZ3wAgAhCOAQsgACgCFCIABH8DQCABIAAoAgQiA0cEQCAAKAIIIgANAQsLIAEgA0YFQQALIQAgAkEQaiQAIAALdAEBf0HMABCOAiIAQgA3AgAgAEIANwIIIABBEGpBBBCGAiAAQr7vmKzj943DNTcCKCAAQs2Zs/LDtfGTNzcCICAAQQA2AkggAEFAa0LmzJn9g4CAwP8ANwIAIABCgICAgMACNwI4IABCgICAgKABNwIwIAALrQEBA38jAEEQayICJAAgAEUEQCACQZgJNgIAQQJB2d8AIAIQjgELIAAoAgAiAQRAA0AgASgCBCEDIAFB0AIQjwIgAyIBDQALCyAAKAIEIgEEQANAIAEoAgQhAwJAIAEtABhBAXEEQCABQQA2AgAgAUIANwIsIAFCADcCIEEAQcYNQQAQjwEMAQsgASABKAIUKAIAEI8CCyADIgENAAsLIABBzAAQjwIgAkEQaiQAC0IBAX8jAEEQayIEJAAgAEUEQCAEQZEINgIAQQJB2d8AIAQQjgELIAAgATgCECAAIAM4AhggACACOAIUIARBEGokAAtLAQF/IwBBEGsiAiQAIABFBEAgAkGiCDYCAEECQdnfACACEI4BCyABIAAqAhA4AgAgASAAKgIUOAIEIAEgACoCGDgCCCACQRBqJAALNQEBfyMAQRBrIgIkACAARQRAIAJBhs4ANgIAQQJB2d8AIAIQjgELIAAgATgCICACQRBqJAALOQIBfwF9IwBBEGsiASQAIABFBEAgAUGTzgA2AgBBAkHZ3wAgARCOAQsgACoCICECIAFBEGokACACCzUBAX8jAEEQayICJAAgAEUEQCACQc3OADYCAEECQdnfACACEI4BCyAAIAE4AiQgAkEQaiQACzkCAX8BfSMAQRBrIgEkACAARQRAIAFB2s4ANgIAQQJB2d8AIAEQjgELIAAqAiQhAiABQRBqJAAgAgtZAQF/IwBBIGsiAiQAIABFBEAgAkGVHDYCEEECQZXWACACQRBqEI4BCyABQwAAAABeRQRAIAJBlRw2AgBBAkG83wAgAhCOAQsgACABQe4AEPwCIAJBIGokAAtZAQF/IwBBIGsiAiQAIABFBEAgAkGFHDYCEEECQZXWACACQRBqEI4BCyABQwAAAABeRQRAIAJBhRw2AgBBAkG83wAgAhCOAQsgACABQe8AEPwCIAJBIGokAAs0AQF/IwBBEGsiAiQAIABFBEAgAkH0DzYCAEECQdnfACACEI4BCyAAIAE2AjwgAkEQaiQACzQBAX8jAEEQayICJAAgAEUEQCACQckhNgIAQQJB2d8AIAIQjgELIAAgATgCRCACQRBqJAALOAIBfwF9IwBBEGsiASQAIABFBEAgAUHqITYCAEECQdnfACABEI4BCyAAKgJEIQIgAUEQaiQAIAILNAEBfyMAQRBrIgIkACAARQRAIAJBxhU2AgBBAkHZ3wAgAhCOAQsgACABOAJIIAJBEGokAAs4AgF/AX0jAEEQayIBJAAgAEUEQCABQeMVNgIAQQJB2d8AIAEQjgELIAAqAkghAiABQRBqJAAgAgvLAgIGfQF/IwBBEGsiByQAIABFBEAgB0GqzwA2AgBBAkHZ3wAgBxCOAQsgACoCCCIEiyEBAkACQAJAIAAqAgQiBYsiAiAAKgIAIgOLIgZeBEAgASACXg0BIABDAACAPyADIAKVIgEgAZQgBCAClSIDIAOUkkMAAIA/kpGVIgIgBZg4AgQgACABIAKUOAIAIAMgApQhAQwDCyABIAZeRQ0BCyAAIAUgAZUiAkMAAIA/IAMgAZUiASABlCACIAKUkkMAAIA/kpGVIgOUOAIEIAAgASADlDgCACADIASYIQEMAQtDAAAAACEBIANDAAAAAFsEQCAAQoCAgPwDNwIADAELIAAgBSAGlSIBQwAAgD8gASABlCAEIAaVIgEgAZSSQwAAgD+SkZUiApQ4AgQgACACIAOYOAIAIAEgApQhAQsgACABOAIIIAdBEGokAAvZAQIBfwZ9IwBBIGsiASQAIAAEQAJAIAAqAgwiAyADlCAAKgIIIgQgBJQgACoCACIFIAWUIAAqAgQiBiAGlJKSkiIHQwAAAABeBEAgAEMAAIA/IAeRlSICIASUOAIIIAAgAiAGlDgCBCAAIAIgBZQ4AgAgAyAClCECDAELIAFBgQE2AhggAUH4GTYCFCABQZLPADYCEEECQcAvIAFBEGoQjwEgAEEANgIIIABCgICA/AM3AgALIAAgAjgCDCABQSBqJAAPCyABQZLPADYCAEECQdnfACABEI4BAAumAgIDfQF/IwBBEGsiBiQAAkACQCAARQ0AIAFFDQAgAg0BCyAGQagsNgIAQQJB2d8AIAYQjgELIAICfSAAKgIIIgOLu0TNO39mnqDmP2QEQCAAKgIEIQQgAUEANgIAIAFDAACAPyAEIASUIAMgA5SSIgSRlSIDIAAqAgiMlDgCBCABIAMgACoCBJQ4AgggAiAEIAOUOAIAIAIgASoCCCAAKgIAjJQ4AgQgACoCACABKgIElAwBCyABQwAAgD8gACoCACIDIAOUIAAqAgQiAyADlJIiBZGVIgQgA4yUOAIAIAAqAgAhAyABQQA2AgggASADIASUIgM4AgQgAiADIAAqAgiMlDgCACACIAAqAgggASoCAJQ4AgQgBSAElAs4AgggBkEQaiQAC4EBAQV9IAAgAUEAECwiAUEENgIEIAFB1OcANgIAQwAAgD8hBiABIAQgBJQgAiAClCADIAOUkpIiCkMAAAAAXgR9QwAAgD8gCpGVIgYgBZQhCSAGIASUIQggBiADlCEHIAYgApQFIAYLOAJMIAEgCTgCWCABIAg4AlQgASAHOAJQIAELlAICA30BfyAAQoCAgPyPgIDA/wA3AiwgAEKAgID8j4CAwP8ANwI8IABCgICA/I+AgMD/ADcCNCAAKgJUIQEgACoCTCECAkAgACoCUCIDQwAAAABcDQAgAUMAAAAAXA0AIAAgACoCWCIBQwAAgH8gAkMAAAAAXiIEGzgCMCAAQwAAgP8gAYwgBBs4AiwPCwJAIAJDAAAAAFwNACABQwAAAABcDQAgACAAKgJYIgFDAACAfyADQwAAAABeIgQbOAI4IABDAACA/yABjCAEGzgCNA8LAkAgA0MAAAAAXA0AIAJDAAAAAFwNACAAIAAqAlgiAkMAAIB/IAFDAAAAAF4iBBs4AkAgAEMAAID/IAKMIAQbOAI8CwscAQF/QdwAEI4CIgUgACABIAIgAyAEENMCGiAFC4YCAgF9AX8jAEEQayIGJAACQAJAIABFDQAgACgCBEEERw0AIAMgA5QgASABlCACIAKUkpIiBUMAAAAAXgRAIABDAACAPyAFkZUiBSAElDgCWCAAIAUgA5Q4AlQgACAFIAKUOAJQIAAgBSABlDgCTAwCCyAAQgA3AlQgAEKAgID8AzcCTAwBCyAGQZQQNgIAQQJBi9kAIAYQjgEgAyADlCABIAGUIAIgApSSkiIFQwAAAABeBEAgAEMAAIA/IAWRlSIFIASUOAJYIAAgBSADlDgCVCAAIAUgApQ4AlAgACAFIAGUOAJMDAELIABCADcCVCAAQoCAgPwDNwJMCyAAED0gBkEQaiQAC2EBAX8jAEEQayICJAACQCAABEAgACgCBEEERg0BCyACQecQNgIAQQJBi9kAIAIQjgELIAEgACoCTDgCACABIAAqAlA4AgQgASAAKgJUOAIIIAEgACoCWDgCDCACQRBqJAAL5DQCHn8YfSMAQYABayIUIQ0gFCQAAkAgAkEATA0AIAJBA3EhDiACQQRPBEAgAkF8cSEPA0AgASAGQQJ0aigCACAGNgIQIAEgBkEBciILQQJ0aigCACALNgIQIAEgBkECciILQQJ0aigCACALNgIQIAEgBkEDciILQQJ0aigCACALNgIQIAZBBGohBiAJQQRqIgkgD0cNAAsLIA5FDQADQCABIAZBAnRqKAIAIAY2AhAgBkEBaiEGIAdBAWoiByAORw0ACwsgFCAEQQJ0IgZBD2pBcHFrIgciCyQAIAcgAyAGEOwDISBBACEJIAsgAkEwbEEeakFwcWsiIiILJAACQCACQQBMDQADQCABIAlBAnRqKAIAIgYqArABISUgBioCqAEhJiAGKgKsASEnIAYqAsABIS0gBioCuAEhLiAGKgK8ASEvICIgCUEwbGoiByAGKgLQASIqICogBioCjAEiMJQgBioChAEiMiAGKgLIASIrlCAGKgLMASIxIAYqAogBIjOUkpIiNJQgKyAGKgJsIjUgKpQgKyAGKgJkIjaUIDEgBioCaCI3lJKSIjiUIDEgBioCfCI5ICqUIAYqAnQiOiArlCAxIAYqAngiO5SSkiIklJKSOAIoIAcgKiAwIC2UIDIgLpQgLyAzlJKSIimUICsgNSAtlCA2IC6UIC8gN5SSkiIolCAxIDkgLZQgOiAulCAvIDuUkpIiLJSSkjgCJCAHICogMCAllCAyICaUICcgM5SSkiIwlCArIDUgJZQgNiAmlCAnIDeUkpIiKpQgMSA5ICWUIDogJpQgJyA7lJKSIiuUkpI4AiAgByAtIDSUIC4gOJQgLyAklJKSOAIYIAcgLSAplCAuICiUIC8gLJSSkjgCFCAHIC0gMJQgLiAqlCAvICuUkpI4AhAgByAlIDSUICYgOJQgJyAklJKSOAIIIAcgJSAplCAmICiUICcgLJSSkjgCBCAHICUgMJQgJiAqlCAnICuUkpI4AgAgCUEBaiIJIAJHDQALIAJBAEwNAEEAIQcDQCABIAdBAnRqKAIAIgYtABhBCHFFBEAgBiAGKgIgIiUgACoCEJQgBioCiAKSOAKIAiAGQYwCaiIJICUgACoCFJQgCSoCAJI4AgAgBkGQAmoiBiAlIAAqAhiUIAYqAgCSOAIACyAHQQFqIgcgAkcNAAsLIAsgBEEDdEEPakFwcWsiAyIQJAACQCAEQQBMBEAgDUHwAGohG0EAIRQMAQtBACEUA0AgICAcQQJ0aigCACIJIAMgFEEDdGoiBiAJKAIUKAIIEQAAAkACQCAGKAIAIgdBBksNACAGKAIEIgtBAEgNACAHIAtODQELIA1B3hg2AhQgDUGAFjYCEEEBQY05IA1BEGoQjgEgBigCACEHCyAHQQBKBEAgICAUQQJ0aiAJNgIAIBRBAWohFAsgHEEBaiIcIARHDQALQQAhHCAQIBRBAnRBD2pBcHFrIhsiECQAIBRBAEwNACAUQQNxIQ9BACEHQQAhBiAUQQRPBEAgFEF8cSETQQAhCQNAIBsgBkECdGogCjYCACAbIAZBAXIiBEECdGogAyAGQQN0aigCACAKaiILNgIAIBsgBkECciIOQQJ0aiADIARBA3RqKAIAIAtqIgQ2AgAgGyAGQQNyIgtBAnRqIAMgDkEDdGooAgAgBGoiBDYCACADIAtBA3RqKAIAIARqIQogBkEEaiEGIAlBBGoiCSATRw0ACwsgFEEASiEcIA9FDQADQCAbIAZBAnRqIAo2AgAgAyAGQQN0aigCACAKaiEKIAZBAWohBiAHQQFqIgcgD0cNAAsLIBAgCkEwbCIdQR5qQXBxayIMIgYkACAGIApBA3RBD2pBcHFrIhciCSQAAkAgCkEATA0AIApBAXQhESAdQQ9yIRUgCSAKQQJ0IgdBHmpBcHEiBmsiGCIJJAAgCSAGayITIgkkACAJIAZrIiMiCSQAIAkgBmsiISIGJAAgBiAHQQ9qIhpBcHFrIgYiHiQAIBggChCGAiATIAogACoCJBCHAiAjIApDAACA/xCHAiAhIApDAACAfxCHAiAGQf8BIAcQ7gMhCSAMIApBDGwQhgIgDUMAAIA/IAWVIiU4AkAgDUEMNgJYIA0gACoCIDgCRAJAIBxFBEAgHiAVQQ9qQXBxayIfIhAkACAfIAwgHRDsAxogFyEGDAELQQAhEANAIA0gCSAbIBBBAnQiBGooAgAiB0ECdCIGajYCbCANIAYgIWo2AmggDSAGICNqNgJkIA0gBiATajYCYCANIAYgGGo2AlwgDSAMIAdBMGxqIgY2AkggDSAGQSRqNgJUIA0gBkEYajYCUCANIAZBDGo2AkwgBCAgaigCACIGIA1BQGsgBigCFCgCDBEAAAJAIAMgEEEDdGooAgAiBEEATA0AIARBAXEhH0EAIQYgBEEBRwRAIARBfnEhD0EAIQQDQCAJIAYgB2pBAnRqIgsoAgAiDkEATgRAIAsgByAOajYCAAsgCSAGQQFyIAdqQQJ0aiILKAIAIg5BAE4EQCALIAcgDmo2AgALIAZBAmohBiAEQQJqIgQgD0cNAAsLIB9FDQAgCSAGIAdqQQJ0aiIGKAIAIgRBAEgNACAGIAQgB2o2AgALIBBBAWoiECAURw0ACyAeIBVBD2pBcHFrIh8iECQAIB8gDCAdEOwDGiAcRQRAIBchBgwBC0EAIQ8gFyEGA0BBfyEEQX8hCyAgIA9BAnRqKAIAIgcoAiAiDgRAIA4oAhAhCwsgBygCLCIHBEAgBygCECEEC0EAIQcgAyAPQQN0aiIOKAIAQQBKBEADQCAGIAQ2AgQgBiALNgIAIAZBCGohBiAHQQFqIgcgDigCAEgNAAsLIA9BAWoiDyAURw0ACwsgFyARQQJ0aiAGRwRAIA1B3hg2AgQgDUGAFjYCAEEBQf45IA0QjgELIBAgAkEYbCIPQR5qQXBxayIOIhAkACACQQBKBEBBACELA0AgDiALQRhsaiIEIAEgC0ECdGooAgAiBioCiAIgBioClAEiJpQgJSAGKgLoAZSSOAIAIAQgJiAGKgKMApQgJSAGKgLsAZSSOAIEIAQgJiAGKgKQApQgJSAGKgLwAZSSOAIIICIgC0EwbGoiByoCKCEuIAcqAiAhLyAHKgIkISogByoCGCErIAcqAhAhMSAHKgIUITAgBCAGKgL4ASAllCAHKgIIIAYqAqACIiaUIAcqAgAgBioCmAIiJ5QgByoCBCAGKgKcAiItlJKSkjgCDCAEIAYqAvwBICWUICsgJpQgMSAnlCAtIDCUkpKSOAIQIAQgBioCgAIgJZQgLiAmlCAvICeUIC0gKpSSkpI4AhQgC0EBaiILIAJHDQALCyAPQQ9qIR0gECAaQQ9qQXBxayILIhEkAEEAIQQgDCEGA0AgBioCFCAOIBcgBEEDdGoiDygCAEEYbGoiByoCFJQgBioCECAHKgIQlCAGKgIMIAcqAgyUIAYqAgggByoCCJQgBioCBCAHKgIElCAGKgIAIAcqAgCUQwAAAACSkpKSkpIhJiALIARBAnRqIA8oAgQiB0EATgR9IAYqAiwgDiAHQRhsaiIHKgIUlCAGKgIoIAcqAhCUIAYqAiQgByoCDJQgBioCICAHKgIIlCAGKgIcIAcqAgSUIAYqAhggByoCAJQgJpKSkpKSkgUgJgs4AgAgBkEwaiEGIARBAWoiBCAKRw0ACyAKQQFxIRBBACEGIApBAUcEQCAKQX5xIQ9BACEEA0AgCyAGQQJ0IgdqIg4gByAYaioCACAllCAOKgIAkzgCACALIAdBBHIiB2oiDiAHIBhqKgIAICWUIA4qAgCTOAIAIAZBAmohBiAEQQJqIgQgD0cNAAsLIBAEQCALIAZBAnQiBmoiByAGIBhqKgIAICWUIAcqAgCTOAIACyAKQQNxIRBBACEEQQAhBiAKQQRPBEAgCkF8cSEYQQAhDgNAIBMgBkECdCIHaiIPICUgDyoCAJQ4AgAgEyAHQQRyaiIPICUgDyoCAJQ4AgAgEyAHQQhyaiIPICUgDyoCAJQ4AgAgEyAHQQxyaiIHICUgByoCAJQ4AgAgBkEEaiEGIA5BBGoiDiAYRw0ACwsgEARAA0AgEyAGQQJ0aiIHICUgByoCAJQ4AgAgBkEBaiEGIARBAWoiBCAQRw0ACwsgESAaQQ9qQXBxayIPIgYkACAGIB1BD2pBcHFrIg4kACACIRogDCEEIBchHiABIRUgIiERIAAoAjwhGCAAQUBrKgIAISwjAEEgayIAIQcgACQAIA8gChCGAiAAIApBAnQiBkEeakFwcWsiACIIJAAgACAhIAYQ7AMhHSAKQQxsIRAgBkEPaiEWIAggCkEwbEEeakFwcWsiFyIZJAACQAJAAkAgCkEASgRAIAQhACAXIQYDQCAeIBJBA3RqIggoAgQhDCAGIBUgCCgCACIIQQJ0aigCACoClAEiJCAAKgIAlDgCACAGICQgACoCBJQ4AgQgBiAkIAAqAgiUOAIIIAYgESAIQTBsaiIIKgIIIAAqAhQiJJQgCCoCACAAKgIMIiiUIAgqAgQgACoCECIplJKSOAIMIAYgJCAIKgIYlCAoIAgqAhCUICkgCCoCFJSSkjgCECAGICQgCCoCKJQgKCAIKgIglCApIAgqAiSUkpI4AhQgDEEATgRAIAYgFSAMQQJ0aigCACoClAEiJCAAKgIYlDgCGCAGICQgACoCHJQ4AhwgBiAkIAAqAiCUOAIgIAYgESAMQTBsaiIIKgIIIAAqAiwiJJQgCCoCACAAKgIkIiiUIAgqAgQgACoCKCIplJKSOAIkIAYgJCAIKgIYlCAoIAgqAhCUICkgCCoCFJSSkjgCKCAGICQgCCoCKJQgKCAIKgIglCApIAgqAiSUkpI4AiwLIAZBMGohBiAAQTBqIQAgEkEBaiISIApHDQALIA4gGkEGbBCGAiAZIBZBD2pBcHFrIhYiGSQAIApBAEwNAUEAIQggFyEAIAQhBgNAIAAqAhQgBioCFJQgACoCECAGKgIQlCAAKgIMIAYqAgyUIAAqAgggBioCCJQgACoCBCAGKgIElCAAKgIAIAYqAgCUQwAAAACSkpKSkpIhJCAWIAhBAnQiDGogLCAeIAhBA3RqKAIEQQBOBH0gACoCLCAGKgIslCAAKgIoIAYqAiiUIAAqAiQgBioCJJQgACoCICAGKgIglCAAKgIcIAYqAhyUIAAqAhggBioCGJQgJJKSkpKSkgUgJAsgDCATaioCAJKVOAIAIAZBMGohBiAAQTBqIQAgCEEBaiIIIApHDQALQQAhCCAKQQBMDQEgBCEAA0AgACAWIAhBAnQiDGoiBioCACIkIAAqAgCUOAIAIAAgJCAAKgIElDgCBCAAIAYqAgAiJCAAKgIIlDgCCCAAICQgACoCDJQ4AgwgACAGKgIAIiQgACoCEJQ4AhAgACAkIAAqAhSUOAIUIAAgBioCACIkIAAqAhiUOAIYIAAgJCAAKgIclDgCHCAAIAYqAgAiJCAAKgIglDgCICAAICQgACoCJJQ4AiQgACAGKgIAIiQgACoCKJQ4AiggACAkIAAqAiyUOAIsIAsgDGoiDCAGKgIAIAwqAgCUOAIAIABBMGohACAIQQFqIgggCkcNAAsgCkEATA0BIApBA3EhFUEAIQhBACEAIApBBE8EQCAKQXxxIRpBACEMA0AgFiAAQQJ0IgZqIhIgBiATaioCACASKgIAlDgCACAWIAZBBHIiEmoiESASIBNqKgIAIBEqAgCUOAIAIBYgBkEIciISaiIRIBIgE2oqAgAgESoCAJQ4AgAgFiAGQQxyIgZqIhIgBiATaioCACASKgIAlDgCACAAQQRqIQAgDEEEaiIMIBpHDQALCyAVBEADQCAWIABBAnQiBmoiDCAGIBNqKgIAIAwqAgCUOAIAIABBAWohACAIQQFqIgggFUcNAAsLIBkgEEEPakFwcWsiESQAIApBAEoNAkEAIQAMAwsgDiAaQQZsEIYCIBkgFkEPakFwcWsiFiIZJAALIBkgEEEPakFwcWsiESQAQQAhAAwBCyAKQQFxIRUCQCAKQQFrIhNFBEBBACEGQQAhAAwBCyAKQX5xIRJBACEGQQAhAEEAIQgDQCAJIAZBAnRqKAIAQQBIBEAgESAAQQxsaiAGNgIIIABBAWohAAsgCSAGQQFyIgxBAnRqKAIAQQBIBEAgESAAQQxsaiAMNgIIIABBAWohAAsgBkECaiEGIAhBAmoiCCASRw0ACwsCQCAVRQ0AIAkgBkECdGooAgBBAE4NACARIABBDGxqIAY2AgggAEEBaiEACyAKQQBMDQAgCkEBcSEVAkAgE0UEQEEAIQYMAQsgCkF+cSESQQAhBkEAIQgDQCAJIAZBAnRqKAIAQQBOBEAgESAAQQxsaiAGNgIIIABBAWohAAsgCSAGQQFyIgxBAnRqKAIAQQBOBEAgESAAQQxsaiAMNgIIIABBAWohAAsgBkECaiEGIAhBAmoiCCASRw0ACwsgFUUNACAJIAZBAnRqKAIAQQBIDQAgESAAQQxsaiAGNgIIIABBAWohAAsgACAKRwRAIAdB3hg2AgQgB0GqzgA2AgBBAUHoOCAHEI4BCyAYQQBKBEBBACEZA0ACQCAZQQdxDQBBASEAIApBAkgNAANAIAdBGGoiDCARIABBDGxqIgZBCGoiEigCADYCACAHIAYpAgA3AxAgBkH4sgFB+LIBKAIAQY3M5QBsQd/mu+MDaiIGNgIAAkAgAEEBaiIAQYCABEsNACAGQRB2IAZzIQYgAEGAAksNACAGQQh2IAZzIQYgAEEQSw0AIAZBBHYgBnMhBiAAQQRLDQAgBkECdiAGcyEGIABBAksNACAGQQF2IAZzIQYLIBEgBiAAcEEMbGoiCCkCADcCACASIAhBCGoiBigCADYCACAIIAcpAxA3AgAgBiAMKAIANgIAIAAgCkcNAAsLQQAhEiAKQQBKBEADQCAEIBEgEkEMbGooAggiAEEwbCITaiEGIAkgAEECdCIIaigCACIMQQBOBEAgCCAhaiAIIB1qKgIAIA8gDEECdGoqAgCUiyIkOAIAIAggI2ogJIw4AgALIAggC2oqAgAgCCAPaiIaKgIAIikgCCAWaioCAJSTIA4gHiAAQQN0aiIMKAIAQRhsaiIAKgIUIAYqAhSUIAAqAhAgBioCEJQgACoCDCAGKgIMlCAAKgIIIAYqAgiUIAAqAgAgBioCAJQgACoCBCAGKgIElJKSkpKSkyEkIAwoAgQiFUEASCIQRQRAICQgDiAVQRhsaiIMKgIUIAYqAiyUIAwqAhAgBioCKJQgDCoCDCAGKgIklCAMKgIIIAYqAiCUIAwqAgAgBioCGJQgDCoCBCAGKgIclJKSkpKSkyEkCyATIBdqIQYCQCApICSSIiggCCAjaioCACIsXQRAICwgKZMhJCAsISgMAQsgKCAIICFqKgIAIixeRQ0AICwgKZMhJCAsISgLIBogKDgCACAAICQgBioCAJQgACoCAJI4AgAgACAkIAYqAgSUIAAqAgSSOAIEIAAgJCAGKgIIlCAAKgIIkjgCCCAAICQgBioCDJQgACoCDJI4AgwgACAkIAYqAhCUIAAqAhCSOAIQIAAgJCAGKgIUlCAAKgIUkjgCFCAQRQRAIA4gFUEYbGoiACAkIAYqAhiUIAAqAgCSOAIAIAAgJCAGKgIclCAAKgIEkjgCBCAAICQgBioCIJQgACoCCJI4AgggACAkIAYqAiSUIAAqAgySOAIMIAAgJCAGKgIolCAAKgIQkjgCECAAICQgBioCLJQgACoCFJI4AhQLIBJBAWoiEiAKRw0ACwsgGUEBaiIZIBhHDQALCyAHQSBqJAAgAkEASgRAQQAhCQNAIAEgCUECdGooAgAiBiAFIA4gCUEYbGoiByoCAJQgBioC6AGSOALoASAGQewBaiIEIAUgByoCBJQgBCoCAJI4AgAgBkHwAWoiBCAFIAcqAgiUIAQqAgCSOAIAIAYgBSAHKgIMlCAGKgL4AZI4AvgBIAZB/AFqIgQgBSAHKgIQlCAEKgIAkjgCACAGQYACaiIGIAUgByoCFJQgBioCAJI4AgAgCUEBaiIJIAJHDQALCyAcRQ0AQQAhBwNAAkAgICAHQQJ0IglqKAIAIgQoAjQiBkUNACANQSBqIB8gCSAbaigCACIJQTBsaiILIA8gCUECdGoiCSADIAdBA3RqIg4oAgAQ2QIgBiANKgIgOAIAIAYgDSoCJDgCBCAGIA0qAig4AgggBiANKgIsOAIQIAYgDSoCMDgCFCAGIA0qAjQ4AhggBCgCLEUNACANQSBqIAtBGGogCSAOKAIAENkCIAYgDSoCIDgCICAGIA0qAiQ4AiQgBiANKgIoOAIoIAYgDSoCLDgCMCAGIA0qAjA4AjQgBiANKgI0OAI4CyAHQQFqIgcgFEcNAAsLQQAhCQJAIAJBAEwNAANAIAEgCUECdGooAgAiBiAGKgKYAiAFlCIlOAKYAiAGQZwCaiIHIAcqAgAgBZQiJjgCACAGIAYqApQBIAWUIicgBioCiAKUIAYqAugBkjgC6AEgBkHsAWoiByAnIAYqAowClCAHKgIAkjgCACAGQfABaiIHICcgBioCkAKUIAcqAgCSOAIAIAZBoAJqIgcgByoCACAFlCInOAIAIAYgBioC+AEgIiAJQTBsaiIHKgIIICeUIAcqAgAgJZQgByoCBCAmlJKSkjgC+AEgBkH8AWoiBCAEKgIAIAcqAhggJ5QgByoCECAllCAmIAcqAhSUkpKSOAIAIAZBgAJqIgYgBioCACAHKgIoICeUIAcqAiAgJZQgJiAHKgIklJKSkjgCACAJQQFqIgkgAkcNAAtBACEGIAJBAEwNAANAIAEgBkECdGooAgAgBRD7AiAGQQFqIgYgAkcNAAtBACEGIAJBAEwNAANAIAEgBkECdGoiBygCAEGIAmpBAxCGAiAHKAIAQZgCakEDEIYCIAZBAWoiBiACRw0ACwsgDUGAAWokAAurCQIHfwF9IwBBEGsiCiQAAkACQAJAAkACQAJAAkACQAJAAkAgAEUNACABRQ0AIAJFDQAgA0EASg0BCyAKQd4YNgIEIApBodIANgIAQQFB/sAAIAoQjgEgA0EATA0BCyADQQFxIQYCQCADQQFrIglFBEAMAQsgA0F+cSEHA0AgASAEQQFyIghBMGxqKgIAIAIgCEECdGoqAgCUIAEgBEEwbGoqAgAgAiAEQQJ0aioCAJQgC5KSIQsgBEECaiEEIAVBAmoiBSAHRw0ACwsgACAGBH0gASAEQTBsaioCACACIARBAnRqKgIAlCALkgUgCws4AgAgA0EATA0BIANBAXEhBgJAIAlFBEBBACEEQwAAAAAhCwwBCyADQX5xIQdBACEEQwAAAAAhC0EAIQUDQCABIARBAXIiCEEwbGoqAgQgAiAIQQJ0aioCAJQgASAEQTBsaioCBCACIARBAnRqKgIAlCALkpIhCyAEQQJqIQQgBUECaiIFIAdHDQALCyAAIAYEfSABIARBMGxqKgIEIAIgBEECdGoqAgCUIAuSBSALCzgCBCADQQBMDQIgA0EBcSEGIAkNA0EAIQRDAAAAACELDAQLIABBADYCAAsgAEEANgIECyAAQQA2AggMAgsgA0F+cSEHQQAhBEMAAAAAIQtBACEFA0AgASAEQQFyIghBMGxqKgIIIAIgCEECdGoqAgCUIAEgBEEwbGoqAgggAiAEQQJ0aioCAJQgC5KSIQsgBEECaiEEIAVBAmoiBSAHRw0ACwsgACAGBH0gASAEQTBsaioCCCACIARBAnRqKgIAlCALkgUgCws4AgggA0EATA0AIANBAXEhBgJAIAlFBEBBACEEQwAAAAAhCwwBCyADQX5xIQdBACEEQwAAAAAhC0EAIQUDQCABIARBAXIiCEEwbGoqAgwgAiAIQQJ0aioCAJQgASAEQTBsaioCDCACIARBAnRqKgIAlCALkpIhCyAEQQJqIQQgBUECaiIFIAdHDQALCyAAIAYEfSABIARBMGxqKgIMIAIgBEECdGoqAgCUIAuSBSALCzgCDCADQQBMDQEgA0EBcSEGAkAgCUUEQEEAIQRDAAAAACELDAELIANBfnEhB0EAIQRDAAAAACELQQAhBQNAIARBAXIiCEEwbCABaioCECACIAhBAnRqKgIAlCABIARBMGxBEHJqKgIAIAIgBEECdGoqAgCUIAuSkiELIARBAmohBCAFQQJqIgUgB0cNAAsLIAAgBgR9IARBMGwgAWoqAhAgAiAEQQJ0aioCAJQgC5IFIAsLOAIQIANBAEwEQEMAAAAAIQsMAwsgA0EBcSEGAkAgCUUEQEEAIQRDAAAAACELDAELIANBfnEhB0EAIQRDAAAAACELQQAhBQNAIARBAXIiCEEwbCABaioCFCACIAhBAnRqKgIAlCABIARBMGxBFHJqKgIAIAIgBEECdGoqAgCUIAuSkiELIARBAmohBCAFQQJqIgUgB0cNAAsLIAZFDQIgBEEwbCABaioCFCACIARBAnRqKgIAlCALkiELDAILIABBADYCDAsgAEEANgIQQwAAAAAhCwsgACALOAIUIApBEGokAAsjACAAQQBBARAsIgAgATgCTCAAQQU2AgQgAEGE6AA2AgAgAAvQAQIBfwZ9IAAoAhgiASoCOCAAKgJMIgKUIQYgASoCCCEHIAEqAiggApQgASoCBJIhAwJAIAEqAgAiBSAFIAEqAhggApSSIgRdBEAgACAFOAIsDAELIAAgBDgCLCABKgIAIQQLIAYgB5IhAiAAIAQ4AjACQCADIAEqAgQiBF4EQCAAIAQ4AjQMAQsgACADOAI0IAEqAgQhAwsgACADOAI4AkAgAiABKgIIIgNeBEAgACADOAI8DAELIAAgAjgCPCABKgIIIQILIABBQGsgAjgCAAuuAQECfyMAQSBrIgckAAJAIAAEQCAAKAIEQQVGDQELIAdB8Aw2AgBBAkGo1QAgBxCOAQsgAC0ACEECcQRAIAAQKyAAIAAoAghBfXE2AggLIAAoAhgiCCADOAIIIAggAjgCBCAIIAE4AgAgByAGOAIYIAcgBTgCFCAHIAQ4AhAgB0EQahDQAiAIIAcqAhA4AhggCCAHKgIUOAIoIAggByoCGDgCOCAAED0gB0EgaiQAC6cBACMAQTBrIgIkACAEQTNMBEAgAkHkFzYCJCACQfYmNgIgQQFB3ckAIAJBIGoQjgELIAAoAgRBBUcEQCACQeQXNgIUIAJB9iY2AhBBAUGXMiACQRBqEI4BCyABKAIEBEAgAkHkFzYCBCACQfYmNgIAQQFB4DUgAhCOAQsgAyABNgIoIAMgADYCJCAAIAEoAhggASoCTCADQQAQ3gIhASACQTBqJAAgAQvmAgIGfQJ/AkAgACgCGCILKgIIIAEqAgiTIgUgCyoCOJQgCyoCACIJIAEqAgCTIgYgCyoCGCIKlCALKgIEIAEqAgSTIgggCyoCKJSSkiIHIAeUIAUgBZQgBiAGlCAIIAiUkpIgAiAClJMiApMiBUMAAAAAXQ0AIAWRIQYCQAJAIARFDQAgAkMAAAAAYEUNACAGIAeTIgVDAAAAAF1FDQEMAgsgB4wgBpMiBUMAAAAAXUUNACAGIAeTIgVDAAAAAF0NAQsgBSAAKgJMXg0AIAMgBSAKlCAJkiIGOAIAIAMgBSALKgIolCALKgIEkiIIOAIEIAMgBSALKgI4lCALKgIIkiIHOAIIIANDAACAv0MAAIC/QwAAgD8gAkMAAAAAXRsgBBsiAiAGIAEqAgCTlDgCECADIAIgCCABKgIEk5Q4AhQgAyACIAcgASoCCJOUOAIYIANBEGoQ0AIgAyAFOAIgQQEhDAsgDAupCAIUfQV/IwBBQGoiAiQAIARBM0wEQCACQeQXNgIkIAJBrwo2AiBBAUHdyQAgAkEgahCOAQsgACgCBEEFRwRAIAJB5Bc2AhQgAkGvCjYCEEEBQZcyIAJBEGoQjgELIAEoAgRBAUcEQCACQeQXNgIEIAJBrwo2AgBBAUHNMiACEI4BCyADIAE2AiggAyAANgIkIAEoAhgiBCoCICEFIAQqAjAhBiAEKgI0IQogBCoCFCEOIAQqAiQhCyAEKgIAIQwgACgCGCIZKgIAIRIgBCoCBCEPIBkqAgQhECAEKgIIIREgGSoCCCEVIAQqAhAhCCACQwAAgD9DAACAvyAEKgI4IhYgGSoCOCIHlCAEKgIYIhcgGSoCGCINlCAEKgIoIhggGSoCKCIJlJKSIhNDAAAAAF0iHRs4AjggAkMAAIA/QwAAgL8gCiAHlCAOIA2UIAsgCZSSkiIUQwAAAABdIhsbOAI0IAJDAACAP0MAAIC/IAYgB5QgCCANlCAFIAmUkpIiB0MAAAAAXSIaGzgCMAJAIAYgFSARkyIJlCAIIBIgDJMiDJQgBSAQIA+TIgiUkpIiBYwgBSAaGyIFIAEqAkxDAAAAP5QiBl4NACAFIAaMIg9dIAeMIAcgGhsiB0MAAAAAX3ENACAKIAmUIA4gDJQgCCALlJKSIgqMIAogGxsiCiABKgJQQwAAAD+UIg5eDQAgCiAOjCIQXSAUjCAUIBsbIgtDAAAAAF9xDQAgFiAJlCAXIAyUIAggGJSSkiIIjCAIIB0bIgggASoCVEMAAAA/lCIMjCIRXSATjCATIB0bIglDAAAAAF9xDQAgCCAMXg0AAkAgB0MAAAAAXA0AIAtDAAAAAFwNACAJQwAAAABbDQELAn0gB0MAAAAAWwRAQwAAgH8hBkMAAID/DAELIAYgBZMgB5UiBkMAAIB/IAZDAACAf10bIQYgDyAFkyAHlSIFQwAAgP8gBUMAAID/XhsLIQUCQCALQwAAAABbBEBBACEBQQAhGgwBCyAOIAqTIAuVIgcgBiAGIAdeIhobIQYgECAKkyALlSIHIAUgBSAHXSIBGyEFCyAJQwAAAABcBEAgDCAIkyAJlSIHIAYgBiAHXiIcGyEGIBEgCJMgCZUiCCAFIAUgCF0iGxshBUECIBogHBshGkECIAEgGxshAQtBACEcIAUgBl4NACAFIAYgBUMAAAAAYCIbGyIFQwAAAABdDQAgBSAAKgJMXg0AIAMgBSANlCASkjgCACADIAUgGSoCKJQgGSoCBJI4AgQgAyAFIBkqAjiUIBkqAgiSOAIIIAMgBCABIBogGxtBAnQiGWoiBCoCECACQTBqIBlyKgIAIg2UOAIQIAMgDSAEKgIglDgCFCAEKgIwIQYgAyAFOAIgIAMgDSAGlDgCGEEBIRwLIAJBQGskACAcC+IHAhN9An8jAEFAaiIYJAAgBEEzTARAIBhB5Bc2AiQgGEHtKDYCIEEBQd3JACAYQSBqEI4BCyAAKAIEQQVHBEAgGEHkFzYCFCAYQe0oNgIQQQFBlzIgGEEQahCOAQsgASgCBEECRwRAIBhB5Bc2AgQgGEHtKDYCAEEBQYo3IBgQjgELIAMgATYCKCADIAA2AiQgASoCUEMAAAA/lCEMQQAhAgJ/AkACQCABKAIYIgQqAjgiCCAAKAIYIhkqAggiECAEKgIIIhGTIgWUIAQqAhgiDSAZKgIAIhUgBCoCACIPkyIKlCAZKgIEIhYgBCoCBCISkyIHIAQqAigiDpSSkiIGIAiUIAWTIgsgC5QgBiANlCAKkyIKIAqUIAYgDpQgB5MiByAHlJKSIAEqAkwiEyATlCIXkyIUQwAAAABdRQ0AIAyMIgUhCQJAIAUgBl4NACAGIQkgBiAMXkUNACAMIQkLQQEhAiAQIAkgCJQgEZKTIgYgBpQgFSAJIA2UIA+SkyIGIAaUIBYgCSAOlCASkpMiBiAGlJKSIBddDQBBACECIAlDAAAAAF0NASAMIQUMAQsgCyAIIBkqAjgiBZQgDSAZKgIYIgmUIA4gGSoCKCIQlJKSIgYgCJQgBZMiBZQgCiAGIA2UIAmTIguUIAcgBiAOlCAQkyIKlJKSIgcgB5IiByAHlCAUIAUgBZQgCyALlCAKIAqUkpIiBUMAAIDAlJSSIgtDAAAAAF0EQEEAIBRDAAAAAF1FDQIaIAZDAAAAAF1FBEAgDCEFDAILIAyMIQUMAQtDAACAPyAFIAWSlSINIAeMIAuRIgiTlCIGQwAAAABdBEBBACANIAggB5OUIgZDAAAAAF0NAhoLQQAgBiAAKgJMXg0BGiADIAYgCZQgFZIiCzgCACADIAYgGSoCKJQgGSoCBJIiCjgCBCADIAYgGSoCOJQgGSoCCJIiBzgCCAJAIAcgBCoCCCIRkyAEKgI4IgiUIAsgBCoCACIPkyAEKgIYIg2UIAogBCoCBCISkyAEKgIoIg6UkpIiBSAMjCIJYEUNACAFIAxfRQ0AIANDAACAv0MAAIA/IBRDAAAAAF0bIgggCyAFIA2UIA+Sk5Q4AhAgAyAIIAogBSAEKgIolCAEKgIEkpOUOAIUIAMgCCAHIAUgBCoCOJQgBCoCCJKTlDgCGCADQRBqENACIAMgBjgCIEEBDAILIAkgDCAFQwAAAABdGyEFIAEqAkwhEwsgGCAFIAiUIBGSOAI4IBggBSAOlCASkjgCNCAYIAUgDZQgD5I4AjAgACAYQTBqIBMgAyACEN4CCyEAIBhBQGskACAAC40DAgZ9AX8jAEEwayICJAAgBEEzTARAIAJB5Bc2AiQgAkHKJzYCIEEBQd3JACACQSBqEI4BCyAAKAIEQQVHBEAgAkHkFzYCFCACQconNgIQQQFBlzIgAkEQahCOAQsgASgCBEEERwRAIAJB5Bc2AgQgAkHKJzYCAEEBQdI2IAIQjgELAkAgASoCVCIFIAAoAhgiBCoCOJQgASoCTCIGIAQqAhgiCJQgASoCUCIHIAQqAiiUkpIiCUMAAAAAWw0AIAEqAlggBSAEKgIIlCAGIAQqAgAiCpQgByAEKgIElJKSkyIGIAmVIgVDAAAAAF0NACAFIAAqAkxeDQAgAyAFIAiUIAqSOAIAIAMgBSAEKgIolCAEKgIEkjgCBCADIAUgBCoCOJQgBCoCCJI4AgggA0MAAIC/QwAAgD8gBkMAAAAAXhsiBiABKgJMlDgCECADIAYgASoCUJQ4AhQgASoCVCEHIAMgATYCKCADIAA2AiQgAyAFOAIgIAMgBiAHlDgCGEEBIQsLIAJBMGokACALC9MHAg19AX8jAEEwayISJAAgBEEzTARAIBJB5Bc2AiQgEkGPFjYCIEEBQefKACASQSBqEI4BCyAAKAIEQQVHBEAgEkHkFzYCFCASQY8WNgIQQQFBlzIgEkEQahCOAQsgASgCBEEDRwRAIBJB5Bc2AgQgEkGPFjYCAEEBQas0IBIQjgELIAMgATYCKCADIAA2AiQgASoCUEMAAAA/lCELAkACQAJAIAEoAhgiAioCOCIGIAAoAhgiBCoCCCACKgIIkyIIlCACKgIYIgcgBCoCACIQIAIqAgCTIg2UIAQqAgQgAioCBJMiDiACKgIoIgqUkpIiBSAGlCAIkyIJIAYgBCoCOCIMlCAHIAQqAhgiD5QgCiAEKgIoIhGUkpIiCCAGlCAMkyIGlCAFIAeUIA2TIg0gCCAHlCAPkyIHlCAFIAqUIA6TIg4gCCAKlCARkyIKlJKSIgwgDJIiDCAMlCAJIAmUIA0gDZQgDiAOlJKSIAEqAkwiCSAJlJMiCSAGIAaUIAcgB5QgCiAKlJKSIgdDAACAwJSUkiIGQwAAADRdRQ0AIAlDAAAAAF9FDQBDAACAv0MAAIA/IAUgC18bQwAAgD8gBSALjGAbIQdDAACAv0MAAIA/IAhDAAAAAF0bIQYgCEMAAAAAXgRAQQAhASAGIAAqAkyUIAWSIAsgB5RdDQMLIAhDAAAAAF0EQEEAIQEgBSAAKgJMkyALIAeUXg0DCyADIAaMIAWUIAsgB5STIgU4AiAgAyAFIAQqAhiUIAQqAgCSOAIAIAMgBSAEKgIolCAEKgIEkjgCBCADIAUgBCoCOJQgBCoCCJI4AgggAyAGIAIqAhiUOAIQIAMgBiACKgIolDgCFCADIAYgAioCOJQ4AhgMAQtBACEBIAZDAAAAAF5FDQFDAACAPyAHIAeSlSIFIAaRIgggDJOUIAUgDIwgCJOUIgUgBUMAAAAAXRsiBUMAAAAAYEUNASAFIAAqAkxfRQ0BIAMgBSAPlCAQkiIGOAIAIAMgBSAEKgIolCAEKgIEkiIHOAIEIAMgBSAEKgI4lCAEKgIIkiIKOAIIIAogAioCCJMgAioCOJQgBiACKgIAIg2TIAIqAhgiDpQgByACKgIEkyACKgIolJKSIgggC4xgRQ0BIAggC19FDQEgA0MAAIC/QwAAgD8gCUMAAAAAXRsiCSAGIAggDpQgDZKTlDgCECADIAkgByAIIAIqAiiUIAIqAgSSk5Q4AhQgAyAJIAogCCACKgI4lCACKgIIkpOUOAIYIANBEGoQ0AIgAyAFOAIgC0EBIQELIBJBMGokACABCwwAIAAQLkHQABCPAgtqAQF/IwBBEGsiASQAIABFBEAgAUGzCDYCAEECQdnfACABEI4BCyAAQgA3AgQgAEGAgID8AzYCACAAQgA3AhggAEGAgID8AzYCFCAAQoCAgPwDNwIoIABCADcCDCAAQgA3AiAgAUEQaiQAC/ECAgV9AX8jAEEgayIKJAAgAEUEQCAKQaAqNgIQQQJB2d8AIApBEGoQjgELQwAAgD8hBiADIAOUIAEgAZQgAiAClJKSIglDAAAAAF4EQCAEQwAAAD+UIgYQ9gNDAACAPyAJkZWUIgUgA5QhCCAFIAKUIQcgBhDrAyEGIAUgAZQhBQsgAEUEQCAKQf7NADYCAEECQdnfACAKEI4BCyAAQQA2AiwgAEEANgIcIABBADYCDCAAIAcgCJQiAyAGIAWUIgKSIgEgAZI4AiQgACAFIAiUIgEgBiAHlCIEkyIJIAmSOAIgIAAgAyACkyIDIAOSOAIYIAAgBSAHlCIDIAYgCJQiBpIiAiACkjgCECAAIAEgBJIiAiACkjgCCCAAIAMgBpMiBiAGkjgCBCAAQwAAgD8gBSAFIAWSlJMiBSAHIAcgB5KUIgeTOAIoIAAgBSAIIAggCJKUIgiTOAIUIABDAACAPyAHkyAIkzgCACAKQSBqJAALoQECBX0BfyMAQRBrIgokACAARQRAIApBsyo2AgBBAkHZ3wAgChCOAQtDAACAPyEGIAMgA5QgASABlCACIAKUkpIiCUMAAAAAXgRAIARDAAAAP5QiBhD2A0MAAIA/IAmRlZQiBSADlCEIIAUgApQhByAGEOsDIQYgBSABlCEFCyAAIAg4AgwgACAHOAIIIAAgBTgCBCAAIAY4AgAgCkEQaiQAC6MDAgd9AX8jAEEQayIJJAAgAEEAIAEbRQRAIAlB/s0ANgIAQQJB2d8AIAkQjgELIAEqAgQhBCAAQwAAgD8gASoCCCICIAIgApKUIgiTIAEqAgwiAiACIAKSlCICkzgCACAAIAEqAgQgASoCCJQgASoCDCABKgIAlJMiAyADkjgCBCABKgIMIQMgASoCBCEFIAEqAgghBiABKgIAIQcgAEEANgIMIAAgBSADlCAHIAaUkiIDIAOSOAIIIAEqAgghAyABKgIEIQUgASoCDCEGIAEqAgAhByAAQwAAgD8gBCAEIASSlJMiBCACkzgCFCAAIAUgA5QgByAGlJIiAiACkjgCECABKgIMIQIgASoCCCEDIAEqAgQhBSABKgIAIQYgAEEANgIcIAAgAyAClCAFIAaUkyICIAKSOAIYIAAgASoCBCABKgIMlCABKgIIIAEqAgCUkyICIAKSOAIgIAEqAgwhAiABKgIIIQMgASoCBCEFIAEqAgAhBiAAQQA2AiwgACAEIAiTOAIoIAAgAyAClCAGIAWUkiIEIASSOAIkIAlBEGokAAvcAQIDfQF/IwBBEGsiByQAIABFBEAgB0GpEzYCAEECQdnfACAHEI4BCyAAQQA2AiwgAEEANgIcIABBADYCDCAAIAEQ6wMiBSACEOsDIgSUOAIoIAAgBCABEPYDIgGUOAIYIAAgAhD2AyIGjDgCCCAAIAQgAxD2AyIClDgCBCAAIAQgAxDrAyIDlDgCACAAIAUgBiAClCIElCABIAOUkzgCJCAAIAUgBiADlCIGlCABIAKUkjgCICAAIAQgAZQgBSADlJI4AhQgACAGIAGUIAUgApSTOAIQIAdBEGokAAuAAwIBfQF/IwBBMGsiCCQAIABFBEAgCEGdEzYCIEECQdnfACAIQSBqEI4BCwJAIAMgA5QgASABlCACIAKUkpKRIgdDAAAAAF8EQCAIQeQANgIYIAhBlRk2AhQgCEGdEzYCEEECQZUvIAhBEGoQjwEMAQsgBkMAAIA/IAeVIgcgA5QiAyAGlCAHIAGUIgEgBJQgByAClCICIAWUkpIiByADlJMiBiAGlCAEIAcgAZSTIgQgBJQgBSAHIAKUkyIFIAWUkpKRIgdDAAAAAF8EQCAIQfEANgIIIAhBlRk2AgQgCEGdEzYCAEECQZUvIAgQjwEMAQsgACADOAIgIAAgAjgCECAAIAE4AgAgAEEANgIsIABBADYCHCAAQQA2AgwgACAGQwAAgD8gB5UiB5QiBjgCJCAAIAUgB5QiBTgCFCAAIAQgB5QiBDgCBCAAIAEgBZQgBCAClJM4AiggACADIASUIAYgAZSTOAIYIAAgAiAGlCAFIAOUkzgCCAsgCEEwaiQACz8BAX8jAEEQayIBJAAgAEUEQCABQcEINgIAQQJB2d8AIAEQjgELIABCADcCCCAAQoCAgPwDNwIAIAFBEGokAAuMAgEBfyMAQRBrIgMkAAJAAkAgAEUNACABRQ0AIAINAQsgA0Gc0QA2AgBBAkHZ3wAgAxCOAQsgACABKgIMIAIqAgyUIAEqAgggAioCCJQgASoCACACKgIAlCABKgIEIAIqAgSUkpKSOAIAIAAgASoCDCACKgIIlCABKgIAIAIqAgSUIAIqAgAgASoCBJSTIAEqAgggAioCDJSTkjgCBCAAIAEqAgQgAioCDJQgASoCACACKgIIlCACKgIAIAEqAgiUkyABKgIMIAIqAgSUk5I4AgggACABKgIIIAIqAgSUIAEqAgAgAioCDJQgAioCACABKgIMlJMgASoCBCACKgIIlJOSOAIMIANBEGokAAuMAgEBfyMAQRBrIgMkAAJAAkAgAEUNACABRQ0AIAINAQsgA0G2zwA2AgBBAkHZ3wAgAxCOAQsgACABKgIMIAIqAgyUIAEqAgggAioCCJQgASoCACACKgIAlCABKgIEIAIqAgSUkpKSOAIAIAAgASoCDCACKgIIlCABKgIEIAIqAgCUIAEqAgAgAioCBJSTIAEqAgggAioCDJSTkjgCBCAAIAEqAgQgAioCDJQgASoCCCACKgIAlCABKgIAIAIqAgiUkyABKgIMIAIqAgSUk5I4AgggACABKgIIIAIqAgSUIAEqAgwgAioCAJQgASoCACACKgIMlJMgASoCBCACKgIIlJOSOAIMIANBEGokAAuPAgEBfyMAQRBrIgMkAAJAAkAgAEUNACABRQ0AIAINAQsgA0GezwA2AgBBAkHZ3wAgAxCOAQsgACABKgIAIAIqAgCUIAIqAgQgASoCBJSTIAEqAgggAioCCJSTIAEqAgwgAioCDJSTOAIAIAAgASoCCCACKgIMlCABKgIAjCACKgIElCACKgIAIAEqAgSUk5IgASoCDCACKgIIlJM4AgQgACABKgIMIAIqAgSUIAEqAgCMIAIqAgiUIAIqAgAgASoCCJSTkiABKgIEIAIqAgyUkzgCCCAAIAEqAgQgAioCCJQgASoCAIwgAioCDJQgAioCACABKgIMlJOSIAEqAgggAioCBJSTOAIMIANBEGokAAv+AwIFfQF/IwBBEGsiByQAIABBACABG0UEQCAHQePNADYCAEECQdnfACAHEI4BCwJAIAEqAgAiAiABKgIUIgSSIgUgASoCKCIDkiIGQwAAAABgBEAgACAGQwAAgD+SkSICQwAAAD+UOAIAIABDAACAPyAClUMAAAA/lCICIAEqAiQgASoCGJOUOAIEIAAgAiABKgIIIAEqAiCTlDgCCCAAIAIgASoCECABKgIEk5Q4AgwMAQsCQCACIARdBEAgAyAEXg0BIAAgBCACIAOSk0MAAIA/kpEiAkMAAAA/lDgCCCAAQwAAgD8gApVDAAAAP5QiAiABKgIYIAEqAiSSlDgCDCAAIAIgASoCBCABKgIQkpQ4AgQgACACIAEqAgggASoCIJOUOAIADAILIAIgA10NACAAIAIgBCADkpNDAACAP5KRIgJDAAAAP5Q4AgQgAEMAAIA/IAKVQwAAAD+UIgIgASoCBCABKgIQkpQ4AgggACACIAEqAiAgASoCCJKUOAIMIAAgAiABKgIkIAEqAhiTlDgCAAwBCyAAIAMgBZNDAACAP5KRIgJDAAAAP5Q4AgwgAEMAAIA/IAKVQwAAAD+UIgIgASoCICABKgIIkpQ4AgQgACACIAEqAhggASoCJJKUOAIIIAAgAiABKgIQIAEqAgSTlDgCAAsgB0EQaiQAC/UBAQF/IwBBEGsiAyQAAkACQCAARQ0AIAFFDQAgAg0BCyADQcPNADYCAEECQdnfACADEI4BCyAAIAEqAgCMIAIqAgSUIAIqAgggASoCBJSTIAEqAgggAioCDJSTQwAAAD+UOAIAIAAgASoCACACKgIAlCABKgIEIAIqAgyUkiABKgIIIAIqAgiUk0MAAAA/lDgCBCAAIAEqAgggAioCBJQgASoCBCACKgIAlCABKgIAIAIqAgyUk5JDAAAAP5Q4AgggACABKgIIIAIqAgCUIAEqAgAgAioCCJQgAioCBCABKgIElJOSQwAAAD+UOAIMIANBEGokAAthAgF/AX0gACAAKAIYIgEqAgAgACoCTCICkzgCLCAAIAIgASoCAJI4AjAgACABKgIEIAKTOAI0IAAgAiABKgIEkjgCOCAAIAEqAgggApM4AjwgAEFAayACIAEqAgiSOAIAC1wBAn9B0AAQjgIhAyMAQRBrIgIkACADIABBARAsIgBBsOgANgIAIAFDAAAAAF5FBEAgAkGIJzYCAEECQdnfACACEI4BCyAAIAE4AkwgAEEANgIEIAJBEGokACADC2QBAX8jAEEgayICJAACQCAABEAgACgCBEUNAQsgAkGcDTYCEEECQe3YACACQRBqEI4BCyABQwAAAABeRQRAIAJBnA02AgBBAkHZ3wAgAhCOAQsgACABOAJMIAAQPSACQSBqJAALQgIBfwF9IwBBEGsiASQAAkAgAARAIAAoAgRFDQELIAFBsQ02AgBBAkHt2AAgARCOAQsgACoCTCECIAFBEGokACACC5oBAgJ/BH0jAEEQayIEJAACQCAABEAgACgCBEUNAQsgBEGzIzYCAEECQe3YACAEEI4BCyAALQAIQQJxBEAgABArIAAgACgCCEF9cTYCCAsgACgCGCIFKgIEIQYgBSoCACEHIAUqAgghCCAAKgJMIQkgBEEQaiQAIAkgAyAIkyIDIAOUIAEgB5MiAyADlCACIAaTIgMgA5SSkpGTC6oBACMAQTBrIgIkACAEQTNMBEAgAkHRGjYCJCACQZEnNgIgQQFB3ckAIAJBIGoQjgELIAAoAgQEQCACQdEaNgIUIAJBkSc2AhBBAUGZNiACQRBqEI4BCyABKAIEBEAgAkHRGjYCBCACQZEnNgIAQQFB4DUgAhCOAQsgAyABNgIoIAMgADYCJCAAKAIYIAAqAkwgASgCGCABKgJMIAMQggEhASACQTBqJAAgAQuTBwIVfQV/IwBB0ABrIgIkACAEQTNMBEAgAkHRGjYCJCACQfkKNgIgQQFB3ckAIAJBIGoQjgELIAAoAgQEQCACQdEaNgIUIAJB+Qo2AhBBAUGZNiACQRBqEI4BCyABKAIEQQFHBEAgAkHRGjYCBCACQfkKNgIAQQFBzTIgAhCOAQsgAyABNgIoIAMgADYCJCACIAEqAkxDAAAAP5QiCyALjCIFIAAoAhgiGioCCCABKAIYIgQqAgiTIgcgBCoCMCIPlCAaKgIAIhAgBCoCACIRkyIIIAQqAhAiEpQgGioCBCAEKgIEkyIJIAQqAiAiE5SSkiIGIAUgBl4iGxsiBSAFIAteIhwbIgY4AkAgAiABKgJQQwAAAD+UIgwgDIwiBSAHIAQqAjQiFJQgCCAEKgIUIhWUIAkgBCoCJCIWlJKSIgogBSAKXiIdGyIFIAUgDF4iHhsiCjgCRCACIAcgBCoCOCIXlCAIIAQqAhgiGJQgCSAEKgIoIhmUkpIiDjgCSAJ/AkACQAJAAkAgDiABKgJUQwAAAD+UIg2MIgVdRQRAIA0gDl1FDQEgDSEFDAILIA1DAAAAAF1FDQEgDSEFDAELIB0gHnIgGyAccnJFDQEgDiEFC0EAIAAqAkwgByAXIAWUIA8gBpQgCiAUlJKSIguTIgcgB5QgCCAYIAWUIBIgBpQgFSAKlJKSIgyTIgggCJQgCSAZIAWUIBMgBpQgCiAWlJKSIgaTIgUgBZSSkpGTIglDAAAAAF0NAhogAyARIAySOAIAIAMgBiAEKgIEkjgCBCAEKgIIIQYgAyAHOAIYIAMgBTgCFCADIAg4AhAgAyALIAaSOAIIIANBEGoQ0AIgAyAJOAIgDAELIAMgEDgCACADIBoqAgQ4AgQgAyAaKgIIOAIIIAJBADYCOCACQgA3AzBBAiAMIAqLkyIFIAsgBouTIgddIgEgDSAOi5MiCSAFIAcgARsiBl0iARtBAnQiGiACQTBqckMAAIA/QwAAgL8gAkFAayAacioCAEMAAAAAXhs4AgAgAyAEKgIYIAIqAjgiBZQgBCoCECACKgIwIgeUIAQqAhQgAioCNCIIlJKSOAIQIAMgBSAEKgIolCAHIAQqAiCUIAggBCoCJJSSkjgCFCADIAUgBCoCOJQgByAEKgIwlCAIIAQqAjSUkpI4AhggAyAJIAYgARsgACoCTJI4AiALQQELIQEgAkHQAGokACABC8sCAgF/BH0jAEEwayICJAAgBEEzTARAIAJB0Ro2AiQgAkGrKDYCIEEBQd3JACACQSBqEI4BCyAAKAIEBEAgAkHRGjYCFCACQasoNgIQQQFBmTYgAkEQahCOAQsgASgCBEEERwRAIAJB0Ro2AgQgAkGrKDYCAEEBQdI2IAIQjgELIAMgATYCKCADIAA2AiQgASoCWCAAKAIYIgQqAgggASoCVJQgBCoCACABKgJMIgaUIAQqAgQgASoCUJSSkpMgACoCTJIiB0MAAAAAYARAIAMgBjgCECADIAEqAlA4AhQgAyABKgJUOAIYIAMgBCoCACABKgJMIAAqAkyUkzgCACADIAQqAgQgASoCUCAAKgJMlJM4AgQgBCoCCCEGIAAqAkwhCCABKgJUIQkgAyAHOAIgIAMgBiAJIAiUkzgCCEEBIQULIAJBMGokACAFC6UJAgd/AX0jAEEQayIKJAACQAJAAkACQAJAAkACQAJAAkACQCAARQ0AIAFFDQAgAkUNACADQQBKDQELIApB9Bg2AgQgCkGC0gA2AgBBAUH+wAAgChCOASADQQBMDQELIANBAXEhBgJAIANBAWsiCUUEQAwBCyADQX5xIQcDQCABIARBAXIiCEEFdGoqAgAgAiAIQQJ0aioCAJQgASAEQQV0aioCACACIARBAnRqKgIAlCALkpIhCyAEQQJqIQQgBUECaiIFIAdHDQALCyAAIAYEfSABIARBBXRqKgIAIAIgBEECdGoqAgCUIAuSBSALCzgCACADQQBMDQEgA0EBcSEGAkAgCUUEQEEAIQRDAAAAACELDAELIANBfnEhB0EAIQRDAAAAACELQQAhBQNAIAEgBEEBciIIQQV0aioCBCACIAhBAnRqKgIAlCABIARBBXRqKgIEIAIgBEECdGoqAgCUIAuSkiELIARBAmohBCAFQQJqIgUgB0cNAAsLIAAgBgR9IAEgBEEFdGoqAgQgAiAEQQJ0aioCAJQgC5IFIAsLOAIEIANBAEwNAiADQQFxIQYgCQ0DQQAhBEMAAAAAIQsMBAsgAEEANgIACyAAQQA2AgQLIABBADYCCAwCCyADQX5xIQdBACEEQwAAAAAhC0EAIQUDQCABIARBAXIiCEEFdGoqAgggAiAIQQJ0aioCAJQgASAEQQV0aioCCCACIARBAnRqKgIAlCALkpIhCyAEQQJqIQQgBUECaiIFIAdHDQALCyAAIAYEfSABIARBBXRqKgIIIAIgBEECdGoqAgCUIAuSBSALCzgCCCADQQBMDQAgA0EBcSEGAkAgCUUEQEEAIQRDAAAAACELDAELIANBfnEhB0EAIQRDAAAAACELQQAhBQNAIAEgBEEBciIIQQV0aioCECACIAhBAnRqKgIAlCABIARBBXRqKgIQIAIgBEECdGoqAgCUIAuSkiELIARBAmohBCAFQQJqIgUgB0cNAAsLIAAgBgR9IAEgBEEFdGoqAhAgAiAEQQJ0aioCAJQgC5IFIAsLOAIQIANBAEwNASADQQFxIQYCQCAJRQRAQQAhBEMAAAAAIQsMAQsgA0F+cSEHQQAhBEMAAAAAIQtBACEFA0AgASAEQQFyIghBBXRqKgIUIAIgCEECdGoqAgCUIAEgBEEFdGoqAhQgAiAEQQJ0aioCAJQgC5KSIQsgBEECaiEEIAVBAmoiBSAHRw0ACwsgACAGBH0gASAEQQV0aioCFCACIARBAnRqKgIAlCALkgUgCws4AhQgA0EATARAQwAAAAAhCwwDCyADQQFxIQYCQCAJRQRAQQAhBEMAAAAAIQsMAQsgA0F+cSEHQQAhBEMAAAAAIQtBACEFA0AgASAEQQFyIghBBXRqKgIYIAIgCEECdGoqAgCUIAEgBEEFdGoqAhggAiAEQQJ0aioCAJQgC5KSIQsgBEECaiEEIAVBAmoiBSAHRw0ACwsgBkUNAiABIARBBXRqKgIYIAIgBEECdGoqAgCUIAuSIQsMAgsgAEEANgIQCyAAQQA2AhRDAAAAACELCyAAIAs4AhggCkEQaiQAC/YJAgd/AX0jAEEQayIKJAACQAJAAkACQAJAAkACQAJAAkACQCAARQ0AIAFFDQAgAkUNACADQQBKDQELIApB9Bg2AgQgCkGQ0gA2AgBBAUH+wAAgChCOASADQQBMDQELIANBAXEhBgJAIANBAWsiCUUEQAwBCyADQX5xIQcDQCABIARBAXIiCEEFdGoqAgAgAiAIQQJ0aioCAJQgASAEQQV0aioCACACIARBAnRqKgIAlCALkpIhCyAEQQJqIQQgBUECaiIFIAdHDQALCyAAIAYEfSABIARBBXRqKgIAIAIgBEECdGoqAgCUIAuSBSALCyAAKgIAkjgCACADQQBMDQEgA0EBcSEGAkAgCUUEQEEAIQRDAAAAACELDAELIANBfnEhB0EAIQRDAAAAACELQQAhBQNAIAEgBEEBciIIQQV0aioCBCACIAhBAnRqKgIAlCABIARBBXRqKgIEIAIgBEECdGoqAgCUIAuSkiELIARBAmohBCAFQQJqIgUgB0cNAAsLIAAgBgR9IAEgBEEFdGoqAgQgAiAEQQJ0aioCAJQgC5IFIAsLIAAqAgSSOAIEIANBAEwNAiADQQFxIQYgCQ0DQQAhBEMAAAAAIQsMBAsgACAAKgIAQwAAAACSOAIACyAAIAAqAgRDAAAAAJI4AgQLIAAgACoCCEMAAAAAkjgCCAwCCyADQX5xIQdBACEEQwAAAAAhC0EAIQUDQCABIARBAXIiCEEFdGoqAgggAiAIQQJ0aioCAJQgASAEQQV0aioCCCACIARBAnRqKgIAlCALkpIhCyAEQQJqIQQgBUECaiIFIAdHDQALCyAAIAYEfSABIARBBXRqKgIIIAIgBEECdGoqAgCUIAuSBSALCyAAKgIIkjgCCCADQQBMDQAgA0EBcSEGAkAgCUUEQEEAIQRDAAAAACELDAELIANBfnEhB0EAIQRDAAAAACELQQAhBQNAIAEgBEEBciIIQQV0aioCECACIAhBAnRqKgIAlCABIARBBXRqKgIQIAIgBEECdGoqAgCUIAuSkiELIARBAmohBCAFQQJqIgUgB0cNAAsLIAAgBgR9IAEgBEEFdGoqAhAgAiAEQQJ0aioCAJQgC5IFIAsLIAAqAhCSOAIQIANBAEwNASADQQFxIQYCQCAJRQRAQQAhBEMAAAAAIQsMAQsgA0F+cSEHQQAhBEMAAAAAIQtBACEFA0AgASAEQQFyIghBBXRqKgIUIAIgCEECdGoqAgCUIAEgBEEFdGoqAhQgAiAEQQJ0aioCAJQgC5KSIQsgBEECaiEEIAVBAmoiBSAHRw0ACwsgACAGBH0gASAEQQV0aioCFCACIARBAnRqKgIAlCALkgUgCwsgACoCFJI4AhQgA0EATARAQwAAAAAhCwwDCyADQQFxIQYCQCAJRQRAQQAhBEMAAAAAIQsMAQsgA0F+cSEHQQAhBEMAAAAAIQtBACEFA0AgASAEQQFyIghBBXRqKgIYIAIgCEECdGoqAgCUIAEgBEEFdGoqAhggAiAEQQJ0aioCAJQgC5KSIQsgBEECaiEEIAVBAmoiBSAHRw0ACwsgBkUNAiABIARBBXRqKgIYIAIgBEECdGoqAgCUIAuSIQsMAgsgACAAKgIQQwAAAACSOAIQC0MAAAAAIQsgACAAKgIUQwAAAACSOAIUCyAAIAsgACoCGJI4AhggCkEQaiQAC8x2AjJ/GH0gASEZIAMhGEEAIQMjAEHwAWsiFSEQIBUkAAJAIAIiFkEATA0AIBZBA3EhASAWQQRPBEAgFkF8cSECA0AgGSAGQQJ0aigCACAGNgIQIBkgBkEBciIKQQJ0aigCACAKNgIQIBkgBkECciIKQQJ0aigCACAKNgIQIBkgBkEDciIKQQJ0aigCACAKNgIQIAZBBGohBiADQQRqIgMgAkcNAAsLIAFFDQADQCAZIAZBAnRqKAIAIAY2AhAgBkEBaiEGIAdBAWoiByABRw0ACwsgFSAEQQJ0IgZBHmpBcHFrIgciCiQAIAcgGCAGEOwDISUgBkEPaiEBQQAhAyAKIBZBMGxBHmpBcHFrIjEiCiQAAkAgFkEATA0AA0AgGSADQQJ0aigCACIGKgKwASE4IAYqAqgBITsgBioCrAEhPCAGKgLAASE9IAYqArgBIT8gBioCvAEhQCAxIANBMGxqIgcgBioC0AEiPiA+IAYqAowBIkKUIAYqAoQBIkcgBioCyAEiQZQgBioCzAEiQyAGKgKIASJIlJKSIkmUIEEgBioCbCJKID6UIEEgBioCZCJLlCBDIAYqAmgiTJSSkiJNlCBDIAYqAnwiTiA+lCAGKgJ0Ik8gQZQgQyAGKgJ4IkWUkpIiRpSSkjgCKCAHID4gQiA9lCBHID+UIEAgSJSSkiJElCBBIEogPZQgSyA/lCBAIEyUkpIiOpQgQyBOID2UIE8gP5QgQCBFlJKSIjmUkpI4AiQgByA+IEIgOJQgRyA7lCA8IEiUkpIiQpQgQSBKIDiUIEsgO5QgPCBMlJKSIj6UIEMgTiA4lCBPIDuUIDwgRZSSkiJBlJKSOAIgIAcgPSBJlCA/IE2UIEAgRpSSkjgCGCAHID0gRJQgPyA6lCBAIDmUkpI4AhQgByA9IEKUID8gPpQgQCBBlJKSOAIQIAcgOCBJlCA7IE2UIDwgRpSSkjgCCCAHIDggRJQgOyA6lCA8IDmUkpI4AgQgByA4IEKUIDsgPpQgPCBBlJKSOAIAIANBAWoiAyAWRw0ACyAWQQBMDQBBACEHA0AgGSAHQQJ0aigCACIGLQAYQQhxRQRAIAYgBioCICI4IAAqAhCUIAYqAogCkjgCiAIgBkGMAmoiAyA4IAAqAhSUIAMqAgCSOAIAIAZBkAJqIgYgOCAAKgIYlCAGKgIAkjgCAAsgB0EBaiIHIBZHDQALCyAKIARBA3RBHmpBcHFrIhwiBiQAIAYgAUEPakFwcWsiGCICJAACQCAEQQBMDQBBACEKA0AgJSAKQQJ0aigCACIGIBwgGkEDdGoiByAGKAIUKAIIEQAAAkACQCAHKAIAIgNBBksNACAHKAIEIgFBAEgNACABIANMDQELIBBB9Bg2AnQgEEHCzwA2AnBBAUGNOSAQQfAAahCOASAHKAIAIQMLAkAgA0EATARAQX8hBwwBCyAlIBpBAnRqIAY2AgAgGiIHQQFqIRoLIAYgBzYCECAKQQFqIgogBEcNAAsgGkEATA0AIBpBAXEhFwJAIBpBAWsiFUUEQEEAIQYMAQsgGkF+cSEBQQAhBkEAIQcDQCAcIAZBA3RqIgMoAgQiCiADKAIARgRAIBggBkECdGogCTYCACAJIApqIQkLIBwgBkEBciIKQQN0aiIDKAIEIgQgAygCAEYEQCAYIApBAnRqIAk2AgAgBCAJaiEJCyAGQQJqIQYgB0ECaiIHIAFHDQALCwJAIBdFDQAgHCAGQQN0aiIHKAIEIgMgBygCAEcNACAYIAZBAnRqIAk2AgAgAyAJaiEJCyAaQQBMBEAgCSEPDAELIBpBAXEhFwJAIBVFBEBBACEGIAkhDwwBCyAaQX5xIQFBACEGIAkhD0EAIQcDQAJAIBwgBkEDdGoiAygCBCIKQQBMDQAgCiADKAIAIgNODQAgGCAGQQJ0aiAPNgIAIAMgD2ohDwsCQCAcIAZBAXIiBEEDdGoiAygCBCIKQQBMDQAgCiADKAIAIgNODQAgGCAEQQJ0aiAPNgIAIAMgD2ohDwsgBkECaiEGIAdBAmoiByABRw0ACwsCQCAXRQ0AIBwgBkEDdGoiBygCBCIDQQBMDQAgAyAHKAIAIgdODQAgGCAGQQJ0aiAPNgIAIAcgD2ohDwsgGkEATA0AIBpBAXEhAQJAIBVFBEBBACEGDAELIBpBfnEhBEEAIQZBACEHA0AgHCAGQQN0aiIDKAIERQRAIBggBkECdGogDzYCACADKAIAIA9qIQ8LIBwgBkEBciIDQQN0aiIKKAIERQRAIBggA0ECdGogDzYCACAKKAIAIA9qIQ8LIAZBAmohBiAHQQJqIgcgBEcNAAsLIBpBAEohMiABRQ0AIBwgBkEDdGoiBygCBA0AIBggBkECdGogDzYCACAHKAIAIA9qIQ8LIAIgFkEFdCI1QRByayIjIgckACAjIBZBA3QiNhCGAgJAIA9BAEwNACAHIA9BAnQiNEEeakFwcSIGayIpIgckACAHIAZrIioiByQAIAcgBmsiGyIHJAAgByAGayIgIgckACAHIAZrIgYiByQAICkgDxCGAiAqIA8gACoCJBCHAiAbIA9DAACA/xCHAiAgIA9DAACAfxCHAiAGQf8BIDQQ7gMhIiAHIA9BBnQiBkEQcmsiKyIVJAAgKyAPQQR0IhcQhgIgEEMAAIA/IAWVIj44AsABIBBBCDYC2AEgECAAKgIgOALEASAGQQ9yIRECQCAyRQRAIBUgEUEPakFwcWsiJiIVJAAgJiAXEIYCDAELQQAhAQNAIBAgKyAYIAFBAnQiCmooAgAiB0EGdGoiAzYCyAEgECADQRBqNgLMASAcIAFBA3RqIgQoAgAhACAQICIgB0ECdCIGajYC7AEgECAGICBqNgLoASAQIAYgG2o2AuQBIBAgBiAqajYC4AEgECAGIClqNgLcASAQIAMgAEEFdGoiBjYC0AEgECAGQRBqNgLUASAKICVqKAIAIgYgEEHAAWogBigCFCgCDBEAAAJAIAQoAgAiA0EATA0AIANBAXEhAkEAIQYgA0EBRwRAIANBfnEhAEEAIQMDQCAiIAYgB2pBAnRqIgooAgAiBEEATgRAIAogBCAHajYCAAsgIiAGQQFyIAdqQQJ0aiIKKAIAIgRBAE4EQCAKIAQgB2o2AgALIAZBAmohBiADQQJqIgMgAEcNAAsLIAJFDQAgIiAGIAdqQQJ0aiIGKAIAIgNBAEgNACAGIAMgB2o2AgALIAFBAWoiASAaRw0ACyAVIBFBD2pBcHFrIiYiFSQAICYgFxCGAiAyRQ0AQQAhAANAICYgGCAAQQJ0IgNqKAIAQQZ0IgdqIQYgByAraiEHIAMgJWooAgAhASAcIABBA3RqKAIAIgRBAEwiAkUEQCAZIAEoAiAoAhAiA0ECdGooAgAqApQBITggMSADQTBsaiIDKgIoIT8gAyoCGCFAIAMqAgghQSADKgIkIUMgAyoCFCFCIAMqAgQhRyADKgIgIUggAyoCECFJIAMqAgAhSiAEIQMDQCAGIDggByoCAJQ4AgAgBiA4IAcqAgSUOAIEIAYgOCAHKgIIlDgCCCAGIAcqAhgiOyA/lCAHKgIQIjwgQZQgByoCFCI9IECUkpI4AhggBiA7IEOUIDwgR5QgPSBClJKSOAIUIAYgOyBIlCA8IEqUID0gSZSSkjgCECAGQSBqIQYgB0EgaiEHIANBAUshCiADQQFrIQMgCg0ACwsCQCABKAIsIgNFDQAgAg0AIDEgAygCECIKQTBsaiEDIBkgCkECdGooAgAqApQBITgDQCAGIDggByoCAJQ4AgAgBiA4IAcqAgSUOAIEIAYgOCAHKgIIlDgCCCAGIAcqAhgiOyADKgIglCAHKgIQIjwgAyoCAJQgByoCFCI9IAMqAhCUkpI4AhAgBiA7IAMqAiSUIDwgAyoCBJQgPSADKgIUlJKSOAIUIAYgOyADKgIolCA8IAMqAgiUID0gAyoCGJSSkjgCGCAGQSBqIQYgB0EgaiEHIARBAUshCiAEQQFrIQQgCg0ACwsgAEEBaiIAIBpHDQALCyAVQQEgD0EBa0EDckEBaiAPQQFMGyIkIA9sIgZBAnRBHmpBcHFrIgskACALIAYQhgIgFkEASgRAA0ACQCAZIC5BAnRqIiwoAgAoAhQiEUUNAANAIBEoAggiFUUNAQNAAkAgFSgCACgCECIGIBEoAgAoAhAiByAYIAdBAnRqKAIAIBggBkECdGooAgBIIgobIgNBf0YNACAHIAYgChsiB0F/Rg0AICwoAgAhBgJAAn8gJSAHQQJ0IgFqKAIAIgAoAiwiCiAlIANBAnQiF2ooAgAoAiwiAg0AGiAKIAIgBkcNABogEEH0GDYCZCAQQcLPADYCYEEBQerFACAQQeAAahCOASAAKAIsCw0AIAYgCkcNACAQQfQYNgJUIBBBws8ANgJQQQFBqMUAIBBB0ABqEI4BCyAcIAdBA3RqKAIAIQAgASAYaigCACEHIBcgGGooAgAhFyAcIANBA3RqKAIAIgRBAEogAEEASnFFBEAgEEH0GDYCRCAQQf8WNgJAQQFBxMAAIBBBQGsQjgEgBEUNASAARQ0BCyArIAdBBnRqIAYgCkYgAGxBBXRqIQEgJiAXQQZ0aiACIAZGIARsQQV0aiEKIAsgFyAkbEECdGogB0ECdGohByAkIABrIQIDQCAKKgIYITggCioCFCE7IAoqAhAhPCAKKgIIIT0gCioCBCE/IAoqAgAhQCABIQYgACEDA0AgByAHKgIAIDggBioCGJQgOyAGKgIUlCA8IAYqAhCUID0gBioCCJQgPyAGKgIElCBAIAYqAgCUkpKSkpKSOAIAIAZBIGohBiAHQQRqIQcgA0EBayIDDQALIApBIGohCiAHIAJBAnRqIQcgBEEBayIEDQALCyAVKAIIIhUNAAsgESgCCCIRDQALCyAuQQFqIi4gFkcNAAsLIDIEQCAkQQFqIQhBACEXA0AgKyAYIBdBAnQiLGooAgAiBkEGdCIHaiECIAcgJmohESALIAYgCGxBAnRqIQMCQCAcIBdBA3RqIi4oAgAiAUEATARAIBBB9Bg2AjQgEEHxFjYCMEEBQcTAACAQQTBqEI4BIAFFDQELICQgAWshFSARIQQgAyEHIAEhAANAIAQqAhghOCAEKgIUITsgBCoCECE8IAQqAgghPSAEKgIEIT8gBCoCACFAIAIhBiABIQoDQCAHIDggBioCGJQgOyAGKgIUlCA8IAYqAhCUID0gBioCCJQgPyAGKgIElCBAIAYqAgCUkpKSkpI4AgAgBkEgaiEGIAdBBGohByAKQQFrIgoNAAsgBEEgaiEEIAcgFUECdGohByAAQQFrIgANAAsLAkAgJSAsaigCACgCLEUNACAuKAIAIgBBAEwEQCAQQfQYNgIkIBBB/xY2AiBBAUHEwAAgEEEgahCOASAARQ0BCyACIABBBXQiBmohASAGIBFqIQogJCAAayECIAAhBANAIAoqAhghOCAKKgIUITsgCioCECE8IAoqAgghPSAKKgIEIT8gCioCACFAIAEhBiAAIQcDQCADIAMqAgAgOCAGKgIYlCA7IAYqAhSUIDwgBioCEJQgPSAGKgIIlCA/IAYqAgSUIEAgBioCAJSSkpKSkpI4AgAgBkEgaiEGIANBBGohAyAHQQFrIgcNAAsgCkEgaiEKIAMgAkECdGohAyAEQQFrIgQNAAsLIBdBAWoiFyAaRw0ACwsgD0EBcSEBICRBAWohBwJAIA9BAWsiJEUEQEEAIQYMAQsgD0F+cSEAQQAhBkEAIQMDQCALIAYgB2xBAnRqIgogKiAGQQJ0aioCACA+lCAKKgIAkjgCACALIAZBAXIiCiAHbEECdGoiBCAqIApBAnRqKgIAID6UIAQqAgCSOAIAIAZBAmohBiADQQJqIgMgAEcNAAsLIDVBD3IhAyABBEAgCyAGIAdsQQJ0aiIHICogBkECdGoqAgAgPpQgByoCAJI4AgALIDRBD2ohESALIANBD2pBcHFrIgEiBCQAIBZBAEoEQEEAIQoDQCABIApBBXRqIgMgGSAKQQJ0aigCACIGKgKIAiAGKgKUASI4lCA+IAYqAugBlJI4AgAgAyA4IAYqAowClCA+IAYqAuwBlJI4AgQgAyA4IAYqApAClCA+IAYqAvABlJI4AgggMSAKQTBsaiIHKgIoIT0gByoCICE/IAcqAiQhQCAHKgIYIUEgByoCECFDIAcqAhQhQiADIAYqAvgBID6UIAcqAgggBioCoAIiOJQgByoCACAGKgKYAiI7lCAHKgIEIAYqApwCIjyUkpKSOAIQIAMgBioC/AEgPpQgQSA4lCBDIDuUIDwgQpSSkpI4AhQgAyAGKgKAAiA+lCA9IDiUID8gO5QgPCBAlJKSkjgCGCAKQQFqIgogFkcNAAsLIAQgEUEPakFwcWsiACIsJAAgMgRAQQAhBANAIAAgGCAEQQJ0IgZqKAIAIgdBAnRqIQMgKyAHQQZ0aiECIAYgJWooAgAiFSgCICgCECEGAkAgHCAEQQN0aiIXKAIAIgpBAEwEQCAQQfQYNgIUIBBB/NIANgIQQQFBscEAIBBBEGoQjgEgCkUNAQsgASAGQQV0aiIGKgIYITggBioCFCE7IAYqAhAhPCAGKgIIIT0gBioCBCE/IAYqAgAhQCADIQcgAiEGA0AgByAGKgIYIDiUIAYqAhQgO5QgBioCECA8lCAGKgIIID2UIAYqAgQgP5QgBioCACBAlJKSkpKSOAIAIAZBIGohBiAHQQRqIQcgCkEBayIKDQALCwJAIBUoAiwiBkUNACAGKAIQIQogFygCACIHQQBMBEAgEEH0GDYCBCAQQYrTADYCAEEBQbHBACAQEI4BIAdFDQELIAIgB0EFdGohBiABIApBBXRqIgoqAhghOCAKKgIUITsgCioCECE8IAoqAgghPSAKKgIEIT8gCioCACFAA0AgAyADKgIAIAYqAhggOJQgBioCFCA7lCAGKgIQIDyUIAYqAgggPZQgBioCBCA/lCAGKgIAIECUkpKSkpKSOAIAIAZBIGohBiADQQRqIQMgB0EBayIHDQALCyAEQQFqIgQgGkcNAAsLIA9BAXEhAQJAICRFBEBBACEGDAELIA9BfnEhBEEAIQZBACEDA0AgACAGQQJ0IgdqIgogByApaioCACA+lCAKKgIAkzgCACAAIAdBBHIiB2oiCiAHIClqKgIAID6UIAoqAgCTOAIAIAZBAmohBiADQQJqIgMgBEcNAAsLIAEEQCAAIAZBAnQiBmoiByAGIClqKgIAID6UIAcqAgCTOAIACyAsIBFBD2pBcHEiBmsiAiIHJAAgByAGayIGJAAgDyEKIAIhESAAIQ8gBiEHQQAhFSMAQTBrIgghJyAIJAACQAJAIAsiA0UNACARRQ0AIABFDQAgBkUNACAbRQ0AICBFDQAgCUEASA0AIAkgCkoNACAKQQBKDQELICdBoM4ANgIgQQJB2d8AICdBIGoQjgELIApBAWsiJkEDckEBaiAKIApBAUobIR0CQCAJIApIBEAgCkEASgRAA0ACQCAbIBRBAnQiAWoqAgBDAAAAAF8EQCABICBqKgIAQwAAAABgDQELICdBhRk2AhQgJ0GgzgA2AhBBAUGyyAAgJ0EQahCOAQsgFEEBaiIUIApHDQALCyAIIApBAnQiFCAdbEEeakFwcWsiDCIIJAAgCCAUQR5qQXBxIgFrIgsiFCQAIBQgAWsiHSIUJAAgFCABayIUIggkACAIIAFrIg0iCCQAIAggAWsiDiIIJAAgCCABayITIggkACAIIAFrIi8iCCQAIAggAWsiACIIJAAgCCABayIoJABB1AAQjQQiCCADNgIQIAggCTYCCCAIIAo2AgAgCCAANgJIIAggLzYCRCAIICI2AkAgCCAoNgI8IAggFDYCOCAIIA42AjQgCCANNgIwIAggCzYCLCAIIAw2AiggCCAgNgIkIAggGzYCICAIIAc2AhwgCCAPNgIYIAggETYCFEEAIQMgCEEANgIMIAggCkEBa0EDckEBaiAKIApBAUobNgIEIBEgChCGAiAIIBM2AgwCQCAIKAIAIgBBAEwEQCAIQgA3AkwgCEHMAGohDAwBCyAAQQNxIQYgCCgCBCEJIABBBE8EQCAAQXxxIQtBACEBA0AgCCgCDCADQQJ0aiAIKAIQIAMgCWxBAnRqNgIAIAgoAgwgA0EBciIEQQJ0aiAIKAIQIAQgCWxBAnRqNgIAIAgoAgwgA0ECciIEQQJ0aiAIKAIQIAQgCWxBAnRqNgIAIAgoAgwgA0EDciIEQQJ0aiAIKAIQIAQgCWxBAnRqNgIAIANBBGohAyABQQRqIgEgC0cNAAsLIAYEQEEAIQEDQCAIKAIMIANBAnRqIAgoAhAgAyAJbEECdGo2AgAgA0EBaiEDIAFBAWoiASAGRw0ACwsgCEIANwJMIAhBzABqIQwgAEEATA0AIAgoAkQhCUEAIQMDQCAJIANBAnRqIAM2AgAgA0EBaiIDIAgoAgAiAEgNAAsLIAAgCCgCCCIJSgRAIAkhAwNAAkAgCCgCQCIBBEAgASADQQJ0aigCAEEATg0BCyAIKAIgIgYgA0ECdCIEaioCAEMAAID/XA0AIAgoAiQiCyAEaioCAEMAAIB/XA0AIAgoAgwgCCgCFCAIKAIYIAgoAhwgBiALIAgoAkQgCCgCPCABIAAgCSADIAgoAgRBABD1ASAIIAgoAghBAWoiCTYCCCAIKAIAIQALIANBAWoiAyAASA0ACwsgCUEASgRAQQAhAwNAIAgoAiggCCgCBCADbEECdGogCCgCDCADQQJ0aigCACADQQFqIglBAnQQ7AMaIAgoAggiACAJIgNKDQALIAgoAiggCCgCLCAAIAgoAgQQCCAIKAIUIAgoAhggCCgCCEECdBDsAxogCCgCKCAIKAIsIAgoAhQgCCgCCCAIKAIEEIwCIAgoAhwgCCgCCBCGAiAIKAIIIglBAEoEQCAIKAJIIQBBACEDA0AgACADQQJ0aiADNgIAIANBAWoiAyAIKAIIIglIDQALCyAMIAk2AgALAkAgCCgCQEUNACAIKAIAIgMgCUwNAEEAIQADQCAIKAJAIgEgA0EBayIDQQJ0aigCAEEATgRAIAgoAgwgCCgCFCAIKAIYIAgoAhwgCCgCICAIKAIkIAgoAkQgCCgCPCABIAgoAgAiCSADIAkgAEF/c2ogCCgCBEEBEPUBIAgoAgghCSAAQQFqIQALIAMgCUoNAAsLAkAgCCgCCCIGIApODQAgCkF8cSEpIApBA3EhNyAKQQBMISogCkEESSEsIAYhBANAAkAgIkUNACAVDQBBACEVICIgBEECdGooAgBBAEgNAAJAICoNAEEAIQNBACEBQQAhDCAsRQRAA0AgFCAvIAFBAnQiCWooAgBBAnRqIAkgEWoqAgA4AgAgFCAvIAlBBHIiC2ooAgBBAnRqIAsgEWoqAgA4AgAgFCAvIAlBCHIiC2ooAgBBAnRqIAsgEWoqAgA4AgAgFCAvIAlBDHIiCWooAgBBAnRqIAkgEWoqAgA4AgAgAUEEaiEBIAxBBGoiDCApRw0ACwsgN0UNAANAIBQgLyABQQJ0IglqKAIAQQJ0aiAJIBFqKgIAOAIAIAFBAWohASADQQFqIgMgN0cNAAsLIAQhAQNAICAgAUECdCIJaiEDIAkgG2oCfSAUIAkgImooAgBBAnRqKgIAIjlDAAAAAFsEQCADQQA2AgBDAAAAAAwBCyADIDkgAyoCAJSLIjk4AgAgOYwLOAIAQQEhFSABQQFqIgEgCkgNAAsLIAcgBEECdCIeaiIhIAgoAgwgHmooAgAgESAIKAJMEAcgCCgCTEECdCIBIAgoAgwgHmooAgBqIAEgEWogCCgCUBAHkiAPIB5qKgIAkyI5OAIAAkACQCAbIB5qIhcqAgBDAAAAAFwNACA5QwAAAABgRQ0AIAggCCgCUEEBajYCUCAeIChqQQA2AgAMAQsCQCAeICBqIiQqAgBDAAAAAFwNACA5QwAAAABfRQ0AIAggCCgCUEEBajYCUCAeIChqQQE2AgAMAQsCQCA5QwAAAABcBEAgESAeaiEtIBQgHmohLgNAQQAhCSAEIQNBAUF/IDlDAAAAAF8iExshNEEAIQtBACEOQQAhHwJAIAgiACgCTCIzQQBMDQAgCCgCDCADQQJ0aigCACEDAkAgCCgCCCINQQBMDQAgDUEDcSEwIAgoAjAhASANQQRPBEAgDUF8cSE1A0AgASALQQJ0IgxqIAMgDGoqAgA4AgAgASAMQQRyIhJqIAMgEmoqAgA4AgAgASAMQQhyIhJqIAMgEmoqAgA4AgAgASAMQQxyIgxqIAMgDGoqAgA4AgAgC0EEaiELIB9BBGoiHyA1Rw0ACwsgMEUNAANAIAEgC0ECdCIMaiADIAxqKgIAOAIAIAtBAWohCyAOQQFqIg4gMEcNAAsLAkAgDSAzTgRAIAAoAjAhCwwBCyAzIA1Bf3NqIRIgACgCMCELIAAoAkghASAzIA1rQQNxIh8EQEEAIQwDQCALIA1BAnQiDmogAyABIA5qKAIAQQJ0aioCADgCACANQQFqIQ0gDEEBaiIMIB9HDQALCyASQQNJDQADQCALIA1BAnQiDGogAyABIAxqKAIAQQJ0aioCADgCACALIAxBBGoiDmogAyABIA5qKAIAQQJ0aioCADgCACALIAxBCGoiDmogAyABIA5qKAIAQQJ0aioCADgCACALIAxBDGoiDGogAyABIAxqKAIAQQJ0aioCADgCACANQQRqIg0gM0cNAAsLIAAoAiggCyAzIAAoAgQQCQJAIAAoAkwiEkEASgRAAkAgEkEBcSEwIAAoAjQhDSAAKAIsIQEgACgCMCEMQQAhCyASQQFHBEAgEkF+cSEfQQAhDgNAIA0gC0ECdCIDaiADIAxqKgIAIAEgA2oqAgCUOAIAIA0gA0EEciIDaiADIAxqKgIAIAEgA2oqAgCUOAIAIAtBAmohCyAOQQJqIg4gH0cNAAsLIDAEQCANIAtBAnQiA2ogAyAMaioCACABIANqKgIAlDgCAAtBACEDIBJBAEwNACASQQNxIR8gACgCOCELIAAoAjQhDSASQQRPBEAgEkF8cSEwQQAhDANAIAsgA0ECdCIBaiABIA1qKgIAOAIAIAsgAUEEciIOaiANIA5qKgIAOAIAIAsgAUEIciIOaiANIA5qKgIAOAIAIAsgAUEMciIBaiABIA1qKgIAOAIAIANBBGohAyAMQQRqIgwgMEcNAAsLIB9FDQJBACEBA0AgCyADQQJ0IgxqIAwgDWoqAgA4AgAgA0EBaiEDIAFBAWoiASAfRw0ACwwCCwsgACgCOCELCyAAKAIoIAsgEiAAKAIEEAogACgCTCEOIDRBAEwEQCAOQQBMDQEgDkEDcSESIAAoAkghCyAAKAI4IQ1BACEMQQAhAyAOQQRPBEAgDkF8cSEAQQAhDgNAIB0gCyADQQJ0IgFqKAIAQQJ0aiABIA1qKgIAOAIAIB0gCyABQQRyIh9qKAIAQQJ0aiANIB9qKgIAOAIAIB0gCyABQQhyIh9qKAIAQQJ0aiANIB9qKgIAOAIAIB0gCyABQQxyIgFqKAIAQQJ0aiABIA1qKgIAOAIAIANBBGohAyAOQQRqIg4gAEcNAAsLIBJFDQEDQCAdIAsgA0ECdCIBaigCAEECdGogASANaioCADgCACADQQFqIQMgDEEBaiIMIBJHDQALDAELIA5BAEwNACAOQQFxIR8gACgCSCENIAAoAjghAUEAIQMgDkEBRwRAIA5BfnEhDkEAIQwDQCAdIA0gA0ECdCILaigCAEECdGogASALaioCAIw4AgAgHSANIAtBBHIiC2ooAgBBAnRqIAEgC2oqAgCMOAIAIANBAmohAyAMQQJqIgwgDkcNAAsLIB9FDQAgHSANIANBAnQiA2ooAgBBAnRqIAEgA2oqAgCMOAIACyAIKAJMIQEgCCgCUCIDQQBKBEADQCAIKAIMIAEgCWpBAnRqKAIAIB0gARAHITkgFCAIKAJMIgEgCWpBAnRqIDk4AgAgCUEBaiIJIAgoAlAiA0gNAAsLQwAAgD9DAACAvyATGyFFIAgoAgwgHmooAgAiACABQQJ0aiEMAkAgE0UEQCADQQBMDQEgA0EBcSESQQAhCSADQQFHBEAgA0F+cSEOQQAhAwNAIBQgASAJakECdGoiCyALKgIAIAwgCUECdGoqAgCTOAIAIBQgCUEBciILIAFqQQJ0aiINIA0qAgAgDCALQQJ0aioCAJM4AgAgCUECaiEJIANBAmoiAyAORw0ACwsgEkUNASAUIAEgCWpBAnRqIgMgAyoCACAMIAlBAnRqKgIAkzgCAAwBCyADQQBMDQAgA0EBcSESQQAhCSADQQFHBEAgA0F+cSEOQQAhAwNAIBQgASAJakECdGoiCyAMIAlBAnRqKgIAIAsqAgCSOAIAIBQgCUEBciILIAFqQQJ0aiINIAwgC0ECdGoqAgAgDSoCAJI4AgAgCUECaiEJIANBAmoiAyAORw0ACwsgEkUNACAUIAEgCWpBAnRqIgMgDCAJQQJ0aioCACADKgIAkjgCAAsgLiAAIB0gARAHIAgoAgwgHmooAgAgHmoqAgAgRZSSIkY4AgAgISoCAIwgRpUhOQJ/IBMEQEEBICQqAgAiOkMAAIB/XUUNARogOiAtKgIAkyBFlSI6IDkgOSA6XiIBGyE5QQNBASABGwwBC0EBIBcqAgAiOkMAAID/XkUNABogOiAtKgIAkyBFlSI6IDkgOSA6XiIBGyE5QQJBASABGwshE0EAIQAgCCgCTCEDQQAhCSAIKAJQIgxBAEoEQANAIBQgAyAJaiILQQJ0IgFqKgIAIToCQAJAIAEgKGooAgBFBEAgOkMAAAAAXQ0BDAILIDpDAAAAAF5FDQELIAEgG2oqAgBDAAAAAFsEQCABICBqKgIAQwAAAABbDQELIAEgB2oqAgCMIDqVIjogOV1FDQBBBCETIAshACA6ITkLIAlBAWoiCSAMRw0ACwsgBiIBIANIBEADQAJAIB0gAUECdCIJaioCACI6QwAAAABdRQ0AIAkgG2oqAgAiREMAAID/XkUNACBEIAkgEWoqAgCTIDqVIkQgOV1FDQBBBSETIAEhACBEITkLAkAgOkMAAAAAXkUNACAJICBqKgIAIkRDAACAf11FDQAgRCAJIBFqKgIAkyA6lSI6IDldRQ0AQQYhEyABIQAgOiE5CyABQQFqIgEgA0cNAAsLIDlDAAAAAF8EQCAnIDm7OQMAQQNBu9MAICcQjwEgBCAmTg0GIC0gCiAEayIUEIYCICEgFBCGAgwGCwJAIANBAEwNACADQQFxIRJBACEBIANBAUcEQCADQX5xIQ5BACELA0AgESABQQJ0IglqIg0gOSAJIB1qKgIAlCANKgIAkjgCACARIAlBBHIiCWoiDSA5IAkgHWoqAgCUIA0qAgCSOAIAIAFBAmohASALQQJqIgsgDkcNAAsLIBJFDQAgESABQQJ0IgFqIgkgOSABIB1qKgIAlCAJKgIAkjgCAAsgLSA5IEWUIC0qAgCSOAIAAkAgDEEATA0AIAxBAXEhEkEAIQEgDEEBRwRAIAxBfnEhDkEAIQkDQCAHIAEgA2pBAnQiC2oiDSA5IAsgFGoqAgCUIA0qAgCSOAIAIAcgAUEBciADakECdCILaiINIDkgCyAUaioCAJQgDSoCAJI4AgAgAUECaiEBIAlBAmoiCSAORw0ACwsgEkUNACAHIAEgA2pBAnQiAWoiCSA5IAEgFGoqAgCUIAkqAgCSOAIACyAhIDkgRpQgISoCAJI4AgACQAJAAkACQAJAAkACQCATQQFrDgYGAAECAwQFCyAtIBcqAgA4AgAgHiAoakEANgIAIAggDEEBajYCUAwJCyAtICQqAgA4AgAgHiAoakEBNgIAIAggDEEBajYCUAwICyAHIABBAnRqQQA2AgBBACENQQAhEyAIKAIMIgkgAEECdCILaigCACEDAkAgCCgCTCIOQQBKBEACQCAIKAIIIgtBAEwNACAIKAIwIQxBACEJIAtBBE8EQCALQXxxIR8DQCAMIAlBAnQiAWogASADaioCADgCACAMIAFBBHIiEmogAyASaioCADgCACAMIAFBCHIiEmogAyASaioCADgCACAMIAFBDHIiAWogASADaioCADgCACAJQQRqIQkgE0EEaiITIB9HDQALCyALQQNxIhNFDQADQCAMIAlBAnQiAWogASADaioCADgCACAJQQFqIQkgDUEBaiINIBNHDQALCwJAIAsgDk4EQCAIKAIwIQkMAQsgDiALQX9zaiESIAgoAjAhCSAIKAJIIQwgDiALa0EDcSITBEBBACEBA0AgCSALQQJ0Ig1qIAMgDCANaigCAEECdGoqAgA4AgAgC0EBaiELIAFBAWoiASATRw0ACwsgEkEDSQ0AA0AgCSALQQJ0IgFqIAMgASAMaigCAEECdGoqAgA4AgAgCSABQQRqIg1qIAMgDCANaigCAEECdGoqAgA4AgAgCSABQQhqIg1qIAMgDCANaigCAEECdGoqAgA4AgAgCSABQQxqIgFqIAMgASAMaigCAEECdGoqAgA4AgAgC0EEaiILIA5HDQALCyAIKAIoIAkgDiAIKAIEEAkCQAJAIAgoAkwiDkEASgRAIA5BAXEhEiAIKAI0IQsgCCgCLCEMIAgoAjAhAUEAIQkgDkEBRwRAIA5BfnEhE0EAIQ0DQCALIAlBAnQiA2ogASADaioCACADIAxqKgIAlDgCACALIANBBHIiA2ogASADaioCACADIAxqKgIAlDgCACAJQQJqIQkgDUECaiINIBNHDQALCyASBEAgCyAJQQJ0IgNqIAEgA2oqAgAgAyAMaioCAJQ4AgALQQAhAyAOQQBKDQELIAgoAjQhCQwBCyAOQQNxIRMgCCgCBCAObCELIAgoAighDCAIKAI0IQkgDkEETwRAIA5BfHEhEkEAIQEDQCAMIAMgC2pBAnRqIAkgA0ECdGoqAgA4AgAgDCALIANBAXIiDWpBAnRqIAkgDUECdGoqAgA4AgAgDCALIANBAnIiDWpBAnRqIAkgDUECdGoqAgA4AgAgDCALIANBA3IiDWpBAnRqIAkgDUECdGoqAgA4AgAgA0EEaiEDIAFBBGoiASASRw0ACwsgE0UNAEEAIQEDQCAMIAMgC2pBAnRqIAkgA0ECdGoqAgA4AgAgA0EBaiEDIAFBAWoiASATRw0ACwsgAEECdCIDIAgoAgxqKAIAIANqKgIAITkgCSAIKAIwIA4QByE6IAgoAiwgCCgCTCIOQQJ0akMAAIA/IDkgOpOVOAIAIAgoAgwhCQwBCyAIKAIsQwAAgD8gAyALaioCAJU4AgALIAkgCCgCFCAIKAIYIAgoAhwgCCgCICAIKAIkIAgoAkQgCCgCPCAIKAJAIAgoAgAgDiAAIAgoAgRBARD1ASAIKAJIIAgoAkwiA0ECdGogAzYCACAIIAgoAlBBAWs2AlAgCCAIKAJMQQFqNgJMICEqAgAhOQwECyARIABBAnQiAWogASAbaioCADgCACABIChqQQA2AgAgCCAAEPYBICEqAgAhOQwDCyARIABBAnQiAWogASAgaioCADgCACABIChqQQE2AgAgCCAAEPYBICEqAgAhOQwCCyATQQRIDQQgISoCACE5DAELCyAhQQA2AgAMAQsgCCgCTCIhQQBMDQAgCCgCDCAeaigCACEBAkAgCCgCCCIDQQBMDQAgA0EDcSEAIAgoAjAhDEEAIQ1BACEJIANBBE8EQCADQXxxIR5BACEOA0AgDCAJQQJ0IgtqIAEgC2oqAgA4AgAgDCALQQRyIhNqIAEgE2oqAgA4AgAgDCALQQhyIhNqIAEgE2oqAgA4AgAgDCALQQxyIgtqIAEgC2oqAgA4AgAgCUEEaiEJIA5BBGoiDiAeRw0ACwsgAEUNAANAIAwgCUECdCILaiABIAtqKgIAOAIAIAlBAWohCSANQQFqIg0gAEcNAAsLAkAgAyAhTgRAIAgoAjAhCQwBCyAhIANBf3NqIRMgCCgCMCEJIAgoAkghDEEAIQsgISADa0EDcSIOBEADQCAJIANBAnQiDWogASAMIA1qKAIAQQJ0aioCADgCACADQQFqIQMgC0EBaiILIA5HDQALCyATQQNJDQADQCAJIANBAnQiC2ogASALIAxqKAIAQQJ0aioCADgCACAJIAtBBGoiDWogASAMIA1qKAIAQQJ0aioCADgCACAJIAtBCGoiDWogASAMIA1qKAIAQQJ0aioCADgCACAJIAtBDGoiC2ogASALIAxqKAIAQQJ0aioCADgCACADQQRqIgMgIUcNAAsLIAgoAiggCSAhIAgoAgQQCSAIKAJMIgFBAEwNACABQQFxIRMgCCgCNCEDIAgoAiwhDCAIKAIwIQtBACEJIAFBAUcEQCABQX5xIQ5BACENA0AgAyAJQQJ0IgFqIAEgC2oqAgAgASAMaioCAJQ4AgAgAyABQQRyIgFqIAEgC2oqAgAgASAMaioCAJQ4AgAgCUECaiEJIA1BAmoiDSAORw0ACwsgE0UNACADIAlBAnQiAWogASALaioCACABIAxqKgIAlDgCAAtBACEDQQAhDUEAIQ4CQCAIKAJMIgFBAEoEQCAIKAIEIAFsIQsgCCgCKCEMIAgoAjQhCSABQQRPBEAgAUF8cSETA0AgDCADIAtqQQJ0aiAJIANBAnRqKgIAOAIAIAwgCyADQQFyIgBqQQJ0aiAJIABBAnRqKgIAOAIAIAwgCyADQQJyIgBqQQJ0aiAJIABBAnRqKgIAOAIAIAwgCyADQQNyIgBqQQJ0aiAJIABBAnRqKgIAOAIAIANBBGohAyAOQQRqIg4gE0cNAAsLIAFBA3EiAARAA0AgDCADIAtqQQJ0aiAJIANBAnRqKgIAOAIAIANBAWohAyANQQFqIg0gAEcNAAsLIARBAnQiAyAIKAIMaigCACADaioCACE5IAkgCCgCMCABEAchOiAIKAIsIAgoAkwiAUECdGpDAACAPyA5IDqTlTgCACAIKAIMIQMMAQsgCCgCLEMAAIA/IAgoAgwiAyAEQQJ0IglqKAIAIAlqKgIAlTgCAAsgAyAIKAIUIAgoAhggCCgCHCAIKAIgIAgoAiQgCCgCRCAIKAI8IAgoAkAgCCgCACABIAQgCCgCBEEBEPUBIAgoAkggCCgCTCIDQQJ0aiADNgIAIAggCCgCTEEBajYCTAsgBEEBaiIEIApHDQALC0EAISJBACEAIwAiAyEGIAMgCCgCACIbQQJ0IgRBHmpBcHFrIgMkACADIAgoAhQiByAEEOwDIQ8CQCAbQQBMDQAgG0EDcSEgIAgoAkQhEUEAIQMgG0EETwRAIBtBfHEhAQNAIAcgESADQQJ0IgpqKAIAQQJ0aiAKIA9qKgIAOAIAIAcgESAKQQRyIglqKAIAQQJ0aiAJIA9qKgIAOAIAIAcgESAKQQhyIglqKAIAQQJ0aiAJIA9qKgIAOAIAIAcgESAKQQxyIgpqKAIAQQJ0aiAKIA9qKgIAOAIAIANBBGohAyAAQQRqIgAgAUcNAAsLICAEQANAIAcgESADQQJ0IgpqKAIAQQJ0aiAKIA9qKgIAOAIAIANBAWohAyAiQQFqIiIgIEcNAAsLIA8gCCgCHCIHIAQQ7AMhDyAbQQBMDQAgG0EDcSEgIAgoAkQhEUEAISJBACEDIBtBBE8EQCAbQXxxIQFBACEAA0AgByARIANBAnQiCmooAgBBAnRqIAogD2oqAgA4AgAgByARIApBBHIiCWooAgBBAnRqIAkgD2oqAgA4AgAgByARIApBCHIiCWooAgBBAnRqIAkgD2oqAgA4AgAgByARIApBDHIiCmooAgBBAnRqIAogD2oqAgA4AgAgA0EEaiEDIABBBGoiACABRw0ACwsgIEUNAANAIAcgESADQQJ0IgpqKAIAQQJ0aiAKIA9qKgIAOAIAIANBAWohAyAiQQFqIiIgIEcNAAsLIAYkACAIEIoEDAELIAMgByAKIB0QCCADIAcgDyAKIB0QjAIgESAPIApBAnQQ7AMaIAcgChCGAgsgJ0EwaiQAIDJFDQBBACEDA0AgKyAYIANBAnQiBmooAgAiAEEGdGohCiAGICVqKAIAIgYoAiwhBCAGKAIgIQECQCAGKAI0IgcEQCAQQaABaiAKIAIgAEECdGoiACAcIANBA3RqIhUoAgAQ+AIgASgCECEGIAcgECoCoAEiODgCACAjIAZBBXRqIgYgOCAGKgIAkjgCACAHIBAqAqQBIjg4AgQgBiA4IAYqAgSSOAIEIAcgECoCqAEiODgCCCAGIDggBioCCJI4AgggByAQKgKwASI4OAIQIAYgOCAGKgIQkjgCECAHIBAqArQBIjg4AhQgBiA4IAYqAhSSOAIUIAcgECoCuAEiODgCGCAGIDggBioCGJI4AhggBEUNASAQQYABaiAKIBUoAgAiBkEFdGogACAGEPgCIAQoAhAhBiAHIBAqAoABIjg4AiAgIyAGQQV0aiIGIDggBioCAJI4AgAgByAQKgKEASI4OAIkIAYgOCAGKgIEkjgCBCAHIBAqAogBIjg4AiggBiA4IAYqAgiSOAIIIAcgECoCkAEiODgCMCAGIDggBioCEJI4AhAgByAQKgKUASI4OAI0IAYgOCAGKgIUkjgCFCAHIBAqApgBIjg4AjggBiA4IAYqAhiSOAIYDAELICMgASgCEEEFdGogCiACIABBAnRqIgYgHCADQQN0aiIHKAIAEPkCIARFDQAgIyAEKAIQQQV0aiAKIAcoAgAiB0EFdGogBiAHEPkCCyADQQFqIgMgGkcNAAsLAkAgFkEATA0AQQAhAwNAICMgA0EFdGoiBiAZIANBAnRqKAIAIgcqAogCIAYqAgCSOAIAIAZBBGoiCiAHKgKMAiAKKgIAkjgCACAGQQhqIgogByoCkAIgCioCAJI4AgAgBkEQaiIKIAcqApgCIAoqAgCSOAIAIAZBFGoiCiAHKgKcAiAKKgIAkjgCACAGQRhqIgYgByoCoAIgBioCAJI4AgAgA0EBaiIDIBZHDQALIBZBAEwNAEEBIDYgNkEBTBsiB0EBcSEAQQAhA0EAIQYgB0EETwRAIAdB+P///wdxIQFBACEKA0AgIyAGQQJ0IgdqIgQgBCoCACAFlDgCACAjIAdBBHJqIgQgBCoCACAFlDgCACAjIAdBCHJqIgQgBCoCACAFlDgCACAjIAdBDHJqIgcgByoCACAFlDgCACAGQQRqIQYgCkEEaiIKIAFHDQALCyAABEADQCAjIAZBAnRqIgcgByoCACAFlDgCACAGQQFqIQYgA0EBaiIDIABHDQALC0EAIQogFkEATA0AA0AgGSAKQQJ0aigCACIHIAcqApQBIjggIyAKQQV0aiIGKgIAlCAHKgLoAZI4AugBIAdB7AFqIgMgOCAGKgIElCADKgIAkjgCACAHQfABaiIDIDggBioCCJQgAyoCAJI4AgAgByAHKgL4ASAxIApBMGxqIgMqAgggBioCGJQgAyoCACAGKgIQlCADKgIEIAYqAhSUkpKSOAL4ASAHQfwBaiIEIAQqAgAgAyoCGCAGKgIYlCADKgIQIAYqAhCUIAMqAhQgBioCFJSSkpI4AgAgB0GAAmoiByAHKgIAIAMqAiggBioCGJQgAyoCICAGKgIQlCADKgIkIAYqAhSUkpKSOAIAIApBAWoiCiAWRw0AC0EAIQYgFkEATA0AA0AgGSAGQQJ0aigCACAFEPsCIAZBAWoiBiAWRw0ACyAWQQBMDQAgFkEDcSEAQQAhCkEAIQYgFkEETwRAIBZBfHEhAUEAIQQDQCAZIAZBAnQiB2ooAgAiA0IANwKIAiADQgA3AqACIANCADcCmAIgA0IANwKQAiAZIAdBBHJqKAIAIgNCADcCiAIgA0IANwKgAiADQgA3ApgCIANCADcCkAIgGSAHQQhyaigCACIDQgA3AogCIANCADcCoAIgA0IANwKYAiADQgA3ApACIBkgB0EMcmooAgAiB0IANwKIAiAHQgA3AqACIAdCADcCmAIgB0IANwKQAiAGQQRqIQYgBEEEaiIEIAFHDQALCyAARQ0AA0AgGSAGQQJ0aigCACIHQgA3AogCIAdCADcCoAIgB0IANwKYAiAHQgA3ApACIAZBAWohBiAKQQFqIgogAEcNAAsLIBBB8AFqJAALjQgCBX8GfSMAQUBqIgMkACAAIAEgACoC6AGUIAAqApgBkjgCmAEgAEGcAWoiAiABIAAqAuwBlCACKgIAkjgCACAAQaABaiICIAEgACoC8AGUIAIqAgCSOAIAAkAgACgCGCICQQFxBEAgAwJ9IAJBAnEEQCADIAAqAoACIgcgByAAKgKwAiIIlCAAKgKoAiIJIAAqAvgBIgqUIAAqAqwCIgsgACoC/AEiDJSSkiIHIAiUIgiTOAI4IAMgDCALIAeUIguTOAI0IAMgCiAJIAeUIgmTOAIwIAMgAUMAAAA/lCIBIAeUIgcQ6wM4AiAgAyALIAEgB4u7RC1DHOviNho/YwR9IAcgB5RDq6oqvpRDAACAP5IFIAcQ9gMgB5ULlCIHlDgCKCADIAkgB5Q4AiQgCCAHlAwBCyADIAFDAAAAP5QiASAAKgKAAiIIIAiUIAAqAvgBIgkgCZQgACoC/AEiCiAKlJKSkZQiBxDrAzgCICADIAogASAHi7tELUMc6+I2Gj9jBH0gByAHlEOrqiq+lEMAAIA/kgUgBxD2AyAHlQuUIgeUOAIoIAMgCSAHlDgCJCAIIAeUCzgCLCADQSBqIQQgAEHYAWohAiMAQRBrIgYkAAJAAkAgA0EQaiIFRQ0AIARFDQAgAg0BCyAGQabTADYCAEECQdnfACAGEI4BCyAFIAQqAgAgAioCAJQgAioCBCAEKgIElJMgBCoCCCACKgIIlJMgBCoCDCACKgIMlJM4AgAgBSAEKgIIIAIqAgyUIAQqAgAgAioCBJQgBCoCBCACKgIAlJKSIAQqAgwgAioCCJSTOAIEIAUgBCoCDCACKgIElCAEKgIAIAIqAgiUIAQqAgggAioCAJSSkiAEKgIEIAIqAgyUkzgCCCAFIAQqAgQgAioCCJQgBCoCACACKgIMlCAEKgIMIAIqAgCUkpIgBCoCCCACKgIElJM4AgwgBkEQaiQAIABB4AFqIgQgAykDGDcCACACIAMpAxA3AgAgAC0AGEECcUUNASADIANBMGogAhDvAiACIAEgAyoCAJQgAioCAJI4AgAgAEHcAWoiAiABIAMqAgSUIAIqAgCSOAIAIAQgASADKgIIlCAEKgIAkjgCACAAQeQBaiICIAEgAyoCDJQgAioCAJI4AgAMAQsgA0EwaiAAQfgBaiAAQdgBahDvAiAAIAEgAyoCMJQgACoC2AGSOALYASAAQdwBaiICIAEgAyoCNJQgAioCAJI4AgAgAEHgAWoiAiABIAMqAjiUIAIqAgCSOAIAIABB5AFqIgIgASADKgI8lCACKgIAkjgCAAsgAEHYAWoiAhDRAiAAQagBaiACEOcCIAAoAhwiAARAA0AgABA9IAAoAhQiAA0ACwsgA0FAayQAC6QKAg1/AX0jAEEgayIIIQwgCCQAAkAgACgCCCIFQQBMDQAgACgCACIHBEAgByEDA0ACQCADKAIYIgRBFHFBEEcNACADAn0CQCADKgK4AiADKgLwASIQIBCUIAMqAugBIhAgEJQgAyoC7AEiECAQlJKSXQ0AIAMqArwCIAMqAoACIhAgEJQgAyoC+AEiECAQlCADKgL8ASIQIBCUkpJdDQAgAyADKALMAkEBayIGNgLMAiADKgLIAiABkwwBCyADIAMoAsQCIgY2AswCIAMqAsACCyIQOALIAiAGQQBODQAgEEMAAAAAXUUNACADIARBBHI2AhgLIAMoAgQiAw0ACwsgCCAFQQJ0QR5qQXBxayIKIgMkACADIAAoAgwiBEECdEEeakFwcWsiCCIGJAAgBwRAIAchAwNAIANBADYCECADKAIEIgMNAAsLIAAoAgQiAwRAA0AgA0EANgIQIAMoAgQiAw0ACwsgBiAEIAUgBCAFSBtBAnRBHmpBcHFrIg0kAAJAIAdFDQADQAJAIAcoAhANACAHLQAYQQRxDQBBASEJIAdBATYCECAKIAc2AgBBACELQQAhBiAHIQNBACEFA0AgAygCFCIDBEADQAJAIAMoAgAiBCgCEA0AIARBATYCECAIIAZBAnRqIAQ2AgAgBkEBaiEGIAMoAgQiBEUNACAEKAIQDQAgBEEBNgIQIA0gBUECdGogBDYCACAFQQFqIQULIAMoAggiAw0ACwsgACgCCCAFSARAIAxByhk2AhQgDEHZEzYCEEEBQYk8IAxBEGoQjgELIAAoAgwgBUgEQCAMQcoZNgIEIAxB2RM2AgBBAUHZOiAMEI4BCyAFQQBKBEAgCiAJQQJ0aiANIAVBAWsiBUECdGooAgAiAzYCACALQQFqIQsgCUEBaiEJDAELCyAAIAogCSAIIAYgASACERsAQQAhDkEAIQMgC0EDTwRAIAlB/P///wdxIQ9BACELA0AgCiADQQJ0IgRqKAIAIgVBATYCECAFIAUoAhhBe3E2AhggCiAEQQRyaigCACIFQQE2AhAgBSAFKAIYQXtxNgIYIAogBEEIcmooAgAiBUEBNgIQIAUgBSgCGEF7cTYCGCAKIARBDHJqKAIAIgRBATYCECAEIAQoAhhBe3E2AhggA0EEaiEDIAtBBGoiCyAPRw0ACwsgCUEDcSIFBEADQCAKIANBAnRqKAIAIgRBATYCECAEIAQoAhhBe3E2AhggA0EBaiEDIA5BAWoiDiAFRw0ACwsgBkEATA0AQQAhBUEAIQMgBkEETwRAIAZBfHEhC0EAIQkDQCAIIANBAnQiBGooAgBBATYCECAIIARBBHJqKAIAQQE2AhAgCCAEQQhyaigCAEEBNgIQIAggBEEMcmooAgBBATYCECADQQRqIQMgCUEEaiIJIAtHDQALCyAGQQNxIgRFDQADQCAIIANBAnRqKAIAQQE2AhAgA0EBaiEDIAVBAWoiBSAERw0ACwsgBygCBCIHDQALIAAoAgAiA0UNAANAIAMoAhAhBAJAQQACfyADLQAYQQRxBEBBwi0gBA0BGgwCCyAEDQFB1y0LQQAQjgELIAMoAgQiAw0ACwsgACgCBCIDRQ0AA0ACQAJAAkACQCADKAIgIgQEQCAELQAYQQRxRQ0BCyADKAIsIgRFDQEgBC0AGEEEcQ0BCyADKAIQDQJB7y0hBAwBC0GRLiEEIAMoAhBFDQELQQAgBEEAEI4BCyADKAIEIgMNAAsLIAxBIGokAAsWACAAQgA3AiwgACAAKAIEQXNxNgIECxAAIABBADYCICAAQgA3AhgL1AEBBn8CQCAAKAIYIgFBAXENACABQX5xIgNFDQACQCADQQRrIgQoAgAiAkUNACACQQFrQf////8DcSEFIAMgAkEkbGohASACQQdxIgYEQEEAIQIDQCABQSRrIgEQ/wIgAkEBaiICIAZHDQALCyAFQQdJDQADQCABQSRrEP8CIAFByABrEP8CIAFB7ABrEP8CIAFBkAFrEP8CIAFBtAFrEP8CIAFB2AFrEP8CIAFB/AFrEP8CIAFBoAJrIgEQ/wIgASADRw0ACwsgBBCKBAsgAEIANwIcC8kSAgh/B30jAEEgayIGJAACQCABRQ0AIAAoAiAiA0EBRg0AIAEgACgCHCADIAAgASgCACgCFBEOAEUNAAJAAkACQCABKAIIIgNBAXEEQCAGQRhqIgQgACgCFDYCACAGIAApAgw3AxAgASAAKAIcIAAoAiAgAEECIAYqAhQgBioCEF4iAyAEKgIAIAZBEGogA0ECdHIqAgBeGyIFIAEoAgAoAhARDQAhCiAAKAIgRQ0BQQAhA0EAIQQDQCABIARBAnQiAiAAKAIcaigCACAFIAEoAgAoAgwRCgAgCl4EQCAAKAIcIgcgAmoiAigCACEIIAIgByADQQJ0aiIHKAIANgIAIAcgCDYCACADQQFqIQMLIARBAWoiBCAAKAIgIgJJDQALIANFDQIgAiADRw0DDAILAkAgA0ECcQRAIAAoAiAEQEEAIQMDQCAMIAEgACgCHCADQQJ0aigCACICQQAgASgCACgCDBEKAJIhDCALIAEgAkEBIAEoAgAoAgwRCgCSIQsgCiABIAJBAiABKAIAKAIMEQoAkiEKIANBAWoiAyAAKAIgIgJJDQALCyACRQRAQwAAAAAhCkMAAAAAIQtBACEDDAILIApDAACAPyACs5UiDpQhDyALIA6UIRAgDCAOlCEOQwAAAAAhC0MAAAAAIQoDQCABIAAoAhwgBEECdGooAgAiA0EAIAEoAgAoAgwRCgAgDpMiDCAMlCANkiENIAEgA0EBIAEoAgAoAgwRCgAgEJMiDCAMlCALkiELIAEgA0ECIAEoAgAoAgwRCgAgD5MiDCAMlCAKkiEKIARBAWoiBCAAKAIgIgNJDQALDAELIANBCHEEQEEAIQMgASAAKAIcIAAoAiAgAEEAIAEoAgAoAhARDQAhCiAAKAIgBEADQCABIARBAnQiBSAAKAIcaigCAEEAIAEoAgAoAgwRCgAgCl4EQCAAKAIcIgcgBWoiBSgCACEIIAUgByACQQJ0aiIHKAIANgIAIAcgCDYCACACQQFqIQILIARBAWoiBCAAKAIgIgVJDQALIAKzIQwLIAWzIQ0gASAAKAIcIAUgAEEBIAEoAgAoAhARDQAhCgJAIAAoAiBFBEBBACECDAELQQAhBANAIAEgBEECdCICIAAoAhxqKAIAQQEgASgCACgCDBEKACAKXgRAIAAoAhwiBSACaiICKAIAIQcgAiAFIANBAnRqIgUoAgA2AgAgBSAHNgIAIANBAWohAwsgBEEBaiIEIAAoAiAiAkkNAAsgA7MhCwsgDCANlSEMIAsgArOVIQsgASAAKAIcIAIgAEECIAEoAgAoAhARDQAhCkEAIQMCfSAAKAIgRQRAQQAhBUMAAAAADAELQQAhAkEAIQQDQCABIARBAnQiBSAAKAIcaigCAEECIAEoAgAoAgwRCgAgCl4EQCAAKAIcIgcgBWoiBSgCACEIIAUgByACQQJ0aiIHKAIANgIAIAcgCDYCACACQQFqIQILIARBAWoiBCAAKAIgIgVJDQALIAKzCyENIAYgDEMAAAC/kiIKIAqUIgo4AhAgBiALQwAAAL+SIgsgC5QiCzgCFCABIAAoAhwgBSAAQQIgCiALXiIEIAZBEGogBEECdGoqAgAgDSAFs5VDAAAAv5IiCiAKlF4bIgcgASgCACgCEBENACEKIAAoAiBFDQJBACEEA0AgASAEQQJ0IgIgACgCHGooAgAgByABKAIAKAIMEQoAIApeBEAgACgCHCIFIAJqIgIoAgAhCCACIAUgA0ECdGoiBSgCADYCACAFIAg2AgAgA0EBaiEDCyAEQQFqIgQgACgCICICSQ0ACyADRQ0DIAIgA0YNAwwECyADQQRxBEAgBiAAKAIUNgIYIAYgACkCDDcDECAGQeDoACgCADYCCCAGQdjoACkCADcDAEEBIQIgBioCECILIAYqAhQiCl0EQCAGQgE3AwBBASEEQQAhAiALIQoLAn8gCiAGKgIYIgtdRQRAQQIhAyAKIQsgAgwBCyAGIAI2AgggBkECNgIEIAIhA0ECCyEFAkAgBkEQaiAEQQJ0cioCACIKIAtdRQRAIAQhAiALIQogBSEEDAELIAYgBDYCBCAGIAU2AgAgBSECCwJAIAogBkEQaiADQQJ0aioCACILXUUEQCADIQUgCiELIAQhAwwBCyAGIAQ2AgggBiADNgIEIAQhBQsCQCAGQRBqIAJBAnRqKgIAIgogC11FBEAgCyEKIAMhAgwBCyAGIAI2AgQgBiADNgIACyAGQRBqIAVBAnRqKgIAIApeBEAgBiACNgIIIAYgBTYCBAsgACgCICECA0AgASAAKAIcIAIgACAGIAlBAnRqKAIAIgUgASgCACgCEBENACEKQQAhA0EAIQRBACECIAAoAiAEQANAIAEgBEECdCICIAAoAhxqKAIAIAUgASgCACgCDBEKACAKXgRAIAAoAhwiByACaiICKAIAIQggAiAHIANBAnRqIgcoAgA2AgAgByAINgIAIANBAWohAwsgBEEBaiIEIAAoAiAiAkkNAAsLIAkgA0UgAiADRnIiBGoiCUEDR0EAIAQbDQALIAQNAwwECyADQRBxRQ0EIAAoAiBBAXYhAwwDCyAGQwAAgD8gA0EBa7OVIgwgDZQiDTgCECAGIAwgC5QiCzgCFCABIAAoAhwgAyAAQQIgCyANXiIEIAZBEGogBEECdGoqAgAgDCAKlF0bIgUgASgCACgCEBENACEKIAAoAiBFDQBBACEDQQAhBANAIAEgBEECdCICIAAoAhxqKAIAIAUgASgCACgCDBEKACAKXgRAIAAoAhwiByACaiICKAIAIQggAiAHIANBAnRqIgcoAgA2AgAgByAINgIAIANBAWohAwsgBEEBaiIEIAAoAiAiAkkNAAsgA0UNASACIANGDQEMAgtBACECCyABKAIEQQFHDQEgASABKAIYQQFqNgIYIAJBAXYhAwsCQCABKAIQIgQEQCAAIAEoAhQiAkEkbCAEakEka0EBciIENgIYDAELQcwAEI0EIgJBAjYCACACQQRqIgQQ/gIgAkEoahD+AiAAIAQ2AhggASgCFCECCyABIAJBAmo2AhQgACgCHCECIARBfnEiASADNgIgIAEgAjYCHCABQSRqQQAgARsiASAAKAIcIANBAnRqNgIcIAEgACgCICADazYCIAsgBkEgaiQAC3EBAX8gASAAKAIcIAAoAiAgACABKAIAKAIIEQ4AGiAAIAEQgAMgACgCGEF+cSIABEADQCAAIAEQgQMgASAAQUBrKAIAIAAoAkQgAEEkaiICIAEoAgAoAggRDgAaIAIgARCAAyAAKAI8QX5xIgANAAsLC60DAQZ/IAAoAigiAwRAAkAgA0EEayIFKAIAIgJFDQAgAkEBa0H/////A3EhBiADIAJBJGxqIQEgAkEHcSIEBEBBACECA0AgAUEkayIBEP8CIAJBAWoiAiAERw0ACwsgBkEHSQ0AA0AgAUEkaxD/AiABQcgAaxD/AiABQewAaxD/AiABQZABaxD/AiABQbQBaxD/AiABQdgBaxD/AiABQfwBaxD/AiABQaACayIBEP8CIAEgA0cNAAsLIAUQigQgAEEANgIoCyAAKAIkIgEEQCABEIoEIABBADYCJAsCQCAAKAIYIgFBAXENACABQX5xIgRFDQACQCAEQQRrIgUoAgAiAkUNACACQQFrQf////8DcSEGIAQgAkEkbGohASACQQdxIgMEQEEAIQIDQCABQSRrIgEQ/wIgAkEBaiICIANHDQALCyAGQQdJDQADQCABQSRrEP8CIAFByABrEP8CIAFB7ABrEP8CIAFBkAFrEP8CIAFBtAFrEP8CIAFB2AFrEP8CIAFB/AFrEP8CIAFBoAJrIgEQ/wIgASAERw0ACwsgBRCKBAsgAEIANwIcIAALRgEBfyAAQezoADYCACAAKAIMIgEEQCABEIIDEIoEIABBADYCDAsgACgCECIBBEAgASABKAIAKAIEEQEAIABBADYCEAsgAAs7AQF/IAAoAgwiAQRAIAEQggMQigQgAEEANgIMCyAAKAIQIgEEQCABIAEoAgAoAgQRAQAgAEEANgIQCwsbAQF/IAAoAhAiASAAKAIEIAEoAgAoAgwRBwALGwAgAEEANgIMIABCADcCBCAAQaTpADYCACAACw8AIAAgACgCBEFzcTYCBAsHACAAENsDCw0AIAAQ2wMaIAAQigQLFQAgAEGU6gA2AgAgABCEAyAAEIMDCw0AIAAQigMaIAAQigQL0AwDC38Bfgh8IwBBIGsiByQAAkAgASgCACICRQ0AAkAgAigCAEUNACACKAIERQ0AIAIoAghBAEcgAigCDEEAR3EhBAsgBEUNACABKAIEQQFHDQBBACEEIAEoAgAiAigCACIDBEAgAigCFCEGIAIoAhAhBSACKAIIIQgCQCACLQAYBEBBACECA0ACQAJAIAYgCCACIAVsaiIJKAIAbCIKIAkoAgQgBmwiC0YNACAJKAIIIAZsIgkgCkYNACAJIAtHDQELIARBAWohBAsgAkEBaiICIANHDQALDAELIAIoAgwiAiAIIAUgA0EBa2xqIgkoAgAgBmxqIgQrAwAhDiAEKwMIIQ8gBCsDECEQIAIgCSgCBCAGbGoiBCsDACERIAQrAwghEiAEKwMQIRMgAiAJKAIIIAZsaiICKwMAIRQgAisDCCEVQaCzASACKwMQtjgCAEGcswEgFbY4AgBBmLMBIBS2OAIAQZSzASATtjgCAEGQswEgErY4AgBBjLMBIBG2OAIAQYizASAQtjgCAEGEswEgD7Y4AgBBgLMBIA62OAIACwsgABCEAyAAIAEoAgAiCTYCBCAJKAIAIgJBAUYEQCAAIAAoAghBBHI2AghBASEJDAELQTAQjQQiBEIANwIYIARCADcCKCAEQgA3AiAgACAENgIMQQAhCSAHQQA2AhggB0IANwIQIAdBvO8ANgIAIAcgASgCADYCHCABKQIEIQ0gByACNgIMIAcgDTcCBEEAIQUCQCAHRQ0AIAcoAgxFDQAgBCgCKCIIBEACQCAIQQRrIgUoAgAiA0UNACADQQFrQf////8DcSEGIAggA0EkbGohAiADQQdxIgsEQEEAIQMDQCACQSRrIgIQ/wIgA0EBaiIDIAtHDQALCyAGQQdJDQADQCACQSRrEP8CIAJByABrEP8CIAJB7ABrEP8CIAJBkAFrEP8CIAJBtAFrEP8CIAJB2AFrEP8CIAJB/AFrEP8CIAJBoAJrIgIQ/wIgAiAIRw0ACwsgBRCKBCAEQQA2AigLIAQoAiQiAgRAIAIQigQgBEEANgIkCyAHQgE3AhQgBEF/IAcoAgwiCkECdCAKQf////8DSxsQjQQiAzYCJAJAIApFDQAgCkEHcSEGQQAhCEEAIQIgCkEITwRAIApBeHEhDEEAIQsDQCADIAJBAnRqIAI2AgAgAyACQQFyIgVBAnRqIAU2AgAgAyACQQJyIgVBAnRqIAU2AgAgAyACQQNyIgVBAnRqIAU2AgAgAyACQQRyIgVBAnRqIAU2AgAgAyACQQVyIgVBAnRqIAU2AgAgAyACQQZyIgVBAnRqIAU2AgAgAyACQQdyIgVBAnRqIAU2AgAgAkEIaiECIAtBCGoiCyAMRw0ACwsgBkUNAANAIAMgAkECdGogAjYCACACQQFqIQIgCEEBaiIIIAZHDQALCyAEIAo2AiAgBCADNgIcQQEhBSAHKAIEQQFGBEBBf0F/IApBAXRBAWsiAq1CJH4iDaciA0EEaiIIIAMgCEsbIA1CIIinGxCNBCIDIAI2AgAgA0EEaiIGIAJBJGxqIQsgCkEDdEEIayIMQQJ2QQZxQQFyIQhBACEDIAYhAgNAIAIQ/gIgAkEkaiECIANBAWoiAyAIRw0ACyAMQRxPBEADQCACEP4CIAJBJGoQ/gIgAkHIAGoQ/gIgAkHsAGoQ/gIgAkGQAWoQ/gIgAkG0AWoQ/gIgAkHYAWoQ/gIgAkH8AWoQ/gIgAkGgAmoiAiALRw0ACwsgBCAGNgIoIAcgBjYCEAsgBCAHEIEDIAQgBygCFDYCLAsgBUUNACABLQAMIQYgAS0ADSEEIAAiAigCECIDBEAgAyADKAIAKAIEEQEAIAJBADYCEAsgAiACKAIIQXxxQQJBACAGG3IgBHI2AgggAgJ/IAYEQCAEBEBBJBCNBCICQgA3AgQgAkHo6wA2AgAgAgwCC0EMEI0EIgJCADcCBCACQajrADYCACACDAELIAQEQEEkEI0EIgJCADcCBCACQcjrADYCACACDAELQQwQjQQiAkIANwIEIAJBiOsANgIAIAILNgIQIAAoAhAiAiAAKAIMIAIoAgAoAggRBwBFDQBBASEJIAEtAA4NACAAKAIMIgFFDQAgARCCAxCKBCAAQQA2AgwLIAdBIGokACAJCx0AIAAoAhAiAEUEQEEADwsgACAAKAIAKAIUEQIACxQAQdPgAEEAIAAoAgRBA3FBAkYbC9E3Awd/On0DfkH8pAEgAjYCAEGApQEgAigCBCIENgIAAkAgBEUNACMAQcABayIEJABBoKUBQgA3AgBB+KQBQfikASgCAEFzcTYCAEGspgEgASkCDDcCAEG0pgEgASgCFDYCACAEQUBrIAFBGGoQ5AMgBCAEKQJ4NwO4ASAEQbABaiIFIAQpAnA3AwAgBCAEKQJoNwOoASAEIAQpAmA3A6ABIAQgBCkCWDcDmAEgBCAEKQJQNwOQASAEIAQpAkg3A4gBIAQgBCkCQDcDgAEgBSABKgIAOAIAIAQgASoCBDgCtAEgBCABKgIIOAK4ASAEQUBrIARBgAFqEOUDAkAgAwRAIAQgAxDlAyADKgIcIR8gAyoCGCEjIAMqAhQhJyADKgIsISggAyoCKCEpIAMqAiQhKiADKgI8ISsgAyoCOCEsIAMqAjQhLSADKgIQIS4gAyoCICEvIAMqAjAhMCAEKgKcASExIAQqApgBITIgBCoClAEhMyAEKgKsASE0IAQqAqgBITUgBCoCpAEhNiAEKgI0IQ0gBCoCJCEPIAQqAhQhESAEKgK8ASEkIAQqAjghDiAEKgIoIQwgBCoCtAEhNyAEKgIYIRcgBCoCdCESIAQqAmQhFCAEKgJUIQsgBCoCjAEhOCAEKgKIASE5IAQqAoABITogBCoChAEhOyAEKgKQASE8IAQqAqABIT0gBCoCMCEYIAQqAiAhECAEKgIAIRMgBCoCECEVIAQqAgQhFiAEKgK4ASE+IAQqArABIT8gBCoCCCEaIAQqAnAhGSAEKgJgIRsgBCoCQCEiIAQqAlAhICAEKgJEISFB1KUBIAMqAgwiHCAEKgJ4IkCUIAMqAggiJSAEKgJoIkGUIAMqAgAiJiAEKgJIIkKUIAMqAgQiRCAEKgJYIkOUkpKSIh44AgBB0KUBIBwgEpQgJSAUlCAmICGUIEQgC5SSkpIiHTgCAEHMpQEgHCAZlCAlIBuUICYgIpQgRCAglJKSkiIcOAIAQaimASAkIA6UID4gDJQgPyAalCAXIDeUkpKSIiU4AgBBpKYBICQgDZQgPiAPlCA/IBaUIBEgN5SSkpIiJjgCAEGgpgEgJCAYlCA+IBCUID8gE5QgFSA3lJKSkiIkOAIAQZCmASA0IA6UIDUgDJQgPSAalCAXIDaUkpKSOAIAQYymASA0IA2UIDUgD5QgPSAWlCARIDaUkpKSOAIAQYimASA0IBiUIDUgEJQgPSATlCAVIDaUkpKSOAIAQYSmASAxIA6UIDIgDJQgPCAalCAXIDOUkpKSOAIAQYCmASAxIA2UIDIgD5QgPCAWlCARIDOUkpKSOAIAQfylASAxIBiUIDIgEJQgPCATlCAVIDOUkpKSOAIAQfilASA4IA6UIDkgDJQgOiAalCA7IBeUkpKSOAIAQfSlASA4IA2UIDkgD5QgOiAWlCA7IBGUkpKSOAIAQfClASA4IBiUIDkgEJQgOiATlCA7IBWUkpKSOAIAQZymASArIECUICwgQZQgMCBClCBDIC2UkpKSIhc4AgBBmKYBICsgEpQgLCAUlCAwICGUIAsgLZSSkpIiGDgCAEGUpgEgKyAZlCAsIBuUIDAgIpQgICAtlJKSkiIQOAIAQeylASAoIECUICkgQZQgLyBClCBDICqUkpKSIhM4AgBB6KUBICggEpQgKSAUlCAvICGUIAsgKpSSkpIiDTgCAEHkpQEgKCAZlCApIBuUIC8gIpQgICAqlJKSkiIPOAIAQeClASAfIECUICMgQZQgLiBClCBDICeUkpKSIhE4AgBB3KUBIB8gEpQgIyAUlCAuICGUIAsgJ5SSkpIiDjgCAEHYpQEgHyAZlCAjIBuUIC4gIpQgICAnlJKSkiIMOAIADAELIAQqAlQhDiAEKgJYIREgBCoCZCENIAQqAkAhHCAEKgJEIR0gBCoCSCEeIAQqAlAhDCAEKgJgIQ9B7KUBIAQqAmgiEzgCAEHopQEgDTgCAEHkpQEgDzgCAEHgpQEgETgCAEHcpQEgDjgCAEHYpQEgDDgCAEHUpQEgHjgCAEHQpQEgHTgCAEHMpQEgHDgCAEGUpgEgBCoCcCIQOAIAQZimASAEKgJ0Ihg4AgBBnKYBIAQqAngiFzgCACAEKQKkASFFIAQpApQBIUYgBCoCiAEhEiAEKQOAASFHIAQqAqABIRRB/KUBIAQqApABOAIAQYCmASBGNwIAQYimASAUOAIAQYymASBFNwIAQfClASBHNwIAQfilASASOAIAQaCmASAEKgKwASIkOAIAQaSmASAEKgK0ASImOAIAQaimASAEKgK4ASIlOAIAC0GEpQEgADYCAAJAAkBB/KQBKAIAIgVFBEBB+KQBKAIAIQMMAQtB+KQBKAIAIQMgBS0ACEEEcUUNACADQRBxDQAgACgCBARAIABBADYCBAtBgKUBKAIAIgUoAgghBwJAIAUtABhFBEBBgLMBIAUoAgwiASAFKAIUIgUgBygCAGxqIggrAwC2IhI4AgBBgLMBIQZBhLMBIAgrAwi2Igs4AgBBiLMBIAgrAxC2IhQ4AgBBjLMBIAEgBSAHKAIEbGoiCCsDALY4AgBBkLMBIAgrAwi2OAIAQZSzASAIKwMQtjgCAEGYswEgASAFIAcoAghsaiIFKwMAtjgCAEGcswEgBSsDCLY4AgBBoLMBIAUrAxC2OAIAQZizASEFQYyzASEBDAELIAUoAgwiBiAFKAIUIgggBygCCGxqIQUgBiAHKAIEIAhsaiEBIAYgCCAHKAIAbGoiBioCCCEUIAYqAgQhCyAGKgIAIRILQYCnASAUIA+UIAsgDJQgEiAclCAQkpKSIhI4AgBBhKcBIBQgDZQgCyAOlCAGKgIAIgsgHZQgGJKSkiIVOAIAQYinASAUIBOUIAYqAgQgEZQgCyAelCAXkpKSIhk4AgBBjKcBIAEqAggiCyAPlCABKgIEIhYgDJQgASoCACAclCAQkpKSIhQ4AgBBkKcBIAsgDZQgFiAOlCABKgIAIhogHZQgGJKSkiIWOAIAQZSnASALIBOUIAEqAgQgEZQgGiAelCAXkpKSIhs4AgBBmKcBIAUqAggiCyAPlCAFKgIEIhogDJQgBSoCACAclCAQkpKSIg84AgBBnKcBIAsgDZQgGiAOlCAFKgIAIg4gHZQgGJKSkiINOAIAQaCnASALIBOUIAUqAgQgEZQgDiAelCAXkpKSIg44AgBBASEFQaSlAUGkpQEoAgBBAWo2AgBBrKYBKgIAIhEgEiAPIA8gEl4bIBQgDyAPIBReGyASIBRdG10NASARjCIMIBIgDyAPIBJdGyAUIA8gDyAUXRsgEiAUXhteDQFBsKYBKgIAIhcgFSANIA0gFV4bIBYgDSANIBZeGyAVIBZdG10NASAXjCILIBUgDSANIBVdGyAWIA0gDSAWXRsgFSAWXhteDQFBtKYBKgIAIhggGSAOIA4gGV4bIBsgDiAOIBteGyAZIBtdG10NASAYjCIQIBkgDiAOIBldGyAbIA4gDiAbXRsgGSAbXhteDQEgFiAVkyIhIA4gG5MiHZQgDSAWkyIcIBsgGZMiIJSTIhOMIBKUIBUgICAPIBSTIh+UIB0gFCASkyIelJMiGpSTIB4gHJQgHyAhlJMiIiAZlJMiIyAiIBAgGCAiQwAAAABeIgEblCATIAwgESATQwAAAABeIgYblCAaIAsgFyAaQwAAAABeIgcblJKSkkMAAAAAXg0BICMgIiAYIBAgARuUIBMgESAMIAYblCAaIBcgCyAHG5SSkpJDAAAAAGBFDQEgIIsiEyAXlCAhiyIaIBiUkiIQICAgDZQgDiAhjCILlJIiDCAgIBWUIBkgC5SSIgsgCyAMXiIBG10NASAQjCALIAwgARteDQEgEyARlCAeiyITIBiUkiIQIB4gDpQgDyAgjCILlJIiDCAeIBmUIBIgC5SSIgsgCyAMXiIBG10NASAQjCALIAwgARteDQEgGiARlCATIBeUkiIQICEgD5QgDSAejCILlJIiDCAhIBSUIBYgC5SSIgsgCyAMXiIBG10NASAQjCALIAwgARteDQEgHYsiEyAXlCAciyIaIBiUkiIQIB0gDZQgDiAclJMiDCAdIBWUIBkgHJSTIgsgCyAMXiIBG10NASAQjCALIAwgARteDQEgEyARlCAfiyITIBiUkiIQIB8gDpQgDyAdlJMiDCAfIBmUIBIgHZSTIgsgCyAMXiIBG10NASAQjCALIAwgARteDQEgGiARlCATIBeUkiIQIBwgFJQgFiAflJMiDCAcIBKUIBUgH5STIgsgCyAMXiIBG10NASAQjCALIAwgARteDQEgGSAOkyIOIBaUIBsgFSANkyIMlJMiCyAOIBWUIBkgDJSTIhAgCyAQXSIBGyAOiyIVIBeUIAyLIhogGJSSIhNeDQEgE4wgECALIAEbXg0BIBIgD5MiCyAblCAUIA6UkyIQIAsgGZQgEiAOlJMiDiAOIBBeIgEbIBUgEZQgC4siEyAYlJIiEl4NASASjCAOIBAgARteDQEgGiARlCATIBeUkiIRIAwgD5QgDSALlJMiDSAMIBSUIBYgC5STIg8gDSAPXSIBG11Bf3MgEYwgDyANIAEbXkVxRQ0BQfikASADQQRyNgIAQQAhASAAKAIARQRAIAAQ4wMgACgCBCEBCyAAIAFBAWo2AgQgACgCCCABQQJ0akEANgIADAELAkACQCADQQJxBEAgA0EBcQRAIAAoAgRFDQMgACgCCCIKKAIAIQggAEEANgIEQYClASgCACIFKAIIIAggBSgCEGxqIQcCQCAFLQAYRQRAQYCzASAFKAIMIgEgBSgCFCIFIAcoAgBsaiIJKwMAtiISOAIAQYCzASEGQYSzASAJKwMItiILOAIAQYizASAJKwMQtiIUOAIAQYyzASABIAUgBygCBGxqIgkrAwC2OAIAQZCzASAJKwMItjgCAEGUswEgCSsDELY4AgBBmLMBIAEgBSAHKAIIbGoiBSsDALY4AgBBnLMBIAUrAwi2OAIAQaCzASAFKwMQtjgCAEGYswEhBUGMswEhAQwBCyAFKAIMIgYgBSgCFCIJIAcoAghsaiEFIAYgBygCBCAJbGohASAGIAkgBygCAGxqIgYqAgghFCAGKgIEIQsgBioCACESC0GApwEgFCAPlCALIAyUIBIgHJQgEJKSkiISOAIAQYSnASAUIA2UIAsgDpQgBioCACILIB2UIBiSkpIiFTgCAEGIpwEgFCATlCAGKgIEIBGUIAsgHpQgF5KSkiIZOAIAQYynASABKgIIIgsgD5QgASoCBCIWIAyUIAEqAgAgHJQgEJKSkiIUOAIAQZCnASALIA2UIBYgDpQgASoCACIaIB2UIBiSkpIiFjgCAEGUpwEgCyATlCABKgIEIBGUIBogHpQgF5KSkiIbOAIAQZinASAFKgIIIgsgD5QgBSoCBCIaIAyUIAUqAgAgHJQgEJKSkiIPOAIAQZynASALIA2UIBogDpQgBSoCACIOIB2UIBiSkpIiDTgCAEGgpwEgCyATlCAFKgIEIBGUIA4gHpQgF5KSkiIOOAIAQQEhBUGkpQFBpKUBKAIAQQFqNgIAAkBBrKYBKgIAIhEgEiAPIA8gEl4bIBQgDyAPIBReGyASIBRdG10NACARjCIMIBIgDyAPIBJdGyAUIA8gDyAUXRsgEiAUXhteDQBBsKYBKgIAIhcgFSANIA0gFV4bIBYgDSANIBZeGyAVIBZdG10NACAXjCILIBUgDSANIBVdGyAWIA0gDSAWXRsgFSAWXhteDQBBtKYBKgIAIhggGSAOIA4gGV4bIBsgDiAOIBteGyAZIBtdG10NACAYjCIQIBkgDiAOIBldGyAbIA4gDiAbXRsgGSAbXhteDQAgFiAVkyIhIA4gG5MiHZQgDSAWkyIcIBsgGZMiIJSTIhOMIBKUIBUgICAPIBSTIh+UIB0gFCASkyIelJMiGpSTIB4gHJQgHyAhlJMiIiAZlJMiIyAiIBAgGCAiQwAAAABeIgEblCATIAwgESATQwAAAABeIgYblCAaIAsgFyAaQwAAAABeIgcblJKSkkMAAAAAXg0AICMgIiAYIBAgARuUIBMgESAMIAYblCAaIBcgCyAHG5SSkpJDAAAAAGBFDQAgIIsiEyAXlCAhiyIaIBiUkiIQICAgDZQgDiAhjCILlJIiDCAgIBWUIBkgC5SSIgsgCyAMXiIBG10NACAQjCALIAwgARteDQAgEyARlCAeiyITIBiUkiIQIB4gDpQgDyAgjCILlJIiDCAeIBmUIBIgC5SSIgsgCyAMXiIBG10NACAQjCALIAwgARteDQAgGiARlCATIBeUkiIQICEgD5QgDSAejCILlJIiDCAhIBSUIBYgC5SSIgsgCyAMXiIBG10NACAQjCALIAwgARteDQAgHYsiEyAXlCAciyIaIBiUkiIQIB0gDZQgDiAclJMiDCAdIBWUIBkgHJSTIgsgCyAMXiIBG10NACAQjCALIAwgARteDQAgEyARlCAfiyITIBiUkiIQIB8gDpQgDyAdlJMiDCAfIBmUIBIgHZSTIgsgCyAMXiIBG10NACAQjCALIAwgARteDQAgGiARlCATIBeUkiIQIBwgFJQgFiAflJMiDCAcIBKUIBUgH5STIgsgCyAMXiIBG10NACAQjCALIAwgARteDQAgGSAOkyIOIBaUIBsgFSANkyIMlJMiCyAOIBWUIBkgDJSTIhAgCyAQXSIBGyAOiyIVIBeUIAyLIhogGJSSIhNeDQAgE4wgECALIAEbXg0AIBIgD5MiCyAblCAUIA6UkyIQIAsgGZQgEiAOlJMiDiAOIBBeIgEbIBUgEZQgC4siEyAYlJIiEl4NACASjCAOIBAgARteDQAgGiARlCATIBeUkiIRIAwgD5QgDSALlJMiDSAMIBSUIBYgC5STIg8gDSAPXSIBG11Bf3MgEYwgDyANIAEbXkVxRQ0AQfikASADQQxyNgIAQQAhAyAAKAIARQRAIAAQ4wMgACgCCCEKIAAoAgQhAwsgACADQQFqNgIEIAogA0ECdGogCDYCAEH4pAEoAgAhAwsgA0EEcUUNAwwECyAEICU4AgggBCAmOAIEIAQgJDgCACAEQaymASoCADgCDCAEQbCmASoCADgCECAEQbSmASoCADgCFCAEQZCmASgCADYCOCAEQYimASkCADcCMCAEQYCmASkCADcCKCAEQfilASkCADcCICAEQfClASkCADcCGCAFIAAoAhBHBEAgACAFNgIQIAAhAwwCC0EAIQUjAEGAAWsiASQAIAEgAEEUaiIDQRhqEOQDIAEgAyoCADgCMCABIAMqAgQ4AjQgASADKgIIOAI4IAFBQGsgARDlAwJAIAQqAiAiDiABKgJgIguUIAQqAhgiECABKgJAIgyUIAEqAlAiDSAEKgIcIhGUkpIgBCoCDCISlIsgBCoCLCITIAuUIAQqAiQiFCAMlCANIAQqAigiFZSSkiAEKgIQIhaUi5IgBCoCOCIXIAuUIAQqAjAiGCAMlCANIAQqAjQiGZSSkiAEKgIUIhqUi5IgAyoCDJMiDyAEKgIIIhsgC5QgBCoCACIcIAyUIAQqAgQiHSANlJKSIAEqAnCSIgteDQAgCyAPjF4NACAaIBcgASoCZCILlCAYIAEqAkQiDJQgGSABKgJUIg2UkpKUiyASIA4gC5QgECAMlCARIA2UkpKUiyAWIBMgC5QgFCAMlCAVIA2UkpKUi5KSIAMqAhCTIg8gASoCdCAbIAuUIBwgDJQgHSANlJKSkiILXg0AIAsgD4xeDQAgDiABKgJoIguUIBAgASoCSCIMlCABKgJYIg0gEZSSkiASlIsgEyALlCAUIAyUIA0gFZSSkiAWlIuSIBcgC5QgGCAMlCANIBmUkpIgGpSLkiADKgIUkyIOIAEqAnggGyALlCAcIAyUIB0gDZSSkpIiC14NACALIA6MXkUhBQsgAUGAAWokAEGEpQEoAgAhAyAFRQ0BIAMoAgQEQEH4pAFB+KQBKAIAQQxyNgIAC0EBIQUMAwsgACgCBEUNASAAQQA2AgQMAQsgAygCBARAIANBADYCBAsgBEEQaiIDIAAqAlAiDSADKgIAlDgCACAEIA0gBCoCDJQ4AgwgBCANIAQqAhSUOAIUQaymASANQaymASoCAJQ4AgBBsKYBIA1BsKYBKgIAlDgCAEG0pgEgDUG0pgEqAgCUOAIAIAAgBCgCODYCTCAAIAQpAjA3AkQgACAEKQIoNwI8IAAgBCkCIDcCNCAAIAQpAhg3AiwgACADKQIANwIkIAAgBCkCCDcCHCAAIAQpAgA3AhQLQailAUHwpQEqAgCLQ703hjWSIg44AgBBrKUBQfSlASoCAItDvTeGNZIiDDgCAEGwpQFB+KUBKgIAi0O9N4Y1kiIXOAIAQbSlAUH8pQEqAgCLQ703hjWSIhI4AgBBuKUBQYCmASoCAItDvTeGNZIiFDgCAEG8pQFBhKYBKgIAi0O9N4Y1kiILOAIAQcClAUGIpgEqAgCLQ703hjWSIhg4AgBBxKUBQYymASoCAItDvTeGNZIiEDgCAEHIpQFBkKYBKgIAi0O9N4Y1kiITOAIAQZimASoCACEVQbCmASoCACENQZSmASoCACEWQaymASoCACEPQcymAUG0pgEqAgAiEYxBnKYBKgIAIhqTOAIAQcimASANjCAVkzgCAEHEpgEgD4wgFpM4AgBBwKYBIBEgGpM4AgBBvKYBIA0gFZM4AgBBuKYBIA8gFpM4AgBB/KYBIA8gC5QgDSAXlJI4AgBB+KYBIA8gE5QgESAXlJI4AgBB9KYBIA0gE5QgESALlJI4AgBB8KYBIA8gFJQgDSAMlJI4AgBB7KYBIA8gEJQgESAMlJI4AgBB6KYBIA0gEJQgESAUlJI4AgBB5KYBIA8gEpQgDiANlJI4AgBB4KYBIA8gGJQgDiARlJI4AgBB3KYBIA0gGJQgEiARlJI4AgBB2KYBIBEgE5QgDyAXlCANIAuUkpI4AgBB1KYBIBEgEJQgDyAMlCANIBSUkpI4AgBB0KYBIBEgGJQgDyAOlCANIBKUkpI4AgBBACEFCyAEQcABaiQAIAUNACACKAIIIgNBAXEhACACKAIQIQIgA0ECcQRAIAAEQEGIpQEgAikCDDcCAEGQpQEgAigCFDYCAEGcpQEgAigCIDYCAEGUpQEgAikCGDcCACACKAIIIQJB+KQBLQAAQRBxBEBB9KQBIAIQkAMMAwtB9KQBIAIQkQMMAgsgAigCCCECQfikAS0AAEEQcQRAQfSkASACEJIDDAILQfSkASACEJMDDAELIAAEQEGIpQEgAikCDDcCAEGQpQEgAigCFDYCAEGcpQEgAigCIDYCAEGUpQEgAikCGDcCACACKAIIIQJB+KQBLQAAQRBxBEBB9KQBIAIQlAMMAgtB9KQBIAIQlQMMAQsgAigCCCECQfikAS0AAEEQcQRAQfSkASACEJYDDAELQfSkASACEJcDCwu8CgIcfQd/AkADQCABLwEIISAgAS8BCiEhIAEuAQIhIiABLgEEISMgAS8BBiEeIAEuAQAhHyAAIAAoAiwiJEEBajYCLCAAKgIgIB6zlCIGIAAqAtwBkrwgACoCrAEgACoCFCAfspQiCZMiA7xB/////wdxSQ0BIAAqAiQgILOUIgcgACoC4AGSvCAAKgKwASAAKgIYICKylCIKkyIEvEH/////B3FJDQEgACoCKCAhs5QiBSAAKgLkAZK8IAAqArQBIAAqAhwgI7KUIguTIgK8Qf////8HcUkNASAAKgK4ASAFIAAqAjwiDJQgBiAAKgI0Ig2UIAcgACoCOCIOlJKSkrwgAiAAKgKEASIIlCADIAAqAnwiD5QgBCAAKgKAASIQlJKSvEH/////B3FJDQEgACoCvAEgBSAAKgJIIhGUIAYgACoCQCISlCAHIAAqAkQiE5SSkpK8IAIgACoCkAEiFJQgAyAAKgKIASIVlCAEIAAqAowBIhaUkpK8Qf////8HcUkNASAAKgLAASAFIAAqAlQiF5QgBiAAKgJMIhiUIAcgACoCUCIZlJKSkrwgAiAAKgKcASIalCADIAAqApQBIhuUIAQgACoCmAEiHJSSkrxB/////wdxSQ0BIAAtALACQQEgJBsEQCAHIAyUIAUgDpSSIAAqAugBkrwgAiAQlCAIIASUk7xB/////wdxSQ0CIAcgEZQgBSATlJIgACoC7AGSvCACIBaUIBQgBIwiHZSSvEH/////B3FJDQIgByAXlCAFIBmUkiAAKgLwAZK8IAIgHJQgGiAdlJK8Qf////8HcUkNAiAGIAyUIAUgDZSSIAAqAvQBkrwgAyAIlCAPIAKUk7xB/////wdxSQ0CIAYgEZQgBSASlJIgACoC+AGSvCADIBSUIBUgAowiApSSvEH/////B3FJDQIgBiAXlCAFIBiUkiAAKgL8AZK8IAMgGpQgGyAClJK8Qf////8HcUkNAiAGIA6UIAcgDZSSIAAqAoACkrwgBCAPlCAQIAOUk7xB/////wdxSQ0CIAYgE5QgByASlJIgACoChAKSvCAEIBWUIBYgA4wiApSSvEH/////B3FJDQIgBiAZlCAHIBiUkiAAKgKIApK8IAQgG5QgHCAClJK8Qf////8HcUkNAgsCQCAAKgLEASALIAAqAnAiApQgCSAAKgJYIgSUIAogACoCZCIDlJKSIgggBiAElIsgByADlIuSIAUgApSLkiICkl0NACAAKgLQASAIIAKTXg0AIAAqAsgBIAsgACoCdCIClCAJIAAqAlwiBJQgCiAAKgJoIgOUkpIiCCAGIASUiyAHIAOUi5IgBSAClIuSIgKSXQ0AIAAqAtQBIAggApNeDQAgACoCzAEgCyAAKgJ4IgKUIAkgACoCYCIElCAKIAAqAmwiA5SSkiIJIAYgBJSLIAcgA5SLkiAFIAKUi5IiBZJdDQAgACoC2AEgCSAFk14NACAAIAAoAgRBBHI2AgQgACABEN4DDwsCQCABKAIMIh5BAXEEQCAAIAAoAgRBBHI2AgQgHkEBdiEgIAAoAhAiHigCBCIfIB4oAgBGBEAgHhDjAyAeKAIEIR8LIB4gH0EBajYCBCAeKAIIIB9BAnRqICA2AgAMAQsgACAeEJADCyAAKAIEIh5BBXFBBUYNASABKAIQIgFBAXFFDQALIAAgHkEEcjYCBCABQQF2IR4gACgCECIAKAIEIgEgACgCAEYEQCAAEOMDIAAoAgQhAQsgACABQQFqNgIEIAAoAgggAUECdGogHjYCAAsL1SQCH30HfwJAA0AgAS8BCCEjIAEvAQohJCABLgECISUgAS4BBCEmIAEvAQYhISABLgEAISIgACAAKAIsIidBAWo2AiwgACoCICAhs5QiByAAKgLcAZK8IAAqAqwBIAAqAhQgIrKUIgKTIgS8Qf////8HcUkNASAAKgIkICOzlCIGIAAqAuABkrwgACoCsAEgACoCGCAlspQiCpMiCbxB/////wdxSQ0BIAAqAiggJLOUIgMgACoC5AGSvCAAKgK0ASAAKgIcICaylCIFkyIIvEH/////B3FJDQEgACoCuAEiGCADIAAqAjwiC5QgByAAKgI0Ig+UIAYgACoCOCISlJKSkrwgCCAAKgKEASIMlCAEIAAqAnwiEJQgCSAAKgKAASIOlJKSvEH/////B3FJDQEgACoCvAEiGSADIAAqAkgiFJQgByAAKgJAIhuUIAYgACoCRCINlJKSkrwgCCAAKgKQASIVlCAEIAAqAogBIheUIAkgACoCjAEiEZSSkrxB/////wdxSQ0BIAAqAsABIhogAyAAKgJUIhaUIAcgACoCTCIelCAGIAAqAlAiHZSSkpK8IAggACoCnAEiE5QgBCAAKgKUASIflCAJIAAqApgBIhyUkpK8Qf////8HcUkNASAALQCwAkEBICcbBEAgBiALlCADIBKUkiAAKgLoAZK8IAggDpQgDCAJlJO8Qf////8HcUkNAiAGIBSUIAMgDZSSIAAqAuwBkrwgCCARlCAVIAmMIiCUkrxB/////wdxSQ0CIAYgFpQgAyAdlJIgACoC8AGSvCAIIByUIBMgIJSSvEH/////B3FJDQIgByALlCADIA+UkiAAKgL0AZK8IAQgDJQgECAIlJO8Qf////8HcUkNAiAHIBSUIAMgG5SSIAAqAvgBkrwgBCAVlCAXIAiMIgiUkrxB/////wdxSQ0CIAcgFpQgAyAelJIgACoC/AGSvCAEIBOUIB8gCJSSvEH/////B3FJDQIgByASlCAGIA+UkiAAKgKAApK8IAkgEJQgDiAElJO8Qf////8HcUkNAiAHIA2UIAYgG5SSIAAqAoQCkrwgCSAXlCARIASMIgiUkrxB/////wdxSQ0CIAcgHZQgBiAelJIgACoCiAKSvCAJIB+UIBwgCJSSvEH/////B3FJDQILAkAgACoCxAEgBSAAKgJwIgiUIAIgACoCWCIJlCAKIAAqAmQiBJSSkiIMIAcgCZSLIAYgBJSLkiADIAiUi5IiC5JdDQAgACoC0AEgDCALk14NACAAKgLIASAFIAAqAnQiDJQgAiAAKgJcIguUIAogACoCaCIOlJKSIhIgByALlIsgBiAOlIuSIAMgDJSLkiIMkl0NACAAKgLUASASIAyTXg0AIAAqAswBIAUgACoCeCIMlCACIAAqAmAiBZQgCiAAKgJsIgKUkpIiCiAHIAWUiyAGIAKUi5IgAyAMlIuSIgOSXQ0AIAAqAtgBIAogA5NeDQAgACAAKAIEQQRyNgIEIAAgARDeAw8LAkAgASgCDCIiQQFxBEAgACgCDCIhKAIIICJBAXYiJiAhKAIQbGohJQJAICEtABhFBEBBgLMBICEoAgwiIiAhKAIUIiEgJSgCAGxqIiQrAwC2IgY4AgBBgLMBISNBhLMBICQrAwi2Igc4AgBBiLMBICQrAxC2IgM4AgBBjLMBICIgISAlKAIEbGoiJCsDALY4AgBBkLMBICQrAwi2OAIAQZSzASAkKwMQtjgCAEGYswEgIiAhICUoAghsaiIhKwMAtjgCAEGcswEgISsDCLY4AgBBoLMBICErAxC2OAIAQZizASEhQYyzASEiDAELICEoAgwiIyAhKAIUIiQgJSgCCGxqISEgIyAlKAIEICRsaiEiICMgJCAlKAIAbGoiIyoCCCEDICMqAgQhByAjKgIAIQYLIAAgAyAIlCAHIASUIAYgCZQgACoCoAEiApKSkiIGOAKMAiAAIAMgACoCdCIKlCAHIAAqAmgiBZQgIyoCACIHIAAqAlwiDJQgACoCpAEiC5KSkiIPOAKQAiAAIAMgACoCeCIOlCAjKgIEIAAqAmwiEpQgByAAKgJgIhWUIAAqAqgBIhSSkpIiDTgClAIgACAiKgIIIgMgCJQgIioCBCIQIASUIAIgIioCACAJlJKSkiIHOAKYAiAAIAMgCpQgECAFlCALIAwgIioCACIQlJKSkiIROAKcAiAAIAMgDpQgEiAiKgIElCAUIBAgFZSSkpIiEzgCoAIgACAhKgIIIhAgCJQgISoCBCIIIASUIAIgISoCACAJlJKSkiIDOAKkAiAAIBAgCpQgCCAFlCALIAwgISoCACIJlJKSkiIIOAKoAiAAIBAgDpQgEiAhKgIElCAUIAkgFZSSkpIiCTgCrAIgACAAKAIwQQFqNgIwIAYgAyADIAZeGyAHIAMgAyAHXhsgBiAHXRsgGF4NASAYjCIEIAYgAyADIAZdGyAHIAMgAyAHXRsgBiAHXhteDQEgDyAIIAggD14bIBEgCCAIIBFeGyAPIBFdGyAZXg0BIBmMIgIgDyAIIAggD10bIBEgCCAIIBFdGyAPIBFeG14NASANIAkgCSANXhsgEyAJIAkgE14bIA0gE10bIBpeDQEgGowiCiANIAkgCSANXRsgEyAJIAkgE10bIA0gE14bXg0BIBEgD5MiEiAJIBOTIhSUIAggEZMiECATIA2TIg6UkyIFjCAGlCAPIA4gAyAHkyIWlCAUIAcgBpMiFZSTIgyUkyAVIBCUIBYgEpSTIgsgDZSTIhcgCyAKIBogC0MAAAAAXiIhG5QgBSAEIBggBUMAAAAAXiIiG5QgDCACIBkgDEMAAAAAXiIjG5SSkpJDAAAAAF4NASAXIAsgGiAKICEblCAFIBggBCAiG5QgDCAZIAIgIxuUkpKSQwAAAABgRQ0BIA6LIgUgGZQgEosiDCAalJIiCiAOIAiUIAkgEowiApSSIgQgDiAPlCANIAKUkiICIAIgBF4iIRtdDQEgCowgAiAEICEbXg0BIAUgGJQgFYsiBSAalJIiCiAVIAmUIAMgDowiApSSIgQgFSANlCAGIAKUkiICIAIgBF4iIRtdDQEgCowgAiAEICEbXg0BIAwgGJQgBSAZlJIiCiASIAOUIAggFYwiApSSIgQgEiAHlCARIAKUkiICIAIgBF4iIRtdDQEgCowgAiAEICEbXg0BIBSLIgUgGZQgEIsiDCAalJIiCiAUIAiUIAkgEJSTIgQgFCAPlCANIBCUkyICIAIgBF4iIRtdDQEgCowgAiAEICEbXg0BIAUgGJQgFosiBSAalJIiCiAWIAmUIAMgFJSTIgQgFiANlCAGIBSUkyICIAIgBF4iIRtdDQEgCowgAiAEICEbXg0BIAwgGJQgBSAZlJIiCiAQIAeUIBEgFpSTIgQgECAGlCAPIBaUkyICIAIgBF4iIRtdDQEgCowgAiAEICEbXg0BIA0gCZMiCSARlCATIA8gCJMiBJSTIgIgCSAPlCANIASUkyIKIAIgCl0iIRsgCYsiDCAZlCAEiyILIBqUkiIFXg0BIAWMIAogAiAhG14NASAGIAOTIgIgE5QgByAJlJMiCiACIA2UIAYgCZSTIgYgBiAKXiIhGyAMIBiUIAKLIgUgGpSSIgleDQEgCYwgBiAKICEbXg0BIAQgA5QgCCAClJMiAyAEIAeUIBEgApSTIgYgAyAGXSIhGyALIBiUIAUgGZSSIgdeQX9zIAeMIAYgAyAhG15FcUUNASAAIAAoAgRBBHI2AgQgACgCECIhKAIEIiIgISgCAEYEQCAhEOMDICEoAgQhIgsgISAiQQFqNgIEICEoAgggIkECdGogJjYCAAwBCyAAICIQkQMLIAAoAgQiIUEFcUEFRg0BIAEoAhAiAUEBcUUNAAsgACgCDCIiKAIIIAFBAXYiJiAiKAIQbGohJQJAICItABhFBEBBgLMBICIoAgwiASAiKAIUIiIgJSgCAGxqIiQrAwC2IgY4AgBBgLMBISNBhLMBICQrAwi2Igc4AgBBiLMBICQrAxC2IgM4AgBBjLMBIAEgIiAlKAIEbGoiJCsDALY4AgBBkLMBICQrAwi2OAIAQZSzASAkKwMQtjgCAEGYswEgASAiICUoAghsaiIBKwMAtjgCAEGcswEgASsDCLY4AgBBoLMBIAErAxC2OAIAQZizASEBQYyzASEiDAELICIoAgwiIyAiKAIUIiQgJSgCCGxqIQEgIyAlKAIEICRsaiEiICMgJCAlKAIAbGoiIyoCCCEDICMqAgQhByAjKgIAIQYLIAAgAyAAKgJwIgiUIAcgACoCZCIJlCAGIAAqAlgiBJQgACoCoAEiApKSkiIGOAKMAiAAIAMgACoCdCIKlCAHIAAqAmgiBZQgIyoCACIHIAAqAlwiDJQgACoCpAEiC5KSkiIPOAKQAiAAIAMgACoCeCIOlCAjKgIEIAAqAmwiEpQgByAAKgJgIhWUIAAqAqgBIhSSkpIiDTgClAIgACAIICIqAggiA5QgCSAiKgIEIhCUIAIgBCAiKgIAlJKSkiIHOAKYAiAAIAMgCpQgECAFlCALIAwgIioCACIQlJKSkiIROAKcAiAAIAMgDpQgEiAiKgIElCAUIBAgFZSSkpIiEzgCoAIgACAIIAEqAggiEJQgCSABKgIEIgiUIAIgBCABKgIAlJKSkiIDOAKkAiAAIBAgCpQgCCAFlCALIAwgASoCACIJlJKSkiIIOAKoAiAAIBAgDpQgEiABKgIElCAUIAkgFZSSkpIiBDgCrAIgACAAKAIwQQFqNgIwIAAqArgBIgkgBiADIAMgBl4bIAcgAyADIAdeGyAGIAddG10NACAJjCICIAYgAyADIAZdGyAHIAMgAyAHXRsgBiAHXhteDQAgACoCvAEiCiAPIAggCCAPXhsgESAIIAggEV4bIA8gEV0bXQ0AIAqMIgUgDyAIIAggD10bIBEgCCAIIBFdGyAPIBFeG14NACAAKgLAASIMIA0gBCAEIA1eGyATIAQgBCATXhsgDSATXRtdDQAgDIwiCyANIAQgBCANXRsgEyAEIAQgE10bIA0gE14bXg0AIBEgD5MiECAEIBOTIheUIAggEZMiGyATIA2TIhSUkyIOjCAGlCAPIBQgAyAHkyIclCAXIAcgBpMiFpSTIhKUkyAWIBuUIBwgEJSTIhUgDZSTIh0gFSALIAwgFUMAAAAAXiIBG5QgDiACIAkgDkMAAAAAXiIiG5QgEiAFIAogEkMAAAAAXiIjG5SSkpJDAAAAAF4NACAdIBUgDCALIAEblCAOIAkgAiAiG5QgEiAKIAUgIxuUkpKSQwAAAABgRQ0AIBSLIg4gCpQgEIsiEiAMlJIiCyAUIAiUIAQgEIwiBZSSIgIgFCAPlCANIAWUkiIFIAIgBV0iARtdDQAgC4wgBSACIAEbXg0AIA4gCZQgFosiDiAMlJIiCyAWIASUIAMgFIwiBZSSIgIgFiANlCAGIAWUkiIFIAIgBV0iARtdDQAgC4wgBSACIAEbXg0AIBIgCZQgDiAKlJIiCyAQIAOUIAggFowiBZSSIgIgECAHlCARIAWUkiIFIAIgBV0iARtdDQAgC4wgBSACIAEbXg0AIBeLIg4gCpQgG4siEiAMlJIiCyAXIAiUIAQgG5STIgIgFyAPlCANIBuUkyIFIAIgBV0iARtdDQAgC4wgBSACIAEbXg0AIA4gCZQgHIsiDiAMlJIiCyAcIASUIAMgF5STIgIgHCANlCAGIBeUkyIFIAIgBV0iARtdDQAgC4wgBSACIAEbXg0AIBIgCZQgDiAKlJIiCyAbIAeUIBEgHJSTIgIgGyAGlCAPIByUkyIFIAIgBV0iARtdDQAgC4wgBSACIAEbXg0AIA0gBJMiBCARlCATIA8gCJMiApSTIgUgBCAPlCANIAKUkyILIAUgC10iARsgBIsiEiAKlCACiyIVIAyUkiIOXg0AIA6MIAsgBSABG14NACAGIAOTIgUgE5QgByAElJMiCyAFIA2UIAYgBJSTIgYgBiALXiIBGyASIAmUIAWLIg4gDJSSIgReDQAgBIwgBiALIAEbXg0AIAIgA5QgCCAFlJMiAyACIAeUIBEgBZSTIgYgAyAGXSIBGyAVIAmUIA4gCpSSIgdeQX9zIAeMIAYgAyABG15FcUUNACAAICFBBHI2AgQgACgCECIAKAIEIgEgACgCAEYEQCAAEOMDIAAoAgQhAQsgACABQQFqNgIEIAAoAgggAUECdGogJjYCAAsLtAoCHH0DfyAAIAAoAiwiHkEBajYCLAJAIAEqAgwiBCAAKgLcAZK8IAAqAqwBIAEqAgAiCJMiArxB/////wdxSQ0AA0AgASoCECIGIAAqAuABkrwgACoCsAEgASoCBCIKkyIFvEH/////B3FJDQEgASoCFCIHIAAqAuQBkrwgACoCtAEgASoCCCILkyIDvEH/////B3FJDQEgACoCuAEgByAAKgI8IgyUIAQgACoCNCINlCAGIAAqAjgiDpSSkpK8IAMgACoChAEiCZQgAiAAKgJ8Ig+UIAUgACoCgAEiEJSSkrxB/////wdxSQ0BIAAqArwBIAcgACoCSCIRlCAEIAAqAkAiEpQgBiAAKgJEIhOUkpKSvCADIAAqApABIhSUIAIgACoCiAEiFZQgBSAAKgKMASIWlJKSvEH/////B3FJDQEgACoCwAEgByAAKgJUIheUIAQgACoCTCIYlCAGIAAqAlAiGZSSkpK8IAMgACoCnAEiGpQgAiAAKgKUASIblCAFIAAqApgBIhyUkpK8Qf////8HcUkNASAALQCwAkEBIB4bBEAgBiAMlCAHIA6UkiAAKgLoAZK8IAMgEJQgCSAFlJO8Qf////8HcUkNAiAGIBGUIAcgE5SSIAAqAuwBkrwgAyAWlCAUIAWMIh2UkrxB/////wdxSQ0CIAYgF5QgByAZlJIgACoC8AGSvCADIByUIBogHZSSvEH/////B3FJDQIgBCAMlCAHIA2UkiAAKgL0AZK8IAIgCZQgDyADlJO8Qf////8HcUkNAiAEIBGUIAcgEpSSIAAqAvgBkrwgAiAUlCAVIAOMIgOUkrxB/////wdxSQ0CIAQgF5QgByAYlJIgACoC/AGSvCACIBqUIBsgA5SSvEH/////B3FJDQIgBCAOlCAGIA2UkiAAKgKAApK8IAUgD5QgECAClJO8Qf////8HcUkNAiAEIBOUIAYgEpSSIAAqAoQCkrwgBSAVlCAWIAKMIgKUkrxB/////wdxSQ0CIAQgGZQgBiAYlJIgACoCiAKSvCAFIBuUIBwgApSSvEH/////B3FJDQILAkAgACoCxAEgCyAAKgJwIgKUIAggACoCWCIDlCAKIAAqAmQiBZSSkiIJIAQgA5SLIAUgBpSLkiACIAeUi5IiApJdDQAgACoC0AEgCSACk14NACAAKgLIASALIAAqAnQiApQgCCAAKgJcIgOUIAogACoCaCIFlJKSIgkgBCADlIsgBiAFlIuSIAcgApSLkiICkl0NACAAKgLUASAJIAKTXg0AIAAqAswBIAsgACoCeCIClCAIIAAqAmAiA5QgCiAAKgJsIgWUkpIiCCAEIAOUiyAGIAWUi5IgByAClIuSIgSSXQ0AIAAqAtgBIAggBJNeDQAgACAAKAIEQQRyNgIEIAAgARDdAw8LAkAgASgCGCIeQQFxBEAgACAAKAIEQQRyNgIEIB5BAXYhICAAKAIQIh4oAgQiHyAeKAIARgRAIB4Q4wMgHigCBCEfCyAeIB9BAWo2AgQgHigCCCAfQQJ0aiAgNgIADAELIAAgHhCSAwsgACgCBCIeQQVxQQVGDQEgASgCHCIBQQFxBEAgACAeQQRyNgIEIAFBAXYhHiAAKAIQIgAoAgQiASAAKAIARgRAIAAQ4wMgACgCBCEBCyAAIAFBAWo2AgQgACgCCCABQQJ0aiAeNgIADwsgACAAKAIsIh5BAWo2AiwgASoCDCIEIAAqAtwBkrwgACoCrAEgASoCACIIkyICvEH/////B3FPDQALCwvNJAIffQZ/IAAgACgCLCIhQQFqNgIsAkAgASoCDCIDIAAqAtwBkrwgACoCrAEgASoCACICkyIJvEH/////B3FJDQADQCABKgIQIgcgACoC4AGSvCAAKgKwASABKgIEIgqTIgS8Qf////8HcUkNASABKgIUIgYgACoC5AGSvCAAKgK0ASABKgIIIgWTIgi8Qf////8HcUkNASAAKgK4ASIYIAYgACoCPCILlCADIAAqAjQiD5QgByAAKgI4IhKUkpKSvCAIIAAqAoQBIgyUIAkgACoCfCIQlCAEIAAqAoABIg6UkpK8Qf////8HcUkNASAAKgK8ASIZIAYgACoCSCIUlCADIAAqAkAiG5QgByAAKgJEIg2UkpKSvCAIIAAqApABIhWUIAkgACoCiAEiF5QgBCAAKgKMASIRlJKSvEH/////B3FJDQEgACoCwAEiGiAGIAAqAlQiFpQgAyAAKgJMIh6UIAcgACoCUCIdlJKSkrwgCCAAKgKcASITlCAJIAAqApQBIh+UIAQgACoCmAEiHJSSkrxB/////wdxSQ0BIAAtALACQQEgIRsEQCAHIAuUIAYgEpSSIAAqAugBkrwgCCAOlCAMIASUk7xB/////wdxSQ0CIAcgFJQgBiANlJIgACoC7AGSvCAIIBGUIBUgBIwiIJSSvEH/////B3FJDQIgByAWlCAGIB2UkiAAKgLwAZK8IAggHJQgEyAglJK8Qf////8HcUkNAiADIAuUIAYgD5SSIAAqAvQBkrwgCSAMlCAQIAiUk7xB/////wdxSQ0CIAMgFJQgBiAblJIgACoC+AGSvCAJIBWUIBcgCIwiCJSSvEH/////B3FJDQIgAyAWlCAGIB6UkiAAKgL8AZK8IAkgE5QgHyAIlJK8Qf////8HcUkNAiADIBKUIAcgD5SSIAAqAoACkrwgBCAQlCAOIAmUk7xB/////wdxSQ0CIAMgDZQgByAblJIgACoChAKSvCAEIBeUIBEgCYwiCZSSvEH/////B3FJDQIgAyAdlCAHIB6UkiAAKgKIApK8IAQgH5QgHCAJlJK8Qf////8HcUkNAgsCQCAAKgLEASAFIAAqAnAiCZQgAiAAKgJYIgiUIAogACoCZCIElJKSIgwgAyAIlIsgBCAHlIuSIAkgBpSLkiILkl0NACAAKgLQASAMIAuTXg0AIAAqAsgBIAUgACoCdCIMlCACIAAqAlwiC5QgCiAAKgJoIg6UkpIiEiADIAuUiyAHIA6Ui5IgBiAMlIuSIgySXQ0AIAAqAtQBIBIgDJNeDQAgACoCzAEgBSAAKgJ4IgyUIAIgACoCYCIFlCAKIAAqAmwiApSSkiIKIAMgBZSLIAcgApSLkiAGIAyUi5IiA5JdDQAgACoC2AEgCiADk14NACAAIAAoAgRBBHI2AgQgACABEN0DDwsCQCABKAIYIiJBAXEEQCAAKAIMIiEoAgggIkEBdiImICEoAhBsaiElAkAgIS0AGEUEQEGAswEgISgCDCIiICEoAhQiISAlKAIAbGoiJCsDALYiBjgCAEGAswEhI0GEswEgJCsDCLYiBzgCAEGIswEgJCsDELYiAzgCAEGMswEgIiAhICUoAgRsaiIkKwMAtjgCAEGQswEgJCsDCLY4AgBBlLMBICQrAxC2OAIAQZizASAiICEgJSgCCGxqIiErAwC2OAIAQZyzASAhKwMItjgCAEGgswEgISsDELY4AgBBmLMBISFBjLMBISIMAQsgISgCDCIjICEoAhQiJCAlKAIIbGohISAjICUoAgQgJGxqISIgIyAkICUoAgBsaiIjKgIIIQMgIyoCBCEHICMqAgAhBgsgACADIAmUIAcgBJQgBiAIlCAAKgKgASICkpKSIgY4AowCIAAgAyAAKgJ0IgqUIAcgACoCaCIFlCAjKgIAIgcgACoCXCIMlCAAKgKkASILkpKSIg84ApACIAAgAyAAKgJ4Ig6UICMqAgQgACoCbCISlCAHIAAqAmAiFZQgACoCqAEiFJKSkiINOAKUAiAAICIqAggiAyAJlCAiKgIEIhAgBJQgAiAiKgIAIAiUkpKSIgc4ApgCIAAgAyAKlCAQIAWUIAsgDCAiKgIAIhCUkpKSIhE4ApwCIAAgAyAOlCASICIqAgSUIBQgECAVlJKSkiITOAKgAiAAICEqAggiECAJlCAhKgIEIgkgBJQgAiAhKgIAIAiUkpKSIgM4AqQCIAAgECAKlCAJIAWUIAsgDCAhKgIAIgiUkpKSIgk4AqgCIAAgECAOlCASICEqAgSUIBQgCCAVlJKSkiIIOAKsAiAAIAAoAjBBAWo2AjAgBiADIAMgBl4bIAcgAyADIAdeGyAGIAddGyAYXg0BIBiMIgQgBiADIAMgBl0bIAcgAyADIAddGyAGIAdeG14NASAPIAkgCSAPXhsgESAJIAkgEV4bIA8gEV0bIBleDQEgGYwiAiAPIAkgCSAPXRsgESAJIAkgEV0bIA8gEV4bXg0BIA0gCCAIIA1eGyATIAggCCATXhsgDSATXRsgGl4NASAajCIKIA0gCCAIIA1dGyATIAggCCATXRsgDSATXhteDQEgESAPkyISIAggE5MiFJQgCSARkyIQIBMgDZMiDpSTIgWMIAaUIA8gDiADIAeTIhaUIBQgByAGkyIVlJMiDJSTIBUgEJQgFiASlJMiCyANlJMiFyALIAogGiALQwAAAABeIiEblCAFIAQgGCAFQwAAAABeIiIblCAMIAIgGSAMQwAAAABeIiMblJKSkkMAAAAAXg0BIBcgCyAaIAogIRuUIAUgGCAEICIblCAMIBkgAiAjG5SSkpJDAAAAAGBFDQEgDosiBSAZlCASiyIMIBqUkiIKIA4gCZQgCCASjCIClJIiBCAOIA+UIA0gApSSIgIgAiAEXiIhG10NASAKjCACIAQgIRteDQEgBSAYlCAViyIFIBqUkiIKIBUgCJQgAyAOjCIClJIiBCAVIA2UIAYgApSSIgIgAiAEXiIhG10NASAKjCACIAQgIRteDQEgDCAYlCAFIBmUkiIKIBIgA5QgCSAVjCIClJIiBCASIAeUIBEgApSSIgIgAiAEXiIhG10NASAKjCACIAQgIRteDQEgFIsiBSAZlCAQiyIMIBqUkiIKIBQgCZQgCCAQlJMiBCAUIA+UIA0gEJSTIgIgAiAEXiIhG10NASAKjCACIAQgIRteDQEgBSAYlCAWiyIFIBqUkiIKIBYgCJQgAyAUlJMiBCAWIA2UIAYgFJSTIgIgAiAEXiIhG10NASAKjCACIAQgIRteDQEgDCAYlCAFIBmUkiIKIBAgB5QgESAWlJMiBCAQIAaUIA8gFpSTIgIgAiAEXiIhG10NASAKjCACIAQgIRteDQEgDSAIkyIIIBGUIBMgDyAJkyIElJMiAiAIIA+UIA0gBJSTIgogAiAKXSIhGyAIiyIMIBmUIASLIgsgGpSSIgVeDQEgBYwgCiACICEbXg0BIAYgA5MiAiATlCAHIAiUkyIKIAIgDZQgBiAIlJMiBiAGIApeIiEbIAwgGJQgAosiBSAalJIiCF4NASAIjCAGIAogIRteDQEgBCADlCAJIAKUkyIDIAQgB5QgESAClJMiBiADIAZdIiEbIAsgGJQgBSAZlJIiB15Bf3MgB4wgBiADICEbXkVxRQ0BIAAgACgCBEEEcjYCBCAAKAIQIiEoAgQiIiAhKAIARgRAICEQ4wMgISgCBCEiCyAhICJBAWo2AgQgISgCCCAiQQJ0aiAmNgIADAELIAAgIhCTAwsgACgCBCIhQQVxQQVGDQEgASgCHCIBQQFxBEAgACgCDCIiKAIIIAFBAXYiJiAiKAIQbGohJQJAICItABhFBEBBgLMBICIoAgwiASAiKAIUIiIgJSgCAGxqIiQrAwC2IgY4AgBBgLMBISNBhLMBICQrAwi2Igc4AgBBiLMBICQrAxC2IgM4AgBBjLMBIAEgIiAlKAIEbGoiJCsDALY4AgBBkLMBICQrAwi2OAIAQZSzASAkKwMQtjgCAEGYswEgASAiICUoAghsaiIBKwMAtjgCAEGcswEgASsDCLY4AgBBoLMBIAErAxC2OAIAQZizASEBQYyzASEiDAELICIoAgwiIyAiKAIUIiQgJSgCCGxqIQEgIyAlKAIEICRsaiEiICMgJCAlKAIAbGoiIyoCCCEDICMqAgQhByAjKgIAIQYLIAAgAyAAKgJwIgmUIAcgACoCZCIIlCAGIAAqAlgiBJQgACoCoAEiApKSkiIGOAKMAiAAIAMgACoCdCIKlCAHIAAqAmgiBZQgIyoCACIHIAAqAlwiDJQgACoCpAEiC5KSkiIPOAKQAiAAIAMgACoCeCIOlCAjKgIEIAAqAmwiEpQgByAAKgJgIhWUIAAqAqgBIhSSkpIiDTgClAIgACAJICIqAggiA5QgCCAiKgIEIhCUIAIgBCAiKgIAlJKSkiIHOAKYAiAAIAMgCpQgECAFlCALIAwgIioCACIQlJKSkiIROAKcAiAAIAMgDpQgEiAiKgIElCAUIBAgFZSSkpIiEzgCoAIgACAJIAEqAggiEJQgCCABKgIEIgmUIAIgBCABKgIAlJKSkiIDOAKkAiAAIBAgCpQgCSAFlCALIAwgASoCACIIlJKSkiIJOAKoAiAAIBAgDpQgEiABKgIElCAUIAggFZSSkpIiBDgCrAIgACAAKAIwQQFqNgIwIAAqArgBIgggBiADIAMgBl4bIAcgAyADIAdeGyAGIAddG10NAiAIjCICIAYgAyADIAZdGyAHIAMgAyAHXRsgBiAHXhteDQIgACoCvAEiCiAPIAkgCSAPXhsgESAJIAkgEV4bIA8gEV0bXQ0CIAqMIgUgDyAJIAkgD10bIBEgCSAJIBFdGyAPIBFeG14NAiAAKgLAASIMIA0gBCAEIA1eGyATIAQgBCATXhsgDSATXRtdDQIgDIwiCyANIAQgBCANXRsgEyAEIAQgE10bIA0gE14bXg0CIBEgD5MiECAEIBOTIheUIAkgEZMiGyATIA2TIhSUkyIOjCAGlCAPIBQgAyAHkyIclCAXIAcgBpMiFpSTIhKUkyAWIBuUIBwgEJSTIhUgDZSTIh0gFSALIAwgFUMAAAAAXiIBG5QgDiACIAggDkMAAAAAXiIiG5QgEiAFIAogEkMAAAAAXiIjG5SSkpJDAAAAAF4NAiAdIBUgDCALIAEblCAOIAggAiAiG5QgEiAKIAUgIxuUkpKSQwAAAABgRQ0CIBSLIg4gCpQgEIsiEiAMlJIiCyAUIAmUIAQgEIwiBZSSIgIgFCAPlCANIAWUkiIFIAIgBV0iARtdDQIgC4wgBSACIAEbXg0CIA4gCJQgFosiDiAMlJIiCyAWIASUIAMgFIwiBZSSIgIgFiANlCAGIAWUkiIFIAIgBV0iARtdDQIgC4wgBSACIAEbXg0CIBIgCJQgDiAKlJIiCyAQIAOUIAkgFowiBZSSIgIgECAHlCARIAWUkiIFIAIgBV0iARtdDQIgC4wgBSACIAEbXg0CIBeLIg4gCpQgG4siEiAMlJIiCyAXIAmUIAQgG5STIgIgFyAPlCANIBuUkyIFIAIgBV0iARtdDQIgC4wgBSACIAEbXg0CIA4gCJQgHIsiDiAMlJIiCyAcIASUIAMgF5STIgIgHCANlCAGIBeUkyIFIAIgBV0iARtdDQIgC4wgBSACIAEbXg0CIBIgCJQgDiAKlJIiCyAbIAeUIBEgHJSTIgIgGyAGlCAPIByUkyIFIAIgBV0iARtdDQIgC4wgBSACIAEbXg0CIA0gBJMiBCARlCATIA8gCZMiApSTIgUgBCAPlCANIAKUkyILIAUgC10iARsgBIsiEiAKlCACiyIVIAyUkiIOXg0CIA6MIAsgBSABG14NAiAGIAOTIgUgE5QgByAElJMiCyAFIA2UIAYgBJSTIgYgBiALXiIBGyASIAiUIAWLIg4gDJSSIgReDQIgBIwgBiALIAEbXg0CIAIgA5QgCSAFlJMiAyACIAeUIBEgBZSTIgYgAyAGXSIBGyAVIAiUIA4gCpSSIgdeQX9zIAeMIAYgAyABG15FcUUNAiAAICFBBHI2AgQgACgCECIAKAIEIgEgACgCAEYEQCAAEOMDIAAoAgQhAQsgACABQQFqNgIEIAAoAgggAUECdGogJjYCAA8LIAAgACgCLCIhQQFqNgIsIAEqAgwiAyAAKgLcAZK8IAAqAqwBIAEqAgAiApMiCbxB/////wdxTw0ACwsL6gkCHH0HfwNAAkAgAS8BCCEfIAEvAQohICABLgECISEgAS4BBCEiIAEvAQYhHiABLgEAISMgACAAKAIsIiRBAWo2AiwgACoCICAes5QiBiAAKgLcAZK8IAAqAqwBIAAqAhQgI7KUIgmTIgO8Qf////8HcUkNACAAKgIkIB+zlCIHIAAqAuABkrwgACoCsAEgACoCGCAhspQiCpMiBLxB/////wdxSQ0AIAAqAiggILOUIgUgACoC5AGSvCAAKgK0ASAAKgIcICKylCILkyICvEH/////B3FJDQAgACoCuAEgBSAAKgI8IgyUIAYgACoCNCINlCAHIAAqAjgiDpSSkpK8IAIgACoChAEiCJQgAyAAKgJ8Ig+UIAQgACoCgAEiEJSSkrxB/////wdxSQ0AIAAqArwBIAUgACoCSCIRlCAGIAAqAkAiEpQgByAAKgJEIhOUkpKSvCACIAAqApABIhSUIAMgACoCiAEiFZQgBCAAKgKMASIWlJKSvEH/////B3FJDQAgACoCwAEgBSAAKgJUIheUIAYgACoCTCIYlCAHIAAqAlAiGZSSkpK8IAIgACoCnAEiGpQgAyAAKgKUASIblCAEIAAqApgBIhyUkpK8Qf////8HcUkNACAALQCwAkEBICQbBEAgByAMlCAFIA6UkiAAKgLoAZK8IAIgEJQgCCAElJO8Qf////8HcUkNASAHIBGUIAUgE5SSIAAqAuwBkrwgAiAWlCAUIASMIh2UkrxB/////wdxSQ0BIAcgF5QgBSAZlJIgACoC8AGSvCACIByUIBogHZSSvEH/////B3FJDQEgBiAMlCAFIA2UkiAAKgL0AZK8IAMgCJQgDyAClJO8Qf////8HcUkNASAGIBGUIAUgEpSSIAAqAvgBkrwgAyAUlCAVIAKMIgKUkrxB/////wdxSQ0BIAYgF5QgBSAYlJIgACoC/AGSvCADIBqUIBsgApSSvEH/////B3FJDQEgBiAOlCAHIA2UkiAAKgKAApK8IAQgD5QgECADlJO8Qf////8HcUkNASAGIBOUIAcgEpSSIAAqAoQCkrwgBCAVlCAWIAOMIgKUkrxB/////wdxSQ0BIAYgGZQgByAYlJIgACoCiAKSvCAEIBuUIBwgApSSvEH/////B3FJDQELAkAgACoCxAEgCyAAKgJwIgKUIAkgACoCWCIElCAKIAAqAmQiA5SSkiIIIAYgBJSLIAcgA5SLkiAFIAKUi5IiApJdDQAgACoC0AEgCCACk14NACAAKgLIASALIAAqAnQiApQgCSAAKgJcIgSUIAogACoCaCIDlJKSIgggBiAElIsgByADlIuSIAUgApSLkiICkl0NACAAKgLUASAIIAKTXg0AIAAqAswBIAsgACoCeCIClCAJIAAqAmAiBJQgCiAAKgJsIgOUkpIiCSAGIASUiyAHIAOUi5IgBSAClIuSIgWSXQ0AIAAqAtgBIAkgBZNeDQAgACAAKAIEQQRyNgIEIAAgARDgAwwBCyABKAIMIh5BAXEEQCAAIAAoAgRBBHI2AgQgHkEBdiEeIAAoAhAiACgCBCIBIAAoAgBGBEAgABDjAyAAKAIEIQELIAAgAUEBajYCBCAAKAIIIAFBAnRqIB42AgAPCyAAIB4QlAMgACgCBEEFcUEFRg0AIAEoAgxBEGohAQwBCwsL6RYCH30HfwNAAkAgAS8BCCEkIAEvAQohJSABLgECISMgAS4BBCEmIAEvAQYhISABLgEAISIgACAAKAIsIidBAWo2AiwgACoCICAhs5QiCCAAKgLcAZK8IAAqAqwBIAAqAhQgIrKUIgKTIgS8Qf////8HcUkNACAAKgIkICSzlCIGIAAqAuABkrwgACoCsAEgACoCGCAjspQiCZMiBbxB/////wdxSQ0AIAAqAiggJbOUIgMgACoC5AGSvCAAKgK0ASAAKgIcICaylCIKkyIHvEH/////B3FJDQAgACoCuAEiFiADIAAqAjwiD5QgCCAAKgI0Ig2UIAYgACoCOCIRlJKSkrwgByAAKgKEASILlCAEIAAqAnwiDpQgBSAAKgKAASISlJKSvEH/////B3FJDQAgACoCvAEiFyADIAAqAkgiFJQgCCAAKgJAIhuUIAYgACoCRCIMlJKSkrwgByAAKgKQASIVlCAEIAAqAogBIhqUIAUgACoCjAEiEJSSkrxB/////wdxSQ0AIAAqAsABIhggAyAAKgJUIhmUIAggACoCTCIclCAGIAAqAlAiHZSSkpK8IAcgACoCnAEiE5QgBCAAKgKUASIelCAFIAAqApgBIh+UkpK8Qf////8HcUkNACAALQCwAkEBICcbBEAgBiAPlCADIBGUkiAAKgLoAZK8IAcgEpQgCyAFlJO8Qf////8HcUkNASAGIBSUIAMgDJSSIAAqAuwBkrwgByAQlCAVIAWMIiCUkrxB/////wdxSQ0BIAYgGZQgAyAdlJIgACoC8AGSvCAHIB+UIBMgIJSSvEH/////B3FJDQEgCCAPlCADIA2UkiAAKgL0AZK8IAQgC5QgDiAHlJO8Qf////8HcUkNASAIIBSUIAMgG5SSIAAqAvgBkrwgBCAVlCAaIAeMIgeUkrxB/////wdxSQ0BIAggGZQgAyAclJIgACoC/AGSvCAEIBOUIB4gB5SSvEH/////B3FJDQEgCCARlCAGIA2UkiAAKgKAApK8IAUgDpQgEiAElJO8Qf////8HcUkNASAIIAyUIAYgG5SSIAAqAoQCkrwgBSAalCAQIASMIgeUkrxB/////wdxSQ0BIAggHZQgBiAclJIgACoCiAKSvCAFIB6UIB8gB5SSvEH/////B3FJDQELAkAgACoCxAEgCiAAKgJwIgeUIAIgACoCWCIFlCAJIAAqAmQiBJSSkiILIAggBZSLIAYgBJSLkiADIAeUi5IiD5JdDQAgACoC0AEgCyAPk14NACAAKgLIASAKIAAqAnQiC5QgAiAAKgJcIg+UIAkgACoCaCISlJKSIhEgCCAPlIsgBiASlIuSIAMgC5SLkiILkl0NACAAKgLUASARIAuTXg0AIAAqAswBIAogACoCeCILlCACIAAqAmAiCpQgCSAAKgJsIgKUkpIiCSAIIAqUiyAGIAKUi5IgAyALlIuSIgOSXQ0AIAAqAtgBIAkgA5NeDQAgACAAKAIEQQRyNgIEIAAgARDgAwwBCyABKAIMIiFBAXEEQCAAKAIMIgEoAgggIUEBdiIlIAEoAhBsaiEkAkAgAS0AGEUEQEGAswEgASgCDCIhIAEoAhQiASAkKAIAbGoiIysDALYiBjgCAEGAswEhIkGEswEgIysDCLYiCDgCAEGIswEgIysDELYiAzgCAEGMswEgISABICQoAgRsaiIjKwMAtjgCAEGQswEgIysDCLY4AgBBlLMBICMrAxC2OAIAQZizASAhIAEgJCgCCGxqIgErAwC2OAIAQZyzASABKwMItjgCAEGgswEgASsDELY4AgBBmLMBIQFBjLMBISEMAQsgASgCDCIiIAEoAhQiIyAkKAIIbGohASAiICQoAgQgI2xqISEgIiAjICQoAgBsaiIiKgIIIQMgIioCBCEIICIqAgAhBgsgACADIAeUIAggBJQgBiAFlCAAKgKgASICkpKSIgY4AowCIAAgAyAAKgJ0IgmUIAggACoCaCIKlCAiKgIAIgggACoCXCILlCAAKgKkASIPkpKSIg04ApACIAAgAyAAKgJ4IhKUICIqAgQgACoCbCIRlCAIIAAqAmAiFZQgACoCqAEiFJKSkiIMOAKUAiAAICEqAggiAyAHlCAhKgIEIg4gBJQgAiAhKgIAIAWUkpKSIgg4ApgCIAAgAyAJlCAOIAqUIA8gCyAhKgIAIg6UkpKSIhA4ApwCIAAgAyASlCARICEqAgSUIBQgDiAVlJKSkiITOAKgAiAAIAEqAggiDiAHlCABKgIEIgcgBJQgAiABKgIAIAWUkpKSIgM4AqQCIAAgDiAJlCAHIAqUIA8gCyABKgIAIgWUkpKSIgc4AqgCIAAgDiASlCARIAEqAgSUIBQgBSAVlJKSkiIFOAKsAiAAIAAoAjBBAWo2AjAgBiADIAMgBl4bIAggAyADIAheGyAGIAhdGyAWXg0BIBaMIgQgBiADIAMgBl0bIAggAyADIAhdGyAGIAheG14NASANIAcgByANXhsgECAHIAcgEF4bIA0gEF0bIBdeDQEgF4wiAiANIAcgByANXRsgECAHIAcgEF0bIA0gEF4bXg0BIAwgBSAFIAxeGyATIAUgBSATXhsgDCATXRsgGF4NASAYjCIJIAwgBSAFIAxdGyATIAUgBSATXRsgDCATXhteDQEgECANkyIRIAUgE5MiFJQgByAQkyIOIBMgDJMiEpSTIgqMIAaUIA0gEiADIAiTIhmUIBQgCCAGkyIVlJMiC5STIBUgDpQgGSARlJMiDyAMlJMiGiAPIAkgGCAPQwAAAABeIgEblCAKIAQgFiAKQwAAAABeIiEblCALIAIgFyALQwAAAABeIiIblJKSkkMAAAAAXg0BIBogDyAYIAkgARuUIAogFiAEICEblCALIBcgAiAiG5SSkpJDAAAAAGBFDQEgEosiCiAXlCARiyILIBiUkiIJIBIgB5QgBSARjCIClJIiBCASIA2UIAwgApSSIgIgAiAEXiIBG10NASAJjCACIAQgARteDQEgCiAWlCAViyIKIBiUkiIJIBUgBZQgAyASjCIClJIiBCAVIAyUIAYgApSSIgIgAiAEXiIBG10NASAJjCACIAQgARteDQEgCyAWlCAKIBeUkiIJIBEgA5QgByAVjCIClJIiBCARIAiUIBAgApSSIgIgAiAEXiIBG10NASAJjCACIAQgARteDQEgFIsiCiAXlCAOiyILIBiUkiIJIBQgB5QgBSAOlJMiBCAUIA2UIAwgDpSTIgIgAiAEXiIBG10NASAJjCACIAQgARteDQEgCiAWlCAZiyIKIBiUkiIJIBkgBZQgAyAUlJMiBCAZIAyUIAYgFJSTIgIgAiAEXiIBG10NASAJjCACIAQgARteDQEgCyAWlCAKIBeUkiIJIA4gCJQgECAZlJMiBCAOIAaUIA0gGZSTIgIgAiAEXiIBG10NASAJjCACIAQgARteDQEgDCAFkyIFIBCUIBMgDSAHkyIElJMiAiAFIA2UIAwgBJSTIgkgAiAJXSIBGyAFiyILIBeUIASLIg8gGJSSIgpeDQEgCowgCSACIAEbXg0BIAYgA5MiAiATlCAIIAWUkyIJIAIgDJQgBiAFlJMiBiAGIAleIgEbIAsgFpQgAosiCiAYlJIiBV4NASAFjCAGIAkgARteDQEgBCADlCAHIAKUkyIDIAQgCJQgECAClJMiBiADIAZdIgEbIA8gFpQgCiAXlJIiCF5Bf3MgCIwgBiADIAEbXkVxRQ0BIAAgACgCBEEEcjYCBCAAKAIQIgAoAgQiASAAKAIARgRAIAAQ4wMgACgCBCEBCyAAIAFBAWo2AgQgACgCCCABQQJ0aiAlNgIADwsgACAhEJUDIAAoAgRBBXFBBUYNACABKAIMQRBqIQEMAQsLC+IJAhx9An8gACAAKAIsIh9BAWo2AiwCQCABKgIMIgQgACoC3AGSvCAAKgKsASABKgIAIgiTIgK8Qf////8HcUkNAANAIAEqAhAiBiAAKgLgAZK8IAAqArABIAEqAgQiCpMiBbxB/////wdxSQ0BIAEqAhQiByAAKgLkAZK8IAAqArQBIAEqAggiC5MiA7xB/////wdxSQ0BIAAqArgBIAcgACoCPCIMlCAEIAAqAjQiDZQgBiAAKgI4Ig6UkpKSvCADIAAqAoQBIgmUIAIgACoCfCIPlCAFIAAqAoABIhCUkpK8Qf////8HcUkNASAAKgK8ASAHIAAqAkgiEZQgBCAAKgJAIhKUIAYgACoCRCITlJKSkrwgAyAAKgKQASIUlCACIAAqAogBIhWUIAUgACoCjAEiFpSSkrxB/////wdxSQ0BIAAqAsABIAcgACoCVCIXlCAEIAAqAkwiGJQgBiAAKgJQIhmUkpKSvCADIAAqApwBIhqUIAIgACoClAEiG5QgBSAAKgKYASIclJKSvEH/////B3FJDQEgAC0AsAJBASAfGwRAIAYgDJQgByAOlJIgACoC6AGSvCADIBCUIAkgBZSTvEH/////B3FJDQIgBiARlCAHIBOUkiAAKgLsAZK8IAMgFpQgFCAFjCIdlJK8Qf////8HcUkNAiAGIBeUIAcgGZSSIAAqAvABkrwgAyAclCAaIB2UkrxB/////wdxSQ0CIAQgDJQgByANlJIgACoC9AGSvCACIAmUIA8gA5STvEH/////B3FJDQIgBCARlCAHIBKUkiAAKgL4AZK8IAIgFJQgFSADjCIDlJK8Qf////8HcUkNAiAEIBeUIAcgGJSSIAAqAvwBkrwgAiAalCAbIAOUkrxB/////wdxSQ0CIAQgDpQgBiANlJIgACoCgAKSvCAFIA+UIBAgApSTvEH/////B3FJDQIgBCATlCAGIBKUkiAAKgKEApK8IAUgFZQgFiACjCIClJK8Qf////8HcUkNAiAEIBmUIAYgGJSSIAAqAogCkrwgBSAblCAcIAKUkrxB/////wdxSQ0CCwJAIAAqAsQBIAsgACoCcCIClCAIIAAqAlgiA5QgCiAAKgJkIgWUkpIiCSAEIAOUiyAFIAaUi5IgAiAHlIuSIgKSXQ0AIAAqAtABIAkgApNeDQAgACoCyAEgCyAAKgJ0IgKUIAggACoCXCIDlCAKIAAqAmgiBZSSkiIJIAQgA5SLIAYgBZSLkiAHIAKUi5IiApJdDQAgACoC1AEgCSACk14NACAAKgLMASALIAAqAngiApQgCCAAKgJgIgOUIAogACoCbCIFlJKSIgggBCADlIsgBiAFlIuSIAcgApSLkiIEkl0NACAAKgLYASAIIASTXg0AIAAgACgCBEEEcjYCBCAAIAEQ3wMPCyABKAIYIh5BAXEEQCAAIAAoAgRBBHI2AgQgHkEBdiEeIAAoAhAiACgCBCIBIAAoAgBGBEAgABDjAyAAKAIEIQELIAAgAUEBajYCBCAAKAIIIAFBAnRqIB42AgAPCyAAIB4QlgMgACgCBEEFcUEFRg0BIAEoAhghHiAAIAAoAiwiH0EBajYCLCAeQRxqIQEgHioCKCIEIAAqAtwBkrwgACoCrAEgHioCHCIIkyICvEH/////B3FPDQALCwvhFgIffQV/IAAgACgCLCIiQQFqNgIsAkAgASoCDCIDIAAqAtwBkrwgACoCrAEgASoCACICkyIHvEH/////B3FJDQADQCABKgIQIgggACoC4AGSvCAAKgKwASABKgIEIgmTIgS8Qf////8HcUkNASABKgIUIgYgACoC5AGSvCAAKgK0ASABKgIIIgqTIgW8Qf////8HcUkNASAAKgK4ASIWIAYgACoCPCIPlCADIAAqAjQiDZQgCCAAKgI4IhGUkpKSvCAFIAAqAoQBIguUIAcgACoCfCIOlCAEIAAqAoABIhKUkpK8Qf////8HcUkNASAAKgK8ASIXIAYgACoCSCIUlCADIAAqAkAiG5QgCCAAKgJEIgyUkpKSvCAFIAAqApABIhWUIAcgACoCiAEiGpQgBCAAKgKMASIQlJKSvEH/////B3FJDQEgACoCwAEiGCAGIAAqAlQiGZQgAyAAKgJMIhyUIAggACoCUCIdlJKSkrwgBSAAKgKcASITlCAHIAAqApQBIh6UIAQgACoCmAEiH5SSkrxB/////wdxSQ0BIAAtALACQQEgIhsEQCAIIA+UIAYgEZSSIAAqAugBkrwgBSASlCALIASUk7xB/////wdxSQ0CIAggFJQgBiAMlJIgACoC7AGSvCAFIBCUIBUgBIwiIJSSvEH/////B3FJDQIgCCAZlCAGIB2UkiAAKgLwAZK8IAUgH5QgEyAglJK8Qf////8HcUkNAiADIA+UIAYgDZSSIAAqAvQBkrwgByALlCAOIAWUk7xB/////wdxSQ0CIAMgFJQgBiAblJIgACoC+AGSvCAHIBWUIBogBYwiBZSSvEH/////B3FJDQIgAyAZlCAGIByUkiAAKgL8AZK8IAcgE5QgHiAFlJK8Qf////8HcUkNAiADIBGUIAggDZSSIAAqAoACkrwgBCAOlCASIAeUk7xB/////wdxSQ0CIAMgDJQgCCAblJIgACoChAKSvCAEIBqUIBAgB4wiB5SSvEH/////B3FJDQIgAyAdlCAIIByUkiAAKgKIApK8IAQgHpQgHyAHlJK8Qf////8HcUkNAgsCQCAAKgLEASAKIAAqAnAiB5QgAiAAKgJYIgWUIAkgACoCZCIElJKSIgsgAyAFlIsgBCAIlIuSIAcgBpSLkiIPkl0NACAAKgLQASALIA+TXg0AIAAqAsgBIAogACoCdCILlCACIAAqAlwiD5QgCSAAKgJoIhKUkpIiESADIA+UiyAIIBKUi5IgBiALlIuSIguSXQ0AIAAqAtQBIBEgC5NeDQAgACoCzAEgCiAAKgJ4IguUIAIgACoCYCIKlCAJIAAqAmwiApSSkiIJIAMgCpSLIAggApSLkiAGIAuUi5IiA5JdDQAgACoC2AEgCSADk14NACAAIAAoAgRBBHI2AgQgACABEN8DDwsgASgCGCIhQQFxBEAgACgCDCIBKAIIICFBAXYiJSABKAIQbGohJAJAIAEtABhFBEBBgLMBIAEoAgwiISABKAIUIgEgJCgCAGxqIiMrAwC2IgY4AgBBgLMBISJBhLMBICMrAwi2Igg4AgBBiLMBICMrAxC2IgM4AgBBjLMBICEgASAkKAIEbGoiIysDALY4AgBBkLMBICMrAwi2OAIAQZSzASAjKwMQtjgCAEGYswEgISABICQoAghsaiIBKwMAtjgCAEGcswEgASsDCLY4AgBBoLMBIAErAxC2OAIAQZizASEBQYyzASEhDAELIAEoAgwiIiABKAIUIiMgJCgCCGxqIQEgIiAkKAIEICNsaiEhICIgIyAkKAIAbGoiIioCCCEDICIqAgQhCCAiKgIAIQYLIAAgAyAHlCAIIASUIAYgBZQgACoCoAEiApKSkiIGOAKMAiAAIAMgACoCdCIJlCAIIAAqAmgiCpQgIioCACIIIAAqAlwiC5QgACoCpAEiD5KSkiINOAKQAiAAIAMgACoCeCISlCAiKgIEIAAqAmwiEZQgCCAAKgJgIhWUIAAqAqgBIhSSkpIiDDgClAIgACAhKgIIIgMgB5QgISoCBCIOIASUIAIgISoCACAFlJKSkiIIOAKYAiAAIAMgCZQgDiAKlCAPIAsgISoCACIOlJKSkiIQOAKcAiAAIAMgEpQgESAhKgIElCAUIA4gFZSSkpIiEzgCoAIgACABKgIIIg4gB5QgASoCBCIHIASUIAIgASoCACAFlJKSkiIDOAKkAiAAIA4gCZQgByAKlCAPIAsgASoCACIFlJKSkiIHOAKoAiAAIA4gEpQgESABKgIElCAUIAUgFZSSkpIiBTgCrAIgACAAKAIwQQFqNgIwIAYgAyADIAZeGyAIIAMgAyAIXhsgBiAIXRsgFl4NAiAWjCIEIAYgAyADIAZdGyAIIAMgAyAIXRsgBiAIXhteDQIgDSAHIAcgDV4bIBAgByAHIBBeGyANIBBdGyAXXg0CIBeMIgIgDSAHIAcgDV0bIBAgByAHIBBdGyANIBBeG14NAiAMIAUgBSAMXhsgEyAFIAUgE14bIAwgE10bIBheDQIgGIwiCSAMIAUgBSAMXRsgEyAFIAUgE10bIAwgE14bXg0CIBAgDZMiESAFIBOTIhSUIAcgEJMiDiATIAyTIhKUkyIKjCAGlCANIBIgAyAIkyIZlCAUIAggBpMiFZSTIguUkyAVIA6UIBkgEZSTIg8gDJSTIhogDyAJIBggD0MAAAAAXiIBG5QgCiAEIBYgCkMAAAAAXiIhG5QgCyACIBcgC0MAAAAAXiIiG5SSkpJDAAAAAF4NAiAaIA8gGCAJIAEblCAKIBYgBCAhG5QgCyAXIAIgIhuUkpKSQwAAAABgRQ0CIBKLIgogF5QgEYsiCyAYlJIiCSASIAeUIAUgEYwiApSSIgQgEiANlCAMIAKUkiICIAIgBF4iARtdDQIgCYwgAiAEIAEbXg0CIAogFpQgFYsiCiAYlJIiCSAVIAWUIAMgEowiApSSIgQgFSAMlCAGIAKUkiICIAIgBF4iARtdDQIgCYwgAiAEIAEbXg0CIAsgFpQgCiAXlJIiCSARIAOUIAcgFYwiApSSIgQgESAIlCAQIAKUkiICIAIgBF4iARtdDQIgCYwgAiAEIAEbXg0CIBSLIgogF5QgDosiCyAYlJIiCSAUIAeUIAUgDpSTIgQgFCANlCAMIA6UkyICIAIgBF4iARtdDQIgCYwgAiAEIAEbXg0CIAogFpQgGYsiCiAYlJIiCSAZIAWUIAMgFJSTIgQgGSAMlCAGIBSUkyICIAIgBF4iARtdDQIgCYwgAiAEIAEbXg0CIAsgFpQgCiAXlJIiCSAOIAiUIBAgGZSTIgQgDiAGlCANIBmUkyICIAIgBF4iARtdDQIgCYwgAiAEIAEbXg0CIAwgBZMiBSAQlCATIA0gB5MiBJSTIgIgBSANlCAMIASUkyIJIAIgCV0iARsgBYsiCyAXlCAEiyIPIBiUkiIKXg0CIAqMIAkgAiABG14NAiAGIAOTIgIgE5QgCCAFlJMiCSACIAyUIAYgBZSTIgYgBiAJXiIBGyALIBaUIAKLIgogGJSSIgVeDQIgBYwgBiAJIAEbXg0CIAQgA5QgByAClJMiAyAEIAiUIBAgApSTIgYgAyAGXSIBGyAPIBaUIAogF5SSIgheQX9zIAiMIAYgAyABG15FcUUNAiAAIAAoAgRBBHI2AgQgACgCECIAKAIEIgEgACgCAEYEQCAAEOMDIAAoAgQhAQsgACABQQFqNgIEIAAoAgggAUECdGogJTYCAA8LIAAgIRCXAyAAKAIEQQVxQQVGDQEgASgCGCEhIAAgACgCLCIiQQFqNgIsICFBHGohASAhKgIoIgMgACoC3AGSvCAAKgKsASAhKgIcIgKTIge8Qf////8HcU8NAAsLCygBAX8gAEGI6wA2AgAgACgCCCIBBEAgAUEEaxCKBCAAQQA2AggLIAALDQAgABCYAxogABCKBAvnAgIHfwF+IwBBEGsiBSQAAkAgAUUNACABKAIsIgMgASgCIEEBdEEBa0cNAAJAIAMgACgCBEYEQCAAKAIIIQQMAQsgACADNgIEIAAoAggiAgRAIAJBBGsQigQgAEEANgIIIAAoAgQhAwtBf0F/IAOtQhx+IgmnIgJBBGoiBiACIAZLGyAJQiCIpxsQjQQiAiADNgIAIAJBBGohBAJAIANFDQAgBCECIANBHGwiB0EcayIIQRxuQQFqQQdxIgYEQEEAIQMDQCACQQA2AhggAkEcaiECIANBAWoiAyAGRw0ACwsgCEHEAUkNACAEIAdqIQMDQCACQQA2AhggAkEANgLcASACQQA2AsABIAJBADYCpAEgAkEANgKIASACQQA2AmwgAkEANgJQIAJBADYCNCACQeABaiICIANHDQALCyAAIAQ2AggLQQEhAiAFQQE2AgwgBEEAIAVBDGogARCbAwsgBUEQaiQAIAIL7AEBA38gACABQRxsaiIEIAMpAgA3AgAgBCADKAIINgIIIAQgAygCFDYCFCAEIAMpAgw3AgwgAygCGCIEQQFLBEAgA0EYaiEGA0AgAiACKAIAIgVBAmo2AgAgACABQRxsaiAAIAVBHGxqIgE2AhggACAFIAIgBEF+cRCbAyABIAYoAgBBfnEiBEEkaiIDQQAgBBsiBCkCADcCHCABIAQoAgg2AiQgASAEKAIUNgIwIAEgBCkCDDcCKCAEQRhqIQYgBUEBaiEBIAQoAhgiBEECTw0ACwsgACABQRxsaiADKAIcKAIAQQF0QQFyNgIYCwQAQQALGAAgAQRAIAAoAgggASACEJ4DCyABQQBHC0MBAX8CQCAARQ0AIAAgAiABEQcARQ0AA0AgACgCGCIDQQFxDQEgAyABIAIQngMgACgCGEEcaiIAIAIgAREHAA0ACwsLKAEBfyAAQajrADYCACAAKAIIIgEEQCABQQRrEIoEIABBADYCCAsgAAsNACAAEJ8DGiAAEIoEC9oCAQd/IwBBEGsiBSQAAkAgAUUNACABKAIsIAEoAiAiA0EBdEEBa0cNAAJAIANBAWsiAyAAKAIERgRAIAAoAgghBAwBCyAAIAM2AgQgACgCCCICBEAgAkEEaxCKBCAAQQA2AgggACgCBCEDC0F/IANBBXQiBkEEciADQf///z9LGxCNBCICIAM2AgAgAkEEaiEEAkAgA0UNACADQQFrQf///z9xIQcgBCECIANBB3EiCARAQQAhAwNAIAJCADcCGCACQSBqIQIgA0EBaiIDIAhHDQALCyAHQQdJDQAgBCAGaiEDA0AgAkIANwIYIAJCADcC+AEgAkIANwLYASACQgA3ArgBIAJCADcCmAEgAkIANwJ4IAJCADcCWCACQgA3AjggAkGAAmoiAiADRw0ACwsgACAENgIIC0EBIQIgBUEBNgIMIARBACAFQQxqIAEQogMLIAVBEGokACACC+gBAQR/IAMoAhghBANAIAAgAUEFdGoiASADKQIANwIAIAEgAygCCDYCCCABIAMoAhQ2AhQgASADKQIMNwIMIARBfnEiBEEkaiIDQQAgBBshBiABQRhqIQUCQCAEKAIYQQFNBEAgBSAEKAIcKAIAQQF0QQFyNgIADAELIAIgAigCACIHQQFqNgIAIAUgACAHQQV0ajYCACAAIAcgAiAEEKIDCyABQRxqIQUgBigCGCIEQQFNBEAgBSAGKAIcKAIAQQF0QQFyNgIABSACIAIoAgAiAUEBajYCACAFIAAgAUEFdGo2AgAMAQsLC9AKAgl/EH0CQCABRQ0AIAAoAgQiCEUNAEGcswEhCUGgswEhCgNAAn0gACgCCCAIQQFrIghBBXRqIgYoAhgiAkEBcQRAIAEoAgggASgCECACQQF2bGohAgJAIAEtABhFBEBBgLMBIAEoAgwiBCABKAIUIgUgAigCAGxqIgMrAwC2Ig44AgBBhLMBIAMrAwi2Ig84AgBBiLMBIAMrAxC2IhA4AgBBjLMBIAQgBSACKAIEbGoiAysDALYiETgCAEGQswEgAysDCLYiEjgCAEGUswEgAysDELYiEzgCAEGYswEgBCAFIAIoAghsaiICKwMAtiIMOAIAIAkgAisDCLYiCzgCACAKIAIrAxC2Ig04AgAMAQsgASgCDCIEIAEoAhQiBSACKAIIbGoiAyoCCCENIAQgAigCBCAFbGoiByoCCCETIAQgBSACKAIAbGoiAioCCCEQIAMqAgQhCyAHKgIEIRIgAioCBCEPIAMqAgAhDCAHKgIAIREgAioCACEOCyAQIA0gDSAQXRsgEyANIA0gE10bIBAgE14bIRQgDyALIAsgD10bIBIgCyALIBJdGyAPIBJeGyEVIA8gCyALIA9eGyASIAsgCyASXhsgDyASXRshFiAOIAwgDCAOXRsgESAMIAwgEV0bIA4gEV4bIRcgDiAMIAwgDl4bIBEgDCAMIBFeGyAOIBFdGyEYIBAgDSANIBBeGyATIA0gDSATXhsgECATXRsMAQsgAioCACIMIAIqAgwiC5IhFyAMIAuTIRggAioCCCIMIAIqAhQiC5IhFCACKgIEIg0gAioCECIOkiEVIA0gDpMhFiAMIAuTCyEaAkAgBigCHCICQQFxBEAgASgCCCABKAIQIAJBAXZsaiECAkAgAS0AGEUEQEGAswEgASgCDCIEIAEoAhQiBSACKAIAbGoiAysDALYiDjgCAEGEswEgAysDCLYiDzgCAEGIswEgAysDELYiEDgCAEGMswEgBCAFIAIoAgRsaiIDKwMAtiIROAIAQZCzASADKwMItiISOAIAQZSzASADKwMQtiITOAIAQZizASAEIAUgAigCCGxqIgIrAwC2Igw4AgAgCSACKwMItiILOAIAIAogAisDELYiDTgCAAwBCyABKAIMIgQgASgCFCIFIAIoAghsaiIDKgIIIQ0gBCACKAIEIAVsaiIHKgIIIRMgBCAFIAIoAgBsaiICKgIIIRAgAyoCBCELIAcqAgQhEiACKgIEIQ8gAyoCACEMIAcqAgAhESACKgIAIQ4LIBAgDSANIBBdGyATIA0gDSATXRsgECATXhshGSAQIA0gDSAQXhsgEyANIA0gE14bIBAgE10bIQ0gDyALIAsgD10bIBIgCyALIBJdGyAPIBJeGyEQIA8gCyALIA9eGyASIAsgCyASXhsgDyASXRshCyAOIAwgDCAOXRsgESAMIAwgEV0bIA4gEV4bIQ8gDiAMIAwgDl4bIBEgDCAMIBFeGyAOIBFdGyEMDAELIAIqAgAiDCACKgIMIguSIQ8gDCALkyEMIAIqAggiCyACKgIUIg2SIRkgAioCBCIOIAIqAhAiEZIhECALIA2TIQ0gDiARkyELCyAGIBQgGSAUIBleGyIOIBogDSANIBpeGyINk0MAAAA/lDgCFCAGIBUgECAQIBVdGyIQIBYgCyALIBZeGyILk0MAAAA/lDgCECAGIBcgDyAPIBddGyIPIBggDCAMIBheGyIMk0MAAAA/lDgCDCAGIA0gDpJDAAAAP5Q4AgggBiALIBCSQwAAAD+UOAIEIAYgDCAPkkMAAAA/lDgCACAIDQALCyABQQBHCxgAIAEEQCAAKAIIIAEgAhClAwsgAUEARwtCAQF/AkAgAEUNAANAIAAgAiABEQcARQ0BIAAoAhgiA0EBcUUEQCADIAEgAhClAwsgACgCHCIAQQFxDQEgAA0ACwsLKAEBfyAAQcjrADYCACAAKAIIIgEEQCABQQRrEIoEIABBADYCCAsgAAsNACAAEKYDGiAAEIoEC/UNAw9/Fn0BfiMAQRBrIgokAAJAIAFFDQAgASgCLCIDIAEoAiBBAXRBAWtHDQAgACADNgIEIAAoAggiAgRAIAJBBGsQigQgAEEANgIIIAAoAgQhAwtBf0F/IAOtQhx+IienIgJBBGoiBSACIAVLGyAnQiCIpxsQjQQiCyADNgIAIAtBBGohBwJAIANFDQAgByECIANBHGwiCEEcayIGQRxuQQFqQQdxIgUEQEEAIQMDQCACQQA2AhggAkEcaiECIANBAWoiAyAFRw0ACwsgBkHEAUkNACAHIAhqIQMDQCACQQA2AhggAkEANgLcASACQQA2AsABIAJBADYCpAEgAkEANgKIASACQQA2AmwgAkEANgJQIAJBADYCNCACQeABaiICIANHDQALCyAKQQE2AgxBACEDIAdBACAKQQxqIAEQmwNBfyAAKAIEIgRBBHRBBHIgBEH/////AEsbEI0EIgIgBDYCACACQQRqIQkCQCAERQRAIAAgCTYCCEP//3//IRFD//9//yESQ///f/8hFUP//3//IRZD//9//yEXQ///f/8hEwwBCyAEQQFrQf////8AcSEBIAkhAiAEQQdxIgUEQANAIAJBADYCDCACQRBqIQIgA0EBaiIDIAVHDQALCyABQQdPBEAgCSAEQQR0aiEDA0AgAkEANgIMIAJBADYCfCACQQA2AmwgAkEANgJcIAJBADYCTCACQQA2AjwgAkEANgIsIAJBADYCHCACQYABaiICIANHDQALCyAAIAk2AghD//9//yETIARFBEBD//9//yERQ///f/8hEkP//3//IRVD//9//yEWQ///f/8hFwwBC0EAIQND//9//yEXQ///f/8hFkP//3//IRVD//9//yESQ///f/8hEQNAIAcgA0EcbGoiAioCDIsiFCARIBEgFF0bIREgAioCCIsiFCATIBMgFF0bIRMgAioCBIsiFCAXIBQgF14bIRcgAioCAIsiFCAWIBQgFl4bIRYgAioCFIsiFCAVIBQgFV4bIRUgAioCEIsiFCASIBIgFF0bIRIgA0EBaiIDIARHDQALCyAAQwAAgD9DAP7/RiAVlUMAAAAAIBVDAAAAAFwbIhiVQwAAAAAgGEMAAAAAXBsiFDgCICAAQwAAgD9DAP7/RiASlUMAAAAAIBJDAAAAAFwbIhmVQwAAAAAgGUMAAAAAXBsiHzgCHCAAQwAAgD9DAP7/RiARlUMAAAAAIBFDAAAAAFwbIhqVQwAAAAAgGkMAAAAAXBsiIDgCGCAAQwAAgD9DAP7/RiATlUMAAAAAIBNDAAAAAFwbIhuVQwAAAAAgG0MAAAAAXBsiITgCFCAAQwAAgD9DAP7/RiAXlUMAAAAAIBdDAAAAAFwbIhyVQwAAAAAgHEMAAAAAXBsiIjgCECAAQwAAgD9DAP7/RiAWlUMAAAAAIBZDAAAAAFwbIh2VQwAAAAAgHUMAAAAAXBsiIzgCDCAEBEBBACEIA0AgCSAIQQR0aiIBAn8gHSAHIAhBHGxqIgYqAgAiF5QiEYtDAAAAT10EQCARqAwBC0GAgICAeAsiADsBACABAn8gHCAGKgIEIhaUIhGLQwAAAE9dBEAgEagMAQtBgICAgHgLIgw7AQIgAQJ/IBsgBioCCCIVlCIRi0MAAABPXQRAIBGoDAELQYCAgIB4CyINOwEEIAYqAhAhESAGKgIMIRICfyAYIAYqAhQiHpQiE0MAAIBPXSATQwAAAABgcQRAIBOpDAELQQALIQICfyAZIBGUIhNDAACAT10gE0MAAAAAYHEEQCATqQwBC0EACyEDIACyISQCfyAaIBKUIhNDAACAT10gE0MAAAAAYHEEQCATqQwBC0EACyEAIBUgHpMhEyAWIBGTISUgFyASkyEmIBUgHpIhFSAWIBGSIRYgFyASkiEXIAFBCmohDiABQQhqIQ8gAUEGaiEQICMgJJQhEQJAAkADQCARICAgAEH//wNxIgWzlCISkiAXXSARIBKTICZecgRAIAVBAWoiAEH//wNxIABGDQEMAgsLIAUNAQtB//8DIQALIBAgADsBACAiIAyylCERAkACQANAIBEgHyADQf//A3EiALOUIhKSIBZdIBEgEpMgJV5yBEAgAEEBaiIDQf//A3EgA0YNAQwCCwsgAA0BC0H//wMhAwsgDyADOwEAICEgDbKUIRECQAJAA0AgESAUIAJB//8DcSIDs5QiEpIgFV0gESASkyATXnIEQCADQQFqIgJB//8DcSACRg0BDAILCyADDQELQf//AyECCyAOIAI7AQAgASAGKAIYIgJBAXEEfyACBSAJIAIgB2tBHG5BBHRqCzYCDCAIQQFqIgggBEcNAAsLIAsQigRBASECCyAKQRBqJAAgAgsYACABBEAgACgCCCABIAIQqgMLIAFBAEcLQwEBfwJAIABFDQAgACACIAERBwBFDQADQCAAKAIMIgNBAXENASADIAEgAhCqAyAAKAIMQRBqIgAgAiABEQcADQALCwsoAQF/IABB6OsANgIAIAAoAggiAQRAIAFBBGsQigQgAEEANgIICyAACw0AIAAQqwMaIAAQigQLlg4DD38WfQF+IwBBEGsiCiQAAkAgAUUNACABKAIsIAEoAiAiA0EBdEEBa0cNACAAIANBAWsiAzYCBCAAKAIIIgIEQCACQQRrEIoEIABBADYCCCAAKAIEIQMLQX8gA0EFdCIEQQRyIANB////P0sbEI0EIgsgAzYCACALQQRqIQYCQCADRQ0AIANBAWtB////P3EhCSAGIQIgA0EHcSIFBEBBACEDA0AgAkIANwIYIAJBIGohAiADQQFqIgMgBUcNAAsLIAlBB0kNACAEIAZqIQMDQCACQgA3AhggAkIANwL4ASACQgA3AtgBIAJCADcCuAEgAkIANwKYASACQgA3AnggAkIANwJYIAJCADcCOCACQYACaiICIANHDQALCyAKQQE2AgxBACEDIAZBACAKQQxqIAEQogNBf0F/IAAoAgQiB61CFH4iJ6ciAkEEaiIFIAIgBUsbICdCIIinGxCNBCICIAc2AgAgAkEEaiEIAkAgB0UEQCAAIAg2AghD//9//yERQ///f/8hEkP//3//IRVD//9//yEWQ///f/8hF0P//3//IRMMAQsgCCECIAdBFGwiBEEUayIBQRRuQQFqQQdxIgUEQANAIAJCADcCDCACQRRqIQIgA0EBaiIDIAVHDQALCyABQYwBTwRAIAQgCGohAwNAIAJCADcCDCACQgA3ApgBIAJCADcChAEgAkIANwJwIAJCADcCXCACQgA3AkggAkIANwI0IAJCADcCICACQaABaiICIANHDQALCyAAIAg2AghD//9//yETIAdFBEBD//9//yERQ///f/8hEkP//3//IRVD//9//yEWQ///f/8hFwwBC0EAIQND//9//yEXQ///f/8hFkP//3//IRVD//9//yESQ///f/8hEQNAIAYgA0EFdGoiAioCDIsiFCARIBEgFF0bIREgAioCCIsiFCATIBMgFF0bIRMgAioCBIsiFCAXIBQgF14bIRcgAioCAIsiFCAWIBQgFl4bIRYgAioCFIsiFCAVIBQgFV4bIRUgAioCEIsiFCASIBIgFF0bIRIgA0EBaiIDIAdHDQALCyAAQwAAgD9DAP7/RiAVlUMAAAAAIBVDAAAAAFwbIhiVQwAAAAAgGEMAAAAAXBsiFDgCICAAQwAAgD9DAP7/RiASlUMAAAAAIBJDAAAAAFwbIhmVQwAAAAAgGUMAAAAAXBsiHzgCHCAAQwAAgD9DAP7/RiARlUMAAAAAIBFDAAAAAFwbIhqVQwAAAAAgGkMAAAAAXBsiIDgCGCAAQwAAgD9DAP7/RiATlUMAAAAAIBNDAAAAAFwbIhuVQwAAAAAgG0MAAAAAXBsiITgCFCAAQwAAgD9DAP7/RiAXlUMAAAAAIBdDAAAAAFwbIhyVQwAAAAAgHEMAAAAAXBsiIjgCECAAQwAAgD9DAP7/RiAWlUMAAAAAIBZDAAAAAFwbIh2VQwAAAAAgHUMAAAAAXBsiIzgCDCAHBEBBACEJA0AgCCAJQRRsaiIBAn8gHSAGIAlBBXRqIgQqAgAiF5QiEYtDAAAAT10EQCARqAwBC0GAgICAeAsiADsBACABAn8gHCAEKgIEIhaUIhGLQwAAAE9dBEAgEagMAQtBgICAgHgLIgw7AQIgAQJ/IBsgBCoCCCIVlCIRi0MAAABPXQRAIBGoDAELQYCAgIB4CyINOwEEIAQqAhAhESAEKgIMIRICfyAYIAQqAhQiHpQiE0MAAIBPXSATQwAAAABgcQRAIBOpDAELQQALIQICfyAZIBGUIhNDAACAT10gE0MAAAAAYHEEQCATqQwBC0EACyEDIACyISQCfyAaIBKUIhNDAACAT10gE0MAAAAAYHEEQCATqQwBC0EACyEAIBUgHpMhEyAWIBGTISUgFyASkyEmIBUgHpIhFSAWIBGSIRYgFyASkiEXIAFBCmohDiABQQhqIQ8gAUEGaiEQICMgJJQhEQJAAkADQCARICAgAEH//wNxIgWzlCISkiAXXSARIBKTICZecgRAIAVBAWoiAEH//wNxIABGDQEMAgsLIAUNAQtB//8DIQALIBAgADsBACAiIAyylCERAkACQANAIBEgHyADQf//A3EiALOUIhKSIBZdIBEgEpMgJV5yBEAgAEEBaiIDQf//A3EgA0YNAQwCCwsgAA0BC0H//wMhAwsgDyADOwEAICEgDbKUIRECQAJAA0AgESAUIAJB//8DcSIDs5QiEpIgFV0gESASkyATXnIEQCADQQFqIgJB//8DcSACRg0BDAILCyADDQELQf//AyECCyAOIAI7AQAgASAEKAIYIgIgCCACIAZrQQV2QRRsaiACQQFxGzYCDCABIAQoAhwiAiAIIAIgBmtBBXZBFGxqIAJBAXEbNgIQIAlBAWoiCSAHRw0ACwsgCxCKBEEBIQILIApBEGokACACCxgAIAEEQCAAKAIIIAEgAhCvAwsgAUEARwtCAQF/AkAgAEUNAANAIAAgAiABEQcARQ0BIAAoAgwiA0EBcUUEQCADIAEgAhCvAwsgACgCECIAQQFxDQEgAA0ACwsLCgAgACgCBEEcbAsKACAAKAIEQQV0CwoAIAAoAgRBBHQLCgAgACgCBEEUbAsrAQF/IABB3O0ANgIAIAAoAjgiAQRAIAFBBGsQigQgAEEANgI4CyAAENsDCw0AIAAQtAMaIAAQigQLBwAgABCKBAteAQF/An9Bq+AAIAAqAoQBQwAAAABdDQAaQdPgACAAKAIEIgFBA3FBAkYNABoCQCAALQCIAUUNACABQQNxRQ0AQYrhAEHx3wAgAUEBcRsPCyABQRt0QR91Qd/TAHELC6cWAgt/EX0gAEHMAGohB0GQswEhCEGUswEhCUGcswEhCkGgswEhCwJAA0AgAS8BCCEFIAEvAQohBiABLwECIQQgAS4BBCEMIAEuAQAhAiABLwEGIQMgACAAKAJgQQFqNgJgIAAqAkAgACoCbCACspSTIg2LIAAqAnggA7OUIg4gACoCKCIPkl4NASAAKgJEIAAqAnAgBMGylJMiEIsgACoCfCAFs5QiFCAAKgIsIhWSXg0BIAAqAkggACoCdCAMspSTIhGLIAAqAoABIAazlCIXIAAqAjAiGJJeDQEgACoCOCISIBGUIBAgACoCPCITlJOLIBQgGJQgFyAVlJJeDQEgEyANlCARIAAqAjQiE5STiyAOIBiUIBcgD5SSXg0BIBMgEJQgDSASlJOLIA4gFZQgFCAPlJJeDQECQCABKAIMIgNBAXEEQCAAKAIMIgIoAgggA0EBdiIGIAIoAhBsaiEDAkAgAi0AGEUEQEGAswEgAigCDCIFIAIoAhQiAiADKAIAbGoiBCsDALYiDTgCAEGEswEgBCsDCLYiDjgCAEGIswEgBCsDELYiDzgCAEGMswEgBSACIAMoAgRsaiIEKwMAtiIQOAIAIAggBCsDCLYiEjgCACAJIAQrAxC2IhQ4AgBBmLMBIAUgAiADKAIIbGoiAisDALYiFTgCACAKIAIrAwi2IhE4AgAgCyACKwMQtiITOAIADAELIAIoAgwiBSACKAIUIgIgAygCCGxqIgQqAgghEyAEKgIEIREgBCoCACEVIAUgAiADKAIAbGoiBCoCCCEPIAUgAygCBCACbGoiAioCCCEUIAQqAgQhDiACKgIEIRIgBCoCACENIAIqAgAhEAsgACAAKAJkQQFqNgJkIBQgD5MiGSAAKgIcIhQgESAOkyIXlCAVIA2TIhggACoCICIVlJMiFpQgECANkyIbIBUgEyAPkyITlCAXIAAqAiQiEZSTIhqUIBIgDpMiEiARIBiUIBMgFJSTIhyUkpIhEAJAIAAtAIkBBEAgEEO9N4Y1XQ0DIAAgACoCGCAPkyIPIBaUIAAqAhAgDZMiFiAalCAcIAAqAhQgDpMiDpSSkiINOAJUIA28IgJBAEgNAyACIBC8Sw0DIAAgESAWIBKUIBsgDpSTIhqUIBQgDiAZlCASIA+UkyIRlCAVIA8gG5QgGSAWlJMiD5SSkiIOOAJYIA68QQBIDQMgDSAOkiAQXg0DIAAgEyAalCAYIBGUIBcgD5SSkiIPOAJQIA+8QQBIDQMgAEMAAIA/IBCVIhAgDpQ4AlggACAQIA2UOAJUIAAgECAPlCINOAJQIA28IQIMAQsgEEO9N4Y1XSAQQ703hrVecQ0CIABDAACAPyAQlSIdIAAqAhggD5MiDyAWlCAAKgIQIA2TIhAgGpQgHCAAKgIUIA6TIg6UkpKUIg04AlQgDbxBgICA/ANLDQIgACAdIBEgECASlCAbIA6UkyIWlCAUIA4gGZQgEiAPlJMiEZQgFSAPIBuUIBkgEJSTIg+UkpKUIg44AlggDrxBAEgNAiANIA6SQwAAgD9eDQIgACAdIBMgFpQgGCARlCAXIA+UkpKUIg04AlAgDbwiAkEASA0CCyACIAAoAoQBTw0BIAAgBjYCTCAAIAAoAmhBAWo2AmggACAAKAIEQQRyNgIEIAAoAlwiAkUNASAALQCIAUEAIAIoAgQiA0EDSxtFBEAgAigCACADRgRAIAIQ4wMgAigCBCEDIAAqAlAhDQsgAiADQQFqNgIEIAIoAggiBSADQQJ0aiAGNgIAIAIoAgQiAyACKAIARgRAIAIQ4wMgAigCCCEFIAIoAgQhAwsgAiADQQFqNgIEIAUgA0ECdGogDTgCACAAKgJUIQ0gAigCBCIDIAIoAgBGBEAgAhDjAyACKAIIIQUgAigCBCEDCyACIANBAWo2AgQgBSADQQJ0aiANOAIAIAAqAlghDSACKAIEIgMgAigCAEYEQCACEOMDIAIoAgghBSACKAIEIQMLIAIgA0EBajYCBCAFIANBAnRqIA04AgAMAgsgAigCCCICRQ0BIA0gAioCBF1FDQEgAiAHKQIANwIAIAIgBykCCDcCCAwBCyAAIAMQuAMLIAAoAgQiAkEFcUEFRg0BIAEoAhAiAUEBcUUNAAsgACgCDCIDKAIIIAFBAXYiBiADKAIQbGohAQJAIAMtABhFBEBBgLMBIAMoAgwiBSADKAIUIgMgASgCAGxqIgQrAwC2Ig04AgBBhLMBIAQrAwi2Ig44AgBBiLMBIAQrAxC2Ig84AgBBjLMBIAUgAyABKAIEbGoiBCsDALYiEDgCAEGQswEgBCsDCLYiEjgCAEGUswEgBCsDELYiFDgCAEGYswEgBSADIAEoAghsaiIBKwMAtiIVOAIAQZyzASABKwMItiIROAIAQaCzASABKwMQtiITOAIADAELIAMoAgwiBSADKAIUIgMgASgCCGxqIgQqAgghEyAEKgIEIREgBCoCACEVIAUgAyABKAIAbGoiBCoCCCEPIAUgASgCBCADbGoiASoCCCEUIAQqAgQhDiABKgIEIRIgBCoCACENIAEqAgAhEAsgACAAKAJkQQFqNgJkIBQgD5MiFiAAKgIcIhQgESAOkyIXlCAVIA2TIhggACoCICIVlJMiGZQgECANkyIaIBUgEyAPkyITlCAXIAAqAiQiEZSTIhuUIBIgDpMiHCARIBiUIBMgFJSTIhKUkpIhEAJAIAAtAIkBBEAgEEO9N4Y1XQ0CIAAgACoCGCAPkyIPIBmUIAAqAhAgDZMiGSAblCASIAAqAhQgDpMiDpSSkiINOAJUIA28IgFBAEgNAiABIBC8Sw0CIAAgESAZIByUIBogDpSTIhKUIBQgDiAWlCAcIA+UkyIRlCAVIA8gGpQgFiAZlJMiD5SSkiIOOAJYIA68QQBIDQIgDSAOkiAQXg0CIAAgEyASlCAYIBGUIBcgD5SSkiIPOAJQIA+8QQBIDQIgAEMAAIA/IBCVIhAgDpQ4AlggACAQIA2UOAJUIAAgECAPlCINOAJQIA28IQEMAQsgEEO9N4Y1XSAQQ703hrVecQ0BIABDAACAPyAQlSIdIAAqAhggD5MiDyAZlCAAKgIQIA2TIhAgG5QgEiAAKgIUIA6TIg6UkpKUIg04AlQgDbxBgICA/ANLDQEgACAdIBEgECAclCAaIA6UkyISlCAUIA4gFpQgHCAPlJMiEZQgFSAPIBqUIBYgEJSTIg+UkpKUIg44AlggDrxBAEgNASANIA6SQwAAgD9eDQEgACAdIBMgEpQgGCARlCAXIA+UkpKUIg04AlAgDbwiAUEASA0BCyABIAAoAoQBTw0AIAAgBjYCTCAAIAJBBHI2AgQgACAAKAJoQQFqNgJoIAAoAlwiAUUNACAALQCIAUEAIAEoAgQiAkEDSxtFBEAgASgCACACRgRAIAEQ4wMgACoCUCENIAEoAgQhAgsgASACQQFqNgIEIAEoAggiAyACQQJ0aiAGNgIAIAEoAgQiAiABKAIARgRAIAEQ4wMgASgCCCEDIAEoAgQhAgsgASACQQFqNgIEIAMgAkECdGogDTgCACAAKgJUIQ0gASgCBCICIAEoAgBGBEAgARDjAyABKAIIIQMgASgCBCECCyABIAJBAWo2AgQgAyACQQJ0aiANOAIAIAAqAlghDSABKAIEIgAgASgCAEYEQCABEOMDIAEoAgghAyABKAIEIQALIAEgAEEBajYCBCADIABBAnRqIA04AgAPCyABKAIIIgBFDQAgDSAAKgIEXUUNACAAIAcpAgA3AgAgACAHKQIINwIICwvPFgILfxF9IABBzABqIQdBkLMBIQhBlLMBIQlBnLMBIQpBoLMBIQsCQANAIAEvAQghBSABLwEKIQYgAS4BAiEEIAEuAQQhDCABLwEGIQIgAS4BACEDIAAgACgCYEEBajYCYCAAKgJ0IRcgACoCcCENIAAqAoABIREgACoCfCEPIAAqAnggArOUIhK8IAAqAhAgACoCbCADspSTIhC8Qf////8HcUkEQCAQIAAqAhyUQwAAAABgDQILIA8gBbOUIhS8IAAqAhQgDSAEspSTIg68Qf////8HcUkEQCAOIAAqAiCUQwAAAABgDQILIBEgBrOUIhG8IAAqAhggFyAMspSTIg+8Qf////8HcUkgDyAAKgIkIg2UQwAAAABgcQ0BIAAqAiAiFyAPlCAOIA2Uk4sgFCAAKgIwIhWUIBEgACoCLCITlJJeDQEgDSAQlCAPIAAqAhwiG5STiyASIBWUIBEgACoCKCIPlJJeDQEgGyAOlCAQIBeUk4sgEiATlCAUIA+Ukl4NAQJAIAEoAgwiA0EBcQRAIA2MIREgG4whEyAXjCEVIAAoAgwiAigCCCADQQF2IgYgAigCEGxqIQMCQCACLQAYRQRAQYCzASACKAIMIgUgAigCFCICIAMoAgBsaiIEKwMAtiIPOAIAQYSzASAEKwMItiIOOAIAQYizASAEKwMQtiIQOAIAQYyzASAFIAIgAygCBGxqIgQrAwC2Ihg4AgAgCCAEKwMItiIZOAIAIAkgBCsDELYiFDgCAEGYswEgBSACIAMoAghsaiICKwMAtiISOAIAIAogAisDCLYiFjgCACALIAIrAxC2Iho4AgAMAQsgAigCDCIFIAIoAhQiAiADKAIIbGoiBCoCCCEaIAQqAgQhFiAEKgIAIRIgBSACIAMoAgBsaiIEKgIIIRAgBSADKAIEIAJsaiICKgIIIRQgBCoCBCEOIAIqAgQhGSAEKgIAIQ8gAioCACEYCyAAIAAoAmRBAWo2AmQgFCAQkyIcIBsgFiAOkyIUlCASIA+TIhIgFZSSIhaUIBggD5MiHSAXIBogEJMiFZQgFCARlJIiGJQgGSAOkyIZIA0gEpQgFSATlJIiE5SSkiERAkAgAC0AiQEEQCARQ703hjVdDQMgACAAKgIYIBCTIhAgFpQgACoCECAPkyIWIBiUIBMgACoCFCAOkyIOlJKSIg84AlQgD7wiAkEASA0DIAIgEbxLDQMgACANIBYgGZQgHSAOlJMiE5QgGyAOIByUIBkgEJSTIg6UIBcgECAdlCAcIBaUkyIQlJKSIg04AlggDbxBAEgNAyAPIA2SIBFeDQMgACAVIBOUIBIgDpQgFCAQlJKSIg44AlAgDrxBAEgNAyAAQwAAgD8gEZUiECANlDgCWCAAIBAgD5Q4AlQgACAQIA6UIg04AlAMAQsgEUO9N4Y1XSARQ703hrVecQ0CIABDAACAPyARlSIaIAAqAhggEJMiECAWlCAAKgIQIA+TIhEgGJQgEyAAKgIUIA6TIg6UkpKUIg84AlQgD7xBgICA/ANLDQIgACAaIA0gESAZlCAdIA6UkyITlCAbIA4gHJQgGSAQlJMiDpQgFyAQIB2UIBwgEZSTIhCUkpKUIg04AlggDbxBAEgNAiAPIA2SQwAAgD9eDQIgACAaIBUgE5QgEiAOlCAUIBCUkpKUIg04AlAgDbxBAEgNAgsgACAGNgJMIAAgACgCaEEBajYCaCAAIAAoAgRBBHI2AgQgACgCXCICRQ0BIAAtAIgBQQAgAigCBCIDQQNLG0UEQCACKAIAIANGBEAgAhDjAyAAKgJQIQ0gAigCBCEDCyACIANBAWo2AgQgAigCCCIFIANBAnRqIAY2AgAgAigCBCIDIAIoAgBGBEAgAhDjAyACKAIIIQUgAigCBCEDCyACIANBAWo2AgQgBSADQQJ0aiANOAIAIAAqAlQhDSACKAIEIgMgAigCAEYEQCACEOMDIAIoAgghBSACKAIEIQMLIAIgA0EBajYCBCAFIANBAnRqIA04AgAgACoCWCENIAIoAgQiAyACKAIARgRAIAIQ4wMgAigCCCEFIAIoAgQhAwsgAiADQQFqNgIEIAUgA0ECdGogDTgCAAwCCyACKAIIIgJFDQEgDSACKgIEXUUNASACIAcpAgA3AgAgAiAHKQIINwIIDAELIAAgAxC5AwsgACgCBCICQQVxQQVGDQEgASgCECIBQQFxRQ0ACyAAKAIMIgMoAgggAUEBdiIGIAMoAhBsaiEBAkAgAy0AGEUEQEGAswEgAygCDCIFIAMoAhQiAyABKAIAbGoiBCsDALYiDTgCAEGEswEgBCsDCLYiDzgCAEGIswEgBCsDELYiDjgCAEGMswEgBSADIAEoAgRsaiIEKwMAtiIQOAIAQZCzASAEKwMItiITOAIAQZSzASAEKwMQtiIROAIAQZizASAFIAMgASgCCGxqIgErAwC2IhQ4AgBBnLMBIAErAwi2IhI4AgBBoLMBIAErAxC2IhU4AgAMAQsgAygCDCIFIAMoAhQiAyABKAIIbGoiBCoCCCEVIAQqAgQhEiAEKgIAIRQgBSADIAEoAgBsaiIEKgIIIQ4gBSABKAIEIANsaiIBKgIIIREgBCoCBCEPIAEqAgQhEyAEKgIAIQ0gASoCACEQCyAAIAAoAmRBAWo2AmQgESAOkyIWIAAqAhwiESASIA+TIheUIBQgDZMiGyAAKgIgIhSUkyIYlCAQIA2TIhogFCAVIA6TIhWUIBcgACoCJCISlJMiGZQgEyAPkyIcIBIgG5QgFSARlJMiE5SSkiEQAkAgAC0AiQEEQCAQQ703hjVdDQIgACAAKgIYIA6TIg4gGJQgACoCECANkyIYIBmUIBMgACoCFCAPkyIPlJKSIg04AlQgDbwiAUEASA0CIAEgELxLDQIgACASIBggHJQgGiAPlJMiE5QgESAPIBaUIBwgDpSTIhKUIBQgDiAalCAWIBiUkyIOlJKSIg84AlggD7xBAEgNAiANIA+SIBBeDQIgACAVIBOUIBsgEpQgFyAOlJKSIg44AlAgDrxBAEgNAiAAQwAAgD8gEJUiECAPlDgCWCAAIBAgDZQ4AlQgACAQIA6UIg04AlAMAQsgEEO9N4Y1XSAQQ703hrVecQ0BIABDAACAPyAQlSIdIAAqAhggDpMiDiAYlCAAKgIQIA2TIhAgGZQgEyAAKgIUIA+TIg+UkpKUIg04AlQgDbxBgICA/ANLDQEgACAdIBIgECAclCAaIA+UkyITlCARIA8gFpQgHCAOlJMiEpQgFCAOIBqUIBYgEJSTIg6UkpKUIg84AlggD7xBAEgNASANIA+SQwAAgD9eDQEgACAdIBUgE5QgGyASlCAXIA6UkpKUIg04AlAgDbxBAEgNAQsgACAGNgJMIAAgAkEEcjYCBCAAIAAoAmhBAWo2AmggACgCXCIBRQ0AIAAtAIgBQQAgASgCBCICQQNLG0UEQCABKAIAIAJGBEAgARDjAyAAKgJQIQ0gASgCBCECCyABIAJBAWo2AgQgASgCCCIDIAJBAnRqIAY2AgAgASgCBCICIAEoAgBGBEAgARDjAyABKAIIIQMgASgCBCECCyABIAJBAWo2AgQgAyACQQJ0aiANOAIAIAAqAlQhDSABKAIEIgIgASgCAEYEQCABEOMDIAEoAgghAyABKAIEIQILIAEgAkEBajYCBCADIAJBAnRqIA04AgAgACoCWCENIAEoAgQiACABKAIARgRAIAEQ4wMgASgCCCEDIAEoAgQhAAsgASAAQQFqNgIEIAMgAEECdGogDTgCAA8LIAEoAggiAEUNACANIAAqAgRdRQ0AIAAgBykCADcCACAAIAcpAgg3AggLC4oWAgh/EX0gACAAKAJgQQFqNgJgAkAgACoCQCABKgIAkyIKiyABKgIMIgsgACoCKCIMkl4NACAAQcwAaiEHQZyzASEIQaCzASEJA0AgACoCRCABKgIEkyINiyABKgIQIhEgACoCLCISkl4NASAAKgJIIAEqAgiTIg6LIAEqAhQiFCAAKgIwIhWSXg0BIAAqAjgiDyAOlCANIAAqAjwiEJSTiyARIBWUIBIgFJSSXg0BIBAgCpQgDiAAKgI0IhCUk4sgCyAVlCAMIBSUkl4NASAQIA2UIAogD5STiyALIBKUIAwgEZSSXg0BAkAgASgCGCIDQQFxBEAgACgCDCICKAIIIANBAXYiBiACKAIQbGohAwJAIAItABhFBEBBgLMBIAIoAgwiBSACKAIUIgIgAygCAGxqIgQrAwC2Igo4AgBBhLMBIAQrAwi2Igs4AgBBiLMBIAQrAxC2Igw4AgBBjLMBIAUgAiADKAIEbGoiBCsDALYiDTgCAEGQswEgBCsDCLYiDzgCAEGUswEgBCsDELYiETgCAEGYswEgBSACIAMoAghsaiICKwMAtiISOAIAIAggAisDCLYiDjgCACAJIAIrAxC2IhA4AgAMAQsgAigCDCIFIAIoAhQiAiADKAIIbGoiBCoCCCEQIAQqAgQhDiAEKgIAIRIgBSACIAMoAgBsaiIEKgIIIQwgBSADKAIEIAJsaiICKgIIIREgBCoCBCELIAIqAgQhDyAEKgIAIQogAioCACENCyAAIAAoAmRBAWo2AmQgESAMkyIWIAAqAhwiESAOIAuTIhSUIBIgCpMiFSAAKgIgIhKUkyITlCANIAqTIhggEiAQIAyTIhCUIBQgACoCJCIOlJMiF5QgDyALkyIPIA4gFZQgECARlJMiGZSSkiENAkAgAC0AiQEEQCANQ703hjVdDQMgACAAKgIYIAyTIgwgE5QgACoCECAKkyITIBeUIBkgACoCFCALkyILlJKSIgo4AlQgCrwiAkEASA0DIAIgDbxLDQMgACAOIBMgD5QgGCALlJMiF5QgESALIBaUIA8gDJSTIg6UIBIgDCAYlCAWIBOUkyIMlJKSIgs4AlggC7xBAEgNAyAKIAuSIA1eDQMgACAQIBeUIBUgDpQgFCAMlJKSIgw4AlAgDLxBAEgNAyAAQwAAgD8gDZUiDSALlDgCWCAAIA0gCpQ4AlQgACANIAyUIgo4AlAgCrwhAgwBCyANQ703hjVdIA1DvTeGtV5xDQIgAEMAAIA/IA2VIhogACoCGCAMkyIMIBOUIAAqAhAgCpMiDSAXlCAZIAAqAhQgC5MiC5SSkpQiCjgCVCAKvEGAgID8A0sNAiAAIBogDiANIA+UIBggC5STIhOUIBEgCyAWlCAPIAyUkyIOlCASIAwgGJQgFiANlJMiDJSSkpQiCzgCWCALvEEASA0CIAogC5JDAACAP14NAiAAIBogECATlCAVIA6UIBQgDJSSkpQiCjgCUCAKvCICQQBIDQILIAIgACgChAFPDQEgACAGNgJMIAAgACgCaEEBajYCaCAAIAAoAgRBBHI2AgQgACgCXCICRQ0BIAAtAIgBQQAgAigCBCIDQQNLG0UEQCACKAIAIANGBEAgAhDjAyACKAIEIQMgACoCUCEKCyACIANBAWo2AgQgAigCCCIFIANBAnRqIAY2AgAgAigCBCIDIAIoAgBGBEAgAhDjAyACKAIIIQUgAigCBCEDCyACIANBAWo2AgQgBSADQQJ0aiAKOAIAIAAqAlQhCiACKAIEIgMgAigCAEYEQCACEOMDIAIoAgghBSACKAIEIQMLIAIgA0EBajYCBCAFIANBAnRqIAo4AgAgACoCWCEKIAIoAgQiAyACKAIARgRAIAIQ4wMgAigCCCEFIAIoAgQhAwsgAiADQQFqNgIEIAUgA0ECdGogCjgCAAwCCyACKAIIIgJFDQEgCiACKgIEXUUNASACIAcpAgA3AgAgAiAHKQIINwIIDAELIAAgAxC6AwsgACgCBCICQQVxQQVGDQEgASgCHCIBQQFxBEAgACgCDCIDKAIIIAFBAXYiBiADKAIQbGohAQJAIAMtABhFBEBBgLMBIAMoAgwiBSADKAIUIgMgASgCAGxqIgQrAwC2Igo4AgBBhLMBIAQrAwi2Igs4AgBBiLMBIAQrAxC2Igw4AgBBjLMBIAUgAyABKAIEbGoiBCsDALYiDTgCAEGQswEgBCsDCLYiDzgCAEGUswEgBCsDELYiETgCAEGYswEgBSADIAEoAghsaiIBKwMAtiISOAIAQZyzASABKwMItiIOOAIAQaCzASABKwMQtiIQOAIADAELIAMoAgwiBSADKAIUIgMgASgCCGxqIgQqAgghECAEKgIEIQ4gBCoCACESIAUgAyABKAIAbGoiBCoCCCEMIAUgASgCBCADbGoiASoCCCERIAQqAgQhCyABKgIEIQ8gBCoCACEKIAEqAgAhDQsgACAAKAJkQQFqNgJkIBEgDJMiEyAAKgIcIhEgDiALkyIUlCASIAqTIhUgACoCICISlJMiFpQgDSAKkyIXIBIgECAMkyIQlCAUIAAqAiQiDpSTIhiUIA8gC5MiGSAOIBWUIBAgEZSTIg+UkpIhDQJAIAAtAIkBBEAgDUO9N4Y1XQ0EIAAgACoCGCAMkyIMIBaUIAAqAhAgCpMiFiAYlCAPIAAqAhQgC5MiC5SSkiIKOAJUIAq8IgFBAEgNBCABIA28Sw0EIAAgDiAWIBmUIBcgC5STIg+UIBEgCyATlCAZIAyUkyIOlCASIAwgF5QgEyAWlJMiDJSSkiILOAJYIAu8QQBIDQQgCiALkiANXg0EIAAgECAPlCAVIA6UIBQgDJSSkiIMOAJQIAy8QQBIDQQgAEMAAIA/IA2VIg0gC5Q4AlggACANIAqUOAJUIAAgDSAMlCIKOAJQIAq8IQEMAQsgDUO9N4Y1XSANQ703hrVecQ0DIABDAACAPyANlSIaIAAqAhggDJMiDCAWlCAAKgIQIAqTIg0gGJQgDyAAKgIUIAuTIguUkpKUIgo4AlQgCrxBgICA/ANLDQMgACAaIA4gDSAZlCAXIAuUkyIPlCARIAsgE5QgGSAMlJMiDpQgEiAMIBeUIBMgDZSTIgyUkpKUIgs4AlggC7xBAEgNAyAKIAuSQwAAgD9eDQMgACAaIBAgD5QgFSAOlCAUIAyUkpKUIgo4AlAgCrwiAUEASA0DCyABIAAoAoQBTw0CIAAgBjYCTCAAIAJBBHI2AgQgACAAKAJoQQFqNgJoIAAoAlwiAUUNAiAALQCIAUEAIAEoAgQiAkEDSxtFBEAgASgCACACRgRAIAEQ4wMgACoCUCEKIAEoAgQhAgsgASACQQFqNgIEIAEoAggiAyACQQJ0aiAGNgIAIAEoAgQiAiABKAIARgRAIAEQ4wMgASgCCCEDIAEoAgQhAgsgASACQQFqNgIEIAMgAkECdGogCjgCACAAKgJUIQogASgCBCICIAEoAgBGBEAgARDjAyABKAIIIQMgASgCBCECCyABIAJBAWo2AgQgAyACQQJ0aiAKOAIAIAAqAlghCiABKAIEIgAgASgCAEYEQCABEOMDIAEoAgghAyABKAIEIQALIAEgAEEBajYCBCADIABBAnRqIAo4AgAPCyABKAIIIgBFDQIgCiAAKgIEXUUNAiAAIAcpAgA3AgAgACAHKQIINwIIDwsgACAAKAJgQQFqNgJgIAAqAkAgASoCAJMiCosgASoCDCILIAAqAigiDJJeRQ0ACwsL+hUCCH8RfSAAQcwAaiEHQZyzASEIQaCzASEJAkADQCAAIAAoAmBBAWo2AmAgASgCDCIDIAAqAhAgASoCAJMiDLxB/////wdxSQRAIAwgACoCHJRDAAAAAGANAgsgASgCECICIAAqAhQgASoCBJMiC7xB/////wdxSQRAIAsgACoCIJRDAAAAAGANAgsgASgCFCIFIAAqAhggASoCCJMiDbxB/////wdxSSANIAAqAiQiCpRDAAAAAGBxDQEgACoCICISIA2UIAsgCpSTiyACviITIAAqAjAiDpQgACoCLCIQIAW+IhSUkl4NASAKIAyUIA0gACoCHCIVlJOLIAO+Ig0gDpQgACoCKCIOIBSUkl4NASAVIAuUIAwgEpSTiyANIBCUIA4gE5SSXg0BAkAgASgCGCIDQQFxBEAgCowhDiAVjCEPIBKMIRAgACgCDCICKAIIIANBAXYiBiACKAIQbGohAwJAIAItABhFBEBBgLMBIAIoAgwiBSACKAIUIgIgAygCAGxqIgQrAwC2Ig04AgBBhLMBIAQrAwi2Igs4AgBBiLMBIAQrAxC2Igw4AgBBjLMBIAUgAiADKAIEbGoiBCsDALYiFjgCAEGQswEgBCsDCLYiFzgCAEGUswEgBCsDELYiFDgCAEGYswEgBSACIAMoAghsaiICKwMAtiITOAIAIAggAisDCLYiETgCACAJIAIrAxC2Ihg4AgAMAQsgAigCDCIFIAIoAhQiAiADKAIIbGoiBCoCCCEYIAQqAgQhESAEKgIAIRMgBSACIAMoAgBsaiIEKgIIIQwgBSADKAIEIAJsaiICKgIIIRQgBCoCBCELIAIqAgQhFyAEKgIAIQ0gAioCACEWCyAAIAAoAmRBAWo2AmQgFCAMkyIZIBUgESALkyIUlCATIA2TIhMgEJSSIhGUIBYgDZMiGiASIBggDJMiEJQgFCAOlJIiFpQgFyALkyIXIAogE5QgECAPlJIiD5SSkiEOAkAgAC0AiQEEQCAOQ703hjVdDQMgACAAKgIYIAyTIgwgEZQgACoCECANkyIRIBaUIA8gACoCFCALkyILlJKSIg04AlQgDbwiAkEASA0DIAIgDrxLDQMgACAKIBEgF5QgGiALlJMiD5QgFSALIBmUIBcgDJSTIguUIBIgDCAalCAZIBGUkyIMlJKSIgo4AlggCrxBAEgNAyANIAqSIA5eDQMgACAQIA+UIBMgC5QgFCAMlJKSIgs4AlAgC7xBAEgNAyAAQwAAgD8gDpUiDCAKlDgCWCAAIAwgDZQ4AlQgACAMIAuUIgo4AlAMAQsgDkO9N4Y1XSAOQ703hrVecQ0CIABDAACAPyAOlSIYIAAqAhggDJMiDCARlCAAKgIQIA2TIg4gFpQgDyAAKgIUIAuTIguUkpKUIg04AlQgDbxBgICA/ANLDQIgACAYIAogDiAXlCAaIAuUkyIPlCAVIAsgGZQgFyAMlJMiC5QgEiAMIBqUIBkgDpSTIgyUkpKUIgo4AlggCrxBAEgNAiANIAqSQwAAgD9eDQIgACAYIBAgD5QgEyALlCAUIAyUkpKUIgo4AlAgCrxBAEgNAgsgACAGNgJMIAAgACgCaEEBajYCaCAAIAAoAgRBBHI2AgQgACgCXCICRQ0BIAAtAIgBQQAgAigCBCIDQQNLG0UEQCACKAIAIANGBEAgAhDjAyAAKgJQIQogAigCBCEDCyACIANBAWo2AgQgAigCCCIFIANBAnRqIAY2AgAgAigCBCIDIAIoAgBGBEAgAhDjAyACKAIIIQUgAigCBCEDCyACIANBAWo2AgQgBSADQQJ0aiAKOAIAIAAqAlQhCiACKAIEIgMgAigCAEYEQCACEOMDIAIoAgghBSACKAIEIQMLIAIgA0EBajYCBCAFIANBAnRqIAo4AgAgACoCWCEKIAIoAgQiAyACKAIARgRAIAIQ4wMgAigCCCEFIAIoAgQhAwsgAiADQQFqNgIEIAUgA0ECdGogCjgCAAwCCyACKAIIIgJFDQEgCiACKgIEXUUNASACIAcpAgA3AgAgAiAHKQIINwIIDAELIAAgAxC7AwsgACgCBCICQQVxQQVGDQEgASgCHCIBQQFxRQ0ACyAAKAIMIgMoAgggAUEBdiIGIAMoAhBsaiEBAkAgAy0AGEUEQEGAswEgAygCDCIFIAMoAhQiAyABKAIAbGoiBCsDALYiCjgCAEGEswEgBCsDCLYiDTgCAEGIswEgBCsDELYiCzgCAEGMswEgBSADIAEoAgRsaiIEKwMAtiIMOAIAQZCzASAEKwMItiIPOAIAQZSzASAEKwMQtiISOAIAQZizASAFIAMgASgCCGxqIgErAwC2IhU4AgBBnLMBIAErAwi2Ig44AgBBoLMBIAErAxC2IhA4AgAMAQsgAygCDCIFIAMoAhQiAyABKAIIbGoiBCoCCCEQIAQqAgQhDiAEKgIAIRUgBSADIAEoAgBsaiIEKgIIIQsgBSABKAIEIANsaiIBKgIIIRIgBCoCBCENIAEqAgQhDyAEKgIAIQogASoCACEMCyAAIAAoAmRBAWo2AmQgEiALkyIRIAAqAhwiEiAOIA2TIhSUIBUgCpMiEyAAKgIgIhWUkyIWlCAMIAqTIhggFSAQIAuTIhCUIBQgACoCJCIOlJMiF5QgDyANkyIZIA4gE5QgECASlJMiD5SSkiEMAkAgAC0AiQEEQCAMQ703hjVdDQIgACAAKgIYIAuTIgsgFpQgACoCECAKkyIWIBeUIA8gACoCFCANkyINlJKSIgo4AlQgCrwiAUEASA0CIAEgDLxLDQIgACAOIBYgGZQgGCANlJMiD5QgEiANIBGUIBkgC5STIg6UIBUgCyAYlCARIBaUkyILlJKSIg04AlggDbxBAEgNAiAKIA2SIAxeDQIgACAQIA+UIBMgDpQgFCALlJKSIgs4AlAgC7xBAEgNAiAAQwAAgD8gDJUiDCANlDgCWCAAIAwgCpQ4AlQgACAMIAuUIgo4AlAMAQsgDEO9N4Y1XSAMQ703hrVecQ0BIABDAACAPyAMlSIaIAAqAhggC5MiCyAWlCAAKgIQIAqTIgwgF5QgDyAAKgIUIA2TIg2UkpKUIgo4AlQgCrxBgICA/ANLDQEgACAaIA4gDCAZlCAYIA2UkyIPlCASIA0gEZQgGSALlJMiDpQgFSALIBiUIBEgDJSTIguUkpKUIg04AlggDbxBAEgNASAKIA2SQwAAgD9eDQEgACAaIBAgD5QgEyAOlCAUIAuUkpKUIgo4AlAgCrxBAEgNAQsgACAGNgJMIAAgAkEEcjYCBCAAIAAoAmhBAWo2AmggACgCXCIBRQ0AIAAtAIgBQQAgASgCBCICQQNLG0UEQCABKAIAIAJGBEAgARDjAyAAKgJQIQogASgCBCECCyABIAJBAWo2AgQgASgCCCIDIAJBAnRqIAY2AgAgASgCBCICIAEoAgBGBEAgARDjAyABKAIIIQMgASgCBCECCyABIAJBAWo2AgQgAyACQQJ0aiAKOAIAIAAqAlQhCiABKAIEIgIgASgCAEYEQCABEOMDIAEoAgghAyABKAIEIQILIAEgAkEBajYCBCADIAJBAnRqIAo4AgAgACoCWCEKIAEoAgQiACABKAIARgRAIAEQ4wMgASgCCCEDIAEoAgQhAAsgASAAQQFqNgIEIAMgAEECdGogCjgCAA8LIAEoAggiAEUNACAKIAAqAgRdRQ0AIAAgBykCADcCACAAIAcpAgg3AggLC7AMAhF9Bn8DQAJAIAEvAQghFSABLwEKIRcgAS8BAiEWIAEuAQQhGCABLgEAIRMgAS8BBiEUIAAgACgCYEEBajYCYCAAKgJAIAAqAmwgE7KUkyICiyAAKgJ4IBSzlCIDIAAqAigiBJJeDQAgACoCRCAAKgJwIBbBspSTIgWLIAAqAnwgFbOUIgkgACoCLCIKkl4NACAAKgJIIAAqAnQgGLKUkyIGiyAAKgKAASAXs5QiCyAAKgIwIgySXg0AIAAqAjgiByAGlCAFIAAqAjwiCJSTiyAJIAyUIAsgCpSSXg0AIAggApQgBiAAKgI0IgiUk4sgAyAMlCALIASUkl4NACAIIAWUIAIgB5STiyADIAqUIAkgBJSSXg0AIAEoAgwiE0EBcQRAIAAoAgwiASgCCCATQQF2IhYgASgCEGxqIRMCQCABLQAYRQRAQYCzASABKAIMIhQgASgCFCIBIBMoAgBsaiIVKwMAtiICOAIAQYSzASAVKwMItiIDOAIAQYizASAVKwMQtiIEOAIAQYyzASAUIAEgEygCBGxqIhUrAwC2IgU4AgBBkLMBIBUrAwi2Igc4AgBBlLMBIBUrAxC2Igk4AgBBmLMBIBQgASATKAIIbGoiASsDALYiCjgCAEGcswEgASsDCLYiBjgCAEGgswEgASsDELYiCDgCAAwBCyABKAIMIhQgASgCFCIBIBMoAghsaiIVKgIIIQggFSoCBCEGIBUqAgAhCiAUIAEgEygCAGxqIhUqAgghBCAUIBMoAgQgAWxqIgEqAgghCSAVKgIEIQMgASoCBCEHIBUqAgAhAiABKgIAIQULIAAgACgCZEEBajYCZCAJIASTIg4gACoCHCIJIAYgA5MiC5QgCiACkyIMIAAqAiAiCpSTIg2UIAUgApMiDyAKIAggBJMiCJQgCyAAKgIkIgaUkyIRlCAHIAOTIhAgBiAMlCAIIAmUkyIHlJKSIQUCQCAALQCJAQRAIAVDvTeGNV0NAyAAIAAqAhggBJMiBCANlCAAKgIQIAKTIg0gEZQgByAAKgIUIAOTIgOUkpIiAjgCVCACvCIBQQBIDQMgASAFvEsNAyAAIAYgDSAQlCAPIAOUkyIHlCAJIAMgDpQgECAElJMiBpQgCiAEIA+UIA4gDZSTIgSUkpIiAzgCWCADvEEASA0DIAIgA5IgBV4NAyAAIAggB5QgDCAGlCALIASUkpIiBDgCUCAEvEEASA0DIABDAACAPyAFlSIFIAOUOAJYIAAgBSAClDgCVCAAIAUgBJQiAjgCUCACvCEBDAELIAVDvTeGNV0gBUO9N4a1XnENAiAAQwAAgD8gBZUiEiAAKgIYIASTIgQgDZQgACoCECACkyIFIBGUIAcgACoCFCADkyIDlJKSlCICOAJUIAK8QYCAgPwDSw0CIAAgEiAGIAUgEJQgDyADlJMiB5QgCSADIA6UIBAgBJSTIgaUIAogBCAPlCAOIAWUkyIElJKSlCIDOAJYIAO8QQBIDQIgAiADkkMAAIA/Xg0CIAAgEiAIIAeUIAwgBpQgCyAElJKSlCICOAJQIAK8IgFBAEgNAgsgASAAKAKEAU8NASAAIBY2AkwgACAAKAJoQQFqNgJoIAAgACgCBEEEcjYCBCAAKAJcIgFFDQEgAC0AiAFBACABKAIEIhNBA0sbRQRAIAEoAgAgE0YEQCABEOMDIAEoAgQhEyAAKgJQIQILIAEgE0EBajYCBCABKAIIIhQgE0ECdGogFjYCACABKAIEIhMgASgCAEYEQCABEOMDIAEoAgghFCABKAIEIRMLIAEgE0EBajYCBCAUIBNBAnRqIAI4AgAgACoCVCECIAEoAgQiEyABKAIARgRAIAEQ4wMgASgCCCEUIAEoAgQhEwsgASATQQFqNgIEIBQgE0ECdGogAjgCACAAKgJYIQIgASgCBCIAIAEoAgBGBEAgARDjAyABKAIIIRQgASgCBCEACyABIABBAWo2AgQgFCAAQQJ0aiACOAIADwsgASgCCCIBRQ0BIAIgASoCBF1FDQEgASAAQcwAaiIAKQIANwIAIAEgACkCCDcCCAwBCyAAIBMQvAMgACgCBEEFcUEFRg0AIAEoAgxBEGohAQwBCwsL6gwCEX0GfwNAAkAgAS8BCCEVIAEvAQohFyABLgECIRYgAS4BBCEYIAEvAQYhEyABLgEAIRQgACAAKAJgQQFqNgJgIAAqAnQhCyAAKgJwIQIgACoCgAEhBiAAKgJ8IQUgACoCeCATs5QiCLwgACoCECAAKgJsIBSylJMiA7xB/////wdxSQRAIAMgACoCHJRDAAAAAGANAQsgBSAVs5QiCbwgACoCFCACIBaylJMiBLxB/////wdxSQRAIAQgACoCIJRDAAAAAGANAQsgBiAXs5QiBrwgACoCGCALIBiylJMiBbxB/////wdxSSAFIAAqAiQiApRDAAAAAGBxDQAgACoCICILIAWUIAQgApSTiyAJIAAqAjAiDJQgBiAAKgIsIgeUkl4NACACIAOUIAUgACoCHCIOlJOLIAggDJQgBiAAKgIoIgWUkl4NACAOIASUIAMgC5STiyAIIAeUIAkgBZSSXg0AIAEoAgwiE0EBcQRAIAKMIQYgDowhByALjCEMIAAoAgwiASgCCCATQQF2IhYgASgCEGxqIRMCQCABLQAYRQRAQYCzASABKAIMIhQgASgCFCIBIBMoAgBsaiIVKwMAtiIFOAIAQYSzASAVKwMItiIEOAIAQYizASAVKwMQtiIDOAIAQYyzASAUIAEgEygCBGxqIhUrAwC2Ig84AgBBkLMBIBUrAwi2Ig04AgBBlLMBIBUrAxC2Igk4AgBBmLMBIBQgASATKAIIbGoiASsDALYiCDgCAEGcswEgASsDCLYiCjgCAEGgswEgASsDELYiEDgCAAwBCyABKAIMIhQgASgCFCIBIBMoAghsaiIVKgIIIRAgFSoCBCEKIBUqAgAhCCAUIAEgEygCAGxqIhUqAgghAyAUIBMoAgQgAWxqIgEqAgghCSAVKgIEIQQgASoCBCENIBUqAgAhBSABKgIAIQ8LIAAgACgCZEEBajYCZCAJIAOTIhEgDiAKIASTIgmUIAggBZMiCCAMlJIiCpQgDyAFkyISIAsgECADkyIMlCAJIAaUkiIPlCANIASTIg0gAiAIlCAMIAeUkiIHlJKSIQYCQCAALQCJAQRAIAZDvTeGNV0NAyAAIAAqAhggA5MiAyAKlCAAKgIQIAWTIgogD5QgByAAKgIUIASTIgSUkpIiBTgCVCAFvCIBQQBIDQMgASAGvEsNAyAAIAIgCiANlCASIASUkyIHlCAOIAQgEZQgDSADlJMiBJQgCyADIBKUIBEgCpSTIgOUkpIiAjgCWCACvEEASA0DIAUgApIgBl4NAyAAIAwgB5QgCCAElCAJIAOUkpIiBDgCUCAEvEEASA0DIABDAACAPyAGlSIDIAKUOAJYIAAgAyAFlDgCVCAAIAMgBJQiAjgCUAwBCyAGQ703hjVdIAZDvTeGtV5xDQIgAEMAAIA/IAaVIhAgACoCGCADkyIDIAqUIAAqAhAgBZMiBiAPlCAHIAAqAhQgBJMiBJSSkpQiBTgCVCAFvEGAgID8A0sNAiAAIBAgAiAGIA2UIBIgBJSTIgeUIA4gBCARlCANIAOUkyIElCALIAMgEpQgESAGlJMiA5SSkpQiAjgCWCACvEEASA0CIAUgApJDAACAP14NAiAAIBAgDCAHlCAIIASUIAkgA5SSkpQiAjgCUCACvEEASA0CCyAAIBY2AkwgACAAKAJoQQFqNgJoIAAgACgCBEEEcjYCBCAAKAJcIgFFDQEgAC0AiAFBACABKAIEIhNBA0sbRQRAIAEoAgAgE0YEQCABEOMDIAEoAgQhEyAAKgJQIQILIAEgE0EBajYCBCABKAIIIhQgE0ECdGogFjYCACABKAIEIhMgASgCAEYEQCABEOMDIAEoAgghFCABKAIEIRMLIAEgE0EBajYCBCAUIBNBAnRqIAI4AgAgACoCVCECIAEoAgQiEyABKAIARgRAIAEQ4wMgASgCCCEUIAEoAgQhEwsgASATQQFqNgIEIBQgE0ECdGogAjgCACAAKgJYIQIgASgCBCIAIAEoAgBGBEAgARDjAyABKAIIIRQgASgCBCEACyABIABBAWo2AgQgFCAAQQJ0aiACOAIADwsgASgCCCIBRQ0BIAIgASoCBF1FDQEgASAAQcwAaiIAKQIANwIAIAEgACkCCDcCCAwBCyAAIBMQvQMgACgCBEEFcUEFRg0AIAEoAgxBEGohAQwBCwsLmwwCEX0EfyAAIAAoAmBBAWo2AmACQCAAKgJAIAEqAgCTIgKLIAEqAgwiAyAAKgIoIgSSXg0AA0AgACoCRCABKgIEkyIFiyABKgIQIgkgACoCLCIKkl4NASAAKgJIIAEqAgiTIgaLIAEqAhQiCyAAKgIwIgySXg0BIAAqAjgiByAGlCAFIAAqAjwiCJSTiyAJIAyUIAogC5SSXg0BIAggApQgBiAAKgI0IgiUk4sgAyAMlCAEIAuUkl4NASAIIAWUIAIgB5STiyADIAqUIAQgCZSSXg0BIAEoAhgiE0EBcQRAIAAoAgwiASgCCCATQQF2IhYgASgCEGxqIRMCQCABLQAYRQRAQYCzASABKAIMIhQgASgCFCIBIBMoAgBsaiIVKwMAtiICOAIAQYSzASAVKwMItiIDOAIAQYizASAVKwMQtiIEOAIAQYyzASAUIAEgEygCBGxqIhUrAwC2IgU4AgBBkLMBIBUrAwi2Igc4AgBBlLMBIBUrAxC2Igk4AgBBmLMBIBQgASATKAIIbGoiASsDALYiCjgCAEGcswEgASsDCLYiBjgCAEGgswEgASsDELYiCDgCAAwBCyABKAIMIhQgASgCFCIBIBMoAghsaiIVKgIIIQggFSoCBCEGIBUqAgAhCiAUIAEgEygCAGxqIhUqAgghBCAUIBMoAgQgAWxqIgEqAgghCSAVKgIEIQMgASoCBCEHIBUqAgAhAiABKgIAIQULIAAgACgCZEEBajYCZCAJIASTIg4gACoCHCIJIAYgA5MiC5QgCiACkyIMIAAqAiAiCpSTIg2UIAUgApMiDyAKIAggBJMiCJQgCyAAKgIkIgaUkyIRlCAHIAOTIhAgBiAMlCAIIAmUkyIHlJKSIQUCQCAALQCJAQRAIAVDvTeGNV0NBCAAIAAqAhggBJMiBCANlCAAKgIQIAKTIg0gEZQgByAAKgIUIAOTIgOUkpIiAjgCVCACvCIBQQBIDQQgASAFvEsNBCAAIAYgDSAQlCAPIAOUkyIHlCAJIAMgDpQgECAElJMiBpQgCiAEIA+UIA4gDZSTIgSUkpIiAzgCWCADvEEASA0EIAIgA5IgBV4NBCAAIAggB5QgDCAGlCALIASUkpIiBDgCUCAEvEEASA0EIABDAACAPyAFlSIFIAOUOAJYIAAgBSAClDgCVCAAIAUgBJQiAjgCUCACvCEBDAELIAVDvTeGNV0gBUO9N4a1XnENAyAAQwAAgD8gBZUiEiAAKgIYIASTIgQgDZQgACoCECACkyIFIBGUIAcgACoCFCADkyIDlJKSlCICOAJUIAK8QYCAgPwDSw0DIAAgEiAGIAUgEJQgDyADlJMiB5QgCSADIA6UIBAgBJSTIgaUIAogBCAPlCAOIAWUkyIElJKSlCIDOAJYIAO8QQBIDQMgAiADkkMAAIA/Xg0DIAAgEiAIIAeUIAwgBpQgCyAElJKSlCICOAJQIAK8IgFBAEgNAwsgASAAKAKEAU8NAiAAIBY2AkwgACAAKAJoQQFqNgJoIAAgACgCBEEEcjYCBCAAKAJcIgFFDQIgAC0AiAFBACABKAIEIhNBA0sbRQRAIAEoAgAgE0YEQCABEOMDIAEoAgQhEyAAKgJQIQILIAEgE0EBajYCBCABKAIIIhQgE0ECdGogFjYCACABKAIEIhMgASgCAEYEQCABEOMDIAEoAgghFCABKAIEIRMLIAEgE0EBajYCBCAUIBNBAnRqIAI4AgAgACoCVCECIAEoAgQiEyABKAIARgRAIAEQ4wMgASgCCCEUIAEoAgQhEwsgASATQQFqNgIEIBQgE0ECdGogAjgCACAAKgJYIQIgASgCBCIAIAEoAgBGBEAgARDjAyABKAIIIRQgASgCBCEACyABIABBAWo2AgQgFCAAQQJ0aiACOAIADwsgASgCCCIBRQ0CIAIgASoCBF1FDQIgASAAQcwAaiIAKQIANwIAIAEgACkCCDcCCA8LIAAgExC+AyAAKAIEQQVxQQVGDQEgASgCGCETIAAgACgCYEEBajYCYCATQRxqIQEgACoCQCATKgIckyICiyATKgIoIgMgACoCKCIEkl5FDQALCwudDAIEfxF9A0ACQCAAIAAoAmBBAWo2AmAgASgCDCIDIAAqAhAgASoCAJMiB7xB/////wdxSQRAIAcgACoCHJRDAAAAAGANAQsgASgCECICIAAqAhQgASoCBJMiCLxB/////wdxSQRAIAggACoCIJRDAAAAAGANAQsgASgCFCIEIAAqAhggASoCCJMiCbxB/////wdxSSAJIAAqAiQiBpRDAAAAAGBxDQAgACoCICIRIAmUIAggBpSTiyACviILIAAqAjAiCpQgACoCLCIPIAS+IgyUkl4NACAGIAeUIAkgACoCHCISlJOLIAO+IgkgCpQgACoCKCIKIAyUkl4NACASIAiUIAcgEZSTiyAJIA+UIAogC5SSXg0AIAEoAhgiAkEBcQRAIAaMIQogEowhDSARjCEPIAAoAgwiASgCCCACQQF2IgUgASgCEGxqIQICQCABLQAYRQRAQYCzASABKAIMIgMgASgCFCIBIAIoAgBsaiIEKwMAtiIJOAIAQYSzASAEKwMItiIIOAIAQYizASAEKwMQtiIHOAIAQYyzASADIAEgAigCBGxqIgQrAwC2IhM4AgBBkLMBIAQrAwi2IhA4AgBBlLMBIAQrAxC2Igw4AgBBmLMBIAMgASACKAIIbGoiASsDALYiCzgCAEGcswEgASsDCLYiDjgCAEGgswEgASsDELYiFDgCAAwBCyABKAIMIgMgASgCFCIBIAIoAghsaiIEKgIIIRQgBCoCBCEOIAQqAgAhCyADIAEgAigCAGxqIgQqAgghByADIAIoAgQgAWxqIgEqAgghDCAEKgIEIQggASoCBCEQIAQqAgAhCSABKgIAIRMLIAAgACgCZEEBajYCZCAMIAeTIhUgEiAOIAiTIgyUIAsgCZMiCyAPlJIiDpQgEyAJkyIWIBEgFCAHkyIPlCAMIAqUkiITlCAQIAiTIhAgBiALlCAPIA2UkiINlJKSIQoCQCAALQCJAQRAIApDvTeGNV0NAyAAIAAqAhggB5MiByAOlCAAKgIQIAmTIg4gE5QgDSAAKgIUIAiTIgiUkpIiCTgCVCAJvCIBQQBIDQMgASAKvEsNAyAAIAYgDiAQlCAWIAiUkyINlCASIAggFZQgECAHlJMiCJQgESAHIBaUIBUgDpSTIgeUkpIiBjgCWCAGvEEASA0DIAkgBpIgCl4NAyAAIA8gDZQgCyAIlCAMIAeUkpIiCDgCUCAIvEEASA0DIABDAACAPyAKlSIHIAaUOAJYIAAgByAJlDgCVCAAIAcgCJQiBjgCUAwBCyAKQ703hjVdIApDvTeGtV5xDQIgAEMAAIA/IAqVIhQgACoCGCAHkyIHIA6UIAAqAhAgCZMiCiATlCANIAAqAhQgCJMiCJSSkpQiCTgCVCAJvEGAgID8A0sNAiAAIBQgBiAKIBCUIBYgCJSTIg2UIBIgCCAVlCAQIAeUkyIIlCARIAcgFpQgFSAKlJMiB5SSkpQiBjgCWCAGvEEASA0CIAkgBpJDAACAP14NAiAAIBQgDyANlCALIAiUIAwgB5SSkpQiBjgCUCAGvEEASA0CCyAAIAU2AkwgACAAKAJoQQFqNgJoIAAgACgCBEEEcjYCBCAAKAJcIgFFDQEgAC0AiAFBACABKAIEIgJBA0sbRQRAIAEoAgAgAkYEQCABEOMDIAAqAlAhBiABKAIEIQILIAEgAkEBajYCBCABKAIIIgMgAkECdGogBTYCACABKAIEIgIgASgCAEYEQCABEOMDIAEoAgghAyABKAIEIQILIAEgAkEBajYCBCADIAJBAnRqIAY4AgAgACoCVCEGIAEoAgQiAiABKAIARgRAIAEQ4wMgASgCCCEDIAEoAgQhAgsgASACQQFqNgIEIAMgAkECdGogBjgCACAAKgJYIQYgASgCBCIAIAEoAgBGBEAgARDjAyABKAIIIQMgASgCBCEACyABIABBAWo2AgQgAyAAQQJ0aiAGOAIADwsgASgCCCIBRQ0BIAYgASoCBF1FDQEgASAAQcwAaiIAKQIANwIAIAEgACkCCDcCCAwBCyAAIAIQvwMgACgCBEEFcUEFRg0AIAEoAhhBHGohAQwBCwsL9ggCDn0Bf0EBIRIgACAAKAIwQQFqNgIwAkAgAyoCCCIKIAAqAjwiBJMiDSANlCADKgIAIgUgACoCNCIHkyINIA2UIAMqAgQiCyAAKgI4IgiTIg0gDZSSkiAAKgJAIg1fDQAgAioCCCIOIASTIgwgDJQgAioCACIPIAeTIgwgDJQgAioCBCIQIAiTIgwgDJSSkiANXw0AIAEqAggiDCAEkyIEIASUIAEqAgAiBiAHkyIHIAeUIAEqAgQiESAIkyIIIAiUkpIiCSANXw0AAn0gDiAMkyIOIAogDJMiDJQgDyAGkyIPIAUgBpMiBZQgECARkyIQIAsgEZMiC5SSkiIKIAQgDJQgByAFlCAIIAuUkpIiBpQgBCAOlCAHIA+UIAggEJSSkiIEIAwgDJQgBSAFlCALIAuUkpIiB5STIgUgCiAElCAGIA4gDpQgDyAPlCAQIBCUkpIiCJSTIgySIAggB5QgCiAKlJMiDosiD18EQCAFQwAAAABdBEAgDEMAAAAAXQRAIARDAAAAAF0EQCAJIAQgBJIgCJKSIASMIgcgCGANBBogBCAHIAiVlCAJkgwECyAJIAZDAAAAAGANAxogCSAGIAaSIAeSkiAGjCIEIAdgDQMaIAYgBCAHlZQgCZIMAwsgCSAGQwAAAABgDQIaIAkgBiAGkiAHkpIgBowiBCAHYA0CGiAGIAQgB5WUIAmSDAILIAxDAAAAAF0EQCAJIARDAAAAAGANAhogCSAEIASSIAiSkiAEjCIHIAhgDQIaIAQgByAIlZQgCZIMAgtD//9/fyAOQwAAAABbDQEaIAkgBUMAAIA/IA+VIguUIgUgBCAEkiAIIAWUIAogDCALlCIElJKSlCAEIAYgBpIgCiAFlCAHIASUkpKUkpIMAQsgBUMAAAAAXQRAIAcgBpIiBSAKIASSIgteBEAgCSAEIASSIAiSkiAFIAuTIgUgByAIIAogCpKTkiILYA0CGiAJIAUgC5UiBSAEIASSIAggBZQgCkMAAIA/IAWTIgSUkpKUIAQgBiAGkiAKIAWUIAcgBJSSkpSSkgwCCyAJIAYgBpIgB5KSIAVDAAAAAF8NARogCSAGQwAAAABgDQEaIAkgBiAGIAeVlJMMAQsgDEMAAAAAXQRAIAggBJIiBSAKIAaSIgteBEAgCSAGIAaSIAeSkiAFIAuTIgUgByAIIAogCpKTkiILYA0CGiAJQwAAgD8gBSALlSIFkyILIAQgBJIgCCALlCAKIAWUkpKUIAUgBiAGkiAKIAuUIAcgBZSSkpSSkgwCCyAJIAQgBJIgCJKSIAVDAAAAAF8NARogCSAEQwAAAABgDQEaIAkgBCAEIAiVlJMMAQsgCSAGIAaSIAeSkiAHIAaSIAqTIASTIgVDAAAAAF8NABogCSAEIASSIAiSkiAHIAggCiAKkpOSIgsgBV8NABogCSAFIAuVIgUgBCAEkiAIIAWUIApDAACAPyAFkyIElJKSlCAEIAYgBpIgCiAFlCAHIASUkpKUkpILiyANXSESCyASC6UQAgV/C31BuKQBIAI2AgBBvKQBIAIoAgQiBDYCAAJAIARFDQAjAEFAaiIGJABB3KQBQgA3AgBBtKQBQbSkASgCAEFzcTYCAEHwpAEgASoCDCIJIAmUOAIAQeSkASABKQIANwIAQeykASABKAIINgIAIAMEQCAGIAMQ5QMgBioCNCEMIAYqAiQhDSAGKgIUIQ4gBioCMCEPIAYqAiAhECAGKgIAIREgBioCECESIAYqAgQhE0HspAEgBioCOEHspAEqAgAiCSAGKgIolEHkpAEqAgAiCiAGKgIIlEHopAEqAgAiCyAGKgIYlJKSkjgCAEHopAEgDCAJIA2UIAogE5QgCyAOlJKSkjgCAEHkpAEgDyAJIBCUIAogEZQgCyASlJKSkjgCAAtBwKQBIAA2AgACQAJAQbikASgCACIDRQRAQbSkASgCACEEDAELQbSkASgCACEEIAMtAAhBBHFFDQAgBEEQcQ0AIAAoAgQEQCAAQQA2AgQLQbykASgCACIEKAIIIQBBsKQBAn8gBC0AGEUEQEGAswEgBCgCDCIBIAQoAhQiAyAAKAIAbGoiBSsDALY4AgBBhLMBIAUrAwi2OAIAQYizASAFKwMQtjgCAEGMswEgASADIAAoAgRsaiIFKwMAtjgCAEGQswEgBSsDCLY4AgBBlLMBIAUrAxC2OAIAQZizASABIAMgACgCCGxqIgArAwC2OAIAQZyzASAAKwMItjgCAEGgswEgACsDELY4AgBBmLMBIQFBjLMBIQNBgLMBDAELIAQoAgwiBSAEKAIUIgQgACgCCGxqIQEgBSAAKAIEIARsaiEDIAUgBCAAKAIAbGoLIAMgARDAA0UEQEEBIQEMAgtBtKQBQbSkASgCAEEEcjYCAEHApAEoAgAiACgCBCIEIAAoAgBGBEAgABDjAyAAKAIEIQQLQQEhASAAIARBAWo2AgQgACgCCCAEQQJ0akEANgIADAELAkACQCAEQQJxBEAgBEEBcQRAIAAoAgRFDQMgACgCCCgCACEBIABBADYCBEG8pAEoAgAiBCgCCCABIAQoAhBsaiEAQbCkAQJ/IAQtABhFBEBBgLMBIAQoAgwiAyAEKAIUIgUgACgCAGxqIgcrAwC2OAIAQYSzASAHKwMItjgCAEGIswEgBysDELY4AgBBjLMBIAMgBSAAKAIEbGoiBysDALY4AgBBkLMBIAcrAwi2OAIAQZSzASAHKwMQtjgCAEGYswEgAyAFIAAoAghsaiIAKwMAtjgCAEGcswEgACsDCLY4AgBBoLMBIAArAxC2OAIAQZizASEDQYyzASEFQYCzAQwBCyAEKAIMIgcgBCgCFCIEIAAoAghsaiEDIAcgACgCBCAEbGohBSAHIAQgACgCAGxqCyAFIAMQwAMEQEG0pAFBtKQBKAIAQQxyNgIAQcCkASgCACIEKAIEIgAgBCgCAEYEQCAEEOMDIAQoAgQhAAsgBCAAQQFqNgIEIAQoAgggAEECdGogATYCAAtBASEBQbSkAS0AAEEEcUUNAwwECyADIAAoAhBHBEAgACADNgIQDAILIAAqAhxB7KQBKgIAkyIJIAmUIAAqAhRB5KQBKgIAkyIJIAmUIAAqAhhB6KQBKgIAkyIJIAmUkpIgACoCIJEgASoCDJMiCSAJlF1FDQFBASEBIAAoAgRFDQNBtKQBIARBDHI2AgAMAwsgACgCBEUNASAAQQA2AgQMAQsgACgCBARAIABBADYCBAtB8KQBIAAqAiRB8KQBKgIAlDgCACAAQeykASgCADYCHCAAQeSkASkCADcCFCAAQfCkASoCADgCIAtBACEBCyAGQUBrJAAgAQ0AAkBBuKQBKAIAIgNFDQAgAy0ACEEEcUUNAEG8pAEoAgAoAgAiBUUNAQNAQbykASgCACICKAIIIAIoAhAgCGxqIQNBsKQBAn8gAi0AGEUEQEGAswEgAigCDCIBIAIoAhQiACADKAIAbGoiBCsDALY4AgBBhLMBIAQrAwi2OAIAQYizASAEKwMQtjgCAEGMswEgASAAIAMoAgRsaiIEKwMAtjgCAEGQswEgBCsDCLY4AgBBlLMBIAQrAxC2OAIAQZizASABIAAgAygCCGxqIgMrAwC2OAIAQZyzASADKwMItjgCAEGgswEgAysDELY4AgBBmLMBIQFBjLMBIQBBgLMBDAELIAIoAgwiBCACKAIUIgIgAygCCGxqIQEgBCADKAIEIAJsaiEAIAQgAiADKAIAbGoLIAAgARDAAwRAQbSkAUG0pAEoAgBBBHI2AgBBwKQBKAIAIgIoAgQiAyACKAIARgRAIAIQ4wMgAigCBCEDCyACIANBAWo2AgQgAigCCCADQQJ0aiAINgIACyAIQQFqIgggBUcNAAsMAQsgAigCCCIDQQFxIQggAigCECECIANBAnEEQCAIBEBBxKQBIAIpAgw3AgBBzKQBIAIoAhQ2AgBB2KQBIAIoAiA2AgBB0KQBIAIpAhg3AgAgAigCCCECQbSkAS0AAEEQcQRAQbCkASACEMIDDAMLQbCkASACEMMDDAILIAIoAgghAkG0pAEtAABBEHEEQEGwpAEgAhDEAwwCC0GwpAEgAhDFAwwBCyAIBEBBxKQBIAIpAgw3AgBBzKQBIAIoAhQ2AgBB2KQBIAIoAiA2AgBB0KQBIAIpAhg3AgAgAigCCCECQbSkAS0AAEEQcQRAQbCkASACEMYDDAILQbCkASACEMcDDAELIAIoAgghAkG0pAEtAABBEHEEQEGwpAEgAhDIAwwBC0GwpAEgAhDJAwsLwgYCDn0GfwJAA0AgAS8BCCESIAEvAQohEyABLgECIRQgAS4BBCEVIAEuAQAhECABLwEGIREgACAAKAIsQQFqNgIsIAAqAhwhCSAAKgIYIQIgACoCKCEHIAAqAiQhBQJAIAAqAiAgEbOUIgQgACoCNCIKIAAqAhQgELKUIgyTIgaSIgNDAAAAAF0EQCADIAOUQwAAAACSIgMgACoCQF5FDQEMAwtDAAAAACEDIAYgBJMiBkMAAAAAXkUNACAGIAaUQwAAAACSIgMgACoCQF4NAgsCQCAFIBKzlCIFIAAqAjgiDSACIBSylCIGkyILkiICQwAAAABdBEAgAiAClCADkiIDIAAqAkBeRQ0BDAMLIAsgBZMiAkMAAAAAXkUNACACIAKUIAOSIgMgACoCQF4NAgsCQCAHIBOzlCIHIAAqAjwiCyAJIBWylCIJkyIIkiICQwAAAABdBEAgAiAClCADkiIDIAAqAkAiAl5FDQEMAwsgCCAHkyICQwAAAABeRQRAIAAqAkAhAgwBCyACIAKUIAOSIgMgACoCQCICXg0CCyACIANgRQ0BAkAgCyAJIAeSkyIDIAOUIgggCiAMIASSkyIDIAOUIg4gDSAGIAWSkyIDIAOUIgOSIg+SIAJgDQAgCCAKIAwgBJOTIgQgBJQiBCADkiIDkiACYA0AIAggDiANIAYgBZOTIgUgBZQiBZIiCpIgAmANACAIIAQgBZIiBZIgAmANACALIAkgB5OTIgQgBJQiBCAPkiACYA0AIAQgA5IgAmANACAEIAqSIAJgDQAgBCAFkiACYA0AIAAgACgCBEEEcjYCBCAAIAEQ3gMPCwJAIAEoAgwiEEEBcQRAIAAgACgCBEEEcjYCBCAQQQF2IRIgACgCECIQKAIEIhEgECgCAEYEQCAQEOMDIBAoAgQhEQsgECARQQFqNgIEIBAoAgggEUECdGogEjYCAAwBCyAAIBAQwgMLIAAoAgQiEEEFcUEFRg0BIAEoAhAiAUEBcUUNAAsgACAQQQRyNgIEIAFBAXYhECAAKAIQIgAoAgQiASAAKAIARgRAIAAQ4wMgACgCBCEBCyAAIAFBAWo2AgQgACgCCCABQQJ0aiAQNgIACwv2CgIGfw59A0AgAS8BCCEFIAEvAQohBCABLgECIQYgAS4BBCEHIAEuAQAhAiABLwEGIQMgACAAKAIsQQFqNgIsIAAqAhwhDyAAKgIYIQggACoCKCENIAAqAiQhCwJAAkACQCAAKgIgIAOzlCIKIAAqAjQiECAAKgIUIAKylCISkyIMkiIJQwAAAABdBEAgCSAJlEMAAAAAkiIJIAAqAkBeRQ0BDAILQwAAAAAhCSAMIAqTIgxDAAAAAF5FDQAgDCAMlEMAAAAAkiIJIAAqAkBeDQELAkAgCyAFs5QiCyAAKgI4IhMgCCAGspQiDJMiEZIiCEMAAAAAXQRAIAggCJQgCZIiCSAAKgJAXkUNAQwCCyARIAuTIghDAAAAAF5FDQAgCCAIlCAJkiIJIAAqAkBeDQELAkAgDSAEs5QiDSAAKgI8IhEgDyAHspQiD5MiDpIiCEMAAAAAXQRAIAggCJQgCZIiCSAAKgJAIgheRQ0BDAILIA4gDZMiCEMAAAAAXkUEQCAAKgJAIQgMAQsgCCAIlCAJkiIJIAAqAkAiCF4NAQsgCCAJYEUNAAJAIBEgDyANkpMiCSAJlCIOIBAgEiAKkpMiCSAJlCIUIBMgDCALkpMiCSAJlCIJkiIVkiAIYA0AIA4gECASIAqTkyIKIAqUIgogCZIiCZIgCGANACAOIBQgEyAMIAuTkyILIAuUIguSIhCSIAhgDQAgDiAKIAuSIguSIAhgDQAgESAPIA2TkyIKIAqUIgogFZIgCGANACAKIAmSIAhgDQAgCiAQkiAIYA0AIAogC5IgCGANACAAIAAoAgRBBHI2AgQgACABEN4DDwsCQCABKAIMIgNBAXEEQCAAKAIMIgIoAgggAigCECADQQF2bGohAyAAAn8gAi0AGEUEQEGAswEgAigCDCIFIAIoAhQiBiADKAIAbGoiBCsDALY4AgBBhLMBIAQrAwi2OAIAQYizASAEKwMQtjgCAEGMswEgBSAGIAMoAgRsaiIEKwMAtjgCAEGQswEgBCsDCLY4AgBBlLMBIAQrAxC2OAIAQZizASAFIAYgAygCCGxqIgMrAwC2OAIAQZyzASADKwMItjgCAEGgswEgAysDELY4AgBBmLMBIQVBjLMBIQZBgLMBDAELIAIoAgwiBCACKAIUIgIgAygCCGxqIQUgBCADKAIEIAJsaiEGIAQgAiADKAIAbGoLIAYgBRDAA0UNASAAIAAoAgRBBHI2AgQgASgCDEEBdiEFIAAoAhAiAigCBCIDIAIoAgBGBEAgAhDjAyACKAIEIQMLIAIgA0EBajYCBCACKAIIIANBAnRqIAU2AgAMAQsgACADEMMDCyAAKAIEQQVxQQVGDQAgASgCECICQQFxRQ0BIAAoAgwiAygCCCADKAIQIAJBAXZsaiECIAACfyADLQAYRQRAQYCzASADKAIMIgUgAygCFCIGIAIoAgBsaiIEKwMAtjgCAEGEswEgBCsDCLY4AgBBiLMBIAQrAxC2OAIAQYyzASAFIAYgAigCBGxqIgQrAwC2OAIAQZCzASAEKwMItjgCAEGUswEgBCsDELY4AgBBmLMBIAUgBiACKAIIbGoiAisDALY4AgBBnLMBIAIrAwi2OAIAQaCzASACKwMQtjgCAEGYswEhBUGMswEhBkGAswEMAQsgAygCDCIEIAMoAhQiAyACKAIIbGohBSAEIAIoAgQgA2xqIQYgBCADIAIoAgBsagsgBiAFEMADRQ0AIAAgACgCBEEEcjYCBCABKAIQQQF2IQIgACgCECIAKAIEIgEgACgCAEYEQCAAEOMDIAAoAgQhAQsgACABQQFqNgIEIAAoAgggAUECdGogAjYCAAsPCyACIQEMAAsAC/AFAg59A38CQANAIAAgACgCLEEBajYCLAJAIAAqAjQiCCABKgIAIgmTIgIgASoCDCIEkiIDQwAAAABdBEAgAyADlEMAAAAAkiIDIAAqAkBeRQ0BDAMLQwAAAAAhAyACIASTIgJDAAAAAF5FDQAgAiAClEMAAAAAkiIDIAAqAkBeDQILAkAgACoCOCIKIAEqAgQiC5MiBiABKgIQIgWSIgJDAAAAAF0EQCACIAKUIAOSIgMgACoCQF5FDQEMAwsgBiAFkyICQwAAAABeRQ0AIAIgApQgA5IiAyAAKgJAXg0CCwJAIAAqAjwiDCABKgIIIg2TIgcgASoCFCIGkiICQwAAAABdBEAgAiAClCADkiIDIAAqAkAiAl5FDQEMAwsgByAGkyICQwAAAABeRQRAIAAqAkAhAgwBCyACIAKUIAOSIgMgACoCQCICXg0CCyACIANgRQ0BAkAgDCANIAaSkyIDIAOUIgcgCCAJIASSkyIDIAOUIg4gCiALIAWSkyIDIAOUIgOSIg+SIAJgDQAgByAIIAkgBJOTIgQgBJQiBCADkiIDkiACYA0AIAcgDiAKIAsgBZOTIgUgBZQiBZIiCJIgAmANACAHIAQgBZIiBZIgAmANACAMIA0gBpOTIgQgBJQiBCAPkiACYA0AIAQgA5IgAmANACAEIAiSIAJgDQAgBCAFkiACYA0AIAAgACgCBEEEcjYCBCAAIAEQ3QMPCwJAIAEoAhgiEEEBcQRAIAAgACgCBEEEcjYCBCAQQQF2IRIgACgCECIQKAIEIhEgECgCAEYEQCAQEOMDIBAoAgQhEQsgECARQQFqNgIEIBAoAgggEUECdGogEjYCAAwBCyAAIBAQxAMLIAAoAgQiEEEFcUEFRg0BIAEoAhwiAUEBcUUNAAsgACAQQQRyNgIEIAFBAXYhECAAKAIQIgAoAgQiASAAKAIARgRAIAAQ4wMgACgCBCEBCyAAIAFBAWo2AgQgACgCCCABQQJ0aiAQNgIACwukCgIFfw59A0AgACAAKAIsQQFqNgIsAkACQAJAIAAqAjQiDSABKgIAIg6TIgcgASoCDCIJkiIIQwAAAABdBEAgCCAIlEMAAAAAkiIIIAAqAkBeRQ0BDAILQwAAAAAhCCAHIAmTIgdDAAAAAF5FDQAgByAHlEMAAAAAkiIIIAAqAkBeDQELAkAgACoCOCIPIAEqAgQiEJMiCyABKgIQIgqSIgdDAAAAAF0EQCAHIAeUIAiSIgggACoCQF5FDQEMAgsgCyAKkyIHQwAAAABeRQ0AIAcgB5QgCJIiCCAAKgJAXg0BCwJAIAAqAjwiESABKgIIIhKTIgwgASoCFCILkiIHQwAAAABdBEAgByAHlCAIkiIIIAAqAkAiB15FDQEMAgsgDCALkyIHQwAAAABeRQRAIAAqAkAhBwwBCyAHIAeUIAiSIgggACoCQCIHXg0BCyAHIAhgRQ0AAkAgESASIAuSkyIIIAiUIgwgDSAOIAmSkyIIIAiUIhMgDyAQIAqSkyIIIAiUIgiSIhSSIAdgDQAgDCANIA4gCZOTIgkgCZQiCSAIkiIIkiAHYA0AIAwgEyAPIBAgCpOTIgogCpQiCpIiDZIgB2ANACAMIAkgCpIiCpIgB2ANACARIBIgC5OTIgkgCZQiCSAUkiAHYA0AIAkgCJIgB2ANACAJIA2SIAdgDQAgCSAKkiAHYA0AIAAgACgCBEEEcjYCBCAAIAEQ3QMPCwJAIAEoAhgiA0EBcQRAIAAoAgwiAigCCCACKAIQIANBAXZsaiEDIAACfyACLQAYRQRAQYCzASACKAIMIgUgAigCFCIGIAMoAgBsaiIEKwMAtjgCAEGEswEgBCsDCLY4AgBBiLMBIAQrAxC2OAIAQYyzASAFIAYgAygCBGxqIgQrAwC2OAIAQZCzASAEKwMItjgCAEGUswEgBCsDELY4AgBBmLMBIAUgBiADKAIIbGoiAysDALY4AgBBnLMBIAMrAwi2OAIAQaCzASADKwMQtjgCAEGYswEhBUGMswEhBkGAswEMAQsgAigCDCIEIAIoAhQiAiADKAIIbGohBSAEIAMoAgQgAmxqIQYgBCACIAMoAgBsagsgBiAFEMADRQ0BIAAgACgCBEEEcjYCBCABKAIYQQF2IQUgACgCECICKAIEIgMgAigCAEYEQCACEOMDIAIoAgQhAwsgAiADQQFqNgIEIAIoAgggA0ECdGogBTYCAAwBCyAAIAMQxQMLIAAoAgRBBXFBBUYNACABKAIcIgJBAXFFDQEgACgCDCIDKAIIIAMoAhAgAkEBdmxqIQIgAAJ/IAMtABhFBEBBgLMBIAMoAgwiBSADKAIUIgYgAigCAGxqIgQrAwC2OAIAQYSzASAEKwMItjgCAEGIswEgBCsDELY4AgBBjLMBIAUgBiACKAIEbGoiBCsDALY4AgBBkLMBIAQrAwi2OAIAQZSzASAEKwMQtjgCAEGYswEgBSAGIAIoAghsaiICKwMAtjgCAEGcswEgAisDCLY4AgBBoLMBIAIrAxC2OAIAQZizASEFQYyzASEGQYCzAQwBCyADKAIMIgQgAygCFCIDIAIoAghsaiEFIAQgAigCBCADbGohBiAEIAMgAigCAGxqCyAGIAUQwANFDQAgACAAKAIEQQRyNgIEIAEoAhxBAXYhAiAAKAIQIgAoAgQiASAAKAIARgRAIAAQ4wMgACgCBCEBCyAAIAFBAWo2AgQgACgCCCABQQJ0aiACNgIACw8LIAIhAQwACwAL7QUCDn0GfwNAAkAgAS8BCCERIAEvAQohEiABLgECIRMgAS4BBCEUIAEuAQAhECABLwEGIRUgACAAKAIsQQFqNgIsIAAqAhwhCSAAKgIYIQIgACoCKCEHIAAqAiQhBQJAIAAqAiAgFbOUIgQgACoCNCIKIAAqAhQgELKUIgyTIgaSIgNDAAAAAF0EQCADIAOUQwAAAACSIgMgACoCQF5FDQEMAgtDAAAAACEDIAYgBJMiBkMAAAAAXkUNACAGIAaUQwAAAACSIgMgACoCQF4NAQsCQCAFIBGzlCIFIAAqAjgiDSACIBOylCIGkyILkiICQwAAAABdBEAgAiAClCADkiIDIAAqAkBeDQIMAQsgCyAFkyICQwAAAABeRQ0AIAIgApQgA5IiAyAAKgJAXg0BCwJAIAcgErOUIgcgACoCPCILIAkgFLKUIgmTIgiSIgJDAAAAAF0EQCACIAKUIAOSIgMgACoCQCICXg0CDAELIAggB5MiAkMAAAAAXkUEQCAAKgJAIQIMAQsgAiAClCADkiIDIAAqAkAiAl4NAQsgAiADYEUNAAJAIAsgCSAHkpMiAyADlCIIIAogDCAEkpMiAyADlCIOIA0gBiAFkpMiAyADlCIDkiIPkiACYA0AIAggCiAMIASTkyIEIASUIgQgA5IiA5IgAmANACAIIA4gDSAGIAWTkyIFIAWUIgWSIgqSIAJgDQAgCCAEIAWSIgWSIAJgDQAgCyAJIAeTkyIEIASUIgQgD5IgAmANACAEIAOSIAJgDQAgBCAKkiACYA0AIAQgBZIgAmANACAAIAAoAgRBBHI2AgQgACABEOADDwsgASgCDCIQQQFxBEAgACAAKAIEQQRyNgIEIBBBAXYhECAAKAIQIgAoAgQiASAAKAIARgRAIAAQ4wMgACgCBCEBCyAAIAFBAWo2AgQgACgCCCABQQJ0aiAQNgIADwsgACAQEMYDIAAoAgRBBXFBBUYNACABKAIMQRBqIQEMAQsLC4EIAg59Bn8DQAJAIAEvAQghEyABLwEKIRIgAS4BAiEUIAEuAQQhFSABLgEAIRAgAS8BBiERIAAgACgCLEEBajYCLCAAKgIcIQkgACoCGCECIAAqAighByAAKgIkIQUCQCAAKgIgIBGzlCIEIAAqAjQiCiAAKgIUIBCylCIMkyIGkiIDQwAAAABdBEAgAyADlEMAAAAAkiIDIAAqAkBeRQ0BDAILQwAAAAAhAyAGIASTIgZDAAAAAF5FDQAgBiAGlEMAAAAAkiIDIAAqAkBeDQELAkAgBSATs5QiBSAAKgI4Ig0gAiAUspQiBpMiC5IiAkMAAAAAXQRAIAIgApQgA5IiAyAAKgJAXg0CDAELIAsgBZMiAkMAAAAAXkUNACACIAKUIAOSIgMgACoCQF4NAQsCQCAHIBKzlCIHIAAqAjwiCyAJIBWylCIJkyIIkiICQwAAAABdBEAgAiAClCADkiIDIAAqAkAiAl4NAgwBCyAIIAeTIgJDAAAAAF5FBEAgACoCQCECDAELIAIgApQgA5IiAyAAKgJAIgJeDQELIAIgA2BFDQACQCALIAkgB5KTIgMgA5QiCCAKIAwgBJKTIgMgA5QiDiANIAYgBZKTIgMgA5QiA5IiD5IgAmANACAIIAogDCAEk5MiBCAElCIEIAOSIgOSIAJgDQAgCCAOIA0gBiAFk5MiBSAFlCIFkiIKkiACYA0AIAggBCAFkiIFkiACYA0AIAsgCSAHk5MiBCAElCIEIA+SIAJgDQAgBCADkiACYA0AIAQgCpIgAmANACAEIAWSIAJgDQAgACAAKAIEQQRyNgIEIAAgARDgAw8LIAEoAgwiEEEBcQRAIAAoAgwiESgCCCARKAIQIBBBAXZsaiEQIAACfyARLQAYRQRAQYCzASARKAIMIhMgESgCFCIUIBAoAgBsaiISKwMAtjgCAEGEswEgEisDCLY4AgBBiLMBIBIrAxC2OAIAQYyzASATIBQgECgCBGxqIhIrAwC2OAIAQZCzASASKwMItjgCAEGUswEgEisDELY4AgBBmLMBIBMgFCAQKAIIbGoiECsDALY4AgBBnLMBIBArAwi2OAIAQaCzASAQKwMQtjgCAEGYswEhE0GMswEhFEGAswEMAQsgESgCDCISIBEoAhQiESAQKAIIbGohEyASIBAoAgQgEWxqIRQgEiARIBAoAgBsagsgFCATEMADRQ0BIAAgACgCBEEEcjYCBCABKAIMQQF2IRAgACgCECIAKAIEIgEgACgCAEYEQCAAEOMDIAAoAgQhAQsgACABQQFqNgIEIAAoAgggAUECdGogEDYCAA8LIAAgEBDHAyAAKAIEQQVxQQVGDQAgASgCDEEQaiEBDAELCwubBQIOfQF/A0ACQCAAIAAoAixBAWo2AiwCQCAAKgI0IgggASoCACIJkyICIAEqAgwiBJIiA0MAAAAAXQRAIAMgA5RDAAAAAJIiAyAAKgJAXkUNAQwCC0MAAAAAIQMgAiAEkyICQwAAAABeRQ0AIAIgApRDAAAAAJIiAyAAKgJAXg0BCwJAIAAqAjgiCiABKgIEIguTIgYgASoCECIFkiICQwAAAABdBEAgAiAClCADkiIDIAAqAkBeDQIMAQsgBiAFkyICQwAAAABeRQ0AIAIgApQgA5IiAyAAKgJAXg0BCwJAIAAqAjwiDCABKgIIIg2TIgcgASoCFCIGkiICQwAAAABdBEAgAiAClCADkiIDIAAqAkAiAl4NAgwBCyAHIAaTIgJDAAAAAF5FBEAgACoCQCECDAELIAIgApQgA5IiAyAAKgJAIgJeDQELIAIgA2BFDQACQCAMIA0gBpKTIgMgA5QiByAIIAkgBJKTIgMgA5QiDiAKIAsgBZKTIgMgA5QiA5IiD5IgAmANACAHIAggCSAEk5MiBCAElCIEIAOSIgOSIAJgDQAgByAOIAogCyAFk5MiBSAFlCIFkiIIkiACYA0AIAcgBCAFkiIFkiACYA0AIAwgDSAGk5MiBCAElCIEIA+SIAJgDQAgBCADkiACYA0AIAQgCJIgAmANACAEIAWSIAJgDQAgACAAKAIEQQRyNgIEIAAgARDfAw8LIAEoAhgiEEEBcQRAIAAgACgCBEEEcjYCBCAQQQF2IRAgACgCECIAKAIEIgEgACgCAEYEQCAAEOMDIAAoAgQhAQsgACABQQFqNgIEIAAoAgggAUECdGogEDYCAA8LIAAgEBDIAyAAKAIEQQVxQQVGDQAgASgCGEEcaiEBDAELCwuvBwIOfQV/A0ACQCAAIAAoAixBAWo2AiwCQCAAKgI0IgggASoCACIJkyICIAEqAgwiBJIiA0MAAAAAXQRAIAMgA5RDAAAAAJIiAyAAKgJAXkUNAQwCC0MAAAAAIQMgAiAEkyICQwAAAABeRQ0AIAIgApRDAAAAAJIiAyAAKgJAXg0BCwJAIAAqAjgiCiABKgIEIguTIgYgASoCECIFkiICQwAAAABdBEAgAiAClCADkiIDIAAqAkBeDQIMAQsgBiAFkyICQwAAAABeRQ0AIAIgApQgA5IiAyAAKgJAXg0BCwJAIAAqAjwiDCABKgIIIg2TIgcgASoCFCIGkiICQwAAAABdBEAgAiAClCADkiIDIAAqAkAiAl4NAgwBCyAHIAaTIgJDAAAAAF5FBEAgACoCQCECDAELIAIgApQgA5IiAyAAKgJAIgJeDQELIAIgA2BFDQACQCAMIA0gBpKTIgMgA5QiByAIIAkgBJKTIgMgA5QiDiAKIAsgBZKTIgMgA5QiA5IiD5IgAmANACAHIAggCSAEk5MiBCAElCIEIAOSIgOSIAJgDQAgByAOIAogCyAFk5MiBSAFlCIFkiIIkiACYA0AIAcgBCAFkiIFkiACYA0AIAwgDSAGk5MiBCAElCIEIA+SIAJgDQAgBCADkiACYA0AIAQgCJIgAmANACAEIAWSIAJgDQAgACAAKAIEQQRyNgIEIAAgARDfAw8LIAEoAhgiEEEBcQRAIAAoAgwiESgCCCARKAIQIBBBAXZsaiEQIAACfyARLQAYRQRAQYCzASARKAIMIhMgESgCFCIUIBAoAgBsaiISKwMAtjgCAEGEswEgEisDCLY4AgBBiLMBIBIrAxC2OAIAQYyzASATIBQgECgCBGxqIhIrAwC2OAIAQZCzASASKwMItjgCAEGUswEgEisDELY4AgBBmLMBIBMgFCAQKAIIbGoiECsDALY4AgBBnLMBIBArAwi2OAIAQaCzASAQKwMQtjgCAEGYswEhE0GMswEhFEGAswEMAQsgESgCDCISIBEoAhQiESAQKAIIbGohEyASIBAoAgQgEWxqIRQgEiARIBAoAgBsagsgFCATEMADRQ0BIAAgACgCBEEEcjYCBCABKAIYQQF2IRAgACgCECIAKAIEIgEgACgCAEYEQCAAEOMDIAAoAgQhAQsgACABQQFqNgIEIAAoAgggAUECdGogEDYCAA8LIAAgEBDJAyAAKAIEQQVxQQVGDQAgASgCGEEcaiEBDAELCwvTBQIMfw99IAFBAEcgAkEAR3EiCARAIAAoAhwiBSgCECEJIAUoAgghCkP//3//IRBD//9/fyEWIAUtABghC0GQswEhDEGUswEhDUGcswEhDkGgswEhD0P//3//IRFD//9//yESQ///f38hF0P//39/IRgDQCAKIAkgASgCAGxqIQACQCALRQRAQYCzASAFKAIMIgYgBSgCFCIHIAAoAgBsaiIEKwMAtiITOAIAQYSzASAEKwMItiIUOAIAQYizASAEKwMQtiIVOAIAQYyzASAGIAcgACgCBGxqIgQrAwC2Ihk4AgAgDCAEKwMItiIaOAIAIA0gBCsDELYiGzgCAEGYswEgBiAHIAAoAghsaiIAKwMAtiIcOAIAIA4gACsDCLYiHTgCACAPIAArAxC2Ih44AgAMAQsgBSgCDCIGIAUoAhQiByAAKAIIbGoiBCoCCCEeIAQqAgQhHSAEKgIAIRwgBiAAKAIEIAdsaiIEKgIIIRsgBCoCBCEaIAQqAgAhGSAGIAcgACgCAGxqIgAqAgghFSAAKgIEIRQgACoCACETCyABQQRqIQEgEiAVIBIgFV4bIhIgGyASIBteGyISIB4gEiAeXhshEiARIBQgESAUXhsiESAaIBEgGl4bIhEgHSARIB1eGyERIBAgEyAQIBNeGyIQIBkgECAZXhsiECAcIBAgHF4bIRAgFiAVIBUgFl4bIhUgGyAVIBtdGyIVIB4gFSAeXRshFiAYIBQgFCAYXhsiFCAaIBQgGl0bIhQgHSAUIB1dGyEYIBcgEyATIBdeGyITIBkgEyAZXRsiEyAcIBMgHF0bIRcgAkEBayICDQALIAMgEiAWk0MAAAA/lDgCFCADIBEgGJNDAAAAP5Q4AhAgAyAQIBeTQwAAAD+UOAIMIAMgEiAWkkMAAAA/lDgCCCADIBggEZJDAAAAP5Q4AgQgAyAXIBCSQwAAAD+UOAIACyAIC60CAQN/IAAoAhwiACgCCCAAKAIQIAFsaiEBAn8gAC0AGEUEQEGAswEgACgCDCIEIAAoAhQiACABKAIAbGoiAysDALY4AgBBhLMBIAMrAwi2OAIAQYizASADKwMQtjgCAEGMswEgBCAAIAEoAgRsaiIDKwMAtjgCAEGQswEgAysDCLY4AgBBlLMBIAMrAxC2OAIAQZizASAEIAAgASgCCGxqIgArAwC2OAIAQZyzASAAKwMItjgCAEGgswEgACsDELY4AgBBmLMBIQRBjLMBIQNBgLMBDAELIAAoAgwiBSAAKAIUIgAgASgCCGxqIQQgBSABKAIEIABsaiEDIAUgACABKAIAbGoLIQUgBSACQQJ0IgBqKgIAIAAgA2oqAgCSIAAgBGoqAgCSQ6uqqj6UC8ADAgt/AX0CQCAALQAIQSBxBEAgAkUEQAwCCyAAKAIcIgMoAhAhByADKAIIIQggAy0AGEUEQCAEQQJ0QYCzAWoiCUEYaiEKIAlBDGohCyADKAIMIQAgAygCFCEEQZCzASEMQZSzASENQZyzASEOQaCzASEPQQAhAwNAQYCzASAAIAggByABIANBAnRqKAIAbGoiBSgCACAEbGoiBisDALY4AgBBhLMBIAYrAwi2OAIAQYizASAGKwMQtjgCAEGMswEgACAFKAIEIARsaiIGKwMAtjgCACAMIAYrAwi2OAIAIA0gBisDELY4AgBBmLMBIAAgBSgCCCAEbGoiBSsDALY4AgAgDiAFKwMItjgCACAPIAUrAxC2OAIAIBAgCSoCAJIgCyoCAJIgCioCAJIhECADQQFqIgMgAkcNAAsMAgsgAygCDCAEQQJ0aiEAIAMoAhQhBEEAIQMDQCAQIAAgBCAIIAcgASADQQJ0aigCAGxqIgUoAgBsaioCAJIgACAFKAIEIARsaioCAJIgACAFKAIIIARsaioCAJIhECADQQFqIgMgAkcNAAsMAQsgAyAEQQJ0aioCAA8LIBAgAkEDbLOVCwoAIAAoAgQgAkkLFQAgAEGQ8AA2AgAgAEEQahDiAyAACw0AIAAQzgMaIAAQigQLvQ0CAn8pfSMAQYABayICJABB5KgBQQA2AgBB3KgBQgA3AgBBuKgBQbioASgCAEFzcTYCAEHIqAEoAgAEQEHIqAFBADYCAAsCQCAABEAgAkFAayAAEOUDDAELIAJCADcCZCACQdQAaiIDQgA3AgAgAkIANwJ0IAJCADcCbCACQgA3AlwgAkIANwJMIAJBgICA/AM2AnwgAkGAgID8AzYCaCADQYCAgPwDNgIAIAJCADcCRCACQYCAgPwDNgJACwJAIAEEQCACIAEQ5QMMAQsgAkIANwIkIAJBFGoiA0IANwIAIAJCADcCNCACQgA3AiwgAkIANwIcIAJCADcCDCACQYCAgPwDNgIoIANBgICA/AM2AgAgAkIANwIEIAJBgICA/AM2AgALAn0gAARAIAAqAgwiEiACKgIwIg6UIAAqAggiEyACKgIgIgqUIAAqAgAiFCACKgIAIguUIAAqAgQiFSACKgIQIgSUkpKSIR0gACoCPCIGIAIqAjgiBZQgACoCOCIHIAIqAigiDJQgACoCMCIWIAIqAggiCJQgAioCGCINIAAqAjQiF5SSkpIhHiAGIAIqAjQiCZQgByACKgIkIg+UIBYgAioCBCIQlCACKgIUIhEgF5SSkpIhHyAGIA6UIAcgCpQgFiALlCAEIBeUkpKSIRYgACoCLCIGIAWUIAAqAigiByAMlCAAKgIgIhggCJQgDSAAKgIkIhmUkpKSIRcgBiAJlCAHIA+UIBggEJQgESAZlJKSkiEgIAYgDpQgByAKlCAYIAuUIAQgGZSSkpIhGCAAKgIcIgYgBZQgACoCGCIHIAyUIAAqAhAiGiAIlCANIAAqAhQiHJSSkpIhGSAGIAmUIAcgD5QgGiAQlCARIByUkpKSISEgBiAOlCAHIAqUIBogC5QgBCAclJKSkiEaIBIgCZQgEyAPlCAUIBCUIBUgEZSSkpIhIiASIAWUIBMgDJQgFCAIlCAVIA2UkpKSDAELIAIqAjghHiACKgI0IR8gAioCMCEWIAIqAighFyACKgIkISAgAioCICEYIAIqAhghGSACKgIUISEgAioCECEaIAIqAgQhIiACKgIAIR0gAioCCAshHAJ9IAEEQCABKgIMIiMgAioCcCIIlCABKgIIIiQgAioCYCINlCABKgIAIiUgAioCQCIJlCABKgIEIiYgAioCUCIPlJKSkiEOIAEqAjwiCiACKgJ4IhCUIAEqAjgiCyACKgJoIhGUIAEqAjAiBCACKgJIIhKUIAIqAlgiEyABKgI0IgWUkpKSIScgCiACKgJ0IhSUIAsgAioCZCIVlCAEIAIqAkQiBpQgAioCVCIHIAWUkpKSISggCiAIlCALIA2UIAQgCZQgDyAFlJKSkiEpIAEqAiwiBCAQlCABKgIoIgUgEZQgASoCICIMIBKUIBMgASoCJCIblJKSkiEKIAQgFJQgBSAVlCAMIAaUIAcgG5SSkpIhCyAEIAiUIAUgDZQgDCAJlCAPIBuUkpKSIQQgASoCHCIbIBCUIAEqAhgiKiARlCABKgIQIisgEpQgEyABKgIUIiyUkpKSIQUgGyAUlCAqIBWUICsgBpQgByAslJKSkiEMIBsgCJQgKiANlCArIAmUIA8gLJSSkpIhCCAjIBSUICQgFZQgJSAGlCAmIAeUkpKSIQkgIyAQlCAkIBGUICUgEpQgJiATlJKSkgwBCyACKgJ4IScgAioCdCEoIAIqAnAhKSACKgJoIQogAioCZCELIAIqAmAhBCACKgJYIQUgAioCVCEMIAIqAlAhCCACKgJEIQkgAioCQCEOIAIqAkgLIQ1B1KkBIBY4AgBBjKkBIB04AgBB4KkBICk4AgBBsKkBIA44AgBB3KkBIB44AgBB2KkBIB84AgBBrKkBIBc4AgBBqKkBICA4AgBBpKkBIBg4AgBBoKkBIBk4AgBBnKkBICE4AgBBmKkBIBo4AgBBlKkBIBw4AgBBkKkBICI4AgBB6KkBICc4AgBB5KkBICg4AgBB0KkBIAo4AgBBzKkBIAs4AgBByKkBIAQ4AgBBxKkBIAU4AgBBwKkBIAw4AgBBvKkBIAg4AgBBuKkBIA04AgBBtKkBIAk4AgBBiKkBIAqLQ703hjWSOAIAQYSpASALi0O9N4Y1kjgCAEGAqQEgBItDvTeGNZI4AgBB/KgBIAWLQ703hjWSOAIAQfioASAMi0O9N4Y1kjgCAEH0qAEgCItDvTeGNZI4AgBB8KgBIA2LQ703hjWSOAIAQeyoASAJi0O9N4Y1kjgCAEHoqAEgDotDvTeGNZI4AgAgAkGAAWokAAv2EgIIfxx9IwBBMGsiBCQAIAAoAiAiAygCCCADKAIQIAFsaiEGAn8gAy0AGEUEQEGAswEgAygCDCIHIAMoAhQiAyAGKAIAbGoiCCsDALY4AgBBhLMBIAgrAwi2OAIAQYizASAIKwMQtjgCAEGMswEgByADIAYoAgRsaiIIKwMAtjgCAEGQswEgCCsDCLY4AgBBlLMBIAgrAxC2OAIAQZizASAHIAMgBigCCGxqIgMrAwC2OAIAQZyzASADKwMItjgCAEGgswEgAysDELY4AgBBmLMBIQdBjLMBIQhBgLMBDAELIAMoAgwiBSADKAIUIgMgBigCCGxqIQcgBSAGKAIEIANsaiEIIAUgAyAGKAIAbGoLIQUgACgCJCIDKAIIIAMoAhAgAmxqIQYCQCADLQAYRQRAQYCzASADKAIMIgogAygCFCIDIAYoAgBsaiIJKwMAtiINOAIAQYSzASAJKwMItiILOAIAQYizASAJKwMQtiIUOAIAQYyzASAKIAMgBigCBGxqIgkrAwC2Ig44AgBBkLMBIAkrAwi2IhU4AgBBlLMBIAkrAxC2Ig84AgBBmLMBIAogAyAGKAIIbGoiAysDALYiFjgCAEGcswEgAysDCLYiFzgCAEGgswEgAysDELYiEzgCAAwBCyADKAIMIgogAygCFCIDIAYoAghsaiIJKgIIIRMgCSoCBCEXIAkqAgAhFiAKIAYoAgQgA2xqIgkqAgghDyAJKgIEIRUgCSoCACEOIAogAyAGKAIAbGoiAyoCCCEUIAMqAgQhCyADKgIAIQ0LIAQgFCAAKgKUASIblCALIAAqAogBIhqUIA0gACoCfCIYlCAAKgKsASIZkpKSIh04AhggBCAUIAAqApgBIhyUIAsgACoCjAEiHpQgDSAAKgKAASIflCAAKgKwASIgkpKSIiE4AhwgACoCnAEhECAAKgKQASERIAAqArQBIRIgACoChAEhDCAEIA8gHJQgFSAelCAgIA4gH5SSkpIiIjgCECAEIA8gG5QgFSAalCAZIA4gGJSSkpIiIzgCDCAEIBMgHJQgFyAelCAgIBYgH5SSkpIiHDgCBCAEIBMgG5QgFyAalCAZIBYgGJSSkpIiGzgCACAEIA8gEJQgFSARlCASIA4gDJSSkpIiFTgCFCAEIBQgEJQgCyARlCASIA0gDJSSkpIiFDgCICAEIBMgEJQgFyARlCASIBYgDJSSkpIiDzgCCCAAIAAoAixBAWo2AiwgCCoCCCEWIAcqAgghFyAFKgIIIQwgBCAIKgIAIh4gBSoCACINkyIRIAcqAgQiHyAFKgIEIguTIhKUIAcqAgAiICANkyIOIAgqAgQiJCALkyITlJMiEDgCLCAEIBYgDJMiGiAOlCAXIAyTIg4gEZSTIhE4AiggBCATIA6UIBIgGpSTIhI4AiRDAAAAACANIBKMIiWUIAsgEZSTIBAgDJSTIg4gECAUlCASIB2UICEgEZSSkpIiEyATi0O9N4Y1XRsiE0MAAAAAIA4gECAPlCASIBuUIBwgEZSSkpIiGiAai0O9N4Y1XRsiGJQhGgJAIBNDAAAAACAOIBAgFZQgEiAjlCAiIBGUkpKSIg4gDotDvTeGNV0bIhmUIiZDAAAAAF4gGkMAAAAAXnENAEMAAAAAICIgIZMiIiAPIBSTIg+UIBwgIZMiHCAVIBSTIhWUkyIOjCAdlCAhIBUgGyAdkyIblCAPICMgHZMiHZSTIhWUkyAdIByUIBsgIpSTIg8gFJSTIhQgDyAMlCAOIA2UIBUgC5SSkpIiDCAMi0O9N4Y1XRsiDEMAAAAAIBQgDyAXlCAOICCUIBUgH5SSkpIiDSANi0O9N4Y1XRsiDZQhF0MAAAAAIBQgDyAWlCAOIB6UIBUgJJSSkpIiCyALi0O9N4Y1XRsiCyAMlCIUQwAAAABeIBdDAAAAAF5xDQAgBEECIBAgDpQgDyAllJKLIhYgESAPlCAVIBCMlJKLIhBeIgMgEiAVlCAOIBGMlJKLIBYgECADG14bQQJ0IgNqKgIAIQ4gBEEMaiADaioCACEWIARBGGogA2oqAgAhESADIAdqKgIAIRIgAyAIaioCACEPIAMgBWoqAgAhEAJ/AkACQAJAAn0gFEMAAAAAXgRAIA0gC5MhFCANIAyTIRUgDSAPIBKTlCEXIA0gECASk5QMAQsgF0MAAAAAXgRAIAsgDZMhFCALIAyTIRUgCyASIA+TlCEXIAsgECAPk5QhDCAPIRAMAgsgCyANlEMAAAAAXkUgDEMAAAAAW3FFBEAgDCANkyEUIAwgC5MhFSAMIBIgEJOUIRcgDCAPIBCTlCEMDAILIAtDAAAAAFwEQCALIA2TIRQgCyAMkyEVIAsgEiAPk5QhFyALIBAgD5OUIQwgDyEQDAILIA1DAAAAAFsNAiANIAuTIRQgDSAMkyEVIA0gDyASk5QhFyANIBAgEpOUCyEMIBIhEAsCQAJ9ICZDAAAAAF4EQCAYIBmTIQ0gGCATkyELIBggESAOk5QhEyAYIBYgDpOUDAELIBpDAAAAAF4EQCAZIBiTIQ0gGSATkyELIBkgDiAWk5QhDyAZIBEgFpOUIRMgFiERDAILIBkgGJRDAAAAAF5FIBNDAAAAAFtxRQRAIBMgGJMhDSATIBmTIQsgEyAOIBGTlCEPIBMgFiARk5QhEwwCCyAZQwAAAABcBEAgGSAYkyENIBkgE5MhCyAZIA4gFpOUIQ8gGSARIBaTlCETIBYhEQwCCyAYQwAAAABbDQMgGCAZkyENIBggE5MhCyAYIBEgDpOUIRMgGCAWIA6TlAshDyAOIRELIAwgFJQgCyANlCISlCAQIBUgFJQiDCASlCIUlCIOkiIQIBcgFZQgEpQgDpIiEiAQIBJeIgMbIAwgD5QgC5QgESAUlCILkiIRIAwgE5QgDZQgC5IiDCAMIBFeIgUbXUF/cyAMIBEgBRsgEiAQIAMbXUVxDAILIARBJGogBSAIIAcgBEEYaiAEQQxqIAQQfgwBCyAEQSRqIAUgCCAHIARBGGogBEEMaiAEEH4LRQ0AIABBEGohByAAKAIUIgMgACgCEEYEQCAHEOMDIAAoAhQhAwsgACADQQFqNgIUIAAoAhgiBSADQQJ0aiABNgIAIAAoAhQiAyAAKAIQRgRAIAcQ4wMgACgCGCEFIAAoAhQhAwsgACADQQFqNgIUIAUgA0ECdGogAjYCACAAIAAoAgRBBHI2AgQLIARBMGokAAuVCQIcfQN/A0ACQCAAIAAoAigiIEEBajYCKCACKgIUIgUgACoCTCINlCACKgIQIgYgACoCQCIOlCACKgIMIgcgACoCNCIPlCABKgIMIgiSkpK8IAAqApQBIhUgAioCCCIDlCAAKgJ8IhYgAioCACIElCAAKgKIASIXIAIqAgQiCpSSkiAAKgKsAZIgASoCAJMiC7xB/////wdxSQ0AIAUgACoCUCIQlCAGIAAqAkQiEZQgByAAKgI4IhKUIAEqAhAiCZKSkrwgACoCsAEgACoCmAEiGCADlCAAKgKAASIZIASUIAogACoCjAEiGpSSkpIgASoCBJMiDLxB/////wdxSQ0AIAAqArQBIAAqApwBIhsgA5QgACoChAEiHCAElCAKIAAqApABIh2UkpKSIAEqAgiTIgS8Qf////8HcSAFIAAqAlQiE5QgBiAAKgJIIhSUIAcgACoCPCIKlCABKgIUIgOSkpK8Sw0AIAcgAyAKlCAIIA+UIAkgEpSSkpK8IAQgHJQgCyAWlCAZIAyUkpK8Qf////8HcUkNACAGIAMgFJQgCCAOlCAJIBGUkpKSvCAEIB2UIAsgF5QgGiAMlJKSvEH/////B3FJDQAgBSADIBOUIAggDZQgCSAQlJKSkrwgBCAblCALIBWUIBggDJSSkrxB/////wdxSQ0AIAAtAJACQQEgIBsEQCAFIA6UIAYgDZQgCSAKlCASIAOUkpKSvCAEIBmUIBwgDJSTvEH/////B3FJDQEgBSAPlCAHIA2UIAkgFJQgESADlJKSkrwgBCAalCAdIAyMIh6UkrxB/////wdxSQ0BIAYgD5QgByAOlCAJIBOUIBAgA5SSkpK8IAQgGJQgGyAelJK8Qf////8HcUkNASAFIBGUIAYgEJQgCCAKlCAPIAOUkpKSvCALIByUIBYgBJSTvEH/////B3FJDQEgBSASlCAHIBCUIAggFJQgDiADlJKSkrwgCyAdlCAXIASMIgSUkrxB/////wdxSQ0BIAYgEpQgByARlCAIIBOUIA0gA5SSkpK8IAsgG5QgFSAElJK8Qf////8HcUkNASAFIBSUIAYgE5QgCCASlCAPIAmUkpKSvCAMIBaUIBkgC5STvEH/////B3FJDQEgBSAKlCAHIBOUIAggEZQgDiAJlJKSkrwgDCAXlCAaIAuMIgOUkrxB/////wdxSQ0BIAYgCpQgByAUlCAIIBCUIA0gCZSSkpK8IAwgFZQgGCADlJK8Qf////8HcUkNAQsgAigCGCIhQQFxISAgASgCGCIfQQFxBEAgIARAIAAgH0EBdiAhQQF2ENEDDAILIAAgASAhQRxqENIDIAAoAgRBBXFBBUYNASACKAIYIQIMAgsgH0EcaiEfICAEQCAAIB8gAhDSAyAAKAIEQQVxQQVGDQEgASgCGCEBDAILIAAgHyAhQRxqENIDIAAoAgRBBXFBBUYNACAAIAEoAhhBHGogAigCGBDSAyAAKAIEQQVxQQVGDQAgACABKAIYIAIoAhhBHGoQ0gMgACgCBEEFcUEFRg0AIAIoAhghAiABKAIYIQEMAQsLC5liAhJ/H30jAEEQayIKJAAgAEEQaiEQIABBgAJqIQ0gAEH0AWohDiAAQegBaiEPAkACQAJ/A0AgAS8BCCEMIAEvAQohEiACLwEKIQQgAi8BCCEDIAAqArwBISAgAS8BAiERIAAqAsgBISkgACoCzAEhMCAAKgLAASEtIAEuAQQhEyAAKgLkASEVIAAqAuABIRYgACoC3AEhHCACLwEGIQggACoCxAEhGCABLwEGIQsgACoCuAEhHSABLgEAIQUgACoC2AEhFyACLgEEIQYgACoC0AEhGyACLgEAIQcgACoC1AEhGiACLgECIQkgACAAKAIoIhRBAWo2AiggACoCrAEiMSAAKgKUASIvIBcgBrKUIheUIAAqAnwiIiAbIAeylCIblCAaIAmylCIrIAAqAogBIi6UkpKSIB0gBbKUkyIevEH/////B3EgFSAEs5QiFSAAKgJMIiGUIBYgA7OUIhYgACoCQCIflCAcIAizlCIcIAAqAjQiGZQgGCALs5QiHZKSkrxLDQMgACoCsAEiMiAAKgKYASInIBeUIAAqAoABIiogG5QgKyAAKgKMASIllJKSkiAgIBHBspSTIhq8Qf////8HcSAVIAAqAlAiLJQgFiAAKgJEIiaUIBwgACoCOCIglCApIAyzlCIYkpKSvEsNAyAAKgK0ASIzIAAqApwBIiggF5QgACoChAEiJCAblCArIAAqApABIiOUkpKSIC0gE7KUkyIbvEH/////B3EgFSAAKgJUIi2UIBYgACoCSCIplCAcIAAqAjwiK5QgMCASs5QiF5KSkrxLDQMgHCAXICuUIB0gGZQgGCAglJKSkrwgGyAklCAeICKUICogGpSSkrxB/////wdxSQ0DIBYgFyAplCAdIB+UIBggJpSSkpK8IBsgI5QgHiAulCAlIBqUkpK8Qf////8HcUkNAyAVIBcgLZQgHSAhlCAYICyUkpKSvCAbICiUIB4gL5QgJyAalJKSvEH/////B3FJDQMgAC0AkAJBASAUGwRAIBUgH5QgFiAhlCAYICuUIBcgIJSSkpK8IBsgKpQgJCAalJO8Qf////8HcUkNBCAVIBmUIBwgIZQgGCAplCAXICaUkpKSvCAbICWUICMgGowiMJSSvEH/////B3FJDQQgFiAZlCAcIB+UIBggLZQgFyAslJKSkrwgGyAnlCAoIDCUkrxB/////wdxSQ0EIBUgJpQgFiAslCAdICuUIBcgGZSSkpK8IB4gJJQgIiAblJO8Qf////8HcUkNBCAVICCUIBwgLJQgHSAplCAXIB+UkpKSvCAeICOUIC4gG4wiG5SSvEH/////B3FJDQQgFiAglCAcICaUIB0gLZQgFyAhlJKSkrwgHiAolCAvIBuUkrxB/////wdxSQ0EIBUgKZQgFiAtlCAdICCUIBggGZSSkpK8IBogIpQgKiAelJO8Qf////8HcUkNBCAVICuUIBwgLZQgHSAmlCAYIB+UkpKSvCAaIC6UICUgHowiF5SSvEH/////B3FJDQQgFiArlCAcICmUIB0gLJQgGCAhlJKSkrwgGiAvlCAnIBeUkrxB/////wdxSQ0ECyACKAIQQQFxIQsgAigCDCIGQQFxIQgCQAJAAn8CQCABKAIMIgRBAXEEQCAAIARBAXYiCTYCjAIgACgCICIEKAIIIAQoAhAgCWxqIQcCQCAELQAYRQRAQYCzASAEKAIMIgMgBCgCFCIEIAcoAgBsaiIMKwMAtiIYOAIAQYCzASEFQYSzASAMKwMItiIaOAIAQYizASAMKwMQtiIVOAIAQYyzASADIAQgBygCBGxqIgwrAwC2OAIAQZCzASAMKwMItjgCAEGUswEgDCsDELY4AgBBmLMBIAMgBCAHKAIIbGoiBCsDALY4AgBBnLMBIAQrAwi2OAIAQaCzASAEKwMQtjgCAEGYswEhBEGMswEhAwwBCyAEKAIMIgUgBCgCFCIMIAcoAghsaiEEIAUgBygCBCAMbGohAyAFIAwgBygCAGxqIgUqAgghFSAFKgIEIRogBSoCACEYCyAAIBUgACoCcCIWlCAaIAAqAmQiHJQgGCAAKgJYIheUIAAqAqABIhiSkpIiJjgC6AEgACAVIAAqAnQiHZQgGiAAKgJoIhuUIAUqAgAiICAAKgJcIhqUIAAqAqQBIh6SkpIiKzgC7AEgACAVIAAqAngiGZQgBSoCBCAAKgJsIhWUICAgACoCYCIflCAAKgKoASIgkpKSIiw4AvABIAAgFiADKgIIIiGUIBwgAyoCBCIplCAYIBcgAyoCAJSSkpIiLTgC9AEgACAhIB2UICkgG5QgHiAaIAMqAgAiKZSSkpIiJDgC+AEgACAhIBmUIBUgAyoCBJQgICApIB+UkpKSIik4AvwBIAAgFiAEKgIIIiGUIBwgBCoCBCIWlCAYIBcgBCoCAJSSkpIiFzgCgAIgACAhIB2UIBYgG5QgHiAaIAQqAgAiFpSSkpIiGDgChAIgACAhIBmUIBUgBCoCBJQgICAWIB+UkpKSIh04AogCIAgEQCAAKAIkIgQoAgggBkEBdiIMIAQoAhBsaiEDAkAgBC0AGEUEQEGAswEgBCgCDCIFIAQoAhQiBiADKAIAbGoiBysDALYiGzgCAEGAswEhBEGEswEgBysDCLYiGjgCAEGIswEgBysDELYiHjgCAEGMswEgBSAGIAMoAgRsaiIHKwMAtiIfOAIAQZCzASAHKwMItiIgOAIAQZSzASAHKwMQtiIhOAIAQZizASAFIAYgAygCCGxqIgMrAwC2Iio4AgBBnLMBIAMrAwi2IiI4AgBBoLMBIAMrAxC2IiM4AgBBmLMBIQVBjLMBIQYMAQsgBCgCDCIHIAQoAhQiBCADKAIIbGoiBSoCCCEjIAUqAgQhIiAFKgIAISogByADKAIEIARsaiIGKgIIISEgBioCBCEgIAYqAgAhHyAHIAQgAygCAGxqIgQqAgghHiAEKgIEIRogBCoCACEbCyAAIAAoAixBAWo2AiwgCiAtICaTIhYgGCArkyIclCAXICaTIhkgJCArkyIllJMiFTgCDCAKICkgLJMiLiAZlCAdICyTIhkgFpSTIhY4AgggCiAlIBmUIBwgLpSTIhw4AgRDAAAAACAcjCIvICaUICsgFpSTIBUgLJSTIhkgFSAelCAcIBuUIBogFpSSkpIiJSAli0O9N4Y1XRsiJUMAAAAAIBkgFSAjlCAcICqUICIgFpSSkpIiLiAui0O9N4Y1XRsiKJQhLiAlQwAAAAAgGSAVICGUIBwgH5QgICAWlJKSkiIZIBmLQ703hjVdGyInlEMAAAAAXiIHIC5DAAAAAF5xDQRDAAAAACAgIBqTIiAgIyAekyIjlCAiIBqTIiIgISAekyIhlJMiGYwgG5QgGiAhICogG5MiKpQgIyAfIBuTIh+UkyIblJMgHyAilCAqICCUkyIaIB6UkyIeIBogLJQgGSAmlCAbICuUkpKSIh8gH4tDvTeGNV0bIh9DAAAAACAeIBogHZQgGSAXlCAbIBiUkpKSIhcgF4tDvTeGNV0bIheUIR1DAAAAACAeIBogKZQgGSAtlCAbICSUkpKSIhggGItDvTeGNV0bIhggH5RDAAAAAF4iESAdQwAAAABecQ0EIAVBAiAVIBmUIBogL5SSiyIeIBYgGpQgGyAVjJSSiyIVXiIDIBwgG5QgGSAWjJSSiyAeIBUgAxteG0ECdCIDaioCACEbIAMgBmoqAgAhGSADIARqKgIAIRYgAyANaioCACEcIAMgDmoqAgAhHiADIA9qKgIAIRUCQAJAAn0gEQRAIBcgGJMhHSAXIB+TIRogFyAeIByTlCEgIBcgFSAck5QMAQsgHUMAAAAAXgRAIBggF5MhHSAYIB+TIRogGCAcIB6TlCEgIBggFSAek5QhFyAeIRUMAgsgGCAXlEMAAAAAXkUgH0MAAAAAW3FFBEAgHyAXkyEdIB8gGJMhGiAfIBwgFZOUISAgHyAeIBWTlCEXDAILIBhDAAAAAFwEQCAYIBeTIR0gGCAfkyEaIBggHCAek5QhICAYIBUgHpOUIRcgHiEVDAILIBdDAAAAAFsNAiAXIBiTIR0gFyAfkyEaIBcgHiAck5QhICAXIBUgHJOUCyEXIBwhFQsCQAJ9IAcEQCAoICeTIRggKCAlkyEeICggFiAbk5QhISAoIBkgG5OUDAELIC5DAAAAAF4EQCAnICiTIRggJyAlkyEeICcgGyAZk5QhHyAnIBYgGZOUISEgGSEWDAILICcgKJRDAAAAAF5FICVDAAAAAFtxRQRAICUgKJMhGCAlICeTIR4gJSAbIBaTlCEfICUgGSAWk5QhIQwCCyAnQwAAAABcBEAgJyAokyEYICcgJZMhHiAnIBsgGZOUIR8gJyAWIBmTlCEhIBkhFgwCCyAoQwAAAABbDQUgKCAnkyEYICggJZMhHiAoIBYgG5OUISEgKCAZIBuTlAshHyAbIRYLIBcgHZQgHiAYlCIclCAVIBogHZQiFyAclCIdlCIbkiIVICAgGpQgHJQgG5IiHCAVIBxeIgQbIBcgH5QgHpQgFiAdlCIdkiIWIBcgIZQgGJQgHZIiFyAWIBddIgMbXUF/cyAXIBYgAxsgHCAVIAQbXUVxDAQLIApBBGogDyAOIA0gBCAGIAUQfgwDCyAAIAYQ2AMMAwsCQCAIBEAgACAGQQF2IgU2AowCIAAoAiQiAygCCCADKAIQIAVsaiEHAkAgAy0AGEUEQEGAswEgAygCDCIFIAMoAhQiAyAHKAIAbGoiCSsDALYiHDgCAEGAswEhBkGEswEgCSsDCLYiFjgCAEGIswEgCSsDELYiFTgCAEGMswEgBSADIAcoAgRsaiIJKwMAtjgCAEGQswEgCSsDCLY4AgBBlLMBIAkrAxC2OAIAQZizASAFIAMgBygCCGxqIgMrAwC2OAIAQZyzASADKwMItjgCAEGgswEgAysDELY4AgBBmLMBIQNBjLMBIQUMAQsgAygCDCIGIAMoAhQiCSAHKAIIbGohAyAGIAcoAgQgCWxqIQUgBiAJIAcoAgBsaiIGKgIIIRUgBioCBCEWIAYqAgAhHAsgACAVIC+UIBYgLpQgHCAilCAxkpKSOALoASAAIBUgJ5QgFiAllCAGKgIAIhYgKpQgMpKSkjgC7AEgACAVICiUIAYqAgQgI5QgFiAklCAzkpKSOALwASAAIAUqAggiFSAvlCAFKgIEIhYgLpQgBSoCACAilCAxkpKSOAL0ASAAIBUgJ5QgFiAllCAFKgIAIhYgKpQgMpKSkjgC+AEgACAVICiUIAUqAgQgI5QgFiAklCAzkpKSOAL8ASAAIAMqAggiFSAvlCADKgIEIhYgLpQgAyoCACAilCAxkpKSOAKAAiAAIBUgJ5QgFiAllCADKgIAIhYgKpQgMpKSkjgChAIgACAVICiUIAMqAgQgI5QgFiAklCAzkpKSOAKIAiAAIAQQ2QMMAQsgACAEIAYQ0wMLIAAoAgRBBXFBBUYNByALBEAgACACKAIQQQF2IgM2AowCIAAoAiQiBCgCCCAEKAIQIANsaiEGAkAgBC0AGEUEQEGAswEgBCgCDCIDIAQoAhQiBCAGKAIAbGoiBysDALYiGDgCAEGAswEhBUGEswEgBysDCLYiGjgCAEGIswEgBysDELYiFTgCAEGMswEgAyAEIAYoAgRsaiIHKwMAtjgCAEGQswEgBysDCLY4AgBBlLMBIAcrAxC2OAIAQZizASADIAQgBigCCGxqIgQrAwC2OAIAQZyzASAEKwMItjgCAEGgswEgBCsDELY4AgBBmLMBIQRBjLMBIQMMAQsgBCgCDCIFIAQoAhQiByAGKAIIbGohBCAFIAYoAgQgB2xqIQMgBSAHIAYoAgBsaiIFKgIIIRUgBSoCBCEaIAUqAgAhGAsgACAVIAAqApQBIhaUIBogACoCiAEiHJQgGCAAKgJ8IheUIAAqAqwBIhiSkpI4AugBIAAgFSAAKgKYASIdlCAaIAAqAowBIhuUIAUqAgAiICAAKgKAASIalCAAKgKwASIekpKSOALsASAAIBUgACoCnAEiGZQgBSoCBCAAKgKQASIVlCAgIAAqAoQBIh+UIAAqArQBIiCSkpI4AvABIAAgFiADKgIIIiGUIBwgAyoCBCImlCAYIBcgAyoCAJSSkpI4AvQBIAAgISAdlCAmIBuUIB4gGiADKgIAIiaUkpKSOAL4ASAAICEgGZQgFSADKgIElCAgICYgH5SSkpI4AvwBIAAgFiAEKgIIIiGUIBwgBCoCBCIWlCAYIBcgBCoCAJSSkpI4AoACIAAgISAdlCAWIBuUIB4gGiAEKgIAIhaUkpKSOAKEAiAAICEgGZQgFSAEKgIElCAgIBYgH5SSkpI4AogCIAAgASgCDBDZAwwECyAAIAEoAgwgAigCEBDTAwwDCyAKQQRqIA8gDiANIAQgBiAFEH4LRQ0AIAAoAhQiBCAAKAIQRgRAIBAQ4wMgACgCFCEECyAAIARBAWo2AhQgACgCGCIDIARBAnRqIAk2AgAgACgCFCIEIAAoAhBGBEAgEBDjAyAAKAIYIQMgACgCFCEECyAAIARBAWo2AhQgAyAEQQJ0aiAMNgIAIAAgACgCBEEEcjYCBAsgACgCBEEFcUEFRg0EIAIoAhAhAwJ/AkAgCwRAIAAoAiQiBCgCCCADQQF2IgkgBCgCEGxqIQMCQCAELQAYRQRAQYCzASAEKAIMIgUgBCgCFCIGIAMoAgBsaiIHKwMAtiIbOAIAQYCzASEEQYSzASAHKwMItiIaOAIAQYizASAHKwMQtiIeOAIAQYyzASAFIAYgAygCBGxqIgcrAwC2IiE4AgBBkLMBIAcrAwi2IiY4AgBBlLMBIAcrAxC2Iis4AgBBmLMBIAUgBiADKAIIbGoiAysDALYiLDgCAEGcswEgAysDCLYiKTgCAEGgswEgAysDELYiLTgCAEGYswEhBUGMswEhBgwBCyAEKAIMIgcgBCgCFCIEIAMoAghsaiIFKgIIIS0gBSoCBCEpIAUqAgAhLCAHIAMoAgQgBGxqIgYqAgghKyAGKgIEISYgBioCACEhIAcgBCADKAIAbGoiBCoCCCEeIAQqAgQhGiAEKgIAIRsLIAAgACgCLEEBajYCLCAAKgL8ASEfIAAqAvABIRcgACoCiAIhICAKIAAqAvQBIiUgACoC6AEiGJMiFiAAKgKEAiIuIAAqAuwBIh2TIhyUIAAqAoACIiggGJMiGSAAKgL4ASInIB2TIiSUkyIVOAIMIAogHyAXkyIqIBmUICAgF5MiGSAWlJMiFjgCCCAKICQgGZQgHCAqlJMiHDgCBEMAAAAAIBggHIwiL5QgHSAWlJMgFSAXlJMiGSAVIB6UIBwgG5QgGiAWlJKSkiIkICSLQ703hjVdGyIkQwAAAAAgGSAVIC2UIBwgLJQgKSAWlJKSkiIqICqLQ703hjVdGyIilCEqICRDAAAAACAZIBUgK5QgHCAhlCAmIBaUkpKSIhkgGYtDvTeGNV0bIiOUQwAAAABeIgcgKkMAAAAAXnENA0MAAAAAICYgGpMiJiAtIB6TIi2UICkgGpMiKSArIB6TIiuUkyIZjCAblCAaICsgLCAbkyIslCAtICEgG5MiIZSTIhuUkyAhICmUICwgJpSTIhogHpSTIh4gGiAXlCAZIBiUIBsgHZSSkpIiFyAXi0O9N4Y1XRsiF0MAAAAAIB4gGiAglCAZICiUIBsgLpSSkpIiGCAYi0O9N4Y1XRsiGJQhIEMAAAAAIB4gGiAflCAZICWUIBsgJ5SSkpIiHSAdi0O9N4Y1XRsiHSAXlEMAAAAAXiIMICBDAAAAAF5xDQMgBUECIBUgGZQgGiAvlJKLIh4gFiAalCAbIBWMlJKLIhVeIgMgHCAblCAZIBaMlJKLIB4gFSADG14bQQJ0IgNqKgIAIRsgAyAGaioCACEfIAMgBGoqAgAhFiADIA1qKgIAIRwgAyAOaioCACEZIAMgD2oqAgAhFQJAAkACfSAMBEAgGCAdkyEaIBggF5MhHiAYIBUgHJOUIRcgGCAZIByTlAwBCyAgQwAAAABeBEAgHSAYkyEaIB0gF5MhHiAdIBwgGZOUISAgHSAVIBmTlCEXIBkhFQwCCyAdIBiUQwAAAABeRSAXQwAAAABbcUUEQCAXIBiTIRogFyAdkyEeIBcgHCAVk5QhICAXIBkgFZOUIRcMAgsgHUMAAAAAXARAIB0gGJMhGiAdIBeTIR4gHSAcIBmTlCEgIB0gFSAZk5QhFyAZIRUMAgsgGEMAAAAAWw0CIBggHZMhGiAYIBeTIR4gGCAVIByTlCEXIBggGSAck5QLISAgHCEVCwJAAn0gBwRAICIgI5MhGCAiICSTIR0gIiAWIBuTlCEhICIgHyAbk5QMAQsgKkMAAAAAXgRAICMgIpMhGCAjICSTIR0gIyAbIB+TlCEZICMgFiAfk5QhISAfIRYMAgsgIyAilEMAAAAAXkUgJEMAAAAAW3FFBEAgJCAikyEYICQgI5MhHSAkIBsgFpOUIRkgJCAfIBaTlCEhDAILICNDAAAAAFwEQCAjICKTIRggIyAkkyEdICMgGyAfk5QhGSAjIBYgH5OUISEgHyEWDAILICJDAAAAAFsNBCAiICOTIRggIiAkkyEdICIgFiAbk5QhISAiIB8gG5OUCyEZIBshFgsgFyAalCAdIBiUIhyUIBUgHiAalCIXIByUIhuUIhqSIhUgICAelCAclCAakiIcIBUgHF4iBBsgFyAZlCAdlCAWIBuUIh2SIhYgFyAhlCAYlCAdkiIXIBYgF10iAxtdQX9zIBcgFiADGyAcIBUgBBtdRXEMAwsgCkEEaiAPIA4gDSAEIAYgBRB+DAILIAAgAxDYAwwCCyAKQQRqIA8gDiANIAQgBiAFEH4LRQ0AIAAoAowCIQUgACgCFCIEIAAoAhBGBEAgEBDjAyAAKAIUIQQLIAAgBEEBajYCFCAAKAIYIgMgBEECdGogBTYCACAAKAIUIgQgACgCEEYEQCAQEOMDIAAoAhghAyAAKAIUIQQLIAAgBEEBajYCFCADIARBAnRqIAk2AgAgACAAKAIEQQRyNgIECyAAKAIEIgRBBXFBBUYNAwJAIAEoAhAiBUEBcQRAIAAgBUEBdiIHNgKMAiAAKAIgIgEoAgggASgCECAHbGohBgJAIAEtABhFBEBBgLMBIAEoAgwiAyABKAIUIgEgBigCAGxqIgkrAwC2Ihg4AgBBgLMBIQVBhLMBIAkrAwi2Iho4AgBBiLMBIAkrAxC2IhU4AgBBjLMBIAMgASAGKAIEbGoiCSsDALY4AgBBkLMBIAkrAwi2OAIAQZSzASAJKwMQtjgCAEGYswEgAyABIAYoAghsaiIBKwMAtjgCAEGcswEgASsDCLY4AgBBoLMBIAErAxC2OAIAQZizASEBQYyzASEDDAELIAEoAgwiBSABKAIUIgkgBigCCGxqIQEgBSAGKAIEIAlsaiEDIAUgCSAGKAIAbGoiBSoCCCEVIAUqAgQhGiAFKgIAIRgLIAAgFSAAKgJwIhaUIBogACoCZCIclCAYIAAqAlgiF5QgACoCoAEiGJKSkiImOALoASAAIBUgACoCdCIdlCAaIAAqAmgiG5QgBSoCACIgIAAqAlwiGpQgACoCpAEiHpKSkiIrOALsASAAIBUgACoCeCIZlCAFKgIEIAAqAmwiFZQgICAAKgJgIh+UIAAqAqgBIiCSkpIiLDgC8AEgACAWIAMqAggiIZQgHCADKgIEIimUIBggFyADKgIAlJKSkiItOAL0ASAAICEgHZQgKSAblCAeIBogAyoCACIplJKSkiIkOAL4ASAAICEgGZQgFSADKgIElCAgICkgH5SSkpIiKTgC/AEgACAWIAEqAggiIZQgHCABKgIEIhaUIBggFyABKgIAlJKSkiIXOAKAAiAAICEgHZQgFiAblCAeIBogASoCACIWlJKSkiIYOAKEAiAAICEgGZQgFSABKgIElCAgIBYgH5SSkpIiHTgCiAIgAigCDCEDIAgEQCAAKAIkIgEoAgggA0EBdiIJIAEoAhBsaiEDAkAgAS0AGEUEQEGAswEgASgCDCIIIAEoAhQiBSADKAIAbGoiBisDALYiGzgCAEGAswEhAUGEswEgBisDCLYiGjgCAEGIswEgBisDELYiHjgCAEGMswEgCCAFIAMoAgRsaiIGKwMAtiIfOAIAQZCzASAGKwMItiIgOAIAQZSzASAGKwMQtiIhOAIAQZizASAIIAUgAygCCGxqIgMrAwC2Iio4AgBBnLMBIAMrAwi2IiI4AgBBoLMBIAMrAxC2IiM4AgBBmLMBIQhBjLMBIQUMAQsgASgCDCIGIAEoAhQiASADKAIIbGoiCCoCCCEjIAgqAgQhIiAIKgIAISogBiADKAIEIAFsaiIFKgIIISEgBSoCBCEgIAUqAgAhHyAGIAEgAygCAGxqIgEqAgghHiABKgIEIRogASoCACEbCyAAIAAoAixBAWo2AiwgCiAtICaTIhYgGCArkyIclCAXICaTIhkgJCArkyIllJMiFTgCDCAKICkgLJMiLiAZlCAdICyTIhkgFpSTIhY4AgggCiAlIBmUIBwgLpSTIhw4AgRDAAAAACAcjCIvICaUICsgFpSTIBUgLJSTIhkgFSAelCAcIBuUIBogFpSSkpIiJSAli0O9N4Y1XRsiJUMAAAAAIBkgFSAjlCAcICqUICIgFpSSkpIiLiAui0O9N4Y1XRsiKJQhLiAlQwAAAAAgGSAVICGUIBwgH5QgICAWlJKSkiIZIBmLQ703hjVdGyInlCIwQwAAAABeIC5DAAAAAF5xDQVDAAAAACAgIBqTIiAgIyAekyIjlCAiIBqTIiIgISAekyIhlJMiGYwgG5QgGiAhICogG5MiKpQgIyAfIBuTIh+UkyIblJMgHyAilCAqICCUkyIaIB6UkyIeIBogLJQgGSAmlCAbICuUkpKSIh8gH4tDvTeGNV0bIh9DAAAAACAeIBogHZQgGSAXlCAbIBiUkpKSIhcgF4tDvTeGNV0bIheUIR1DAAAAACAeIBogKZQgGSAtlCAbICSUkpKSIhggGItDvTeGNV0bIhggH5QiHkMAAAAAXiAdQwAAAABecQ0FIAhBAiAVIBmUIBogL5SSiyIgIBYgGpQgGyAVjJSSiyIVXiIDIBwgG5QgGSAWjJSSiyAgIBUgAxteG0ECdCIDaioCACEbIAMgBWoqAgAhICABIANqKgIAIRYgAyANaioCACEcIAMgDmoqAgAhGSADIA9qKgIAIRUCQAJAAn0gHkMAAAAAXgRAIBcgGJMhHSAXIB+TIRogFyAZIByTlCEhIBcgFSAck5QMAQsgHUMAAAAAXgRAIBggF5MhHSAYIB+TIRogGCAcIBmTlCEhIBggFSAZk5QhFyAZIRUMAgsgGCAXlEMAAAAAXkUgH0MAAAAAW3FFBEAgHyAXkyEdIB8gGJMhGiAfIBwgFZOUISEgHyAZIBWTlCEXDAILIBhDAAAAAFwEQCAYIBeTIR0gGCAfkyEaIBggHCAZk5QhISAYIBUgGZOUIRcgGSEVDAILIBdDAAAAAFsNAiAXIBiTIR0gFyAfkyEaIBcgGSAck5QhISAXIBUgHJOUCyEXIBwhFQsCQAJ9IDBDAAAAAF4EQCAoICeTIRggKCAlkyEeICggFiAbk5QhHyAoICAgG5OUDAELIC5DAAAAAF4EQCAnICiTIRggJyAlkyEeICcgGyAgk5QhGSAnIBYgIJOUIR8gICEWDAILICcgKJRDAAAAAF5FICVDAAAAAFtxRQRAICUgKJMhGCAlICeTIR4gJSAbIBaTlCEZICUgICAWk5QhHwwCCyAnQwAAAABcBEAgJyAokyEYICcgJZMhHiAnIBsgIJOUIRkgJyAWICCTlCEfICAhFgwCCyAoQwAAAABbDQUgKCAnkyEYICggJZMhHiAoIBYgG5OUIR8gKCAgIBuTlAshGSAbIRYLIBcgHZQgHiAYlCIclCAVIBogHZQiFyAclCIdlCIbkiIVICEgGpQgHJQgG5IiHCAVIBxeIgEbIBcgGZQgHpQgFiAdlCIdkiIWIBcgH5QgGJQgHZIiFyAWIBddIgMbXUF/cyAXIBYgAxsgHCAVIAEbXUVxDAULIApBBGogDyAOIA0gASAFIAgQfgwECyAAIAMQ2AMgACgCBCEEDAQLAkAgCARAIAAgAigCDEEBdiIDNgKMAiAAKAIkIgQoAgggBCgCECADbGohBgJAIAQtABhFBEBBgLMBIAQoAgwiAyAEKAIUIgQgBigCAGxqIgcrAwC2Ihg4AgBBgLMBIQhBhLMBIAcrAwi2Iho4AgBBiLMBIAcrAxC2IhU4AgBBjLMBIAMgBCAGKAIEbGoiBysDALY4AgBBkLMBIAcrAwi2OAIAQZSzASAHKwMQtjgCAEGYswEgAyAEIAYoAghsaiIEKwMAtjgCAEGcswEgBCsDCLY4AgBBoLMBIAQrAxC2OAIAQZizASEEQYyzASEDDAELIAQoAgwiCCAEKAIUIgcgBigCCGxqIQQgCCAGKAIEIAdsaiEDIAggByAGKAIAbGoiCCoCCCEVIAgqAgQhGiAIKgIAIRgLIAAgFSAAKgKUASIWlCAaIAAqAogBIhyUIBggACoCfCIXlCAAKgKsASIYkpKSOALoASAAIBUgACoCmAEiHZQgGiAAKgKMASIblCAIKgIAIiAgACoCgAEiGpQgACoCsAEiHpKSkjgC7AEgACAVIAAqApwBIhmUIAgqAgQgACoCkAEiFZQgICAAKgKEASIflCAAKgK0ASIgkpKSOALwASAAIBYgAyoCCCIhlCAcIAMqAgQiJpQgGCAXIAMqAgCUkpKSOAL0ASAAICEgHZQgJiAblCAeIBogAyoCACImlJKSkjgC+AEgACAhIBmUIBUgAyoCBJQgICAmIB+UkpKSOAL8ASAAIBYgBCoCCCIhlCAcIAQqAgQiFpQgGCAXIAQqAgCUkpKSOAKAAiAAICEgHZQgFiAblCAeIBogBCoCACIWlJKSkjgChAIgACAhIBmUIBUgBCoCBJQgICAWIB+UkpKSOAKIAiAAIAUQ2QMMAQsgACAFIAIoAgwQ0wMLIAAoAgRBBXFBBUYNBCALBEAgACACKAIQQQF2IgQ2AowCIAAoAiQiAigCCCACKAIQIARsaiEIAkAgAi0AGEUEQEGAswEgAigCDCIEIAIoAhQiAiAIKAIAbGoiCysDALYiGDgCAEGAswEhA0GEswEgCysDCLYiGjgCAEGIswEgCysDELYiFTgCAEGMswEgBCACIAgoAgRsaiILKwMAtjgCAEGQswEgCysDCLY4AgBBlLMBIAsrAxC2OAIAQZizASAEIAIgCCgCCGxqIgIrAwC2OAIAQZyzASACKwMItjgCAEGgswEgAisDELY4AgBBmLMBIQJBjLMBIQQMAQsgAigCDCIDIAIoAhQiCyAIKAIIbGohAiADIAgoAgQgC2xqIQQgAyALIAgoAgBsaiIDKgIIIRUgAyoCBCEaIAMqAgAhGAsgACAVIAAqApQBIhaUIBogACoCiAEiHJQgGCAAKgJ8IheUIAAqAqwBIhiSkpI4AugBIAAgFSAAKgKYASIdlCAaIAAqAowBIhuUIAMqAgAiICAAKgKAASIalCAAKgKwASIekpKSOALsASAAIBUgACoCnAEiGZQgAyoCBCAAKgKQASIVlCAgIAAqAoQBIh+UIAAqArQBIiCSkpI4AvABIAAgFiAEKgIIIiGUIBwgBCoCBCImlCAYIBcgBCoCAJSSkpI4AvQBIAAgISAdlCAmIBuUIB4gGiAEKgIAIiaUkpKSOAL4ASAAICEgGZQgFSAEKgIElCAgICYgH5SSkpI4AvwBIAAgFiACKgIIIiGUIBwgAioCBCIWlCAYIBcgAioCAJSSkpI4AoACIAAgISAdlCAWIBuUIB4gGiACKgIAIhaUkpKSOAKEAiAAICEgGZQgFSACKgIElCAgIBYgH5SSkpI4AogCIAAgASgCEBDZAwwFCyACKAIQIQIgASgCECEBDAELCyAKQQRqIA8gDiANIAEgBSAIEH4LRQ0AIAAoAhQiASAAKAIQRgRAIBAQ4wMgACgCFCEBCyAAIAFBAWo2AhQgACgCGCIEIAFBAnRqIAc2AgAgACgCFCIBIAAoAhBGBEAgEBDjAyAAKAIYIQQgACgCFCEBCyAAIAFBAWo2AhQgBCABQQJ0aiAJNgIAIAAgACgCBEEEciIENgIECyAEQQVxQQVGDQAgAigCECEBAn8CQCALBEAgACgCJCICKAIIIAFBAXYiCyACKAIQbGohAQJAIAItABhFBEBBgLMBIAIoAgwiBCACKAIUIgMgASgCAGxqIggrAwC2Ihs4AgBBgLMBIQJBhLMBIAgrAwi2Iho4AgBBiLMBIAgrAxC2Ih44AgBBjLMBIAQgAyABKAIEbGoiCCsDALYiITgCAEGQswEgCCsDCLYiJjgCAEGUswEgCCsDELYiKzgCAEGYswEgBCADIAEoAghsaiIBKwMAtiIsOAIAQZyzASABKwMItiIpOAIAQaCzASABKwMQtiItOAIAQZizASEEQYyzASEDDAELIAIoAgwiCCACKAIUIgIgASgCCGxqIgQqAgghLSAEKgIEISkgBCoCACEsIAggASgCBCACbGoiAyoCCCErIAMqAgQhJiADKgIAISEgCCACIAEoAgBsaiICKgIIIR4gAioCBCEaIAIqAgAhGwsgACAAKAIsQQFqNgIsIAAqAvwBIR8gACoC8AEhFyAAKgKIAiEgIAogACoC9AEiJSAAKgLoASIYkyIWIAAqAoQCIi4gACoC7AEiHZMiHJQgACoCgAIiKCAYkyIZIAAqAvgBIicgHZMiJJSTIhU4AgwgCiAfIBeTIiogGZQgICAXkyIZIBaUkyIWOAIIIAogJCAZlCAcICqUkyIcOAIEQwAAAAAgGCAcjCIvlCAdIBaUkyAVIBeUkyIZIBUgHpQgHCAblCAaIBaUkpKSIiQgJItDvTeGNV0bIiRDAAAAACAZIBUgLZQgHCAslCApIBaUkpKSIiogKotDvTeGNV0bIiKUISogJEMAAAAAIBkgFSArlCAcICGUICYgFpSSkpIiGSAZi0O9N4Y1XRsiI5QiMEMAAAAAXiAqQwAAAABecQ0DQwAAAAAgJiAakyImIC0gHpMiLZQgKSAakyIpICsgHpMiK5STIhmMIBuUIBogKyAsIBuTIiyUIC0gISAbkyIhlJMiG5STICEgKZQgLCAmlJMiGiAelJMiHiAaIBeUIBkgGJQgGyAdlJKSkiIXIBeLQ703hjVdGyIXQwAAAAAgHiAaICCUIBkgKJQgGyAulJKSkiIYIBiLQ703hjVdGyIYlCEgQwAAAAAgHiAaIB+UIBkgJZQgGyAnlJKSkiIdIB2LQ703hjVdGyIdIBeUIh5DAAAAAF4gIEMAAAAAXnENAyAEQQIgFSAZlCAaIC+UkosiHyAWIBqUIBsgFYyUkosiFV4iASAcIBuUIBkgFoyUkosgHyAVIAEbXhtBAnQiAWoqAgAhGyABIANqKgIAIR8gASACaioCACEWIAEgDWoqAgAhHCABIA5qKgIAIRkgASAPaioCACEVAkACQAJ9IB5DAAAAAF4EQCAYIB2TIRogGCAXkyEeIBggFSAck5QhFyAYIBkgHJOUDAELICBDAAAAAF4EQCAdIBiTIRogHSAXkyEeIB0gHCAZk5QhICAdIBUgGZOUIRcgGSEVDAILIB0gGJRDAAAAAF5FIBdDAAAAAFtxRQRAIBcgGJMhGiAXIB2TIR4gFyAcIBWTlCEgIBcgGSAVk5QhFwwCCyAdQwAAAABcBEAgHSAYkyEaIB0gF5MhHiAdIBwgGZOUISAgHSAVIBmTlCEXIBkhFQwCCyAYQwAAAABbDQIgGCAdkyEaIBggF5MhHiAYIBUgHJOUIRcgGCAZIByTlAshICAcIRULAkACfSAwQwAAAABeBEAgIiAjkyEYICIgJJMhHSAiIBYgG5OUISEgIiAfIBuTlAwBCyAqQwAAAABeBEAgIyAikyEYICMgJJMhHSAjIBsgH5OUIRkgIyAWIB+TlCEhIB8hFgwCCyAjICKUQwAAAABeRSAkQwAAAABbcUUEQCAkICKTIRggJCAjkyEdICQgGyAWk5QhGSAkIB8gFpOUISEMAgsgI0MAAAAAXARAICMgIpMhGCAjICSTIR0gIyAbIB+TlCEZICMgFiAfk5QhISAfIRYMAgsgIkMAAAAAWw0EICIgI5MhGCAiICSTIR0gIiAWIBuTlCEhICIgHyAbk5QLIRkgGyEWCyAXIBqUIB0gGJQiHJQgFSAeIBqUIhcgHJQiG5QiGpIiFSAgIB6UIByUIBqSIhwgFSAcXiICGyAXIBmUIB2UIBYgG5QiHZIiFiAXICGUIBiUIB2SIhcgFiAXXSIBG11Bf3MgFyAWIAEbIBwgFSACG11FcQwDCyAKQQRqIA8gDiANIAIgAyAEEH4MAgsgACABENgDDAILIApBBGogDyAOIA0gAiADIAQQfgtFDQAgACgCjAIhBCAAKAIUIgIgACgCEEYEQCAQEOMDIAAoAhQhAgsgACACQQFqNgIUIAAoAhgiASACQQJ0aiAENgIAIAAoAhQiAiAAKAIQRgRAIBAQ4wMgACgCFCECIAAoAhghAQsgACACQQFqNgIUIAEgAkECdGogCzYCACAAIAAoAgRBBHI2AgQLIApBEGokAAvYYAIPfx99IwBBEGsiCiQAIABBEGohECAAQYACaiEMIABB9AFqIQ0gAEHoAWohDgJAAkACfwNAIAAgACgCKCIEQQFqNgIoIAIqAhQiEiAAKgJMIh2UIAIqAhAiEyAAKgJAIhyUIAIqAgwiGSAAKgI0IhaUIAEqAgwiGpKSkrwgACoClAEiLCACKgIIIhSUIAAqAnwiHyACKgIAIhiUIAAqAogBIiogAioCBCIolJKSIAAqAqwBIi2SIAEqAgCTIhu8Qf////8HcUkNAyASIAAqAlAiKZQgEyAAKgJEIiOUIBkgACoCOCIelCABKgIQIhWSkpK8IAAqArABIi4gACoCmAEiJCAUlCAAKgKAASImIBiUICggACoCjAEiIpSSkpIgASoCBJMiF7xB/////wdxSQ0DIAAqArQBIi8gACoCnAEiJSAUlCAAKgKEASIhIBiUICggACoCkAEiIJSSkpIgASoCCJMiGLxB/////wdxIBIgACoCVCIrlCATIAAqAkgiJ5QgGSAAKgI8IiiUIAEqAhQiFJKSkrxLDQMgGSAUICiUIBogFpQgFSAelJKSkrwgGCAhlCAbIB+UICYgF5SSkrxB/////wdxSQ0DIBMgFCAnlCAaIByUIBUgI5SSkpK8IBggIJQgGyAqlCAiIBeUkpK8Qf////8HcUkNAyASIBQgK5QgGiAdlCAVICmUkpKSvCAYICWUIBsgLJQgJCAXlJKSvEH/////B3FJDQMgAC0AkAJBASAEGwRAIBIgHJQgEyAdlCAVICiUIB4gFJSSkpK8IBggJpQgISAXlJO8Qf////8HcUkNBCASIBaUIBkgHZQgFSAnlCAjIBSUkpKSvCAYICKUICAgF4wiMJSSvEH/////B3FJDQQgEyAWlCAZIByUIBUgK5QgKSAUlJKSkrwgGCAklCAlIDCUkrxB/////wdxSQ0EIBIgI5QgEyAplCAaICiUIBYgFJSSkpK8IBsgIZQgHyAYlJO8Qf////8HcUkNBCASIB6UIBkgKZQgGiAnlCAcIBSUkpKSvCAbICCUICogGIwiGJSSvEH/////B3FJDQQgEyAelCAZICOUIBogK5QgHSAUlJKSkrwgGyAllCAsIBiUkrxB/////wdxSQ0EIBIgJ5QgEyArlCAaIB6UIBYgFZSSkpK8IBcgH5QgJiAblJO8Qf////8HcUkNBCASICiUIBkgK5QgGiAjlCAcIBWUkpKSvCAXICqUICIgG4wiFJSSvEH/////B3FJDQQgEyAolCAZICeUIBogKZQgHSAVlJKSkrwgFyAslCAkIBSUkrxB/////wdxSQ0ECyACKAIcQQFxIQsgAigCGCIGQQFxIQgCQAJAAn8CQCABKAIYIgRBAXEEQCAAIARBAXYiCTYCjAIgACgCICIEKAIIIAQoAhAgCWxqIQcCQCAELQAYRQRAQYCzASAEKAIMIgMgBCgCFCIEIAcoAgBsaiIPKwMAtiIVOAIAQYCzASEFQYSzASAPKwMItiIXOAIAQYizASAPKwMQtiISOAIAQYyzASADIAQgBygCBGxqIg8rAwC2OAIAQZCzASAPKwMItjgCAEGUswEgDysDELY4AgBBmLMBIAMgBCAHKAIIbGoiBCsDALY4AgBBnLMBIAQrAwi2OAIAQaCzASAEKwMQtjgCAEGYswEhBEGMswEhAwwBCyAEKAIMIgUgBCgCFCIPIAcoAghsaiEEIAUgBygCBCAPbGohAyAFIA8gBygCAGxqIgUqAgghEiAFKgIEIRcgBSoCACEVCyAAIBIgACoCcCITlCAXIAAqAmQiGZQgFSAAKgJYIhSUIAAqAqABIhWSkpIiIzgC6AEgACASIAAqAnQiGpQgFyAAKgJoIhiUIAUqAgAiHiAAKgJcIheUIAAqAqQBIhuSkpIiKDgC7AEgACASIAAqAngiFpQgBSoCBCAAKgJsIhKUIB4gACoCYCIclCAAKgKoASIekpKSIik4AvABIAAgEyADKgIIIh2UIBkgAyoCBCInlCAVIBQgAyoCAJSSkpIiKzgC9AEgACAdIBqUICcgGJQgGyAXIAMqAgAiJ5SSkpIiITgC+AEgACAdIBaUIBIgAyoCBJQgHiAnIByUkpKSIic4AvwBIAAgEyAEKgIIIh2UIBkgBCoCBCITlCAVIBQgBCoCAJSSkpIiFDgCgAIgACAdIBqUIBMgGJQgGyAXIAQqAgAiE5SSkpIiFTgChAIgACAdIBaUIBIgBCoCBJQgHiATIByUkpKSIho4AogCIAgEQCAAKAIkIgQoAgggBkEBdiIPIAQoAhBsaiEDAkAgBC0AGEUEQEGAswEgBCgCDCIFIAQoAhQiBiADKAIAbGoiBysDALYiGDgCAEGAswEhBEGEswEgBysDCLYiFzgCAEGIswEgBysDELYiGzgCAEGMswEgBSAGIAMoAgRsaiIHKwMAtiIcOAIAQZCzASAHKwMItiIeOAIAQZSzASAHKwMQtiIdOAIAQZizASAFIAYgAygCCGxqIgMrAwC2IiY4AgBBnLMBIAMrAwi2Ih84AgBBoLMBIAMrAxC2IiA4AgBBmLMBIQVBjLMBIQYMAQsgBCgCDCIHIAQoAhQiBCADKAIIbGoiBSoCCCEgIAUqAgQhHyAFKgIAISYgByADKAIEIARsaiIGKgIIIR0gBioCBCEeIAYqAgAhHCAHIAQgAygCAGxqIgQqAgghGyAEKgIEIRcgBCoCACEYCyAAIAAoAixBAWo2AiwgCiArICOTIhMgFSAokyIZlCAUICOTIhYgISAokyIilJMiEjgCDCAKICcgKZMiKiAWlCAaICmTIhYgE5STIhM4AgggCiAiIBaUIBkgKpSTIhk4AgRDAAAAACAZjCIsICOUICggE5STIBIgKZSTIhYgEiAblCAZIBiUIBcgE5SSkpIiIiAii0O9N4Y1XRsiIkMAAAAAIBYgEiAglCAZICaUIB8gE5SSkpIiKiAqi0O9N4Y1XRsiJZQhKiAiQwAAAAAgFiASIB2UIBkgHJQgHiATlJKSkiIWIBaLQ703hjVdGyIklEMAAAAAXiIHICpDAAAAAF5xDQRDAAAAACAeIBeTIh4gICAbkyIglCAfIBeTIh8gHSAbkyIdlJMiFowgGJQgFyAdICYgGJMiJpQgICAcIBiTIhyUkyIYlJMgHCAflCAmIB6UkyIXIBuUkyIbIBcgKZQgFiAjlCAYICiUkpKSIhwgHItDvTeGNV0bIhxDAAAAACAbIBcgGpQgFiAUlCAYIBWUkpKSIhQgFItDvTeGNV0bIhSUIRpDAAAAACAbIBcgJ5QgFiArlCAYICGUkpKSIhUgFYtDvTeGNV0bIhUgHJRDAAAAAF4iESAaQwAAAABecQ0EIAVBAiASIBaUIBcgLJSSiyIbIBMgF5QgGCASjJSSiyISXiIDIBkgGJQgFiATjJSSiyAbIBIgAxteG0ECdCIDaioCACEYIAMgBmoqAgAhFiADIARqKgIAIRMgAyAMaioCACEZIAMgDWoqAgAhGyADIA5qKgIAIRICQAJAAn0gEQRAIBQgFZMhGiAUIByTIRcgFCAbIBmTlCEeIBQgEiAZk5QMAQsgGkMAAAAAXgRAIBUgFJMhGiAVIByTIRcgFSAZIBuTlCEeIBUgEiAbk5QhFCAbIRIMAgsgFSAUlEMAAAAAXkUgHEMAAAAAW3FFBEAgHCAUkyEaIBwgFZMhFyAcIBkgEpOUIR4gHCAbIBKTlCEUDAILIBVDAAAAAFwEQCAVIBSTIRogFSAckyEXIBUgGSAbk5QhHiAVIBIgG5OUIRQgGyESDAILIBRDAAAAAFsNAiAUIBWTIRogFCAckyEXIBQgGyAZk5QhHiAUIBIgGZOUCyEUIBkhEgsCQAJ9IAcEQCAlICSTIRUgJSAikyEbICUgEyAYk5QhHSAlIBYgGJOUDAELICpDAAAAAF4EQCAkICWTIRUgJCAikyEbICQgGCAWk5QhHCAkIBMgFpOUIR0gFiETDAILICQgJZRDAAAAAF5FICJDAAAAAFtxRQRAICIgJZMhFSAiICSTIRsgIiAYIBOTlCEcICIgFiATk5QhHQwCCyAkQwAAAABcBEAgJCAlkyEVICQgIpMhGyAkIBggFpOUIRwgJCATIBaTlCEdIBYhEwwCCyAlQwAAAABbDQUgJSAkkyEVICUgIpMhGyAlIBMgGJOUIR0gJSAWIBiTlAshHCAYIRMLIBQgGpQgGyAVlCIZlCASIBcgGpQiFCAZlCIalCIYkiISIB4gF5QgGZQgGJIiGSASIBleIgQbIBQgHJQgG5QgEyAalCIakiITIBQgHZQgFZQgGpIiFCATIBRdIgMbXUF/cyAUIBMgAxsgGSASIAQbXUVxDAQLIApBBGogDiANIAwgBCAGIAUQfgwDCyAAIAYQ1gMMAwsCQCAIBEAgACAGQQF2IgU2AowCIAAoAiQiAygCCCADKAIQIAVsaiEHAkAgAy0AGEUEQEGAswEgAygCDCIFIAMoAhQiAyAHKAIAbGoiCSsDALYiGTgCAEGAswEhBkGEswEgCSsDCLYiEzgCAEGIswEgCSsDELYiEjgCAEGMswEgBSADIAcoAgRsaiIJKwMAtjgCAEGQswEgCSsDCLY4AgBBlLMBIAkrAxC2OAIAQZizASAFIAMgBygCCGxqIgMrAwC2OAIAQZyzASADKwMItjgCAEGgswEgAysDELY4AgBBmLMBIQNBjLMBIQUMAQsgAygCDCIGIAMoAhQiCSAHKAIIbGohAyAGIAcoAgQgCWxqIQUgBiAJIAcoAgBsaiIGKgIIIRIgBioCBCETIAYqAgAhGQsgACASICyUIBMgKpQgGSAflCAtkpKSOALoASAAIBIgJJQgEyAilCAGKgIAIhMgJpQgLpKSkjgC7AEgACASICWUIAYqAgQgIJQgEyAhlCAvkpKSOALwASAAIAUqAggiEiAslCAFKgIEIhMgKpQgBSoCACAflCAtkpKSOAL0ASAAIBIgJJQgEyAilCAFKgIAIhMgJpQgLpKSkjgC+AEgACASICWUIAUqAgQgIJQgEyAhlCAvkpKSOAL8ASAAIAMqAggiEiAslCADKgIEIhMgKpQgAyoCACAflCAtkpKSOAKAAiAAIBIgJJQgEyAilCADKgIAIhMgJpQgLpKSkjgChAIgACASICWUIAMqAgQgIJQgEyAhlCAvkpKSOAKIAiAAIAQQ1wMMAQsgACAEIAYQ1AMLIAAoAgRBBXFBBUYNByALBEAgACACKAIcQQF2IgM2AowCIAAoAiQiBCgCCCAEKAIQIANsaiEGAkAgBC0AGEUEQEGAswEgBCgCDCIDIAQoAhQiBCAGKAIAbGoiBysDALYiFTgCAEGAswEhBUGEswEgBysDCLYiFzgCAEGIswEgBysDELYiEjgCAEGMswEgAyAEIAYoAgRsaiIHKwMAtjgCAEGQswEgBysDCLY4AgBBlLMBIAcrAxC2OAIAQZizASADIAQgBigCCGxqIgQrAwC2OAIAQZyzASAEKwMItjgCAEGgswEgBCsDELY4AgBBmLMBIQRBjLMBIQMMAQsgBCgCDCIFIAQoAhQiByAGKAIIbGohBCAFIAYoAgQgB2xqIQMgBSAHIAYoAgBsaiIFKgIIIRIgBSoCBCEXIAUqAgAhFQsgACASIAAqApQBIhOUIBcgACoCiAEiGZQgFSAAKgJ8IhSUIAAqAqwBIhWSkpI4AugBIAAgEiAAKgKYASIalCAXIAAqAowBIhiUIAUqAgAiHiAAKgKAASIXlCAAKgKwASIbkpKSOALsASAAIBIgACoCnAEiFpQgBSoCBCAAKgKQASISlCAeIAAqAoQBIhyUIAAqArQBIh6SkpI4AvABIAAgEyADKgIIIh2UIBkgAyoCBCIjlCAVIBQgAyoCAJSSkpI4AvQBIAAgHSAalCAjIBiUIBsgFyADKgIAIiOUkpKSOAL4ASAAIB0gFpQgEiADKgIElCAeICMgHJSSkpI4AvwBIAAgEyAEKgIIIh2UIBkgBCoCBCITlCAVIBQgBCoCAJSSkpI4AoACIAAgHSAalCATIBiUIBsgFyAEKgIAIhOUkpKSOAKEAiAAIB0gFpQgEiAEKgIElCAeIBMgHJSSkpI4AogCIAAgASgCGBDXAwwECyAAIAEoAhggAigCHBDUAwwDCyAKQQRqIA4gDSAMIAQgBiAFEH4LRQ0AIAAoAhQiBCAAKAIQRgRAIBAQ4wMgACgCFCEECyAAIARBAWo2AhQgACgCGCIDIARBAnRqIAk2AgAgACgCFCIEIAAoAhBGBEAgEBDjAyAAKAIYIQMgACgCFCEECyAAIARBAWo2AhQgAyAEQQJ0aiAPNgIAIAAgACgCBEEEcjYCBAsgACgCBEEFcUEFRg0EIAIoAhwhAwJ/AkAgCwRAIAAoAiQiBCgCCCADQQF2IgkgBCgCEGxqIQMCQCAELQAYRQRAQYCzASAEKAIMIgUgBCgCFCIGIAMoAgBsaiIHKwMAtiIYOAIAQYCzASEEQYSzASAHKwMItiIXOAIAQYizASAHKwMQtiIbOAIAQYyzASAFIAYgAygCBGxqIgcrAwC2Ih04AgBBkLMBIAcrAwi2IiM4AgBBlLMBIAcrAxC2Iig4AgBBmLMBIAUgBiADKAIIbGoiAysDALYiKTgCAEGcswEgAysDCLYiJzgCAEGgswEgAysDELYiKzgCAEGYswEhBUGMswEhBgwBCyAEKAIMIgcgBCgCFCIEIAMoAghsaiIFKgIIISsgBSoCBCEnIAUqAgAhKSAHIAMoAgQgBGxqIgYqAgghKCAGKgIEISMgBioCACEdIAcgBCADKAIAbGoiBCoCCCEbIAQqAgQhFyAEKgIAIRgLIAAgACgCLEEBajYCLCAAKgL8ASEcIAAqAvABIRQgACoCiAIhHiAKIAAqAvQBIiIgACoC6AEiFZMiEyAAKgKEAiIqIAAqAuwBIhqTIhmUIAAqAoACIiUgFZMiFiAAKgL4ASIkIBqTIiGUkyISOAIMIAogHCAUkyImIBaUIB4gFJMiFiATlJMiEzgCCCAKICEgFpQgGSAmlJMiGTgCBEMAAAAAIBUgGYwiLJQgGiATlJMgEiAUlJMiFiASIBuUIBkgGJQgFyATlJKSkiIhICGLQ703hjVdGyIhQwAAAAAgFiASICuUIBkgKZQgJyATlJKSkiImICaLQ703hjVdGyIflCEmICFDAAAAACAWIBIgKJQgGSAdlCAjIBOUkpKSIhYgFotDvTeGNV0bIiCUQwAAAABeIgcgJkMAAAAAXnENA0MAAAAAICMgF5MiIyArIBuTIiuUICcgF5MiJyAoIBuTIiiUkyIWjCAYlCAXICggKSAYkyIplCArIB0gGJMiHZSTIhiUkyAdICeUICkgI5STIhcgG5STIhsgFyAUlCAWIBWUIBggGpSSkpIiFCAUi0O9N4Y1XRsiFEMAAAAAIBsgFyAelCAWICWUIBggKpSSkpIiFSAVi0O9N4Y1XRsiFZQhHkMAAAAAIBsgFyAclCAWICKUIBggJJSSkpIiGiAai0O9N4Y1XRsiGiAUlEMAAAAAXiIPIB5DAAAAAF5xDQMgBUECIBIgFpQgFyAslJKLIhsgEyAXlCAYIBKMlJKLIhJeIgMgGSAYlCAWIBOMlJKLIBsgEiADG14bQQJ0IgNqKgIAIRggAyAGaioCACEcIAMgBGoqAgAhEyADIAxqKgIAIRkgAyANaioCACEWIAMgDmoqAgAhEgJAAkACfSAPBEAgFSAakyEXIBUgFJMhGyAVIBIgGZOUIRQgFSAWIBmTlAwBCyAeQwAAAABeBEAgGiAVkyEXIBogFJMhGyAaIBkgFpOUIR4gGiASIBaTlCEUIBYhEgwCCyAaIBWUQwAAAABeRSAUQwAAAABbcUUEQCAUIBWTIRcgFCAakyEbIBQgGSASk5QhHiAUIBYgEpOUIRQMAgsgGkMAAAAAXARAIBogFZMhFyAaIBSTIRsgGiAZIBaTlCEeIBogEiAWk5QhFCAWIRIMAgsgFUMAAAAAWw0CIBUgGpMhFyAVIBSTIRsgFSASIBmTlCEUIBUgFiAZk5QLIR4gGSESCwJAAn0gBwRAIB8gIJMhFSAfICGTIRogHyATIBiTlCEdIB8gHCAYk5QMAQsgJkMAAAAAXgRAICAgH5MhFSAgICGTIRogICAYIByTlCEWICAgEyAck5QhHSAcIRMMAgsgICAflEMAAAAAXkUgIUMAAAAAW3FFBEAgISAfkyEVICEgIJMhGiAhIBggE5OUIRYgISAcIBOTlCEdDAILICBDAAAAAFwEQCAgIB+TIRUgICAhkyEaICAgGCAck5QhFiAgIBMgHJOUIR0gHCETDAILIB9DAAAAAFsNBCAfICCTIRUgHyAhkyEaIB8gEyAYk5QhHSAfIBwgGJOUCyEWIBghEwsgFCAXlCAaIBWUIhmUIBIgGyAXlCIUIBmUIhiUIheSIhIgHiAblCAZlCAXkiIZIBIgGV4iBBsgFCAWlCAalCATIBiUIhqSIhMgFCAdlCAVlCAakiIUIBMgFF0iAxtdQX9zIBQgEyADGyAZIBIgBBtdRXEMAwsgCkEEaiAOIA0gDCAEIAYgBRB+DAILIAAgAxDWAwwCCyAKQQRqIA4gDSAMIAQgBiAFEH4LRQ0AIAAoAowCIQUgACgCFCIEIAAoAhBGBEAgEBDjAyAAKAIUIQQLIAAgBEEBajYCFCAAKAIYIgMgBEECdGogBTYCACAAKAIUIgQgACgCEEYEQCAQEOMDIAAoAhghAyAAKAIUIQQLIAAgBEEBajYCFCADIARBAnRqIAk2AgAgACAAKAIEQQRyNgIECyAAKAIEIgRBBXFBBUYNAwJAIAEoAhwiBUEBcQRAIAAgBUEBdiIHNgKMAiAAKAIgIgEoAgggASgCECAHbGohBgJAIAEtABhFBEBBgLMBIAEoAgwiAyABKAIUIgEgBigCAGxqIgkrAwC2IhU4AgBBgLMBIQVBhLMBIAkrAwi2Ihc4AgBBiLMBIAkrAxC2IhI4AgBBjLMBIAMgASAGKAIEbGoiCSsDALY4AgBBkLMBIAkrAwi2OAIAQZSzASAJKwMQtjgCAEGYswEgAyABIAYoAghsaiIBKwMAtjgCAEGcswEgASsDCLY4AgBBoLMBIAErAxC2OAIAQZizASEBQYyzASEDDAELIAEoAgwiBSABKAIUIgkgBigCCGxqIQEgBSAGKAIEIAlsaiEDIAUgCSAGKAIAbGoiBSoCCCESIAUqAgQhFyAFKgIAIRULIAAgEiAAKgJwIhOUIBcgACoCZCIZlCAVIAAqAlgiFJQgACoCoAEiFZKSkiIjOALoASAAIBIgACoCdCIalCAXIAAqAmgiGJQgBSoCACIeIAAqAlwiF5QgACoCpAEiG5KSkiIoOALsASAAIBIgACoCeCIWlCAFKgIEIAAqAmwiEpQgHiAAKgJgIhyUIAAqAqgBIh6SkpIiKTgC8AEgACATIAMqAggiHZQgGSADKgIEIieUIBUgFCADKgIAlJKSkiIrOAL0ASAAIB0gGpQgJyAYlCAbIBcgAyoCACInlJKSkiIhOAL4ASAAIB0gFpQgEiADKgIElCAeICcgHJSSkpIiJzgC/AEgACATIAEqAggiHZQgGSABKgIEIhOUIBUgFCABKgIAlJKSkiIUOAKAAiAAIB0gGpQgEyAYlCAbIBcgASoCACITlJKSkiIVOAKEAiAAIB0gFpQgEiABKgIElCAeIBMgHJSSkpIiGjgCiAIgAigCGCEDIAgEQCAAKAIkIgEoAgggA0EBdiIJIAEoAhBsaiEDAkAgAS0AGEUEQEGAswEgASgCDCIIIAEoAhQiBSADKAIAbGoiBisDALYiGDgCAEGAswEhAUGEswEgBisDCLYiFzgCAEGIswEgBisDELYiGzgCAEGMswEgCCAFIAMoAgRsaiIGKwMAtiIcOAIAQZCzASAGKwMItiIeOAIAQZSzASAGKwMQtiIdOAIAQZizASAIIAUgAygCCGxqIgMrAwC2IiY4AgBBnLMBIAMrAwi2Ih84AgBBoLMBIAMrAxC2IiA4AgBBmLMBIQhBjLMBIQUMAQsgASgCDCIGIAEoAhQiASADKAIIbGoiCCoCCCEgIAgqAgQhHyAIKgIAISYgBiADKAIEIAFsaiIFKgIIIR0gBSoCBCEeIAUqAgAhHCAGIAEgAygCAGxqIgEqAgghGyABKgIEIRcgASoCACEYCyAAIAAoAixBAWo2AiwgCiArICOTIhMgFSAokyIZlCAUICOTIhYgISAokyIilJMiEjgCDCAKICcgKZMiKiAWlCAaICmTIhYgE5STIhM4AgggCiAiIBaUIBkgKpSTIhk4AgRDAAAAACAZjCIsICOUICggE5STIBIgKZSTIhYgEiAblCAZIBiUIBcgE5SSkpIiIiAii0O9N4Y1XRsiIkMAAAAAIBYgEiAglCAZICaUIB8gE5SSkpIiKiAqi0O9N4Y1XRsiJZQhKiAiQwAAAAAgFiASIB2UIBkgHJQgHiATlJKSkiIWIBaLQ703hjVdGyIklCItQwAAAABeICpDAAAAAF5xDQVDAAAAACAeIBeTIh4gICAbkyIglCAfIBeTIh8gHSAbkyIdlJMiFowgGJQgFyAdICYgGJMiJpQgICAcIBiTIhyUkyIYlJMgHCAflCAmIB6UkyIXIBuUkyIbIBcgKZQgFiAjlCAYICiUkpKSIhwgHItDvTeGNV0bIhxDAAAAACAbIBcgGpQgFiAUlCAYIBWUkpKSIhQgFItDvTeGNV0bIhSUIRpDAAAAACAbIBcgJ5QgFiArlCAYICGUkpKSIhUgFYtDvTeGNV0bIhUgHJQiG0MAAAAAXiAaQwAAAABecQ0FIAhBAiASIBaUIBcgLJSSiyIeIBMgF5QgGCASjJSSiyISXiIDIBkgGJQgFiATjJSSiyAeIBIgAxteG0ECdCIDaioCACEYIAMgBWoqAgAhHiABIANqKgIAIRMgAyAMaioCACEZIAMgDWoqAgAhFiADIA5qKgIAIRICQAJAAn0gG0MAAAAAXgRAIBQgFZMhGiAUIByTIRcgFCAWIBmTlCEdIBQgEiAZk5QMAQsgGkMAAAAAXgRAIBUgFJMhGiAVIByTIRcgFSAZIBaTlCEdIBUgEiAWk5QhFCAWIRIMAgsgFSAUlEMAAAAAXkUgHEMAAAAAW3FFBEAgHCAUkyEaIBwgFZMhFyAcIBkgEpOUIR0gHCAWIBKTlCEUDAILIBVDAAAAAFwEQCAVIBSTIRogFSAckyEXIBUgGSAWk5QhHSAVIBIgFpOUIRQgFiESDAILIBRDAAAAAFsNAiAUIBWTIRogFCAckyEXIBQgFiAZk5QhHSAUIBIgGZOUCyEUIBkhEgsCQAJ9IC1DAAAAAF4EQCAlICSTIRUgJSAikyEbICUgEyAYk5QhHCAlIB4gGJOUDAELICpDAAAAAF4EQCAkICWTIRUgJCAikyEbICQgGCAek5QhFiAkIBMgHpOUIRwgHiETDAILICQgJZRDAAAAAF5FICJDAAAAAFtxRQRAICIgJZMhFSAiICSTIRsgIiAYIBOTlCEWICIgHiATk5QhHAwCCyAkQwAAAABcBEAgJCAlkyEVICQgIpMhGyAkIBggHpOUIRYgJCATIB6TlCEcIB4hEwwCCyAlQwAAAABbDQUgJSAkkyEVICUgIpMhGyAlIBMgGJOUIRwgJSAeIBiTlAshFiAYIRMLIBQgGpQgGyAVlCIZlCASIBcgGpQiFCAZlCIalCIYkiISIB0gF5QgGZQgGJIiGSASIBleIgEbIBQgFpQgG5QgEyAalCIakiITIBQgHJQgFZQgGpIiFCATIBRdIgMbXUF/cyAUIBMgAxsgGSASIAEbXUVxDAULIApBBGogDiANIAwgASAFIAgQfgwECyAAIAMQ1gMgACgCBCEEDAQLAkAgCARAIAAgAigCGEEBdiIDNgKMAiAAKAIkIgQoAgggBCgCECADbGohBgJAIAQtABhFBEBBgLMBIAQoAgwiAyAEKAIUIgQgBigCAGxqIgcrAwC2IhU4AgBBgLMBIQhBhLMBIAcrAwi2Ihc4AgBBiLMBIAcrAxC2IhI4AgBBjLMBIAMgBCAGKAIEbGoiBysDALY4AgBBkLMBIAcrAwi2OAIAQZSzASAHKwMQtjgCAEGYswEgAyAEIAYoAghsaiIEKwMAtjgCAEGcswEgBCsDCLY4AgBBoLMBIAQrAxC2OAIAQZizASEEQYyzASEDDAELIAQoAgwiCCAEKAIUIgcgBigCCGxqIQQgCCAGKAIEIAdsaiEDIAggByAGKAIAbGoiCCoCCCESIAgqAgQhFyAIKgIAIRULIAAgEiAAKgKUASITlCAXIAAqAogBIhmUIBUgACoCfCIUlCAAKgKsASIVkpKSOALoASAAIBIgACoCmAEiGpQgFyAAKgKMASIYlCAIKgIAIh4gACoCgAEiF5QgACoCsAEiG5KSkjgC7AEgACASIAAqApwBIhaUIAgqAgQgACoCkAEiEpQgHiAAKgKEASIclCAAKgK0ASIekpKSOALwASAAIBMgAyoCCCIdlCAZIAMqAgQiI5QgFSAUIAMqAgCUkpKSOAL0ASAAIB0gGpQgIyAYlCAbIBcgAyoCACIjlJKSkjgC+AEgACAdIBaUIBIgAyoCBJQgHiAjIByUkpKSOAL8ASAAIBMgBCoCCCIdlCAZIAQqAgQiE5QgFSAUIAQqAgCUkpKSOAKAAiAAIB0gGpQgEyAYlCAbIBcgBCoCACITlJKSkjgChAIgACAdIBaUIBIgBCoCBJQgHiATIByUkpKSOAKIAiAAIAUQ1wMMAQsgACAFIAIoAhgQ1AMLIAAoAgRBBXFBBUYNBCALBEAgACACKAIcQQF2IgQ2AowCIAAoAiQiAigCCCACKAIQIARsaiEIAkAgAi0AGEUEQEGAswEgAigCDCIEIAIoAhQiAiAIKAIAbGoiCysDALYiFTgCAEGAswEhA0GEswEgCysDCLYiFzgCAEGIswEgCysDELYiEjgCAEGMswEgBCACIAgoAgRsaiILKwMAtjgCAEGQswEgCysDCLY4AgBBlLMBIAsrAxC2OAIAQZizASAEIAIgCCgCCGxqIgIrAwC2OAIAQZyzASACKwMItjgCAEGgswEgAisDELY4AgBBmLMBIQJBjLMBIQQMAQsgAigCDCIDIAIoAhQiCyAIKAIIbGohAiADIAgoAgQgC2xqIQQgAyALIAgoAgBsaiIDKgIIIRIgAyoCBCEXIAMqAgAhFQsgACASIAAqApQBIhOUIBcgACoCiAEiGZQgFSAAKgJ8IhSUIAAqAqwBIhWSkpI4AugBIAAgEiAAKgKYASIalCAXIAAqAowBIhiUIAMqAgAiHiAAKgKAASIXlCAAKgKwASIbkpKSOALsASAAIBIgACoCnAEiFpQgAyoCBCAAKgKQASISlCAeIAAqAoQBIhyUIAAqArQBIh6SkpI4AvABIAAgEyAEKgIIIh2UIBkgBCoCBCIjlCAVIBQgBCoCAJSSkpI4AvQBIAAgHSAalCAjIBiUIBsgFyAEKgIAIiOUkpKSOAL4ASAAIB0gFpQgEiAEKgIElCAeICMgHJSSkpI4AvwBIAAgEyACKgIIIh2UIBkgAioCBCITlCAVIBQgAioCAJSSkpI4AoACIAAgHSAalCATIBiUIBsgFyACKgIAIhOUkpKSOAKEAiAAIB0gFpQgEiACKgIElCAeIBMgHJSSkpI4AogCIAAgASgCHBDXAwwFCyACKAIcIQIgASgCHCEBDAELCyAKQQRqIA4gDSAMIAEgBSAIEH4LRQ0AIAAoAhQiASAAKAIQRgRAIBAQ4wMgACgCFCEBCyAAIAFBAWo2AhQgACgCGCIEIAFBAnRqIAc2AgAgACgCFCIBIAAoAhBGBEAgEBDjAyAAKAIYIQQgACgCFCEBCyAAIAFBAWo2AhQgBCABQQJ0aiAJNgIAIAAgACgCBEEEciIENgIECyAEQQVxQQVGDQAgAigCHCEBAn8CQCALBEAgACgCJCICKAIIIAFBAXYiCyACKAIQbGohAQJAIAItABhFBEBBgLMBIAIoAgwiBCACKAIUIgMgASgCAGxqIggrAwC2Ihg4AgBBgLMBIQJBhLMBIAgrAwi2Ihc4AgBBiLMBIAgrAxC2Ihs4AgBBjLMBIAQgAyABKAIEbGoiCCsDALYiHTgCAEGQswEgCCsDCLYiIzgCAEGUswEgCCsDELYiKDgCAEGYswEgBCADIAEoAghsaiIBKwMAtiIpOAIAQZyzASABKwMItiInOAIAQaCzASABKwMQtiIrOAIAQZizASEEQYyzASEDDAELIAIoAgwiCCACKAIUIgIgASgCCGxqIgQqAgghKyAEKgIEIScgBCoCACEpIAggASgCBCACbGoiAyoCCCEoIAMqAgQhIyADKgIAIR0gCCACIAEoAgBsaiICKgIIIRsgAioCBCEXIAIqAgAhGAsgACAAKAIsQQFqNgIsIAAqAvwBIRwgACoC8AEhFCAAKgKIAiEeIAogACoC9AEiIiAAKgLoASIVkyITIAAqAoQCIiogACoC7AEiGpMiGZQgACoCgAIiJSAVkyIWIAAqAvgBIiQgGpMiIZSTIhI4AgwgCiAcIBSTIiYgFpQgHiAUkyIWIBOUkyITOAIIIAogISAWlCAZICaUkyIZOAIEQwAAAAAgFSAZjCIslCAaIBOUkyASIBSUkyIWIBIgG5QgGSAYlCAXIBOUkpKSIiEgIYtDvTeGNV0bIiFDAAAAACAWIBIgK5QgGSAplCAnIBOUkpKSIiYgJotDvTeGNV0bIh+UISYgIUMAAAAAIBYgEiAolCAZIB2UICMgE5SSkpIiFiAWi0O9N4Y1XRsiIJQiLUMAAAAAXiAmQwAAAABecQ0DQwAAAAAgIyAXkyIjICsgG5MiK5QgJyAXkyInICggG5MiKJSTIhaMIBiUIBcgKCApIBiTIimUICsgHSAYkyIdlJMiGJSTIB0gJ5QgKSAjlJMiFyAblJMiGyAXIBSUIBYgFZQgGCAalJKSkiIUIBSLQ703hjVdGyIUQwAAAAAgGyAXIB6UIBYgJZQgGCAqlJKSkiIVIBWLQ703hjVdGyIVlCEeQwAAAAAgGyAXIByUIBYgIpQgGCAklJKSkiIaIBqLQ703hjVdGyIaIBSUIhtDAAAAAF4gHkMAAAAAXnENAyAEQQIgEiAWlCAXICyUkosiHCATIBeUIBggEoyUkosiEl4iASAZIBiUIBYgE4yUkosgHCASIAEbXhtBAnQiAWoqAgAhGCABIANqKgIAIRwgASACaioCACETIAEgDGoqAgAhGSABIA1qKgIAIRYgASAOaioCACESAkACQAJ9IBtDAAAAAF4EQCAVIBqTIRcgFSAUkyEbIBUgEiAZk5QhFCAVIBYgGZOUDAELIB5DAAAAAF4EQCAaIBWTIRcgGiAUkyEbIBogGSAWk5QhHiAaIBIgFpOUIRQgFiESDAILIBogFZRDAAAAAF5FIBRDAAAAAFtxRQRAIBQgFZMhFyAUIBqTIRsgFCAZIBKTlCEeIBQgFiASk5QhFAwCCyAaQwAAAABcBEAgGiAVkyEXIBogFJMhGyAaIBkgFpOUIR4gGiASIBaTlCEUIBYhEgwCCyAVQwAAAABbDQIgFSAakyEXIBUgFJMhGyAVIBIgGZOUIRQgFSAWIBmTlAshHiAZIRILAkACfSAtQwAAAABeBEAgHyAgkyEVIB8gIZMhGiAfIBMgGJOUIR0gHyAcIBiTlAwBCyAmQwAAAABeBEAgICAfkyEVICAgIZMhGiAgIBggHJOUIRYgICATIByTlCEdIBwhEwwCCyAgIB+UQwAAAABeRSAhQwAAAABbcUUEQCAhIB+TIRUgISAgkyEaICEgGCATk5QhFiAhIBwgE5OUIR0MAgsgIEMAAAAAXARAICAgH5MhFSAgICGTIRogICAYIByTlCEWICAgEyAck5QhHSAcIRMMAgsgH0MAAAAAWw0EIB8gIJMhFSAfICGTIRogHyATIBiTlCEdIB8gHCAYk5QLIRYgGCETCyAUIBeUIBogFZQiGZQgEiAbIBeUIhQgGZQiGJQiF5IiEiAeIBuUIBmUIBeSIhkgEiAZXiICGyAUIBaUIBqUIBMgGJQiGpIiEyAUIB2UIBWUIBqSIhQgEyAUXSIBG11Bf3MgFCATIAEbIBkgEiACG11FcQwDCyAKQQRqIA4gDSAMIAIgAyAEEH4MAgsgACABENYDDAILIApBBGogDiANIAwgAiADIAQQfgtFDQAgACgCjAIhBCAAKAIUIgIgACgCEEYEQCAQEOMDIAAoAhQhAgsgACACQQFqNgIUIAAoAhgiASACQQJ0aiAENgIAIAAoAhQiAiAAKAIQRgRAIBAQ4wMgACgCFCECIAAoAhghAQsgACACQQFqNgIUIAEgAkECdGogCzYCACAAIAAoAgRBBHI2AgQLIApBEGokAAv1DQIGfxx9IwBBMGsiByQAIAAgACgCKCIIQQFqNgIoAkAgBSoCCCIRIAAqAkwiF5QgBSoCBCINIABBQGsqAgAiGJQgBSoCACIOIAAqAjQiGZQgAyoCACISkpKSvCAAKgKUASIfIAYqAggiD5QgACoCfCIgIAYqAgAiEJQgACoCiAEiISAGKgIEIhSUkpIgACoCrAGSIAQqAgCTIhW8Qf////8HcUkNACARIAAqAlAiGpQgDSAAKgJEIhuUIA4gACoCOCIclCADKgIEIhOSkpK8IAAqArABIAAqApgBIiIgD5QgACoCgAEiIyAQlCAUIAAqAowBIiSUkpKSIAQqAgSTIha8Qf////8HcUkNACAAKgK0ASAAKgKcASIlIA+UIAAqAoQBIiYgEJQgFCAAKgKQASInlJKSkiAEKgIIkyIQvEH/////B3EgESAAKgJUIh2UIA0gACoCSCIelCAOIAAqAjwiFJQgAyoCCCIPkpKSvEsNACAOIA8gFJQgEiAZlCATIByUkpKSvCAQICaUIBUgIJQgIyAWlJKSvEH/////B3FJDQAgDSAPIB6UIBIgGJQgEyAblJKSkrwgECAnlCAVICGUICQgFpSSkrxB/////wdxSQ0AIBEgDyAdlCASIBeUIBMgGpSSkpK8IBAgJZQgFSAflCAiIBaUkpK8Qf////8HcUkNACAALQCQAkEBIAgbBEAgESAYlCANIBeUIBMgFJQgHCAPlJKSkrwgECAjlCAmIBaUk7xB/////wdxSQ0BIBEgGZQgDiAXlCATIB6UIBsgD5SSkpK8IBAgJJQgJyAWjCIolJK8Qf////8HcUkNASANIBmUIA4gGJQgEyAdlCAaIA+UkpKSvCAQICKUICUgKJSSvEH/////B3FJDQEgESAblCANIBqUIBIgFJQgGSAPlJKSkrwgFSAmlCAgIBCUk7xB/////wdxSQ0BIBEgHJQgDiAalCASIB6UIBggD5SSkpK8IBUgJ5QgISAQjCIQlJK8Qf////8HcUkNASANIByUIA4gG5QgEiAdlCAXIA+UkpKSvCAVICWUIB8gEJSSvEH/////B3FJDQEgESAelCANIB2UIBIgHJQgGSATlJKSkrwgFiAglCAjIBWUk7xB/////wdxSQ0BIBEgFJQgDiAdlCASIBuUIBggE5SSkpK8IBYgIZQgJCAVjCIPlJK8Qf////8HcUkNASANIBSUIA4gHpQgEiAalCAXIBOUkpKSvCAWIB+UICIgD5SSvEH/////B3FJDQELIAIoAgwiCEEBcSELAkAgASgCDCIJQQFxBEAgC0UNASAAIAlBAXYgCEEBdhDRAwwCCyALRQRAIAEvAQoiCyABLwEIIgogAS8BBiIMIAogDEsbIgogCiALSRsgAi8BCiILIAIvAQgiCiACLwEGIgwgCiAMSxsiCiAKIAtJG00NAQsgACoCvAEhDiAJLgESIQQgACoCwAEhDSAJLgEUIQMgByAAKgK4ASAJLgEQspQ4AiQgByANIAOylDgCLCAHIA4gBLKUOAIoIAkvARYhBCAAKgLIASEOIAkvARghAyAAKgLEASENIAcgACoCzAEgCS8BGrOUOAIgIAcgDiADs5Q4AhwgByANIASzlDgCGCAAIAlBEGogAiAHQRhqIAdBJGogBSAGENUDIAAoAgRBBXFBBUYNASAAKgK4ASEOIAEoAgwiBC4BACEDIAAqArwBIQ0gBC4BAiEBIAcgACoCwAEgBC4BBLKUOAIUIAcgDSABspQ4AhAgByAOIAOylDgCDCAELwEIIQMgACoCxAEhDiAELwEGIQEgACoCyAEhDSAHIAAqAswBIAQvAQqzlDgCCCAHIA0gA7OUOAIEIAcgDiABs5Q4AgAgACAEIAIgByAHQQxqIAUgBhDVAwwBCyAAKgLUASEOIAguARIhBiAAKgLYASENIAguARQhBSAHIAAqAtABIAguARCylDgCJCAHIA0gBbKUOAIsIAcgDiAGspQ4AiggCC8BFiEGIAAqAuABIQ4gCC8BGCEFIAAqAtwBIQ0gByAAKgLkASAILwEas5Q4AiAgByAOIAWzlDgCHCAHIA0gBrOUOAIYIAAgASAIQRBqIAMgBCAHQRhqIAdBJGoQ1QMgACgCBEEFcUEFRg0AIAAqAtABIQ4gAigCDCIGLgEAIQUgACoC1AEhDSAGLgECIQIgByAAKgLYASAGLgEEspQ4AhQgByANIAKylDgCECAHIA4gBbKUOAIMIAYvAQghBSAAKgLcASEOIAYvAQYhAiAAKgLgASENIAcgACoC5AEgBi8BCrOUOAIIIAcgDSAFs5Q4AgQgByAOIAKzlDgCACAAIAEgBiADIAQgByAHQQxqENUDCyAHQTBqJAAL9iUCIn0MfyMAQRBrIikkACAAQRBqIS0gAEGAAmohKiAAQfQBaiErIABB6AFqISwCQANAIAAgACgCMEEBajYCMCABKgIMIgsgACoC6AEiGCABKgIAIgWTIgcgACoCgAIiHCAFkyIJIAcgCV0bIAAqAvQBIiAgBZMiAyAJIAMgCV0bIAMgB14bXQ0BIAuMIhcgByAJIAcgCV4bIAMgCSADIAleGyADIAddG14NASABKgIQIgwgACoC7AEiGSABKgIEIgKTIgYgACoChAIiHiACkyIFIAUgBl4bIAAqAvgBIiEgApMiCiAFIAUgCl4bIAYgCl0bXQ0BIAyMIhsgBiAFIAUgBl0bIAogBSAFIApdGyAGIApeG14NASABKgIUIg8gACoC8AEiGiABKgIIIgiTIgQgACoCiAIiHyAIkyICIAIgBF4bIAAqAvwBIiIgCJMiCCACIAIgCF4bIAQgCF0bXQ0BIA+MIh0gBCACIAIgBF0bIAggAiACIAhdGyAEIAheG14NASAKIAaTIhAgAiAIkyINlCAFIAqTIhEgCCAEkyIOlJMiEowgB5QgBiAOIAkgA5MiE5QgDSADIAeTIhWUkyIWlJMgFSARlCATIBCUkyIUIASUkyIjIBQgHSAPIBRDAAAAAF4iJBuUIBIgFyALIBJDAAAAAF4iJRuUIBYgGyAMIBZDAAAAAF4iJhuUkpKSQwAAAABeDQEgIyAUIA8gHSAkG5QgEiALIBcgJRuUIBYgDCAbICYblJKSkkMAAAAAYEUNASAALQCRAgRAIA6LIhcgDJQgEIsiGyAPlJIiFCAOIAWUIAIgEIwiFpSSIhIgDiAGlCAEIBaUkiIWIBIgFl0iJBtdDQIgFIwgFiASICQbXg0CIBcgC5QgFYsiFCAPlJIiFiAVIAKUIAkgDowiEpSSIg4gFSAElCAHIBKUkiISIA4gEl0iJBtdDQIgFowgEiAOICQbXg0CIBAgCZQgBSAVjCIVlJIiDiAQIAOUIAogFZSSIhAgDiAQXSIkGyAbIAuUIBQgDJSSIhVeDQIgFYwgECAOICQbXg0CIA2LIhIgDJQgEYsiFiAPlJIiFSANIAWUIAIgEZSTIg4gDSAGlCAEIBGUkyIQIA4gEF0iJBtdDQIgFYwgECAOICQbXg0CIBIgC5QgE4siECAPlJIiDiATIAKUIAkgDZSTIgIgEyAElCAHIA2UkyINIAIgDV0iJBtdDQIgDowgDSACICQbXg0CIBEgA5QgCiATlJMiAiARIAeUIAYgE5STIg0gAiANXSIkGyAWIAuUIBAgDJSSIhFeDQIgEYwgDSACICQbXg0CIBogH5MiAiAKlCAIIBkgHpMiDZSTIhEgAiAGlCAEIA2UkyIGIAYgEV4iJBsgAosiDiAMlCANiyIQIA+UkiITXg0CIBOMIAYgESAkG14NAiAYIByTIgYgCJQgAyAClJMiCCAGIASUIAcgApSTIgIgAiAIXiIkGyAOIAuUIAaLIgcgD5SSIgReDQIgBIwgAiAIICQbXg0CIBAgC5QgByAMlJIiAiANIAmUIAUgBpSTIgkgDSADlCAKIAaUkyIFIAUgCV4iJBtdDQIgAowgBSAJICQbXg0CCwJAAn8CQCABKAIYIiVBAXEEQCAAKAIkIiQoAgggJUEBdiIuICQoAhBsaiElAkAgJC0AGEUEQEGAswEgJCgCDCImICQoAhQiJyAlKAIAbGoiKCsDALYiBDgCAEGAswEhJEGEswEgKCsDCLYiBzgCAEGIswEgKCsDELYiAzgCAEGMswEgJiAnICUoAgRsaiIoKwMAtiIKOAIAQZCzASAoKwMItiIIOAIAQZSzASAoKwMQtiILOAIAQZizASAmICcgJSgCCGxqIiUrAwC2Igw4AgBBnLMBICUrAwi2Ig84AgBBoLMBICUrAxC2Ig04AgBBmLMBISZBjLMBIScMAQsgJCgCDCIoICQoAhQiJCAlKAIIbGoiJioCCCENICYqAgQhDyAmKgIAIQwgKCAlKAIEICRsaiInKgIIIQsgJyoCBCEIICcqAgAhCiAoICQgJSgCAGxqIiQqAgghAyAkKgIEIQcgJCoCACEECyAAIAAoAixBAWo2AiwgKSAgIBiTIgUgHiAZkyIClCAcIBiTIgYgISAZkyIRlJMiCTgCDCApICIgGpMiEyAGlCAfIBqTIgYgBZSTIgU4AgggKSARIAaUIAIgE5STIgI4AgRDAAAAACACjCIVIBiUIBkgBZSTIAkgGpSTIgYgCSADlCACIASUIAcgBZSSkpIiESARi0O9N4Y1XRsiEUMAAAAAIAYgCSANlCACIAyUIA8gBZSSkpIiEyATi0O9N4Y1XRsiDpQhEyARQwAAAAAgBiAJIAuUIAIgCpQgCCAFlJKSkiIGIAaLQ703hjVdGyIQlEMAAAAAXiIoIBNDAAAAAF5xDQNDAAAAACAIIAeTIgggDSADkyINlCAPIAeTIg8gCyADkyILlJMiBowgBJQgByALIAwgBJMiDJQgDSAKIASTIgqUkyIElJMgCiAPlCAMIAiUkyIHIAOUkyIDIAcgGpQgBiAYlCAEIBmUkpKSIgogCotDvTeGNV0bIgpDAAAAACADIAcgH5QgBiAclCAEIB6UkpKSIgggCItDvTeGNV0bIgiUIQtDAAAAACADIAcgIpQgBiAglCAEICGUkpKSIgMgA4tDvTeGNV0bIgMgCpRDAAAAAF4iLyALQwAAAABecQ0DICZBAiAJIAaUIAcgFZSSiyIMIAUgB5QgBCAJjJSSiyIJXiIlIAIgBJQgBiAFjJSSiyAMIAkgJRteG0ECdCIlaioCACEEICUgJ2oqAgAhDyAkICVqKgIAIQUgJSAqaioCACECICUgK2oqAgAhDCAlICxqKgIAIQkCQAJAAn0gLwRAIAggA5MhByAIIAqTIQYgCCAMIAKTlCELIAggCSACk5QMAQsgC0MAAAAAXgRAIAMgCJMhByADIAqTIQYgAyACIAyTlCELIAMgCSAMk5QhCCAMIQkMAgsgAyAIlEMAAAAAXkUgCkMAAAAAW3FFBEAgCiAIkyEHIAogA5MhBiAKIAIgCZOUIQsgCiAMIAmTlCEIDAILIANDAAAAAFwEQCADIAiTIQcgAyAKkyEGIAMgAiAMk5QhCyADIAkgDJOUIQggDCEJDAILIAhDAAAAAFsNAiAIIAOTIQcgCCAKkyEGIAggDCACk5QhCyAIIAkgApOUCyEIIAIhCQsCQAJ9ICgEQCAOIBCTIQMgDiARkyEKIA4gBSAEk5QhDSAOIA8gBJOUDAELIBNDAAAAAF4EQCAQIA6TIQMgECARkyEKIBAgBCAPk5QhDCAQIAUgD5OUIQ0gDyEFDAILIBAgDpRDAAAAAF5FIBFDAAAAAFtxRQRAIBEgDpMhAyARIBCTIQogESAEIAWTlCEMIBEgDyAFk5QhDQwCCyAQQwAAAABcBEAgECAOkyEDIBAgEZMhCiAQIAQgD5OUIQwgECAFIA+TlCENIA8hBQwCCyAOQwAAAABbDQQgDiAQkyEDIA4gEZMhCiAOIAUgBJOUIQ0gDiAPIASTlAshDCAEIQULIAggB5QgCiADlCIClCAJIAYgB5QiBCAClCIHlCIIkiIJIAsgBpQgApQgCJIiAiACIAldIiQbIAQgDJQgCpQgBSAHlCIHkiIFIAQgDZQgA5QgB5IiBCAEIAVeIiUbXUF/cyAEIAUgJRsgAiAJICQbXUVxDAMLIClBBGogLCArICogJCAnICYQfgwCCyAAICUQ1gMMAgsgKUEEaiAsICsgKiAkICcgJhB+C0UNACAAKAKMAiEmIAAoAhQiJCAAKAIQRgRAIC0Q4wMgACgCFCEkCyAAICRBAWo2AhQgACgCGCIlICRBAnRqICY2AgAgACgCFCIkIAAoAhBGBEAgLRDjAyAAKAIUISQgACgCGCElCyAAICRBAWo2AhQgJSAkQQJ0aiAuNgIAIAAgACgCBEEEcjYCBAsgACgCBEEFcUEFRg0BIAEoAhwiAUEBcUUNAAsgACgCJCIkKAIIIAFBAXYiKCAkKAIQbGohAQJAICQtABhFBEBBgLMBICQoAgwiJSAkKAIUIiYgASgCAGxqIicrAwC2IgY4AgBBgLMBISRBhLMBICcrAwi2Igo4AgBBiLMBICcrAxC2Igg4AgBBjLMBICUgJiABKAIEbGoiJysDALYiDTgCAEGQswEgJysDCLYiETgCAEGUswEgJysDELYiEzgCAEGYswEgJSAmIAEoAghsaiIBKwMAtiIOOAIAQZyzASABKwMItiIQOAIAQaCzASABKwMQtiIVOAIAQZizASElQYyzASEmDAELICQoAgwiJyAkKAIUIiQgASgCCGxqIiUqAgghFSAlKgIEIRAgJSoCACEOICcgASgCBCAkbGoiJioCCCETICYqAgQhESAmKgIAIQ0gJyAkIAEoAgBsaiIkKgIIIQggJCoCBCEKICQqAgAhBgsgACAAKAIsQQFqNgIsIAAqAvwBIQwgACoC8AEhBCAAKgKIAiEPICkgACoC9AEiGyAAKgLoASIHkyIFIAAqAoQCIhggACoC7AEiA5MiApQgACoCgAIiGSAHkyILIAAqAvgBIh0gA5MiEpSTIgk4AgwgKSAMIASTIhYgC5QgDyAEkyILIAWUkyIFOAIIICkgEiALlCACIBaUkyICOAIEQwAAAAAgByACjCIalCADIAWUkyAJIASUkyILIAkgCJQgAiAGlCAKIAWUkpKSIhIgEotDvTeGNV0bIhJDAAAAACALIAkgFZQgAiAOlCAQIAWUkpKSIhYgFotDvTeGNV0bIhSUIRYgEkMAAAAAIAsgCSATlCACIA2UIBEgBZSSkpIiCyALi0O9N4Y1XRsiF5QiHEMAAAAAXiAWQwAAAABecQ0AQwAAAAAgESAKkyIRIBUgCJMiFZQgECAKkyIQIBMgCJMiE5STIguMIAaUIAogEyAOIAaTIg6UIBUgDSAGkyINlJMiBpSTIA0gEJQgDiARlJMiCiAIlJMiCCAKIASUIAsgB5QgBiADlJKSkiIEIASLQ703hjVdGyIEQwAAAAAgCCAKIA+UIAsgGZQgBiAYlJKSkiIHIAeLQ703hjVdGyIHlCEPQwAAAAAgCCAKIAyUIAsgG5QgBiAdlJKSkiIDIAOLQ703hjVdGyIDIASUIghDAAAAAF4gD0MAAAAAXnENACAlQQIgCSALlCAKIBqUkosiDCAFIAqUIAYgCYyUkosiCV4iASACIAaUIAsgBYyUkosgDCAJIAEbXhtBAnQiAWoqAgAhBiABICZqKgIAIQwgASAkaioCACEFIAEgKmoqAgAhAiABICtqKgIAIQsgASAsaioCACEJAn8CQAJAAkACfSAIQwAAAABeBEAgByADkyEKIAcgBJMhCCAHIAkgApOUIQQgByALIAKTlAwBCyAPQwAAAABeBEAgAyAHkyEKIAMgBJMhCCADIAIgC5OUIQ8gAyAJIAuTlCEEIAshCQwCCyADIAeUQwAAAABeRSAEQwAAAABbcUUEQCAEIAeTIQogBCADkyEIIAQgAiAJk5QhDyAEIAsgCZOUIQQMAgsgA0MAAAAAXARAIAMgB5MhCiADIASTIQggAyACIAuTlCEPIAMgCSALk5QhBCALIQkMAgsgB0MAAAAAWw0CIAcgA5MhCiAHIASTIQggByAJIAKTlCEEIAcgCyACk5QLIQ8gAiEJCwJAAn0gHEMAAAAAXgRAIBQgF5MhByAUIBKTIQMgFCAFIAaTlCENIBQgDCAGk5QMAQsgFkMAAAAAXgRAIBcgFJMhByAXIBKTIQMgFyAGIAyTlCELIBcgBSAMk5QhDSAMIQUMAgsgFyAUlEMAAAAAXkUgEkMAAAAAW3FFBEAgEiAUkyEHIBIgF5MhAyASIAYgBZOUIQsgEiAMIAWTlCENDAILIBdDAAAAAFwEQCAXIBSTIQcgFyASkyEDIBcgBiAMk5QhCyAXIAUgDJOUIQ0gDCEFDAILIBRDAAAAAFsNAyAUIBeTIQcgFCASkyEDIBQgBSAGk5QhDSAUIAwgBpOUCyELIAYhBQsgBCAKlCADIAeUIgKUIAkgCCAKlCIEIAKUIgaUIgqSIgkgDyAIlCAClCAKkiICIAIgCV0iARsgBCALlCADlCAFIAaUIgOSIgUgBCANlCAHlCADkiIEIAQgBV4iJBtdQX9zIAQgBSAkGyACIAkgARtdRXEMAgsgKUEEaiAsICsgKiAkICYgJRB+DAELIClBBGogLCArICogJCAmICUQfgtFDQAgACgCjAIhJSAAKAIUIgEgACgCEEYEQCAtEOMDIAAoAhQhAQsgACABQQFqNgIUIAAoAhgiJCABQQJ0aiAlNgIAIAAoAhQiASAAKAIQRgRAIC0Q4wMgACgCGCEkIAAoAhQhAQsgACABQQFqNgIUICQgAUECdGogKDYCACAAIAAoAgRBBHI2AgQLIClBEGokAAv2JQIifQx/IwBBEGsiKSQAIABBEGohLSAAQYACaiEqIABB9AFqISsgAEHoAWohLAJAA0AgACAAKAIwQQFqNgIwIAEqAgwiCyAAKgLoASIYIAEqAgAiBZMiByAAKgKAAiIcIAWTIgkgByAJXRsgACoC9AEiICAFkyIDIAkgAyAJXRsgAyAHXhtdDQEgC4wiFyAHIAkgByAJXhsgAyAJIAMgCV4bIAMgB10bXg0BIAEqAhAiDCAAKgLsASIZIAEqAgQiApMiBiAAKgKEAiIeIAKTIgUgBSAGXhsgACoC+AEiISACkyIKIAUgBSAKXhsgBiAKXRtdDQEgDIwiGyAGIAUgBSAGXRsgCiAFIAUgCl0bIAYgCl4bXg0BIAEqAhQiDyAAKgLwASIaIAEqAggiCJMiBCAAKgKIAiIfIAiTIgIgAiAEXhsgACoC/AEiIiAIkyIIIAIgAiAIXhsgBCAIXRtdDQEgD4wiHSAEIAIgAiAEXRsgCCACIAIgCF0bIAQgCF4bXg0BIAogBpMiECACIAiTIg2UIAUgCpMiESAIIASTIg6UkyISjCAHlCAGIA4gCSADkyITlCANIAMgB5MiFZSTIhaUkyAVIBGUIBMgEJSTIhQgBJSTIiMgFCAdIA8gFEMAAAAAXiIkG5QgEiAXIAsgEkMAAAAAXiIlG5QgFiAbIAwgFkMAAAAAXiImG5SSkpJDAAAAAF4NASAjIBQgDyAdICQblCASIAsgFyAlG5QgFiAMIBsgJhuUkpKSQwAAAABgRQ0BIAAtAJECBEAgDosiFyAMlCAQiyIbIA+UkiIUIA4gBZQgAiAQjCIWlJIiEiAOIAaUIAQgFpSSIhYgEiAWXSIkG10NAiAUjCAWIBIgJBteDQIgFyALlCAViyIUIA+UkiIWIBUgApQgCSAOjCISlJIiDiAVIASUIAcgEpSSIhIgDiASXSIkG10NAiAWjCASIA4gJBteDQIgECAJlCAFIBWMIhWUkiIOIBAgA5QgCiAVlJIiECAOIBBdIiQbIBsgC5QgFCAMlJIiFV4NAiAVjCAQIA4gJBteDQIgDYsiEiAMlCARiyIWIA+UkiIVIA0gBZQgAiARlJMiDiANIAaUIAQgEZSTIhAgDiAQXSIkG10NAiAVjCAQIA4gJBteDQIgEiALlCATiyIQIA+UkiIOIBMgApQgCSANlJMiAiATIASUIAcgDZSTIg0gAiANXSIkG10NAiAOjCANIAIgJBteDQIgESADlCAKIBOUkyICIBEgB5QgBiATlJMiDSACIA1dIiQbIBYgC5QgECAMlJIiEV4NAiARjCANIAIgJBteDQIgGiAfkyICIAqUIAggGSAekyINlJMiESACIAaUIAQgDZSTIgYgBiARXiIkGyACiyIOIAyUIA2LIhAgD5SSIhNeDQIgE4wgBiARICQbXg0CIBggHJMiBiAIlCADIAKUkyIIIAYgBJQgByAClJMiAiACIAheIiQbIA4gC5QgBosiByAPlJIiBF4NAiAEjCACIAggJBteDQIgECALlCAHIAyUkiICIA0gCZQgBSAGlJMiCSANIAOUIAogBpSTIgUgBSAJXiIkG10NAiACjCAFIAkgJBteDQILAkACfwJAIAEoAhgiJUEBcQRAIAAoAiAiJCgCCCAlQQF2Ii4gJCgCEGxqISUCQCAkLQAYRQRAQYCzASAkKAIMIiYgJCgCFCInICUoAgBsaiIoKwMAtiIEOAIAQYCzASEkQYSzASAoKwMItiIHOAIAQYizASAoKwMQtiIDOAIAQYyzASAmICcgJSgCBGxqIigrAwC2Igo4AgBBkLMBICgrAwi2Igg4AgBBlLMBICgrAxC2Igs4AgBBmLMBICYgJyAlKAIIbGoiJSsDALYiDDgCAEGcswEgJSsDCLYiDzgCAEGgswEgJSsDELYiDTgCAEGYswEhJkGMswEhJwwBCyAkKAIMIiggJCgCFCIkICUoAghsaiImKgIIIQ0gJioCBCEPICYqAgAhDCAoICUoAgQgJGxqIicqAgghCyAnKgIEIQggJyoCACEKICggJCAlKAIAbGoiJCoCCCEDICQqAgQhByAkKgIAIQQLIAAgACgCLEEBajYCLCApICAgGJMiBSAeIBmTIgKUIBwgGJMiBiAhIBmTIhGUkyIJOAIMICkgIiAakyITIAaUIB8gGpMiBiAFlJMiBTgCCCApIBEgBpQgAiATlJMiAjgCBEMAAAAAIAKMIhUgGJQgGSAFlJMgCSAalJMiBiAJIAOUIAIgBJQgByAFlJKSkiIRIBGLQ703hjVdGyIRQwAAAAAgBiAJIA2UIAIgDJQgDyAFlJKSkiITIBOLQ703hjVdGyIOlCETIBFDAAAAACAGIAkgC5QgAiAKlCAIIAWUkpKSIgYgBotDvTeGNV0bIhCUQwAAAABeIiggE0MAAAAAXnENA0MAAAAAIAggB5MiCCANIAOTIg2UIA8gB5MiDyALIAOTIguUkyIGjCAElCAHIAsgDCAEkyIMlCANIAogBJMiCpSTIgSUkyAKIA+UIAwgCJSTIgcgA5STIgMgByAalCAGIBiUIAQgGZSSkpIiCiAKi0O9N4Y1XRsiCkMAAAAAIAMgByAflCAGIByUIAQgHpSSkpIiCCAIi0O9N4Y1XRsiCJQhC0MAAAAAIAMgByAilCAGICCUIAQgIZSSkpIiAyADi0O9N4Y1XRsiAyAKlEMAAAAAXiIvIAtDAAAAAF5xDQMgJkECIAkgBpQgByAVlJKLIgwgBSAHlCAEIAmMlJKLIgleIiUgAiAElCAGIAWMlJKLIAwgCSAlG14bQQJ0IiVqKgIAIQQgJSAnaioCACEPICQgJWoqAgAhBSAlICpqKgIAIQIgJSAraioCACEMICUgLGoqAgAhCQJAAkACfSAvBEAgCCADkyEHIAggCpMhBiAIIAwgApOUIQsgCCAJIAKTlAwBCyALQwAAAABeBEAgAyAIkyEHIAMgCpMhBiADIAIgDJOUIQsgAyAJIAyTlCEIIAwhCQwCCyADIAiUQwAAAABeRSAKQwAAAABbcUUEQCAKIAiTIQcgCiADkyEGIAogAiAJk5QhCyAKIAwgCZOUIQgMAgsgA0MAAAAAXARAIAMgCJMhByADIAqTIQYgAyACIAyTlCELIAMgCSAMk5QhCCAMIQkMAgsgCEMAAAAAWw0CIAggA5MhByAIIAqTIQYgCCAMIAKTlCELIAggCSACk5QLIQggAiEJCwJAAn0gKARAIA4gEJMhAyAOIBGTIQogDiAFIASTlCENIA4gDyAEk5QMAQsgE0MAAAAAXgRAIBAgDpMhAyAQIBGTIQogECAEIA+TlCEMIBAgBSAPk5QhDSAPIQUMAgsgECAOlEMAAAAAXkUgEUMAAAAAW3FFBEAgESAOkyEDIBEgEJMhCiARIAQgBZOUIQwgESAPIAWTlCENDAILIBBDAAAAAFwEQCAQIA6TIQMgECARkyEKIBAgBCAPk5QhDCAQIAUgD5OUIQ0gDyEFDAILIA5DAAAAAFsNBCAOIBCTIQMgDiARkyEKIA4gBSAEk5QhDSAOIA8gBJOUCyEMIAQhBQsgCCAHlCAKIAOUIgKUIAkgBiAHlCIEIAKUIgeUIgiSIgkgCyAGlCAClCAIkiICIAIgCV0iJBsgBCAMlCAKlCAFIAeUIgeSIgUgBCANlCADlCAHkiIEIAQgBV4iJRtdQX9zIAQgBSAlGyACIAkgJBtdRXEMAwsgKUEEaiAsICsgKiAkICcgJhB+DAILIAAgJRDXAwwCCyApQQRqICwgKyAqICQgJyAmEH4LRQ0AIAAoAhQiJCAAKAIQRgRAIC0Q4wMgACgCFCEkCyAAICRBAWo2AhQgACgCGCIlICRBAnRqIC42AgAgACgCjAIhJiAAKAIUIiQgACgCEEYEQCAtEOMDIAAoAhQhJCAAKAIYISULIAAgJEEBajYCFCAlICRBAnRqICY2AgAgACAAKAIEQQRyNgIECyAAKAIEQQVxQQVGDQEgASgCHCIBQQFxRQ0ACyAAKAIgIiQoAgggAUEBdiIoICQoAhBsaiEBAkAgJC0AGEUEQEGAswEgJCgCDCIlICQoAhQiJiABKAIAbGoiJysDALYiBjgCAEGAswEhJEGEswEgJysDCLYiCjgCAEGIswEgJysDELYiCDgCAEGMswEgJSAmIAEoAgRsaiInKwMAtiINOAIAQZCzASAnKwMItiIROAIAQZSzASAnKwMQtiITOAIAQZizASAlICYgASgCCGxqIgErAwC2Ig44AgBBnLMBIAErAwi2IhA4AgBBoLMBIAErAxC2IhU4AgBBmLMBISVBjLMBISYMAQsgJCgCDCInICQoAhQiJCABKAIIbGoiJSoCCCEVICUqAgQhECAlKgIAIQ4gJyABKAIEICRsaiImKgIIIRMgJioCBCERICYqAgAhDSAnICQgASgCAGxqIiQqAgghCCAkKgIEIQogJCoCACEGCyAAIAAoAixBAWo2AiwgACoC/AEhDCAAKgLwASEEIAAqAogCIQ8gKSAAKgL0ASIbIAAqAugBIgeTIgUgACoChAIiGCAAKgLsASIDkyIClCAAKgKAAiIZIAeTIgsgACoC+AEiHSADkyISlJMiCTgCDCApIAwgBJMiFiALlCAPIASTIgsgBZSTIgU4AgggKSASIAuUIAIgFpSTIgI4AgRDAAAAACAHIAKMIhqUIAMgBZSTIAkgBJSTIgsgCSAIlCACIAaUIAogBZSSkpIiEiASi0O9N4Y1XRsiEkMAAAAAIAsgCSAVlCACIA6UIBAgBZSSkpIiFiAWi0O9N4Y1XRsiFJQhFiASQwAAAAAgCyAJIBOUIAIgDZQgESAFlJKSkiILIAuLQ703hjVdGyIXlCIcQwAAAABeIBZDAAAAAF5xDQBDAAAAACARIAqTIhEgFSAIkyIVlCAQIAqTIhAgEyAIkyITlJMiC4wgBpQgCiATIA4gBpMiDpQgFSANIAaTIg2UkyIGlJMgDSAQlCAOIBGUkyIKIAiUkyIIIAogBJQgCyAHlCAGIAOUkpKSIgQgBItDvTeGNV0bIgRDAAAAACAIIAogD5QgCyAZlCAGIBiUkpKSIgcgB4tDvTeGNV0bIgeUIQ9DAAAAACAIIAogDJQgCyAblCAGIB2UkpKSIgMgA4tDvTeGNV0bIgMgBJQiCEMAAAAAXiAPQwAAAABecQ0AICVBAiAJIAuUIAogGpSSiyIMIAUgCpQgBiAJjJSSiyIJXiIBIAIgBpQgCyAFjJSSiyAMIAkgARteG0ECdCIBaioCACEGIAEgJmoqAgAhDCABICRqKgIAIQUgASAqaioCACECIAEgK2oqAgAhCyABICxqKgIAIQkCfwJAAkACQAJ9IAhDAAAAAF4EQCAHIAOTIQogByAEkyEIIAcgCSACk5QhBCAHIAsgApOUDAELIA9DAAAAAF4EQCADIAeTIQogAyAEkyEIIAMgAiALk5QhDyADIAkgC5OUIQQgCyEJDAILIAMgB5RDAAAAAF5FIARDAAAAAFtxRQRAIAQgB5MhCiAEIAOTIQggBCACIAmTlCEPIAQgCyAJk5QhBAwCCyADQwAAAABcBEAgAyAHkyEKIAMgBJMhCCADIAIgC5OUIQ8gAyAJIAuTlCEEIAshCQwCCyAHQwAAAABbDQIgByADkyEKIAcgBJMhCCAHIAkgApOUIQQgByALIAKTlAshDyACIQkLAkACfSAcQwAAAABeBEAgFCAXkyEHIBQgEpMhAyAUIAUgBpOUIQ0gFCAMIAaTlAwBCyAWQwAAAABeBEAgFyAUkyEHIBcgEpMhAyAXIAYgDJOUIQsgFyAFIAyTlCENIAwhBQwCCyAXIBSUQwAAAABeRSASQwAAAABbcUUEQCASIBSTIQcgEiAXkyEDIBIgBiAFk5QhCyASIAwgBZOUIQ0MAgsgF0MAAAAAXARAIBcgFJMhByAXIBKTIQMgFyAGIAyTlCELIBcgBSAMk5QhDSAMIQUMAgsgFEMAAAAAWw0DIBQgF5MhByAUIBKTIQMgFCAFIAaTlCENIBQgDCAGk5QLIQsgBiEFCyAEIAqUIAMgB5QiApQgCSAIIAqUIgQgApQiBpQiCpIiCSAPIAiUIAKUIAqSIgIgAiAJXSIBGyAEIAuUIAOUIAUgBpQiA5IiBSAEIA2UIAeUIAOSIgQgBCAFXiIkG11Bf3MgBCAFICQbIAIgCSABG11FcQwCCyApQQRqICwgKyAqICQgJiAlEH4MAQsgKUEEaiAsICsgKiAkICYgJRB+C0UNACAAKAIUIgEgACgCEEYEQCAtEOMDIAAoAhQhAQsgACABQQFqNgIUIAAoAhgiJCABQQJ0aiAoNgIAIAAoAowCISUgACgCFCIBIAAoAhBGBEAgLRDjAyAAKAIYISQgACgCFCEBCyAAIAFBAWo2AhQgJCABQQJ0aiAlNgIAIAAgACgCBEEEcjYCBAsgKUEQaiQAC74mAiJ9DH8jAEEQayIpJAAgAEEQaiEtIABBgAJqISogAEH0AWohKyAAQegBaiEsAkADQCABLwEIISYgAS8BCiEoIAEuAQIhJyABLgEEIS4gAS8BBiEkIAEuAQAhJSAAIAAoAjBBAWo2AjAgACoC3AEgJLOUIgsgACoC6AEiGCAAKgLQASAlspQiBZMiByAAKgKAAiIcIAWTIgkgByAJXRsgACoC9AEiICAFkyIDIAkgAyAJXRsgAyAHXhtdDQEgC4wiFyAHIAkgByAJXhsgAyAJIAMgCV4bIAMgB10bXg0BIAAqAuABICazlCIMIAAqAuwBIhkgACoC1AEgJ7KUIgKTIgYgACoChAIiHiACkyIFIAUgBl4bIAAqAvgBIiEgApMiCiAFIAUgCl4bIAYgCl0bXQ0BIAyMIhsgBiAFIAUgBl0bIAogBSAFIApdGyAGIApeG14NASAAKgLkASAos5QiDyAAKgLwASIaIAAqAtgBIC6ylCIIkyIEIAAqAogCIh8gCJMiAiACIAReGyAAKgL8ASIiIAiTIgggAiACIAheGyAEIAhdG10NASAPjCIdIAQgAiACIARdGyAIIAIgAiAIXRsgBCAIXhteDQEgCiAGkyIQIAIgCJMiDZQgBSAKkyIRIAggBJMiDpSTIhKMIAeUIAYgDiAJIAOTIhOUIA0gAyAHkyIVlJMiFpSTIBUgEZQgEyAQlJMiFCAElJMiIyAUIB0gDyAUQwAAAABeIiQblCASIBcgCyASQwAAAABeIiUblCAWIBsgDCAWQwAAAABeIiYblJKSkkMAAAAAXg0BICMgFCAPIB0gJBuUIBIgCyAXICUblCAWIAwgGyAmG5SSkpJDAAAAAGBFDQEgAC0AkQIEQCAOiyIXIAyUIA8gEIsiG5SSIhQgDiAFlCACIBCMIhaUkiISIA4gBpQgBCAWlJIiFiASIBZdIiQbXQ0CIBSMIBYgEiAkG14NAiAXIAuUIA8gFYsiFJSSIhYgFSAClCAJIA6MIhKUkiIOIBUgBJQgByASlJIiEiAOIBJdIiQbXQ0CIBaMIBIgDiAkG14NAiAQIAmUIAUgFYwiFZSSIg4gECADlCAKIBWUkiIQIA4gEF0iJBsgGyALlCAMIBSUkiIVXg0CIBWMIBAgDiAkG14NAiANiyISIAyUIA8gEYsiFpSSIhUgDSAFlCACIBGUkyIOIA0gBpQgBCARlJMiECAOIBBdIiQbXQ0CIBWMIBAgDiAkG14NAiASIAuUIA8gE4siEJSSIg4gEyAClCAJIA2UkyICIBMgBJQgByANlJMiDSACIA1dIiQbXQ0CIA6MIA0gAiAkG14NAiARIAOUIAogE5STIgIgESAHlCAGIBOUkyINIAIgDV0iJBsgFiALlCAMIBCUkiIRXg0CIBGMIA0gAiAkG14NAiAaIB+TIgIgCpQgCCAZIB6TIg2UkyIRIAIgBpQgBCANlJMiBiAGIBFeIiQbIAKLIg4gDJQgDyANiyIQlJIiE14NAiATjCAGIBEgJBteDQIgGCAckyIGIAiUIAMgApSTIgggBiAElCAHIAKUkyICIAIgCF4iJBsgDiALlCAPIAaLIgeUkiIEXg0CIASMIAIgCCAkG14NAiAQIAuUIAwgB5SSIgIgDSAJlCAFIAaUkyIJIA0gA5QgCiAGlJMiBSAFIAleIiQbXQ0CIAKMIAUgCSAkG14NAgsCQAJ/AkAgASgCDCIlQQFxBEAgACgCJCIkKAIIICVBAXYiLiAkKAIQbGohJQJAICQtABhFBEBBgLMBICQoAgwiJiAkKAIUIicgJSgCAGxqIigrAwC2IgQ4AgBBgLMBISRBhLMBICgrAwi2Igc4AgBBiLMBICgrAxC2IgM4AgBBjLMBICYgJyAlKAIEbGoiKCsDALYiCjgCAEGQswEgKCsDCLYiCDgCAEGUswEgKCsDELYiCzgCAEGYswEgJiAnICUoAghsaiIlKwMAtiIMOAIAQZyzASAlKwMItiIPOAIAQaCzASAlKwMQtiINOAIAQZizASEmQYyzASEnDAELICQoAgwiKCAkKAIUIiQgJSgCCGxqIiYqAgghDSAmKgIEIQ8gJioCACEMICggJSgCBCAkbGoiJyoCCCELICcqAgQhCCAnKgIAIQogKCAkICUoAgBsaiIkKgIIIQMgJCoCBCEHICQqAgAhBAsgACAAKAIsQQFqNgIsICkgICAYkyIFIB4gGZMiApQgHCAYkyIGICEgGZMiEZSTIgk4AgwgKSAiIBqTIhMgBpQgHyAakyIGIAWUkyIFOAIIICkgESAGlCACIBOUkyICOAIEQwAAAAAgAowiFSAYlCAZIAWUkyAJIBqUkyIGIAkgA5QgAiAElCAHIAWUkpKSIhEgEYtDvTeGNV0bIhFDAAAAACAGIAkgDZQgAiAMlCAPIAWUkpKSIhMgE4tDvTeGNV0bIg6UIRMgEUMAAAAAIAYgCSALlCACIAqUIAggBZSSkpIiBiAGi0O9N4Y1XRsiEJRDAAAAAF4iKCATQwAAAABecQ0DQwAAAAAgCCAHkyIIIA0gA5MiDZQgDyAHkyIPIAsgA5MiC5STIgaMIASUIAcgCyAMIASTIgyUIA0gCiAEkyIKlJMiBJSTIAogD5QgDCAIlJMiByADlJMiAyAHIBqUIAYgGJQgBCAZlJKSkiIKIAqLQ703hjVdGyIKQwAAAAAgAyAHIB+UIAYgHJQgBCAelJKSkiIIIAiLQ703hjVdGyIIlCELQwAAAAAgAyAHICKUIAYgIJQgBCAhlJKSkiIDIAOLQ703hjVdGyIDIAqUQwAAAABeIi8gC0MAAAAAXnENAyAmQQIgCSAGlCAHIBWUkosiDCAFIAeUIAQgCYyUkosiCV4iJSACIASUIAYgBYyUkosgDCAJICUbXhtBAnQiJWoqAgAhBCAlICdqKgIAIQ8gJCAlaioCACEFICUgKmoqAgAhAiAlICtqKgIAIQwgJSAsaioCACEJAkACQAJ9IC8EQCAIIAOTIQcgCCAKkyEGIAggDCACk5QhCyAIIAkgApOUDAELIAtDAAAAAF4EQCADIAiTIQcgAyAKkyEGIAMgAiAMk5QhCyADIAkgDJOUIQggDCEJDAILIAMgCJRDAAAAAF5FIApDAAAAAFtxRQRAIAogCJMhByAKIAOTIQYgCiACIAmTlCELIAogDCAJk5QhCAwCCyADQwAAAABcBEAgAyAIkyEHIAMgCpMhBiADIAIgDJOUIQsgAyAJIAyTlCEIIAwhCQwCCyAIQwAAAABbDQIgCCADkyEHIAggCpMhBiAIIAwgApOUIQsgCCAJIAKTlAshCCACIQkLAkACfSAoBEAgDiAQkyEDIA4gEZMhCiAOIAUgBJOUIQ0gDiAPIASTlAwBCyATQwAAAABeBEAgECAOkyEDIBAgEZMhCiAQIAQgD5OUIQwgECAFIA+TlCENIA8hBQwCCyAQIA6UQwAAAABeRSARQwAAAABbcUUEQCARIA6TIQMgESAQkyEKIBEgBCAFk5QhDCARIA8gBZOUIQ0MAgsgEEMAAAAAXARAIBAgDpMhAyAQIBGTIQogECAEIA+TlCEMIBAgBSAPk5QhDSAPIQUMAgsgDkMAAAAAWw0EIA4gEJMhAyAOIBGTIQogDiAFIASTlCENIA4gDyAEk5QLIQwgBCEFCyAIIAeUIAogA5QiApQgCSAGIAeUIgQgApQiB5QiCJIiCSALIAaUIAKUIAiSIgIgAiAJXSIkGyAEIAyUIAqUIAUgB5QiB5IiBSAEIA2UIAOUIAeSIgQgBCAFXiIlG11Bf3MgBCAFICUbIAIgCSAkG11FcQwDCyApQQRqICwgKyAqICQgJyAmEH4MAgsgACAlENgDDAILIClBBGogLCArICogJCAnICYQfgtFDQAgACgCjAIhJiAAKAIUIiQgACgCEEYEQCAtEOMDIAAoAhQhJAsgACAkQQFqNgIUIAAoAhgiJSAkQQJ0aiAmNgIAIAAoAhQiJCAAKAIQRgRAIC0Q4wMgACgCFCEkIAAoAhghJQsgACAkQQFqNgIUICUgJEECdGogLjYCACAAIAAoAgRBBHI2AgQLIAAoAgRBBXFBBUYNASABKAIQIgFBAXFFDQALIAAoAiQiJCgCCCABQQF2IiggJCgCEGxqIQECQCAkLQAYRQRAQYCzASAkKAIMIiUgJCgCFCImIAEoAgBsaiInKwMAtiIGOAIAQYCzASEkQYSzASAnKwMItiIKOAIAQYizASAnKwMQtiIIOAIAQYyzASAlICYgASgCBGxqIicrAwC2Ig04AgBBkLMBICcrAwi2IhE4AgBBlLMBICcrAxC2IhM4AgBBmLMBICUgJiABKAIIbGoiASsDALYiDjgCAEGcswEgASsDCLYiEDgCAEGgswEgASsDELYiFTgCAEGYswEhJUGMswEhJgwBCyAkKAIMIicgJCgCFCIkIAEoAghsaiIlKgIIIRUgJSoCBCEQICUqAgAhDiAnIAEoAgQgJGxqIiYqAgghEyAmKgIEIREgJioCACENICcgJCABKAIAbGoiJCoCCCEIICQqAgQhCiAkKgIAIQYLIAAgACgCLEEBajYCLCAAKgL8ASEMIAAqAvABIQQgACoCiAIhDyApIAAqAvQBIhsgACoC6AEiB5MiBSAAKgKEAiIYIAAqAuwBIgOTIgKUIAAqAoACIhkgB5MiCyAAKgL4ASIdIAOTIhKUkyIJOAIMICkgDCAEkyIWIAuUIA8gBJMiCyAFlJMiBTgCCCApIBIgC5QgAiAWlJMiAjgCBEMAAAAAIAcgAowiGpQgAyAFlJMgCSAElJMiCyAJIAiUIAIgBpQgCiAFlJKSkiISIBKLQ703hjVdGyISQwAAAAAgCyAJIBWUIAIgDpQgECAFlJKSkiIWIBaLQ703hjVdGyIUlCEWIBJDAAAAACALIAkgE5QgAiANlCARIAWUkpKSIgsgC4tDvTeGNV0bIheUIhxDAAAAAF4gFkMAAAAAXnENAEMAAAAAIBEgCpMiESAVIAiTIhWUIBAgCpMiECATIAiTIhOUkyILjCAGlCAKIBMgDiAGkyIOlCAVIA0gBpMiDZSTIgaUkyANIBCUIA4gEZSTIgogCJSTIgggCiAElCALIAeUIAYgA5SSkpIiBCAEi0O9N4Y1XRsiBEMAAAAAIAggCiAPlCALIBmUIAYgGJSSkpIiByAHi0O9N4Y1XRsiB5QhD0MAAAAAIAggCiAMlCALIBuUIAYgHZSSkpIiAyADi0O9N4Y1XRsiAyAElCIIQwAAAABeIA9DAAAAAF5xDQAgJUECIAkgC5QgCiAalJKLIgwgBSAKlCAGIAmMlJKLIgleIgEgAiAGlCALIAWMlJKLIAwgCSABG14bQQJ0IgFqKgIAIQYgASAmaioCACEMIAEgJGoqAgAhBSABICpqKgIAIQIgASAraioCACELIAEgLGoqAgAhCQJ/AkACQAJAAn0gCEMAAAAAXgRAIAcgA5MhCiAHIASTIQggByAJIAKTlCEEIAcgCyACk5QMAQsgD0MAAAAAXgRAIAMgB5MhCiADIASTIQggAyACIAuTlCEPIAMgCSALk5QhBCALIQkMAgsgAyAHlEMAAAAAXkUgBEMAAAAAW3FFBEAgBCAHkyEKIAQgA5MhCCAEIAIgCZOUIQ8gBCALIAmTlCEEDAILIANDAAAAAFwEQCADIAeTIQogAyAEkyEIIAMgAiALk5QhDyADIAkgC5OUIQQgCyEJDAILIAdDAAAAAFsNAiAHIAOTIQogByAEkyEIIAcgCSACk5QhBCAHIAsgApOUCyEPIAIhCQsCQAJ9IBxDAAAAAF4EQCAUIBeTIQcgFCASkyEDIBQgBSAGk5QhDSAUIAwgBpOUDAELIBZDAAAAAF4EQCAXIBSTIQcgFyASkyEDIBcgBiAMk5QhCyAXIAUgDJOUIQ0gDCEFDAILIBcgFJRDAAAAAF5FIBJDAAAAAFtxRQRAIBIgFJMhByASIBeTIQMgEiAGIAWTlCELIBIgDCAFk5QhDQwCCyAXQwAAAABcBEAgFyAUkyEHIBcgEpMhAyAXIAYgDJOUIQsgFyAFIAyTlCENIAwhBQwCCyAUQwAAAABbDQMgFCAXkyEHIBQgEpMhAyAUIAUgBpOUIQ0gFCAMIAaTlAshCyAGIQULIAQgCpQgAyAHlCIClCAJIAggCpQiBCAClCIGlCIKkiIJIA8gCJQgApQgCpIiAiACIAldIgEbIAQgC5QgA5QgBSAGlCIDkiIFIAQgDZQgB5QgA5IiBCAEIAVeIiQbXUF/cyAEIAUgJBsgAiAJIAEbXUVxDAILIClBBGogLCArICogJCAmICUQfgwBCyApQQRqICwgKyAqICQgJiAlEH4LRQ0AIAAoAowCISUgACgCFCIBIAAoAhBGBEAgLRDjAyAAKAIUIQELIAAgAUEBajYCFCAAKAIYIiQgAUECdGogJTYCACAAKAIUIgEgACgCEEYEQCAtEOMDIAAoAhghJCAAKAIUIQELIAAgAUEBajYCFCAkIAFBAnRqICg2AgAgACAAKAIEQQRyNgIECyApQRBqJAALviYCIn0MfyMAQRBrIikkACAAQRBqIS0gAEGAAmohKiAAQfQBaiErIABB6AFqISwCQANAIAEvAQghJiABLwEKISggAS4BAiEnIAEuAQQhLiABLwEGISQgAS4BACElIAAgACgCMEEBajYCMCAAKgLEASAks5QiCyAAKgLoASIYIAAqArgBICWylCIFkyIHIAAqAoACIhwgBZMiCSAHIAldGyAAKgL0ASIgIAWTIgMgCSADIAldGyADIAdeG10NASALjCIXIAcgCSAHIAleGyADIAkgAyAJXhsgAyAHXRteDQEgACoCyAEgJrOUIgwgACoC7AEiGSAAKgK8ASAnspQiApMiBiAAKgKEAiIeIAKTIgUgBSAGXhsgACoC+AEiISACkyIKIAUgBSAKXhsgBiAKXRtdDQEgDIwiGyAGIAUgBSAGXRsgCiAFIAUgCl0bIAYgCl4bXg0BIAAqAswBICizlCIPIAAqAvABIhogACoCwAEgLrKUIgiTIgQgACoCiAIiHyAIkyICIAIgBF4bIAAqAvwBIiIgCJMiCCACIAIgCF4bIAQgCF0bXQ0BIA+MIh0gBCACIAIgBF0bIAggAiACIAhdGyAEIAheG14NASAKIAaTIhAgAiAIkyINlCAFIAqTIhEgCCAEkyIOlJMiEowgB5QgBiAOIAkgA5MiE5QgDSADIAeTIhWUkyIWlJMgFSARlCATIBCUkyIUIASUkyIjIBQgHSAPIBRDAAAAAF4iJBuUIBIgFyALIBJDAAAAAF4iJRuUIBYgGyAMIBZDAAAAAF4iJhuUkpKSQwAAAABeDQEgIyAUIA8gHSAkG5QgEiALIBcgJRuUIBYgDCAbICYblJKSkkMAAAAAYEUNASAALQCRAgRAIA6LIhcgDJQgDyAQiyIblJIiFCAOIAWUIAIgEIwiFpSSIhIgDiAGlCAEIBaUkiIWIBIgFl0iJBtdDQIgFIwgFiASICQbXg0CIBcgC5QgDyAViyIUlJIiFiAVIAKUIAkgDowiEpSSIg4gFSAElCAHIBKUkiISIA4gEl0iJBtdDQIgFowgEiAOICQbXg0CIBAgCZQgBSAVjCIVlJIiDiAQIAOUIAogFZSSIhAgDiAQXSIkGyAbIAuUIAwgFJSSIhVeDQIgFYwgECAOICQbXg0CIA2LIhIgDJQgDyARiyIWlJIiFSANIAWUIAIgEZSTIg4gDSAGlCAEIBGUkyIQIA4gEF0iJBtdDQIgFYwgECAOICQbXg0CIBIgC5QgDyATiyIQlJIiDiATIAKUIAkgDZSTIgIgEyAElCAHIA2UkyINIAIgDV0iJBtdDQIgDowgDSACICQbXg0CIBEgA5QgCiATlJMiAiARIAeUIAYgE5STIg0gAiANXSIkGyAWIAuUIAwgEJSSIhFeDQIgEYwgDSACICQbXg0CIBogH5MiAiAKlCAIIBkgHpMiDZSTIhEgAiAGlCAEIA2UkyIGIAYgEV4iJBsgAosiDiAMlCAPIA2LIhCUkiITXg0CIBOMIAYgESAkG14NAiAYIByTIgYgCJQgAyAClJMiCCAGIASUIAcgApSTIgIgAiAIXiIkGyAOIAuUIA8gBosiB5SSIgReDQIgBIwgAiAIICQbXg0CIBAgC5QgDCAHlJIiAiANIAmUIAUgBpSTIgkgDSADlCAKIAaUkyIFIAUgCV4iJBtdDQIgAowgBSAJICQbXg0CCwJAAn8CQCABKAIMIiVBAXEEQCAAKAIgIiQoAgggJUEBdiIuICQoAhBsaiElAkAgJC0AGEUEQEGAswEgJCgCDCImICQoAhQiJyAlKAIAbGoiKCsDALYiBDgCAEGAswEhJEGEswEgKCsDCLYiBzgCAEGIswEgKCsDELYiAzgCAEGMswEgJiAnICUoAgRsaiIoKwMAtiIKOAIAQZCzASAoKwMItiIIOAIAQZSzASAoKwMQtiILOAIAQZizASAmICcgJSgCCGxqIiUrAwC2Igw4AgBBnLMBICUrAwi2Ig84AgBBoLMBICUrAxC2Ig04AgBBmLMBISZBjLMBIScMAQsgJCgCDCIoICQoAhQiJCAlKAIIbGoiJioCCCENICYqAgQhDyAmKgIAIQwgKCAlKAIEICRsaiInKgIIIQsgJyoCBCEIICcqAgAhCiAoICQgJSgCAGxqIiQqAgghAyAkKgIEIQcgJCoCACEECyAAIAAoAixBAWo2AiwgKSAgIBiTIgUgHiAZkyIClCAcIBiTIgYgISAZkyIRlJMiCTgCDCApICIgGpMiEyAGlCAfIBqTIgYgBZSTIgU4AgggKSARIAaUIAIgE5STIgI4AgRDAAAAACACjCIVIBiUIBkgBZSTIAkgGpSTIgYgCSADlCACIASUIAcgBZSSkpIiESARi0O9N4Y1XRsiEUMAAAAAIAYgCSANlCACIAyUIA8gBZSSkpIiEyATi0O9N4Y1XRsiDpQhEyARQwAAAAAgBiAJIAuUIAIgCpQgCCAFlJKSkiIGIAaLQ703hjVdGyIQlEMAAAAAXiIoIBNDAAAAAF5xDQNDAAAAACAIIAeTIgggDSADkyINlCAPIAeTIg8gCyADkyILlJMiBowgBJQgByALIAwgBJMiDJQgDSAKIASTIgqUkyIElJMgCiAPlCAMIAiUkyIHIAOUkyIDIAcgGpQgBiAYlCAEIBmUkpKSIgogCotDvTeGNV0bIgpDAAAAACADIAcgH5QgBiAclCAEIB6UkpKSIgggCItDvTeGNV0bIgiUIQtDAAAAACADIAcgIpQgBiAglCAEICGUkpKSIgMgA4tDvTeGNV0bIgMgCpRDAAAAAF4iLyALQwAAAABecQ0DICZBAiAJIAaUIAcgFZSSiyIMIAUgB5QgBCAJjJSSiyIJXiIlIAIgBJQgBiAFjJSSiyAMIAkgJRteG0ECdCIlaioCACEEICUgJ2oqAgAhDyAkICVqKgIAIQUgJSAqaioCACECICUgK2oqAgAhDCAlICxqKgIAIQkCQAJAAn0gLwRAIAggA5MhByAIIAqTIQYgCCAMIAKTlCELIAggCSACk5QMAQsgC0MAAAAAXgRAIAMgCJMhByADIAqTIQYgAyACIAyTlCELIAMgCSAMk5QhCCAMIQkMAgsgAyAIlEMAAAAAXkUgCkMAAAAAW3FFBEAgCiAIkyEHIAogA5MhBiAKIAIgCZOUIQsgCiAMIAmTlCEIDAILIANDAAAAAFwEQCADIAiTIQcgAyAKkyEGIAMgAiAMk5QhCyADIAkgDJOUIQggDCEJDAILIAhDAAAAAFsNAiAIIAOTIQcgCCAKkyEGIAggDCACk5QhCyAIIAkgApOUCyEIIAIhCQsCQAJ9ICgEQCAOIBCTIQMgDiARkyEKIA4gBSAEk5QhDSAOIA8gBJOUDAELIBNDAAAAAF4EQCAQIA6TIQMgECARkyEKIBAgBCAPk5QhDCAQIAUgD5OUIQ0gDyEFDAILIBAgDpRDAAAAAF5FIBFDAAAAAFtxRQRAIBEgDpMhAyARIBCTIQogESAEIAWTlCEMIBEgDyAFk5QhDQwCCyAQQwAAAABcBEAgECAOkyEDIBAgEZMhCiAQIAQgD5OUIQwgECAFIA+TlCENIA8hBQwCCyAOQwAAAABbDQQgDiAQkyEDIA4gEZMhCiAOIAUgBJOUIQ0gDiAPIASTlAshDCAEIQULIAggB5QgCiADlCIClCAJIAYgB5QiBCAClCIHlCIIkiIJIAsgBpQgApQgCJIiAiACIAldIiQbIAQgDJQgCpQgBSAHlCIHkiIFIAQgDZQgA5QgB5IiBCAEIAVeIiUbXUF/cyAEIAUgJRsgAiAJICQbXUVxDAMLIClBBGogLCArICogJCAnICYQfgwCCyAAICUQ2QMMAgsgKUEEaiAsICsgKiAkICcgJhB+C0UNACAAKAIUIiQgACgCEEYEQCAtEOMDIAAoAhQhJAsgACAkQQFqNgIUIAAoAhgiJSAkQQJ0aiAuNgIAIAAoAowCISYgACgCFCIkIAAoAhBGBEAgLRDjAyAAKAIUISQgACgCGCElCyAAICRBAWo2AhQgJSAkQQJ0aiAmNgIAIAAgACgCBEEEcjYCBAsgACgCBEEFcUEFRg0BIAEoAhAiAUEBcUUNAAsgACgCICIkKAIIIAFBAXYiKCAkKAIQbGohAQJAICQtABhFBEBBgLMBICQoAgwiJSAkKAIUIiYgASgCAGxqIicrAwC2IgY4AgBBgLMBISRBhLMBICcrAwi2Igo4AgBBiLMBICcrAxC2Igg4AgBBjLMBICUgJiABKAIEbGoiJysDALYiDTgCAEGQswEgJysDCLYiETgCAEGUswEgJysDELYiEzgCAEGYswEgJSAmIAEoAghsaiIBKwMAtiIOOAIAQZyzASABKwMItiIQOAIAQaCzASABKwMQtiIVOAIAQZizASElQYyzASEmDAELICQoAgwiJyAkKAIUIiQgASgCCGxqIiUqAgghFSAlKgIEIRAgJSoCACEOICcgASgCBCAkbGoiJioCCCETICYqAgQhESAmKgIAIQ0gJyAkIAEoAgBsaiIkKgIIIQggJCoCBCEKICQqAgAhBgsgACAAKAIsQQFqNgIsIAAqAvwBIQwgACoC8AEhBCAAKgKIAiEPICkgACoC9AEiGyAAKgLoASIHkyIFIAAqAoQCIhggACoC7AEiA5MiApQgACoCgAIiGSAHkyILIAAqAvgBIh0gA5MiEpSTIgk4AgwgKSAMIASTIhYgC5QgDyAEkyILIAWUkyIFOAIIICkgEiALlCACIBaUkyICOAIEQwAAAAAgByACjCIalCADIAWUkyAJIASUkyILIAkgCJQgAiAGlCAKIAWUkpKSIhIgEotDvTeGNV0bIhJDAAAAACALIAkgFZQgAiAOlCAQIAWUkpKSIhYgFotDvTeGNV0bIhSUIRYgEkMAAAAAIAsgCSATlCACIA2UIBEgBZSSkpIiCyALi0O9N4Y1XRsiF5QiHEMAAAAAXiAWQwAAAABecQ0AQwAAAAAgESAKkyIRIBUgCJMiFZQgECAKkyIQIBMgCJMiE5STIguMIAaUIAogEyAOIAaTIg6UIBUgDSAGkyINlJMiBpSTIA0gEJQgDiARlJMiCiAIlJMiCCAKIASUIAsgB5QgBiADlJKSkiIEIASLQ703hjVdGyIEQwAAAAAgCCAKIA+UIAsgGZQgBiAYlJKSkiIHIAeLQ703hjVdGyIHlCEPQwAAAAAgCCAKIAyUIAsgG5QgBiAdlJKSkiIDIAOLQ703hjVdGyIDIASUIghDAAAAAF4gD0MAAAAAXnENACAlQQIgCSALlCAKIBqUkosiDCAFIAqUIAYgCYyUkosiCV4iASACIAaUIAsgBYyUkosgDCAJIAEbXhtBAnQiAWoqAgAhBiABICZqKgIAIQwgASAkaioCACEFIAEgKmoqAgAhAiABICtqKgIAIQsgASAsaioCACEJAn8CQAJAAkACfSAIQwAAAABeBEAgByADkyEKIAcgBJMhCCAHIAkgApOUIQQgByALIAKTlAwBCyAPQwAAAABeBEAgAyAHkyEKIAMgBJMhCCADIAIgC5OUIQ8gAyAJIAuTlCEEIAshCQwCCyADIAeUQwAAAABeRSAEQwAAAABbcUUEQCAEIAeTIQogBCADkyEIIAQgAiAJk5QhDyAEIAsgCZOUIQQMAgsgA0MAAAAAXARAIAMgB5MhCiADIASTIQggAyACIAuTlCEPIAMgCSALk5QhBCALIQkMAgsgB0MAAAAAWw0CIAcgA5MhCiAHIASTIQggByAJIAKTlCEEIAcgCyACk5QLIQ8gAiEJCwJAAn0gHEMAAAAAXgRAIBQgF5MhByAUIBKTIQMgFCAFIAaTlCENIBQgDCAGk5QMAQsgFkMAAAAAXgRAIBcgFJMhByAXIBKTIQMgFyAGIAyTlCELIBcgBSAMk5QhDSAMIQUMAgsgFyAUlEMAAAAAXkUgEkMAAAAAW3FFBEAgEiAUkyEHIBIgF5MhAyASIAYgBZOUIQsgEiAMIAWTlCENDAILIBdDAAAAAFwEQCAXIBSTIQcgFyASkyEDIBcgBiAMk5QhCyAXIAUgDJOUIQ0gDCEFDAILIBRDAAAAAFsNAyAUIBeTIQcgFCASkyEDIBQgBSAGk5QhDSAUIAwgBpOUCyELIAYhBQsgBCAKlCADIAeUIgKUIAkgCCAKlCIEIAKUIgaUIgqSIgkgDyAIlCAClCAKkiICIAIgCV0iARsgBCALlCADlCAFIAaUIgOSIgUgBCANlCAHlCADkiIEIAQgBV4iJBtdQX9zIAQgBSAkGyACIAkgARtdRXEMAgsgKUEEaiAsICsgKiAkICYgJRB+DAELIClBBGogLCArICogJCAmICUQfgtFDQAgACgCFCIBIAAoAhBGBEAgLRDjAyAAKAIUIQELIAAgAUEBajYCFCAAKAIYIiQgAUECdGogKDYCACAAKAKMAiElIAAoAhQiASAAKAIQRgRAIC0Q4wMgACgCGCEkIAAoAhQhAQsgACABQQFqNgIUICQgAUECdGogJTYCACAAIAAoAgRBBHI2AgQLIClBEGokAAsgACAAEIYDIgBCADcCLCAAQQA2AhAgAEHQ8AA2AgAgAAsUACAAQQA2AhAgAEHQ8AA2AgAgAAsEAEEAC8EBAQN/AkADQAJAIAEoAhgiAkEBcQRAIAJBAXYhBCAAKAIQIgIoAgQiAyACKAIARgRAIAIQ4wMgAigCBCEDCyACIANBAWo2AgQgAigCCCADQQJ0aiAENgIADAELIAAgAhDdAwsgACgCBEEFcUEFRg0BIAEoAhwiAUEBcUUNAAsgAUEBdiEDIAAoAhAiASgCBCICIAEoAgBGBEAgARDjAyABKAIEIQILIAEgAkEBajYCBCABKAIIIAJBAnRqIAM2AgALC8EBAQN/AkADQAJAIAEoAgwiAkEBcQRAIAJBAXYhBCAAKAIQIgIoAgQiAyACKAIARgRAIAIQ4wMgAigCBCEDCyACIANBAWo2AgQgAigCCCADQQJ0aiAENgIADAELIAAgAhDeAwsgACgCBEEFcUEFRg0BIAEoAhAiAUEBcUUNAAsgAUEBdiEDIAAoAhAiASgCBCICIAEoAgBGBEAgARDjAyABKAIEIQILIAEgAkEBajYCBCABKAIIIAJBAnRqIAM2AgALC4oBAQF/AkAgASgCGCICQQFxRQRAIAFBGGohAQNAIAAgAhDfAyAAKAIEQQVxQQVGDQIgASgCAEE0aiIBKAIAIgJBAXFFDQALCyACQQF2IQEgACgCECIAKAIEIgIgACgCAEYEQCAAEOMDIAAoAgQhAgsgACACQQFqNgIEIAAoAgggAkECdGogATYCAAsLigEBAX8CQCABKAIMIgJBAXFFBEAgAUEMaiEBA0AgACACEOADIAAoAgRBBXFBBUYNAiABKAIAQRxqIgEoAgAiAkEBcUUNAAsLIAJBAXYhASAAKAIQIgAoAgQiAiAAKAIARgRAIAAQ4wMgACgCBCECCyAAIAJBAWo2AgQgACgCCCACQQJ0aiABNgIACws9ACAAQoCAgICAgICAwAA3AgggAEIANwIAQaSzAUGkswEoAgBBAWo2AgBBqLMBQaizASgCAEEQajYCACAAC2ABAn9BqLMBQaizASgCACAAKAIAQQJ0ayIBNgIAIAAoAggiAgRAIAIQigQgAEEANgIIQaizASgCACEBCyAAQgA3AgBBqLMBIAFBEGs2AgBBpLMBQaSzASgCAEEBazYCAAu2AQIFfwF9QaizAUGoswEoAgAgACgCACIBQQJ0ayIENgIAIAACfyAAKgIMIAGzlCIGQwAAgE9dIAZDAAAAAGBxBEAgBqkMAQtBAAtBAiABGyIBIAAoAgQiA0EBaiICIAEgAksbIgE2AgBBfyABQQJ0IgUgAUH/////A0sbEI0EIQJBqLMBIAQgBWo2AgAgACgCCCEBIAMEQCACIAEgA0ECdBDsAxoLIAEEQCABEIoECyAAIAI2AggLgQECA30DfiABKgIgIQIgASoCFCEDIAEqAgghBCABKQIAIQUgASkCDCEGIAEpAhghByAAQQA2AgwgACADOAIYIABBADYCHCAAQgA3AiwgACACOAIoIAAgBzcCICAAIAY3AhAgACAFNwIAIABCADcCNCAAQYCAgPwDNgI8IAAgBDgCCAuxAgIEfwZ9IAAgASoCADgCACAAIAEqAgQ4AhAgACABKgIIOAIgIAAgAUE4aiIEKgIAIAEqAgiUIAEqAjAgASoCAJQgAUE0aiIFKgIAIAEqAgSUkpKMOAIwIAAgASoCEDgCBCAAIAFBFGoiAioCADgCFCAAIAFBGGoiAyoCADgCJCAAIAQqAgAgAyoCAJQgASoCMCABKgIQlCAFKgIAIAIqAgCUkpKMOAI0IAAgASoCIDgCCCAAIAFBJGoiAioCADgCGCAAIAFBKGoiAyoCADgCKCACKgIAIQYgBSoCACEHIAMqAgAhCCAEKgIAIQkgASoCICEKIAEqAjAhCyAAQYCAgPwDNgI8IABBADYCLCAAQQA2AhwgAEEANgIMIAAgCSAIlCALIAqUIAcgBpSSkow4AjgL1wIBBH8gALxB/////wdxQYGAgPwHSSABvEH/////B3FBgICA/AdNcUUEQCAAIAGSDwsgAbwiAkGAgID8A0YEQCAAEOcDDwsgAkEedkECcSIFIAC8IgNBH3ZyIQQCQAJAIANB/////wdxIgNFBEACQAJAIARBAmsOAgABAwtD2w9JQA8LQ9sPScAPCyACQf////8HcSICQYCAgPwHRwRAIAJFBEBD2w/JPyAAmA8LIANBgICA/AdHIAJBgICA6ABqIANPcUUEQEPbD8k/IACYDwsCfSAFBEBDAAAAACADQYCAgOgAaiACSQ0BGgsgACABlYsQ5wMLIQACQAJAAkAgBA4DBAABAgsgAIwPC0PbD0lAIABDLr27M5KTDwsgAEMuvbszkkPbD0nAkg8LIANBgICA/AdGDQEgBEECdEGY8QBqKgIAIQALIAAPCyAEQQJ0QYjxAGoqAgAL6AICA38DfSAAvCICQf////8HcSIBQYCAgOQETwRAIABD2g/JPyAAmCAAvEH/////B3FBgICA/AdLGw8LAkACfyABQf////YDTQRAQX8gAUGAgIDMA08NARoMAgsgAIshACABQf//3/wDTQRAIAFB//+/+QNNBEAgACAAkkMAAIC/kiAAQwAAAECSlSEAQQAMAgsgAEMAAIC/kiAAQwAAgD+SlSEAQQEMAQsgAUH//++ABE0EQCAAQwAAwL+SIABDAADAP5RDAACAP5KVIQBBAgwBC0MAAIC/IACVIQBBAwshAyAAIACUIgUgBZQiBCAEQ0cS2r2UQ5jKTL6SlCEGIAUgBCAEQyWsfD2UQw31ET6SlEOpqqo+kpQhBCABQf////YDTQRAIAAgACAGIASSlJMPCyADQQJ0IgFBsPEAaioCACAAIAYgBJKUIAFBwPEAaioCAJMgAJOTIgCMIAAgAkEASBshAAsgAAtPAQF8IAAgAKIiACAAIACiIgGiIABEaVDu4EKT+T6iRCceD+iHwFa/oKIgAURCOgXhU1WlP6IgAESBXgz9///fv6JEAAAAAAAA8D+goKC2C0sBAnwgACAAoiIBIACiIgIgASABoqIgAUSnRjuMh83GPqJEdOfK4vkAKr+goiACIAFEsvtuiRARgT+iRHesy1RVVcW/oKIgAKCgtguREAIUfwN8IwBBEGsiCyQAAkAgALwiDkH/////B3EiAkHan6TuBE0EQCABIAC7IhcgF0SDyMltMF/kP6JEAAAAAAAAOEOgRAAAAAAAADjDoCIWRAAAAFD7Ifm/oqAgFkRjYhphtBBRvqKgIhg5AwAgGEQAAABg+yHpv2MhDgJ/IBaZRAAAAAAAAOBBYwRAIBaqDAELQYCAgIB4CyECIA4EQCABIBcgFkQAAAAAAADwv6AiFkQAAABQ+yH5v6KgIBZEY2IaYbQQUb6ioDkDACACQQFrIQIMAgsgGEQAAABg+yHpP2RFDQEgASAXIBZEAAAAAAAA8D+gIhZEAAAAUPsh+b+ioCAWRGNiGmG0EFG+oqA5AwAgAkEBaiECDAELIAJBgICA/AdPBEAgASAAIACTuzkDAEEAIQIMAQsgCyACIAJBF3ZBlgFrIgJBF3Rrvrs5AwggC0EIaiENIwBBsARrIgUkACACQQNrQRhtIgRBACAEQQBKGyIRQWhsIAJqIQZB0PEAKAIAIghBAE4EQCAIQQFqIQMgESECQQAhBANAIAVBwAJqIARBA3RqIAJBAEgEfEQAAAAAAAAAAAUgAkECdEHg8QBqKAIAtws5AwAgAkEBaiECIARBAWoiBCADRw0ACwsgBkEYayEJQQAhAyAIQQAgCEEAShshBwNAIAMhBEEAIQJEAAAAAAAAAAAhFgNAIA0gAkEDdGorAwAgBUHAAmogBCACa0EDdGorAwCiIBagIRYgAkEBaiICQQFHDQALIAUgA0EDdGogFjkDACADIAdGIQIgA0EBaiEDIAJFDQALQS8gBmshE0EwIAZrIRIgBkEZayEUIAghAwJAA0AgBSADQQN0aisDACEWQQAhAiADIQQgA0EATCIPRQRAA0AgBUHgA2ogAkECdGoCfwJ/IBZEAAAAAAAAcD6iIheZRAAAAAAAAOBBYwRAIBeqDAELQYCAgIB4C7ciF0QAAAAAAABwwaIgFqAiFplEAAAAAAAA4EFjBEAgFqoMAQtBgICAgHgLNgIAIAUgBEEBayIEQQN0aisDACAXoCEWIAJBAWoiAiADRw0ACwsCfyAWIAkQ9QMiFiAWRAAAAAAAAMA/opxEAAAAAAAAIMCioCIWmUQAAAAAAADgQWMEQCAWqgwBC0GAgICAeAshCiAWIAq3oSEWAkACQAJAAn8gCUEATCIVRQRAIANBAnQgBWpB3ANqIgIgAigCACICIAIgEnUiAiASdGsiBDYCACACIApqIQogBCATdQwBCyAJDQEgA0ECdCAFaigC3ANBF3ULIgxBAEwNAgwBC0ECIQwgFkQAAAAAAADgP2YNAEEAIQwMAQtBACECQQAhECAPRQRAA0AgBUHgA2ogAkECdGoiDygCACEEQf///wchBwJ/AkAgEA0AQYCAgAghByAEDQBBAAwBCyAPIAcgBGs2AgBBAQshECACQQFqIgIgA0cNAAsLAkAgFQ0AQf///wMhAgJAAkAgFA4CAQACC0H///8BIQILIANBAnQgBWpB3ANqIgQgBCgCACACcTYCAAsgCkEBaiEKIAxBAkcNAEQAAAAAAADwPyAWoSEWQQIhDCAQRQ0AIBZEAAAAAAAA8D8gCRD1A6EhFgsgFkQAAAAAAAAAAGEEQEEAIQQCQCADIgIgCEwNAANAIAVB4ANqIAJBAWsiAkECdGooAgAgBHIhBCACIAhKDQALIARFDQAgCSEGA0AgBkEYayEGIAVB4ANqIANBAWsiA0ECdGooAgBFDQALDAMLQQEhAgNAIAIiBEEBaiECIAVB4ANqIAggBGtBAnRqKAIARQ0ACyADIARqIQcDQCAFQcACaiADQQFqIgRBA3RqIANBAWoiAyARakECdEHg8QBqKAIAtzkDAEEAIQJEAAAAAAAAAAAhFgNAIA0gAkEDdGorAwAgBUHAAmogBCACa0EDdGorAwCiIBagIRYgAkEBaiICQQFHDQALIAUgA0EDdGogFjkDACADIAdIDQALIAchAwwBCwsCQCAWQRggBmsQ9QMiFkQAAAAAAABwQWYEQCAFQeADaiADQQJ0agJ/An8gFkQAAAAAAABwPqIiF5lEAAAAAAAA4EFjBEAgF6oMAQtBgICAgHgLIgK3RAAAAAAAAHDBoiAWoCIWmUQAAAAAAADgQWMEQCAWqgwBC0GAgICAeAs2AgAgA0EBaiEDDAELAn8gFplEAAAAAAAA4EFjBEAgFqoMAQtBgICAgHgLIQIgCSEGCyAFQeADaiADQQJ0aiACNgIAC0QAAAAAAADwPyAGEPUDIRYCQCADQQBIDQAgAyEGA0AgBSAGIgJBA3RqIBYgBUHgA2ogAkECdGooAgC3ojkDACACQQFrIQYgFkQAAAAAAABwPqIhFiACDQALIANBAEgNACADIQQDQEQAAAAAAAAAACEWQQAhAiAIIAMgBGsiByAHIAhKGyINQQBOBEADQCACQQN0QbCHAWorAwAgBSACIARqQQN0aisDAKIgFqAhFiACIA1HIQYgAkEBaiECIAYNAAsLIAVBoAFqIAdBA3RqIBY5AwAgBEEASiECIARBAWshBCACDQALC0QAAAAAAAAAACEWIANBAE4EQANAIAMiAkEBayEDIBYgBUGgAWogAkEDdGorAwCgIRYgAg0ACwsgCyAWmiAWIAwbOQMAIAVBsARqJAAgCkEHcSECIAsrAwAhFiAOQQBIBEAgASAWmjkDAEEAIAJrIQIMAQsgASAWOQMACyALQRBqJAAgAgv0AgIDfwF8IwBBEGsiASQAAn0gALwiA0H/////B3EiAkHan6T6A00EQEMAAIA/IAJBgICAzANJDQEaIAC7EOgDDAELIAJB0aftgwRNBEAgAkHkl9uABE8EQEQYLURU+yEJQEQYLURU+yEJwCADQQBIGyAAu6AQ6AOMDAILIAC7IQQgA0EASARAIAREGC1EVPsh+T+gEOkDDAILRBgtRFT7Ifk/IAShEOkDDAELIAJB1eOIhwRNBEAgAkHg27+FBE8EQEQYLURU+yEZQEQYLURU+yEZwCADQQBIGyAAu6AQ6AMMAgsgA0EASARARNIhM3982RLAIAC7oRDpAwwCCyAAu0TSITN/fNkSwKAQ6QMMAQsgACAAkyACQYCAgPwHTw0AGgJAAkACQAJAIAAgAUEIahDqA0EDcQ4DAAECAwsgASsDCBDoAwwDCyABKwMImhDpAwwCCyABKwMIEOgDjAwBCyABKwMIEOkDCyEAIAFBEGokACAAC4AEAQN/IAJBgARPBEAgACABIAIQASAADwsgACACaiEDAkAgACABc0EDcUUEQAJAIABBA3FFBEAgACECDAELIAJFBEAgACECDAELIAAhAgNAIAIgAS0AADoAACABQQFqIQEgAkEBaiICQQNxRQ0BIAIgA0kNAAsLAkAgA0F8cSIEQcAASQ0AIAIgBEFAaiIFSw0AA0AgAiABKAIANgIAIAIgASgCBDYCBCACIAEoAgg2AgggAiABKAIMNgIMIAIgASgCEDYCECACIAEoAhQ2AhQgAiABKAIYNgIYIAIgASgCHDYCHCACIAEoAiA2AiAgAiABKAIkNgIkIAIgASgCKDYCKCACIAEoAiw2AiwgAiABKAIwNgIwIAIgASgCNDYCNCACIAEoAjg2AjggAiABKAI8NgI8IAFBQGshASACQUBrIgIgBU0NAAsLIAIgBE8NAQNAIAIgASgCADYCACABQQRqIQEgAkEEaiICIARJDQALDAELIANBBEkEQCAAIQIMAQsgACADQQRrIgRLBEAgACECDAELIAAhAgNAIAIgAS0AADoAACACIAEtAAE6AAEgAiABLQACOgACIAIgAS0AAzoAAyABQQRqIQEgAkEEaiICIARNDQALCyACIANJBEADQCACIAEtAAA6AAAgAUEBaiEBIAJBAWoiAiADRw0ACwsgAAvoAgECfwJAIAAgAUYNACABIAAgAmoiA2tBACACQQF0a00EQCAAIAEgAhDsAxoPCyAAIAFzQQNxIQQCQAJAIAAgAUkEQCAEBEAgACEDDAMLIABBA3FFBEAgACEDDAILIAAhAwNAIAJFDQQgAyABLQAAOgAAIAFBAWohASACQQFrIQIgA0EBaiIDQQNxDQALDAELAkAgBA0AIANBA3EEQANAIAJFDQUgACACQQFrIgJqIgMgASACai0AADoAACADQQNxDQALCyACQQNNDQADQCAAIAJBBGsiAmogASACaigCADYCACACQQNLDQALCyACRQ0CA0AgACACQQFrIgJqIAEgAmotAAA6AAAgAg0ACwwCCyACQQNNDQADQCADIAEoAgA2AgAgAUEEaiEBIANBBGohAyACQQRrIgJBA0sNAAsLIAJFDQADQCADIAEtAAA6AAAgA0EBaiEDIAFBAWohASACQQFrIgINAAsLC/ICAgJ/AX4CQCACRQ0AIAAgAToAACAAIAJqIgNBAWsgAToAACACQQNJDQAgACABOgACIAAgAToAASADQQNrIAE6AAAgA0ECayABOgAAIAJBB0kNACAAIAE6AAMgA0EEayABOgAAIAJBCUkNACAAQQAgAGtBA3EiBGoiAyABQf8BcUGBgoQIbCIBNgIAIAMgAiAEa0F8cSIEaiICQQRrIAE2AgAgBEEJSQ0AIAMgATYCCCADIAE2AgQgAkEIayABNgIAIAJBDGsgATYCACAEQRlJDQAgAyABNgIYIAMgATYCFCADIAE2AhAgAyABNgIMIAJBEGsgATYCACACQRRrIAE2AgAgAkEYayABNgIAIAJBHGsgATYCACAEIANBBHFBGHIiBGsiAkEgSQ0AIAGtQoGAgIAQfiEFIAMgBGohAQNAIAEgBTcDGCABIAU3AxAgASAFNwMIIAEgBTcDACABQSBqIQEgAkEgayICQR9LDQALCyAACwYAQayzAQvvAQEDfyAARQRAQcCRASgCAARAQcCRASgCABDwAyEBC0GokAEoAgAEQEGokAEoAgAQ8AMgAXIhAQtBtLMBKAIAIgAEQANAIAAoAkwaIAAoAhQgACgCHEcEQCAAEPADIAFyIQELIAAoAjgiAA0ACwsgAQ8LIAAoAkxBAEghAQJAAkAgACgCFCAAKAIcRg0AIABBAEEAIAAoAiQRBQAaIAAoAhQNAEF/IQIMAQsgACgCBCICIAAoAggiA0cEQCAAIAIgA2usQQEgACgCKBEZABoLQQAhAiAAQQA2AhwgAEIANwMQIABCADcCBCABDQALIAILKAEBfyMAQRBrIgMkACADIAI2AgwgACABIAJBAEEAEP0DIANBEGokAAtZAQF/IAAgACgCSCIBQQFrIAFyNgJIIAAoAgAiAUEIcQRAIAAgAUEgcjYCAEF/DwsgAEIANwIEIAAgACgCLCIBNgIcIAAgATYCFCAAIAEgACgCMGo2AhBBAAt9AQJ/IwBBEGsiASQAIAFBCjoADwJAAkAgACgCECICBH8gAgUgABDyAw0CIAAoAhALIAAoAhQiAkYNACAAKAJQQQpGDQAgACACQQFqNgIUIAJBCjoAAAwBCyAAIAFBD2pBASAAKAIkEQUAQQFHDQAgAS0ADxoLIAFBEGokAAtxAQN/IAC8IgJBF3YiA0H/AXEiBEH/AUcEfSAERQRAIAEgAEMAAAAAWwR/QQAFIABDAACAX5QgARD0AyEAIAEoAgBBQGoLNgIAIAAPCyABIANB/wFxQf4AazYCACACQf///4N4cUGAgID4A3K+BSAACwuoAQACQCABQYAITgRAIABEAAAAAAAA4H+iIQAgAUH/D0kEQCABQf8HayEBDAILIABEAAAAAAAA4H+iIQBB/RcgASABQf0XThtB/g9rIQEMAQsgAUGBeEoNACAARAAAAAAAAGADoiEAIAFBuHBLBEAgAUHJB2ohAQwBCyAARAAAAAAAAGADoiEAQfBoIAEgAUHwaEwbQZIPaiEBCyAAIAFB/wdqrUI0hr+iC4oDAgN/AXwjAEEQayIBJAACQCAAvCIDQf////8HcSICQdqfpPoDTQRAIAJBgICAzANJDQEgALsQ6QMhAAwBCyACQdGn7YMETQRAIAC7IQQgAkHjl9uABE0EQCADQQBIBEAgBEQYLURU+yH5P6AQ6AOMIQAMAwsgBEQYLURU+yH5v6AQ6AMhAAwCC0QYLURU+yEJwEQYLURU+yEJQCADQQBOGyAEoJoQ6QMhAAwBCyACQdXjiIcETQRAIAJB39u/hQRNBEAgALshBCADQQBIBEAgBETSITN/fNkSQKAQ6AMhAAwDCyAERNIhM3982RLAoBDoA4whAAwCC0QYLURU+yEZQEQYLURU+yEZwCADQQBIGyAAu6AQ6QMhAAwBCyACQYCAgPwHTwRAIAAgAJMhAAwBCwJAAkACQAJAIAAgAUEIahDqA0EDcQ4DAAECAwsgASsDCBDpAyEADAMLIAErAwgQ6AMhAAwCCyABKwMImhDpAyEADAELIAErAwgQ6AOMIQALIAFBEGokACAACwkAIAAoAjwQAgvbAgEHfyMAQSBrIgMkACADIAAoAhwiBDYCECAAKAIUIQUgAyACNgIcIAMgATYCGCADIAUgBGsiATYCFCABIAJqIQYgA0EQaiEEQQIhBwJ/AkACQAJAIAAoAjwgA0EQakECIANBDGoQAxCGBARAIAQhBQwBCwNAIAYgAygCDCIBRg0CIAFBAEgEQCAEIQUMBAsgBCABIAQoAgQiCEsiCUEDdGoiBSABIAhBACAJG2siCCAFKAIAajYCACAEQQxBBCAJG2oiBCAEKAIAIAhrNgIAIAYgAWshBiAAKAI8IAUiBCAHIAlrIgcgA0EMahADEIYERQ0ACwsgBkF/Rw0BCyAAIAAoAiwiATYCHCAAIAE2AhQgACABIAAoAjBqNgIQIAIMAQsgAEEANgIcIABCADcDECAAIAAoAgBBIHI2AgBBACAHQQJGDQAaIAIgBSgCBGsLIQEgA0EgaiQAIAELRgEBfyAAKAI8IQMjAEEQayIAJAAgAyABpyABQiCIpyACQf8BcSAAQQhqEAUQhgQhAiAAKQMIIQEgAEEQaiQAQn8gASACGwsEAEIACwoAIABBMGtBCkkLfwIBfwF+IAC9IgNCNIinQf8PcSICQf8PRwR8IAJFBEAgASAARAAAAAAAAAAAYQR/QQAFIABEAAAAAAAA8EOiIAEQ/AMhACABKAIAQUBqCzYCACAADwsgASACQf4HazYCACADQv////////+HgH+DQoCAgICAgIDwP4S/BSAACwuyAgEEfyMAQdABayIFJAAgBSACNgLMASAFQaABakEAQSgQ7gMaIAUgBSgCzAE2AsgBAkBBACABIAVByAFqIAVB0ABqIAVBoAFqIAMgBBD+A0EASA0AIAAoAkxBAEghByAAIAAoAgAiCEFfcTYCAAJ/AkACQCAAKAIwRQRAIABB0AA2AjAgAEEANgIcIABCADcDECAAKAIsIQYgACAFNgIsDAELIAAoAhANAQtBfyAAEPIDDQEaCyAAIAEgBUHIAWogBUHQAGogBUGgAWogAyAEEP4DCyECIAhBIHEhBCAGBH8gAEEAQQAgACgCJBEFABogAEEANgIwIAAgBjYCLCAAQQA2AhwgACgCFBogAEIANwMQQQAFIAILGiAAIAAoAgAgBHI2AgAgBw0ACyAFQdABaiQAC88UAhN/AX4jAEHQAGsiCCQAIAggATYCTCAIQTdqIRkgCEE4aiEUAkACQAJAA0BBACEHA0AgASEOIAcgE0H/////B3NKDQIgByATaiETAkACQAJAIAEiBy0AACINBEADQAJAAkAgDUH/AXEiDUUEQCAHIQEMAQsgDUElRw0BIAchDQNAIA0tAAFBJUcEQCANIQEMAgsgB0EBaiEHIA0tAAIhCSANQQJqIgEhDSAJQSVGDQALCyAHIA5rIgcgE0H/////B3MiDUoNCCAABEAgACAOIAcQ/wMLIAcNBiAIIAE2AkwgAUEBaiEHQX8hEQJAIAEsAAEQ+wNFDQAgAS0AAkEkRw0AIAFBA2ohByABLAABQTBrIRFBASEVCyAIIAc2AkxBACELAkAgBywAACIKQSBrIgFBH0sEQCAHIQkMAQsgByEJQQEgAXQiAUGJ0QRxRQ0AA0AgCCAHQQFqIgk2AkwgASALciELIAcsAAEiCkEgayIBQSBPDQEgCSEHQQEgAXQiAUGJ0QRxDQALCwJAIApBKkYEQCAJQQFqIQoCfwJAIAksAAEQ+wNFDQAgCS0AAkEkRw0AIAosAABBMGshBwJ/IABFBEAgBCAHQQJ0akEKNgIAQQAMAQsgAyAHQQN0aigCAAshECAJQQNqIQpBAQwBCyAVDQYgAEUEQCAIIAo2AkxBACEVQQAhEAwDCyACIAIoAgAiB0EEajYCACAHKAIAIRBBAAshFSAIIAo2AkwgEEEATg0BQQAgEGshECALQYDAAHIhCwwBCyAIQcwAahCABCIQQQBIDQkgCCgCTCEKC0EAIQdBfyEMAn8gCi0AAEEuRwRAIAohAUEADAELIAotAAFBKkYEQCAKQQJqIQECfwJAIAosAAIQ+wNFDQAgCi0AA0EkRw0AIAEsAABBMGshCSAKQQRqIQECfyAARQRAIAQgCUECdGpBCjYCAEEADAELIAMgCUEDdGooAgALDAELIBUNBkEAIABFDQAaIAIgAigCACIJQQRqNgIAIAkoAgALIQwgCCABNgJMIAxBAE4MAQsgCCAKQQFqNgJMIAhBzABqEIAEIQwgCCgCTCEBQQELIRcDQCAHIQlBHCESIAEiCiwAACIHQfsAa0FGSQ0KIApBAWohASAHIAlBOmxqQb+HAWotAAAiB0EBa0EISQ0ACyAIIAE2AkwCQCAHQRtHBEAgB0UNCyARQQBOBEAgAEUEQCAEIBFBAnRqIAc2AgAMCwsgCCADIBFBA3RqKQMANwNADAILIABFDQcgCEFAayAHIAIgBhCBBAwBCyARQQBODQpBACEHIABFDQcLQX8hEiAALQAAQSBxDQogC0H//3txIhYgCyALQYDAAHEbIQtBACERQeoLIRggFCEPAkACQAJAAn8CQAJAAkACQAJ/AkACQAJAAkACQAJAAkAgCiwAACIHQV9xIAcgB0EPcUEDRhsgByAJGyIHQdgAaw4hBBQUFBQUFBQUDhQPBg4ODhQGFBQUFAIFAxQUCRQBFBQEAAsCQCAHQcEAaw4HDhQLFA4ODgALIAdB0wBGDQkMEwsgCCkDQCEaQeoLDAULQQAhBwJAAkACQAJAAkACQAJAIAlB/wFxDggAAQIDBBoFBhoLIAgoAkAgEzYCAAwZCyAIKAJAIBM2AgAMGAsgCCgCQCATrDcDAAwXCyAIKAJAIBM7AQAMFgsgCCgCQCATOgAADBULIAgoAkAgEzYCAAwUCyAIKAJAIBOsNwMADBMLQQggDCAMQQhNGyEMIAtBCHIhC0H4ACEHCyAUIQkgB0EgcSEWIAgpA0AiGkIAUgRAA0AgCUEBayIJIBqnQQ9xQdCLAWotAAAgFnI6AAAgGkIPViEOIBpCBIghGiAODQALCyAJIQ4gCCkDQFANAyALQQhxRQ0DIAdBBHZB6gtqIRhBAiERDAMLIBQhByAIKQNAIhpCAFIEQANAIAdBAWsiByAap0EHcUEwcjoAACAaQgdWIQkgGkIDiCEaIAkNAAsLIAchDiALQQhxRQ0CIAwgFCAHayIHQQFqIAcgDEgbIQwMAgsgCCkDQCIaQgBTBEAgCEIAIBp9Iho3A0BBASERQeoLDAELIAtBgBBxBEBBASERQesLDAELQewLQeoLIAtBAXEiERsLIRggGiAUEIIEIQ4LIBcgDEEASHENDyALQf//e3EgCyAXGyELAkAgCCkDQCIaQgBSDQAgDA0AIBQhDkEAIQwMDAsgDCAaUCAUIA5raiIHIAcgDEgbIQwMCwsCf0H/////ByAMIAxB/////wdPGyIJIgpBAEchCwJAAkACQCAIKAJAIgdBtNMAIAcbIg4iByIPQQNxRQ0AIApFDQADQCAPLQAARQ0CIApBAWsiCkEARyELIA9BAWoiD0EDcUUNASAKDQALCyALRQ0BAkAgDy0AAEUNACAKQQRJDQADQCAPKAIAIgtBf3MgC0GBgoQIa3FBgIGChHhxDQIgD0EEaiEPIApBBGsiCkEDSw0ACwsgCkUNAQsDQCAPIA8tAABFDQIaIA9BAWohDyAKQQFrIgoNAAsLQQALIg8gB2sgCSAPGyIHIA5qIQ8gDEEATgRAIBYhCyAHIQwMCwsgFiELIAchDCAPLQAADQ4MCgsgDARAIAgoAkAMAgtBACEHIABBICAQQQAgCxCDBAwCCyAIQQA2AgwgCCAIKQNAPgIIIAggCEEIajYCQEF/IQwgCEEIagshDUEAIQcCQANAIA0oAgAiCUUNAQJAIAhBBGogCRCHBCIJQQBIIg4NACAJIAwgB2tLDQAgDUEEaiENIAcgCWoiByAMSQ0BDAILCyAODQ4LQT0hEiAHQQBIDQwgAEEgIBAgByALEIMEIAdFBEBBACEHDAELQQAhCSAIKAJAIQ0DQCANKAIAIg5FDQEgCEEEaiAOEIcEIg4gCWoiCSAHSw0BIAAgCEEEaiAOEP8DIA1BBGohDSAHIAlLDQALCyAAQSAgECAHIAtBgMAAcxCDBCAQIAcgByAQSBshBwwICyAXIAxBAEhxDQlBPSESIAAgCCsDQCAQIAwgCyAHIAURJAAiB0EATg0HDAoLIAggCCkDQDwAN0EBIQwgGSEOIBYhCwwECyAHLQABIQ0gB0EBaiEHDAALAAsgEyESIAANByAVRQ0CQQEhBwNAIAQgB0ECdGooAgAiDQRAIAMgB0EDdGogDSACIAYQgQRBASESIAdBAWoiB0EKRw0BDAkLC0EBIRIgB0EKTw0HA0AgBCAHQQJ0aigCAA0BIAdBAWoiB0EKRw0ACwwHC0EcIRIMBQsgDCAPIA5rIgogCiAMSBsiDCARQf////8Hc0oNA0E9IRIgECAMIBFqIgkgCSAQSBsiByANSg0EIABBICAHIAkgCxCDBCAAIBggERD/AyAAQTAgByAJIAtBgIAEcxCDBCAAQTAgDCAKQQAQgwQgACAOIAoQ/wMgAEEgIAcgCSALQYDAAHMQgwQMAQsLC0EAIRIMAgtBPSESC0GsswEgEjYCAEF/IRILIAhB0ABqJAAgEgu5AQEDfyAALQAAQSBxRQRAAkAgAiAAIgMoAhAiBAR/IAQFIAMQ8gMNASADKAIQCyADKAIUIgVrSwRAIAMgASACIAMoAiQRBQAaDAELAkAgAygCUEEASA0AIAIhAANAIAAiBEUNASABIARBAWsiAGotAABBCkcNAAsgAyABIAQgAygCJBEFACAESQ0BIAEgBGohASACIARrIQIgAygCFCEFCyAFIAEgAhDsAxogAyADKAIUIAJqNgIUCwsLbQEDfyAAKAIALAAAEPsDRQRAQQAPCwNAIAAoAgAhA0F/IQIgAUHMmbPmAE0EQEF/IAMsAABBMGsiAiABQQpsIgFqIAIgAUH/////B3NKGyECCyAAIANBAWo2AgAgAiEBIAMsAAEQ+wMNAAsgAQu2BAACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQCABQQlrDhIAAQIFAwQGBwgJCgsMDQ4PEBESCyACIAIoAgAiAUEEajYCACAAIAEoAgA2AgAPCyACIAIoAgAiAUEEajYCACAAIAE0AgA3AwAPCyACIAIoAgAiAUEEajYCACAAIAE1AgA3AwAPCyACIAIoAgAiAUEEajYCACAAIAE0AgA3AwAPCyACIAIoAgAiAUEEajYCACAAIAE1AgA3AwAPCyACIAIoAgBBB2pBeHEiAUEIajYCACAAIAEpAwA3AwAPCyACIAIoAgAiAUEEajYCACAAIAEyAQA3AwAPCyACIAIoAgAiAUEEajYCACAAIAEzAQA3AwAPCyACIAIoAgAiAUEEajYCACAAIAEwAAA3AwAPCyACIAIoAgAiAUEEajYCACAAIAExAAA3AwAPCyACIAIoAgBBB2pBeHEiAUEIajYCACAAIAEpAwA3AwAPCyACIAIoAgAiAUEEajYCACAAIAE1AgA3AwAPCyACIAIoAgBBB2pBeHEiAUEIajYCACAAIAEpAwA3AwAPCyACIAIoAgBBB2pBeHEiAUEIajYCACAAIAEpAwA3AwAPCyACIAIoAgAiAUEEajYCACAAIAE0AgA3AwAPCyACIAIoAgAiAUEEajYCACAAIAE1AgA3AwAPCyACIAIoAgBBB2pBeHEiAUEIajYCACAAIAErAwA5AwAPCyAAIAIgAxEAAAsLgwECA38BfgJAIABCgICAgBBUBEAgACEFDAELA0AgAUEBayIBIAAgAEIKgCIFQgp+fadBMHI6AAAgAEL/////nwFWIQIgBSEAIAINAAsLIAWnIgIEQANAIAFBAWsiASACIAJBCm4iA0EKbGtBMHI6AAAgAkEJSyEEIAMhAiAEDQALCyABC3IBAX8jAEGAAmsiBSQAAkAgAiADTA0AIARBgMAEcQ0AIAUgAUH/AXEgAiADayIDQYACIANBgAJJIgIbEO4DGiACRQRAA0AgACAFQYACEP8DIANBgAJrIgNB/wFLDQALCyAAIAUgAxD/AwsgBUGAAmokAAu8GAMSfwF8An4jAEGwBGsiCiQAIApBADYCLAJAIAG9IhlCAFMEQEEBIRFB9AshEyABmiIBvSEZDAELIARBgBBxBEBBASERQfcLIRMMAQtB+gtB9QsgBEEBcSIRGyETIBFFIRcLAkAgGUKAgICAgICA+P8Ag0KAgICAgICA+P8AUQRAIABBICACIBFBA2oiBiAEQf//e3EQgwQgACATIBEQ/wMgAEGPHkHJzgAgBUEgcSIHG0G7JEHyzgAgBxsgASABYhtBAxD/AyAAQSAgAiAGIARBgMAAcxCDBCAGIAIgAiAGSBshCQwBCyAKQRBqIRICQAJ/AkAgASAKQSxqEPwDIgEgAaAiAUQAAAAAAAAAAGIEQCAKIAooAiwiBkEBazYCLCAFQSByIhVB4QBHDQEMAwsgBUEgciIVQeEARg0CIAooAiwhFEEGIAMgA0EASBsMAQsgCiAGQR1rIhQ2AiwgAUQAAAAAAACwQaIhAUEGIAMgA0EASBsLIQwgCkEwakGgAkEAIBRBAE4baiIPIQcDQCAHAn8gAUQAAAAAAADwQWMgAUQAAAAAAAAAAGZxBEAgAasMAQtBAAsiBjYCACAHQQRqIQcgASAGuKFEAAAAAGXNzUGiIgFEAAAAAAAAAABiDQALAkAgFEEATARAIBQhAyAHIQYgDyEIDAELIA8hCCAUIQMDQEEdIAMgA0EdThshAwJAIAdBBGsiBiAISQ0AIAOtIRpCACEZA0AgBiAZQv////8PgyAGNQIAIBqGfCIZIBlCgJTr3AOAIhlCgJTr3AN+fT4CACAGQQRrIgYgCE8NAAsgGaciBkUNACAIQQRrIgggBjYCAAsDQCAIIAciBkkEQCAGQQRrIgcoAgBFDQELCyAKIAooAiwgA2siAzYCLCAGIQcgA0EASg0ACwsgA0EASARAIAxBGWpBCW5BAWohECAVQeYARiEWA0BBCUEAIANrIgcgB0EJThshCwJAIAYgCE0EQCAIKAIAIQcMAQtBgJTr3AMgC3YhDUF/IAt0QX9zIQ5BACEDIAghBwNAIAcgBygCACIJIAt2IANqNgIAIAkgDnEgDWwhAyAHQQRqIgcgBkkNAAsgCCgCACEHIANFDQAgBiADNgIAIAZBBGohBgsgCiAKKAIsIAtqIgM2AiwgDyAIIAdFQQJ0aiIIIBYbIgcgEEECdGogBiAGIAdrQQJ1IBBKGyEGIANBAEgNAAsLQQAhAwJAIAYgCE0NACAPIAhrQQJ1QQlsIQNBCiEHIAgoAgAiCUEKSQ0AA0AgA0EBaiEDIAkgB0EKbCIHTw0ACwsgDCADQQAgFUHmAEcbayAVQecARiAMQQBHcWsiByAGIA9rQQJ1QQlsQQlrSARAQQRBpAIgFEEASBsgCmogB0GAyABqIglBCW0iDUECdGpB0B9rIQtBCiEHIAkgDUEJbGsiCUEHTARAA0AgB0EKbCEHIAlBAWoiCUEIRw0ACwsCQCALKAIAIgkgCSAHbiIQIAdsayINRSALQQRqIg4gBkZxDQACQCAQQQFxRQRARAAAAAAAAEBDIQEgB0GAlOvcA0cNASAIIAtPDQEgC0EEay0AAEEBcUUNAQtEAQAAAAAAQEMhAQtEAAAAAAAA4D9EAAAAAAAA8D9EAAAAAAAA+D8gBiAORhtEAAAAAAAA+D8gDSAHQQF2Ig5GGyANIA5JGyEYAkAgFw0AIBMtAABBLUcNACAYmiEYIAGaIQELIAsgCSANayIJNgIAIAEgGKAgAWENACALIAcgCWoiBzYCACAHQYCU69wDTwRAA0AgC0EANgIAIAggC0EEayILSwRAIAhBBGsiCEEANgIACyALIAsoAgBBAWoiBzYCACAHQf+T69wDSw0ACwsgDyAIa0ECdUEJbCEDQQohByAIKAIAIglBCkkNAANAIANBAWohAyAJIAdBCmwiB08NAAsLIAtBBGoiByAGIAYgB0sbIQYLA0AgBiIHIAhNIglFBEAgBkEEayIGKAIARQ0BCwsCQCAVQecARwRAIARBCHEhCwwBCyADQX9zQX8gDEEBIAwbIgYgA0ogA0F7SnEiCxsgBmohDEF/QX4gCxsgBWohBSAEQQhxIgsNAEF3IQYCQCAJDQAgB0EEaygCACILRQ0AQQohCUEAIQYgC0EKcA0AA0AgBiINQQFqIQYgCyAJQQpsIglwRQ0ACyANQX9zIQYLIAcgD2tBAnVBCWwhCSAFQV9xQcYARgRAQQAhCyAMIAYgCWpBCWsiBkEAIAZBAEobIgYgBiAMShshDAwBC0EAIQsgDCADIAlqIAZqQQlrIgZBACAGQQBKGyIGIAYgDEobIQwLQX8hCSAMQf3///8HQf7///8HIAsgDHIiDRtKDQEgDCANQQBHakEBaiEOAkAgBUFfcSIWQcYARgRAIAMgDkH/////B3NKDQMgA0EAIANBAEobIQYMAQsgEiADIANBH3UiBnMgBmutIBIQggQiBmtBAUwEQANAIAZBAWsiBkEwOgAAIBIgBmtBAkgNAAsLIAZBAmsiECAFOgAAIAZBAWtBLUErIANBAEgbOgAAIBIgEGsiBiAOQf////8Hc0oNAgsgBiAOaiIGIBFB/////wdzSg0BIABBICACIAYgEWoiDiAEEIMEIAAgEyAREP8DIABBMCACIA4gBEGAgARzEIMEAkACQAJAIBZBxgBGBEAgCkEQakEIciELIApBEGpBCXIhAyAPIAggCCAPSxsiCSEIA0AgCDUCACADEIIEIQYCQCAIIAlHBEAgBiAKQRBqTQ0BA0AgBkEBayIGQTA6AAAgBiAKQRBqSw0ACwwBCyADIAZHDQAgCkEwOgAYIAshBgsgACAGIAMgBmsQ/wMgCEEEaiIIIA9NDQALIA0EQCAAQbLTAEEBEP8DCyAHIAhNDQEgDEEATA0BA0AgCDUCACADEIIEIgYgCkEQaksEQANAIAZBAWsiBkEwOgAAIAYgCkEQaksNAAsLIAAgBkEJIAwgDEEJThsQ/wMgDEEJayEGIAhBBGoiCCAHTw0DIAxBCUohCSAGIQwgCQ0ACwwCCwJAIAxBAEgNACAHIAhBBGogByAISxshDSAKQRBqQQhyIQ8gCkEQakEJciEDIAghBwNAIAMgBzUCACADEIIEIgZGBEAgCkEwOgAYIA8hBgsCQCAHIAhHBEAgBiAKQRBqTQ0BA0AgBkEBayIGQTA6AAAgBiAKQRBqSw0ACwwBCyAAIAZBARD/AyAGQQFqIQYgCyAMckUNACAAQbLTAEEBEP8DCyAAIAYgAyAGayIJIAwgCSAMSBsQ/wMgDCAJayEMIAdBBGoiByANTw0BIAxBAE4NAAsLIABBMCAMQRJqQRJBABCDBCAAIBAgEiAQaxD/AwwCCyAMIQYLIABBMCAGQQlqQQlBABCDBAsgAEEgIAIgDiAEQYDAAHMQgwQgDiACIAIgDkgbIQkMAQsgEyAFQRp0QR91QQlxaiEOAkAgA0ELSw0AQQwgA2shBkQAAAAAAAAwQCEYA0AgGEQAAAAAAAAwQKIhGCAGQQFrIgYNAAsgDi0AAEEtRgRAIBggAZogGKGgmiEBDAELIAEgGKAgGKEhAQsgEiAKKAIsIgYgBkEfdSIGcyAGa60gEhCCBCIGRgRAIApBMDoADyAKQQ9qIQYLIBFBAnIhCyAFQSBxIQggCigCLCEHIAZBAmsiDSAFQQ9qOgAAIAZBAWtBLUErIAdBAEgbOgAAIARBCHEhCSAKQRBqIQcDQCAHIgYCfyABmUQAAAAAAADgQWMEQCABqgwBC0GAgICAeAsiB0HQiwFqLQAAIAhyOgAAIAEgB7ehRAAAAAAAADBAoiEBAkAgBkEBaiIHIApBEGprQQFHDQACQCAJDQAgA0EASg0AIAFEAAAAAAAAAABhDQELIAZBLjoAASAGQQJqIQcLIAFEAAAAAAAAAABiDQALQX8hCUH9////ByALIBIgDWsiCGoiEGsgA0gNACAAQSAgAiAQIANBAmogByAKQRBqayIGIAZBAmsgA0gbIAYgAxsiA2oiByAEEIMEIAAgDiALEP8DIABBMCACIAcgBEGAgARzEIMEIAAgCkEQaiAGEP8DIABBMCADIAZrQQBBABCDBCAAIA0gCBD/AyAAQSAgAiAHIARBgMAAcxCDBCAHIAIgAiAHSBshCQsgCkGwBGokACAJC40FAgZ+An8gASABKAIAQQdqQXhxIgFBEGo2AgAgACABKQMAIQQgASkDCCEFIwBBIGsiACQAAkAgBUL///////////8AgyIDQoCAgICAgMCAPH0gA0KAgICAgIDA/8MAfVQEQCAFQgSGIARCPIiEIQMgBEL//////////w+DIgRCgYCAgICAgIAIWgRAIANCgYCAgICAgIDAAHwhAgwCCyADQoCAgICAgICAQH0hAiAEQoCAgICAgICACFINASACIANCAYN8IQIMAQsgBFAgA0KAgICAgIDA//8AVCADQoCAgICAgMD//wBRG0UEQCAFQgSGIARCPIiEQv////////8Dg0KAgICAgICA/P8AhCECDAELQoCAgICAgID4/wAhAiADQv///////7//wwBWDQBCACECIANCMIinIgFBkfcASQ0AIABBEGohCSAEIQIgBUL///////8/g0KAgICAgIDAAIQiAyEGAkAgAUGB9wBrIghBwABxBEAgAiAIQUBqrYYhBkIAIQIMAQsgCEUNACAGIAitIgeGIAJBwAAgCGutiIQhBiACIAeGIQILIAkgAjcDACAJIAY3AwgCQEGB+AAgAWsiAUHAAHEEQCADIAFBQGqtiCEEQgAhAwwBCyABRQ0AIANBwAAgAWuthiAEIAGtIgKIhCEEIAMgAoghAwsgACAENwMAIAAgAzcDCCAAKQMIQgSGIAApAwAiA0I8iIQhAiAAKQMQIAApAxiEQgBSrSADQv//////////D4OEIgNCgYCAgICAgIAIWgRAIAJCAXwhAgwBCyADQoCAgICAgICACFINACACQgGDIAJ8IQILIABBIGokACACIAVCgICAgICAgICAf4OEvzkDAAsWACAARQRAQQAPC0GsswEgADYCAEF/C6ICACAARQRAQQAPCwJ/AkAgAAR/IAFB/wBNDQECQEHQtAEoAgAoAgBFBEAgAUGAf3FBgL8DRg0DQayzAUEZNgIADAELIAFB/w9NBEAgACABQT9xQYABcjoAASAAIAFBBnZBwAFyOgAAQQIMBAsgAUGAQHFBgMADRyABQYCwA09xRQRAIAAgAUE/cUGAAXI6AAIgACABQQx2QeABcjoAACAAIAFBBnZBP3FBgAFyOgABQQMMBAsgAUGAgARrQf//P00EQCAAIAFBP3FBgAFyOgADIAAgAUESdkHwAXI6AAAgACABQQZ2QT9xQYABcjoAAiAAIAFBDHZBP3FBgAFyOgABQQQMBAtBrLMBQRk2AgALQX8FQQELDAELIAAgAToAAEEBCwtSAQJ/QcSRASgCACIBIABBB2pBeHEiAmohAAJAIAJBACAAIAFNGw0AIAA/AEEQdEsEQCAAEARFDQELQcSRASAANgIAIAEPC0GsswFBMDYCAEF/C/AoAQt/IwBBEGsiCiQAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQCAAQfQBTQRAQYi9ASgCACIGQRAgAEELakF4cSAAQQtJGyIEQQN2IgF2IgBBA3EEQAJAIABBf3NBAXEgAWoiA0EDdCIBQbC9AWoiACABQbi9AWooAgAiASgCCCIERgRAQYi9ASAGQX4gA3dxNgIADAELIAQgADYCDCAAIAQ2AggLIAFBCGohACABIANBA3QiA0EDcjYCBCABIANqIgEgASgCBEEBcjYCBAwPCyAEQZC9ASgCACIHTQ0BIAAEQAJAIAAgAXRBAiABdCIAQQAgAGtycWgiAUEDdCIAQbC9AWoiAyAAQbi9AWooAgAiACgCCCICRgRAQYi9ASAGQX4gAXdxIgY2AgAMAQsgAiADNgIMIAMgAjYCCAsgACAEQQNyNgIEIAAgBGoiAiABQQN0IgEgBGsiA0EBcjYCBCAAIAFqIAM2AgAgBwRAIAdBeHFBsL0BaiEEQZy9ASgCACEBAn8gBkEBIAdBA3Z0IgVxRQRAQYi9ASAFIAZyNgIAIAQMAQsgBCgCCAshBSAEIAE2AgggBSABNgIMIAEgBDYCDCABIAU2AggLIABBCGohAEGcvQEgAjYCAEGQvQEgAzYCAAwPC0GMvQEoAgAiC0UNASALaEECdEG4vwFqKAIAIgIoAgRBeHEgBGshASACIQMDQAJAIAMoAhAiAEUEQCADKAIUIgBFDQELIAAoAgRBeHEgBGsiAyABIAEgA0siAxshASAAIAIgAxshAiAAIQMMAQsLIAIoAhghCSACIAIoAgwiBUcEQEGYvQEoAgAaIAIoAggiACAFNgIMIAUgADYCCAwOCyACQRRqIgMoAgAiAEUEQCACKAIQIgBFDQMgAkEQaiEDCwNAIAMhCCAAIgVBFGoiAygCACIADQAgBUEQaiEDIAUoAhAiAA0ACyAIQQA2AgAMDQtBfyEEIABBv39LDQAgAEELaiIAQXhxIQRBjL0BKAIAIgdFDQBBACAEayEBAkACQAJAAn9BACAEQYACSQ0AGkEfIARB////B0sNABogBEEmIABBCHZnIgBrdkEBcSAAQQF0a0E+agsiCEECdEG4vwFqKAIAIgNFBEBBACEADAELQQAhACAEQRkgCEEBdmtBACAIQR9HG3QhAgNAAkAgAygCBEF4cSAEayIGIAFPDQAgAyEFIAYiAQ0AQQAhASADIQAMAwsgACADKAIUIgYgBiADIAJBHXZBBHFqKAIQIgNGGyAAIAYbIQAgAkEBdCECIAMNAAsLIAAgBXJFBEBBACEFQQIgCHQiAEEAIABrciAHcSIARQ0DIABoQQJ0Qbi/AWooAgAhAAsgAEUNAQsDQCAAKAIEQXhxIARrIgYgAUkhAiAGIAEgAhshASAAIAUgAhshBSAAKAIQIgMEfyADBSAAKAIUCyIADQALCyAFRQ0AIAFBkL0BKAIAIARrTw0AIAUoAhghCCAFIAUoAgwiAkcEQEGYvQEoAgAaIAUoAggiACACNgIMIAIgADYCCAwMCyAFQRRqIgMoAgAiAEUEQCAFKAIQIgBFDQMgBUEQaiEDCwNAIAMhBiAAIgJBFGoiAygCACIADQAgAkEQaiEDIAIoAhAiAA0ACyAGQQA2AgAMCwsgBEGQvQEoAgAiAE0EQEGcvQEoAgAhAQJAIAAgBGsiA0EQTwRAIAEgBGoiAiADQQFyNgIEIAAgAWogAzYCACABIARBA3I2AgQMAQsgASAAQQNyNgIEIAAgAWoiACAAKAIEQQFyNgIEQQAhAkEAIQMLQZC9ASADNgIAQZy9ASACNgIAIAFBCGohAAwNCyAEQZS9ASgCACICSQRAQZS9ASACIARrIgE2AgBBoL0BQaC9ASgCACIAIARqIgM2AgAgAyABQQFyNgIEIAAgBEEDcjYCBCAAQQhqIQAMDQtBACEAIARBL2oiBwJ/QeDAASgCAARAQejAASgCAAwBC0HswAFCfzcCAEHkwAFCgKCAgICABDcCAEHgwAEgCkEMakFwcUHYqtWqBXM2AgBB9MABQQA2AgBBxMABQQA2AgBBgCALIgFqIgZBACABayIIcSIFIARNDQxBwMABKAIAIgEEQEG4wAEoAgAiAyAFaiIJIANNDQ0gASAJSQ0NCwJAQcTAAS0AAEEEcUUEQAJAAkACQAJAQaC9ASgCACIBBEBByMABIQADQCABIAAoAgAiA08EQCADIAAoAgRqIAFLDQMLIAAoAggiAA0ACwtBABCIBCICQX9GDQMgBSEGQeTAASgCACIAQQFrIgEgAnEEQCAFIAJrIAEgAmpBACAAa3FqIQYLIAQgBk8NA0HAwAEoAgAiAARAQbjAASgCACIBIAZqIgMgAU0NBCAAIANJDQQLIAYQiAQiACACRw0BDAULIAYgAmsgCHEiBhCIBCICIAAoAgAgACgCBGpGDQEgAiEACyAAQX9GDQEgBEEwaiAGTQRAIAAhAgwEC0HowAEoAgAiASAHIAZrakEAIAFrcSIBEIgEQX9GDQEgASAGaiEGIAAhAgwDCyACQX9HDQILQcTAAUHEwAEoAgBBBHI2AgALIAUQiAQhAkEAEIgEIQAgAkF/Rg0FIABBf0YNBSAAIAJNDQUgACACayIGIARBKGpNDQULQbjAAUG4wAEoAgAgBmoiADYCAEG8wAEoAgAgAEkEQEG8wAEgADYCAAsCQEGgvQEoAgAiAQRAQcjAASEAA0AgAiAAKAIAIgMgACgCBCIFakYNAiAAKAIIIgANAAsMBAtBmL0BKAIAIgBBACAAIAJNG0UEQEGYvQEgAjYCAAtBACEAQczAASAGNgIAQcjAASACNgIAQai9AUF/NgIAQay9AUHgwAEoAgA2AgBB1MABQQA2AgADQCAAQQN0IgFBuL0BaiABQbC9AWoiAzYCACABQby9AWogAzYCACAAQQFqIgBBIEcNAAtBlL0BIAZBKGsiAEF4IAJrQQdxIgFrIgM2AgBBoL0BIAEgAmoiATYCACABIANBAXI2AgQgACACakEoNgIEQaS9AUHwwAEoAgA2AgAMBAsgASACTw0CIAEgA0kNAiAAKAIMQQhxDQIgACAFIAZqNgIEQaC9ASABQXggAWtBB3EiAGoiAzYCAEGUvQFBlL0BKAIAIAZqIgIgAGsiADYCACADIABBAXI2AgQgASACakEoNgIEQaS9AUHwwAEoAgA2AgAMAwtBACEFDAoLQQAhAgwIC0GYvQEoAgAgAksEQEGYvQEgAjYCAAsgAiAGaiEDQcjAASEAAkACQAJAA0AgAyAAKAIARwRAIAAoAggiAA0BDAILCyAALQAMQQhxRQ0BC0HIwAEhAANAIAEgACgCACIDTwRAIAMgACgCBGoiAyABSw0DCyAAKAIIIQAMAAsACyAAIAI2AgAgACAAKAIEIAZqNgIEIAJBeCACa0EHcWoiCCAEQQNyNgIEIANBeCADa0EHcWoiBiAEIAhqIgRrIQAgASAGRgRAQaC9ASAENgIAQZS9AUGUvQEoAgAgAGoiADYCACAEIABBAXI2AgQMCAtBnL0BKAIAIAZGBEBBnL0BIAQ2AgBBkL0BQZC9ASgCACAAaiIANgIAIAQgAEEBcjYCBCAAIARqIAA2AgAMCAsgBigCBCIBQQNxQQFHDQYgAUF4cSEHIAFB/wFNBEAgAUEDdiEFIAYoAgwiASAGKAIIIgNGBEBBiL0BQYi9ASgCAEF+IAV3cTYCAAwHCyADIAE2AgwgASADNgIIDAYLIAYoAhghCSAGIAYoAgwiAkcEQCAGKAIIIgEgAjYCDCACIAE2AggMBQsgBkEUaiIDKAIAIgFFBEAgBigCECIBRQ0EIAZBEGohAwsDQCADIQUgASICQRRqIgMoAgAiAQ0AIAJBEGohAyACKAIQIgENAAsgBUEANgIADAQLQZS9ASAGQShrIgBBeCACa0EHcSIFayIINgIAQaC9ASACIAVqIgU2AgAgBSAIQQFyNgIEIAAgAmpBKDYCBEGkvQFB8MABKAIANgIAIAEgA0EnIANrQQdxakEvayIAIAAgAUEQakkbIgVBGzYCBCAFQdDAASkCADcCECAFQcjAASkCADcCCEHQwAEgBUEIajYCAEHMwAEgBjYCAEHIwAEgAjYCAEHUwAFBADYCACAFQRhqIQADQCAAQQc2AgQgAEEIaiECIABBBGohACACIANJDQALIAEgBUYNACAFIAUoAgRBfnE2AgQgASAFIAFrIgJBAXI2AgQgBSACNgIAIAJB/wFNBEAgAkF4cUGwvQFqIQACf0GIvQEoAgAiA0EBIAJBA3Z0IgJxRQRAQYi9ASACIANyNgIAIAAMAQsgACgCCAshAyAAIAE2AgggAyABNgIMIAEgADYCDCABIAM2AggMAQtBHyEAIAJB////B00EQCACQSYgAkEIdmciAGt2QQFxIABBAXRrQT5qIQALIAEgADYCHCABQgA3AhAgAEECdEG4vwFqIQMCQAJAQYy9ASgCACIFQQEgAHQiBnFFBEBBjL0BIAUgBnI2AgAgAyABNgIAIAEgAzYCGAwBCyACQRkgAEEBdmtBACAAQR9HG3QhACADKAIAIQUDQCAFIgMoAgRBeHEgAkYNAiAAQR12IQUgAEEBdCEAIAMgBUEEcWpBEGoiBigCACIFDQALIAYgATYCACABIAM2AhgLIAEgATYCDCABIAE2AggMAQsgAygCCCIAIAE2AgwgAyABNgIIIAFBADYCGCABIAM2AgwgASAANgIIC0GUvQEoAgAiACAETQ0AQZS9ASAAIARrIgE2AgBBoL0BQaC9ASgCACIAIARqIgM2AgAgAyABQQFyNgIEIAAgBEEDcjYCBCAAQQhqIQAMCAtBrLMBQTA2AgBBACEADAcLQQAhAgsgCUUNAAJAIAYoAhwiA0ECdEG4vwFqIgEoAgAgBkYEQCABIAI2AgAgAg0BQYy9AUGMvQEoAgBBfiADd3E2AgAMAgsgCUEQQRQgCSgCECAGRhtqIAI2AgAgAkUNAQsgAiAJNgIYIAYoAhAiAQRAIAIgATYCECABIAI2AhgLIAYoAhQiAUUNACACIAE2AhQgASACNgIYCyAAIAdqIQAgBiAHaiIGKAIEIQELIAYgAUF+cTYCBCAEIABBAXI2AgQgACAEaiAANgIAIABB/wFNBEAgAEF4cUGwvQFqIQECf0GIvQEoAgAiA0EBIABBA3Z0IgBxRQRAQYi9ASAAIANyNgIAIAEMAQsgASgCCAshACABIAQ2AgggACAENgIMIAQgATYCDCAEIAA2AggMAQtBHyEBIABB////B00EQCAAQSYgAEEIdmciAWt2QQFxIAFBAXRrQT5qIQELIAQgATYCHCAEQgA3AhAgAUECdEG4vwFqIQMCQAJAQYy9ASgCACICQQEgAXQiBXFFBEBBjL0BIAIgBXI2AgAgAyAENgIAIAQgAzYCGAwBCyAAQRkgAUEBdmtBACABQR9HG3QhASADKAIAIQIDQCACIgMoAgRBeHEgAEYNAiABQR12IQIgAUEBdCEBIAMgAkEEcWpBEGoiBSgCACICDQALIAUgBDYCACAEIAM2AhgLIAQgBDYCDCAEIAQ2AggMAQsgAygCCCIAIAQ2AgwgAyAENgIIIARBADYCGCAEIAM2AgwgBCAANgIICyAIQQhqIQAMAgsCQCAIRQ0AAkAgBSgCHCIDQQJ0Qbi/AWoiACgCACAFRgRAIAAgAjYCACACDQFBjL0BIAdBfiADd3EiBzYCAAwCCyAIQRBBFCAIKAIQIAVGG2ogAjYCACACRQ0BCyACIAg2AhggBSgCECIABEAgAiAANgIQIAAgAjYCGAsgBSgCFCIARQ0AIAIgADYCFCAAIAI2AhgLAkAgAUEPTQRAIAUgASAEaiIAQQNyNgIEIAAgBWoiACAAKAIEQQFyNgIEDAELIAUgBEEDcjYCBCAEIAVqIgIgAUEBcjYCBCABIAJqIAE2AgAgAUH/AU0EQCABQXhxQbC9AWohAAJ/QYi9ASgCACIDQQEgAUEDdnQiAXFFBEBBiL0BIAEgA3I2AgAgAAwBCyAAKAIICyEBIAAgAjYCCCABIAI2AgwgAiAANgIMIAIgATYCCAwBC0EfIQAgAUH///8HTQRAIAFBJiABQQh2ZyIAa3ZBAXEgAEEBdGtBPmohAAsgAiAANgIcIAJCADcCECAAQQJ0Qbi/AWohAwJAAkAgB0EBIAB0IgRxRQRAQYy9ASAEIAdyNgIAIAMgAjYCACACIAM2AhgMAQsgAUEZIABBAXZrQQAgAEEfRxt0IQAgAygCACEEA0AgBCIDKAIEQXhxIAFGDQIgAEEddiEEIABBAXQhACADIARBBHFqQRBqIgYoAgAiBA0ACyAGIAI2AgAgAiADNgIYCyACIAI2AgwgAiACNgIIDAELIAMoAggiACACNgIMIAMgAjYCCCACQQA2AhggAiADNgIMIAIgADYCCAsgBUEIaiEADAELAkAgCUUNAAJAIAIoAhwiA0ECdEG4vwFqIgAoAgAgAkYEQCAAIAU2AgAgBQ0BQYy9ASALQX4gA3dxNgIADAILIAlBEEEUIAkoAhAgAkYbaiAFNgIAIAVFDQELIAUgCTYCGCACKAIQIgAEQCAFIAA2AhAgACAFNgIYCyACKAIUIgBFDQAgBSAANgIUIAAgBTYCGAsCQCABQQ9NBEAgAiABIARqIgBBA3I2AgQgACACaiIAIAAoAgRBAXI2AgQMAQsgAiAEQQNyNgIEIAIgBGoiAyABQQFyNgIEIAEgA2ogATYCACAHBEAgB0F4cUGwvQFqIQRBnL0BKAIAIQACf0EBIAdBA3Z0IgUgBnFFBEBBiL0BIAUgBnI2AgAgBAwBCyAEKAIICyEFIAQgADYCCCAFIAA2AgwgACAENgIMIAAgBTYCCAtBnL0BIAM2AgBBkL0BIAE2AgALIAJBCGohAAsgCkEQaiQAIAAL9QsBB38CQCAARQ0AIABBCGsiAiAAQQRrKAIAIgFBeHEiAGohBQJAIAFBAXENACABQQNxRQ0BIAIgAigCACIBayICQZi9ASgCAEkNASAAIAFqIQACQAJAQZy9ASgCACACRwRAIAFB/wFNBEAgAUEDdiEHIAIoAgwiASACKAIIIgRGBEBBiL0BQYi9ASgCAEF+IAd3cTYCAAwFCyAEIAE2AgwgASAENgIIDAQLIAIoAhghBiACIAIoAgwiA0cEQCACKAIIIgEgAzYCDCADIAE2AggMAwsgAkEUaiIEKAIAIgFFBEAgAigCECIBRQ0CIAJBEGohBAsDQCAEIQcgASIDQRRqIgQoAgAiAQ0AIANBEGohBCADKAIQIgENAAsgB0EANgIADAILIAUoAgQiAUEDcUEDRw0CQZC9ASAANgIAIAUgAUF+cTYCBCACIABBAXI2AgQgBSAANgIADwtBACEDCyAGRQ0AAkAgAigCHCIEQQJ0Qbi/AWoiASgCACACRgRAIAEgAzYCACADDQFBjL0BQYy9ASgCAEF+IAR3cTYCAAwCCyAGQRBBFCAGKAIQIAJGG2ogAzYCACADRQ0BCyADIAY2AhggAigCECIBBEAgAyABNgIQIAEgAzYCGAsgAigCFCIBRQ0AIAMgATYCFCABIAM2AhgLIAIgBU8NACAFKAIEIgFBAXFFDQACQAJAAkACQCABQQJxRQRAQaC9ASgCACAFRgRAQaC9ASACNgIAQZS9AUGUvQEoAgAgAGoiADYCACACIABBAXI2AgQgAkGcvQEoAgBHDQZBkL0BQQA2AgBBnL0BQQA2AgAPC0GcvQEoAgAgBUYEQEGcvQEgAjYCAEGQvQFBkL0BKAIAIABqIgA2AgAgAiAAQQFyNgIEIAAgAmogADYCAA8LIAFBeHEgAGohACABQf8BTQRAIAFBA3YhByAFKAIMIgEgBSgCCCIERgRAQYi9AUGIvQEoAgBBfiAHd3E2AgAMBQsgBCABNgIMIAEgBDYCCAwECyAFKAIYIQYgBSAFKAIMIgNHBEBBmL0BKAIAGiAFKAIIIgEgAzYCDCADIAE2AggMAwsgBUEUaiIEKAIAIgFFBEAgBSgCECIBRQ0CIAVBEGohBAsDQCAEIQcgASIDQRRqIgQoAgAiAQ0AIANBEGohBCADKAIQIgENAAsgB0EANgIADAILIAUgAUF+cTYCBCACIABBAXI2AgQgACACaiAANgIADAMLQQAhAwsgBkUNAAJAIAUoAhwiBEECdEG4vwFqIgEoAgAgBUYEQCABIAM2AgAgAw0BQYy9AUGMvQEoAgBBfiAEd3E2AgAMAgsgBkEQQRQgBigCECAFRhtqIAM2AgAgA0UNAQsgAyAGNgIYIAUoAhAiAQRAIAMgATYCECABIAM2AhgLIAUoAhQiAUUNACADIAE2AhQgASADNgIYCyACIABBAXI2AgQgACACaiAANgIAIAJBnL0BKAIARw0AQZC9ASAANgIADwsgAEH/AU0EQCAAQXhxQbC9AWohAQJ/QYi9ASgCACIEQQEgAEEDdnQiAHFFBEBBiL0BIAAgBHI2AgAgAQwBCyABKAIICyEAIAEgAjYCCCAAIAI2AgwgAiABNgIMIAIgADYCCA8LQR8hASAAQf///wdNBEAgAEEmIABBCHZnIgFrdkEBcSABQQF0a0E+aiEBCyACIAE2AhwgAkIANwIQIAFBAnRBuL8BaiEEAkACQAJAQYy9ASgCACIDQQEgAXQiBXFFBEBBjL0BIAMgBXI2AgAgBCACNgIAIAIgBDYCGAwBCyAAQRkgAUEBdmtBACABQR9HG3QhASAEKAIAIQMDQCADIgQoAgRBeHEgAEYNAiABQR12IQMgAUEBdCEBIAQgA0EEcWpBEGoiBSgCACIDDQALIAUgAjYCACACIAQ2AhgLIAIgAjYCDCACIAI2AggMAQsgBCgCCCIAIAI2AgwgBCACNgIIIAJBADYCGCACIAQ2AgwgAiAANgIIC0GovQFBqL0BKAIAQQFrIgJBfyACGzYCAAsLtgsBBn8gACABaiEFAkACQCAAKAIEIgJBAXENACACQQNxRQ0BIAAoAgAiAiABaiEBAkACQAJAIAAgAmsiAEGcvQEoAgBHBEAgAkH/AU0EQCACQQN2IQcgACgCCCIEIAAoAgwiAkcNAkGIvQFBiL0BKAIAQX4gB3dxNgIADAULIAAoAhghBiAAIAAoAgwiA0cEQEGYvQEoAgAaIAAoAggiAiADNgIMIAMgAjYCCAwECyAAQRRqIgQoAgAiAkUEQCAAKAIQIgJFDQMgAEEQaiEECwNAIAQhByACIgNBFGoiBCgCACICDQAgA0EQaiEEIAMoAhAiAg0ACyAHQQA2AgAMAwsgBSgCBCICQQNxQQNHDQNBkL0BIAE2AgAgBSACQX5xNgIEIAAgAUEBcjYCBCAFIAE2AgAPCyAEIAI2AgwgAiAENgIIDAILQQAhAwsgBkUNAAJAIAAoAhwiBEECdEG4vwFqIgIoAgAgAEYEQCACIAM2AgAgAw0BQYy9AUGMvQEoAgBBfiAEd3E2AgAMAgsgBkEQQRQgBigCECAARhtqIAM2AgAgA0UNAQsgAyAGNgIYIAAoAhAiAgRAIAMgAjYCECACIAM2AhgLIAAoAhQiAkUNACADIAI2AhQgAiADNgIYCwJAAkACQAJAIAUoAgQiAkECcUUEQEGgvQEoAgAgBUYEQEGgvQEgADYCAEGUvQFBlL0BKAIAIAFqIgE2AgAgACABQQFyNgIEIABBnL0BKAIARw0GQZC9AUEANgIAQZy9AUEANgIADwtBnL0BKAIAIAVGBEBBnL0BIAA2AgBBkL0BQZC9ASgCACABaiIBNgIAIAAgAUEBcjYCBCAAIAFqIAE2AgAPCyACQXhxIAFqIQEgAkH/AU0EQCACQQN2IQcgBSgCDCICIAUoAggiBEYEQEGIvQFBiL0BKAIAQX4gB3dxNgIADAULIAQgAjYCDCACIAQ2AggMBAsgBSgCGCEGIAUgBSgCDCIDRwRAQZi9ASgCABogBSgCCCICIAM2AgwgAyACNgIIDAMLIAVBFGoiBCgCACICRQRAIAUoAhAiAkUNAiAFQRBqIQQLA0AgBCEHIAIiA0EUaiIEKAIAIgINACADQRBqIQQgAygCECICDQALIAdBADYCAAwCCyAFIAJBfnE2AgQgACABQQFyNgIEIAAgAWogATYCAAwDC0EAIQMLIAZFDQACQCAFKAIcIgRBAnRBuL8BaiICKAIAIAVGBEAgAiADNgIAIAMNAUGMvQFBjL0BKAIAQX4gBHdxNgIADAILIAZBEEEUIAYoAhAgBUYbaiADNgIAIANFDQELIAMgBjYCGCAFKAIQIgIEQCADIAI2AhAgAiADNgIYCyAFKAIUIgJFDQAgAyACNgIUIAIgAzYCGAsgACABQQFyNgIEIAAgAWogATYCACAAQZy9ASgCAEcNAEGQvQEgATYCAA8LIAFB/wFNBEAgAUF4cUGwvQFqIQICf0GIvQEoAgAiBEEBIAFBA3Z0IgFxRQRAQYi9ASABIARyNgIAIAIMAQsgAigCCAshASACIAA2AgggASAANgIMIAAgAjYCDCAAIAE2AggPC0EfIQIgAUH///8HTQRAIAFBJiABQQh2ZyICa3ZBAXEgAkEBdGtBPmohAgsgACACNgIcIABCADcCECACQQJ0Qbi/AWohBAJAAkBBjL0BKAIAIgNBASACdCIFcUUEQEGMvQEgAyAFcjYCACAEIAA2AgAgACAENgIYDAELIAFBGSACQQF2a0EAIAJBH0cbdCECIAQoAgAhAwNAIAMiBCgCBEF4cSABRg0CIAJBHXYhAyACQQF0IQIgBCADQQRxakEQaiIFKAIAIgMNAAsgBSAANgIAIAAgBDYCGAsgACAANgIMIAAgADYCCA8LIAQoAggiASAANgIMIAQgADYCCCAAQQA2AhggACAENgIMIAAgATYCCAsLHwBB+MABKAIARQRAQfjAASAANgIAQfzAASABNgIACws3AQF/QQEgACAAQQFNGyEBAkADQCABEIkEIgANAUGAwQEoAgAiAARAIAARFgAMAQsLEAAACyAACwUAEAAAC3QBAX8gAkUEQCAAKAIEIAEoAgRGDwsgACABRgRAQQEPCyABKAIEIgItAAAhAQJAIAAoAgQiAy0AACIARQ0AIAAgAUcNAANAIAItAAEhASADLQABIgBFDQEgAkEBaiECIANBAWohAyAAIAFGDQALCyAAIAFGC9IDAQR/IwBBQGoiBCQAAn9BASAAIAFBABCPBA0AGkEAIAFFDQAaIwBBQGoiAyQAIAEoAgAiBUEEaygCACEGIAVBCGsoAgAhBSADQgA3AiAgA0IANwIoIANCADcCMCADQgA3ADcgA0IANwIYIANBADYCFCADQYSMATYCECADIAE2AgwgA0G0jAE2AgggASAFaiEBQQAhBQJAIAZBtIwBQQAQjwQEQCADQQE2AjggBiADQQhqIAEgAUEBQQAgBigCACgCFBEVACABQQAgAygCIEEBRhshBQwBCyAGIANBCGogAUEBQQAgBigCACgCGBELAAJAAkAgAygCLA4CAAECCyADKAIcQQAgAygCKEEBRhtBACADKAIkQQFGG0EAIAMoAjBBAUYbIQUMAQsgAygCIEEBRwRAIAMoAjANASADKAIkQQFHDQEgAygCKEEBRw0BCyADKAIYIQULIANBQGskAEEAIAUiAUUNABogBEEMakEAQTQQ7gMaIARBATYCOCAEQX82AhQgBCAANgIQIAQgATYCCCABIARBCGogAigCAEEBIAEoAgAoAhwRBgAgBCgCICIAQQFGBEAgAiAEKAIYNgIACyAAQQFGCyEAIARBQGskACAAC10BAX8gACgCECIDRQRAIABBATYCJCAAIAI2AhggACABNgIQDwsCQCABIANGBEAgACgCGEECRw0BIAAgAjYCGA8LIABBAToANiAAQQI2AhggACAAKAIkQQFqNgIkCwsaACAAIAEoAghBABCPBARAIAEgAiADEJEECwszACAAIAEoAghBABCPBARAIAEgAiADEJEEDwsgACgCCCIAIAEgAiADIAAoAgAoAhwRBgALmgEAIABBAToANQJAIAAoAgQgAkcNACAAQQE6ADQCQCAAKAIQIgJFBEAgAEEBNgIkIAAgAzYCGCAAIAE2AhAgA0EBRw0CIAAoAjBBAUYNAQwCCyABIAJGBEAgACgCGCICQQJGBEAgACADNgIYIAMhAgsgACgCMEEBRw0CIAJBAUYNAQwCCyAAIAAoAiRBAWo2AiQLIABBAToANgsLIAACQCAAKAIEIAFHDQAgACgCHEEBRg0AIAAgAjYCHAsL9QEAIAAgASgCCCAEEI8EBEAgASACIAMQlQQPCwJAIAAgASgCACAEEI8EBEACQCACIAEoAhBHBEAgASgCFCACRw0BCyADQQFHDQIgAUEBNgIgDwsgASADNgIgAkAgASgCLEEERg0AIAFBADsBNCAAKAIIIgAgASACIAJBASAEIAAoAgAoAhQRFQAgAS0ANQRAIAFBAzYCLCABLQA0RQ0BDAMLIAFBBDYCLAsgASACNgIUIAEgASgCKEEBajYCKCABKAIkQQFHDQEgASgCGEECRw0BIAFBAToANg8LIAAoAggiACABIAIgAyAEIAAoAgAoAhgRCwALC5QBACAAIAEoAgggBBCPBARAIAEgAiADEJUEDwsCQCAAIAEoAgAgBBCPBEUNAAJAIAIgASgCEEcEQCABKAIUIAJHDQELIANBAUcNASABQQE2AiAPCyABIAI2AhQgASADNgIgIAEgASgCKEEBajYCKAJAIAEoAiRBAUcNACABKAIYQQJHDQAgAUEBOgA2CyABQQQ2AiwLCzkAIAAgASgCCCAFEI8EBEAgASACIAMgBBCUBA8LIAAoAggiACABIAIgAyAEIAUgACgCACgCFBEVAAscACAAIAEoAgggBRCPBARAIAEgAiADIAQQlAQLCwQAIwALBgAgACQACxAAIwAgAGtBcHEiACQAIAALIgEBfiABIAKtIAOtQiCGhCAEIAARGQAiBUIgiKckASAFpwsLhYcBGwBBgAgLpVxkSm9pbnRHcm91cEVtcHR5AGRXb3JsZFNldEdyYXZpdHkAZFdvcmxkR2V0R3Jhdml0eQBkUlNldElkZW50aXR5AGRRU2V0SWRlbnRpdHkAZEJvZHlEZXN0cm95AGRKb2ludERlc3Ryb3kAZEpvaW50R3JvdXBEZXN0cm95AGRHZW9tRGVzdHJveQBkU3BhY2VEZXN0cm95AGRXb3JsZERlc3Ryb3kAZEdlb21IZWlnaHRmaWVsZERhdGFEZXN0cm95AGRGYWN0b3JDaG9sZXNreQBkU29sdmVDaG9sZXNreQBkR2VvbVNldEJvZHkAZEpvaW50R2V0Qm9keQBkR2VvbUdldEJvZHkAc2V0U2l6ZSgpIG91dCBvZiBzcGFjZSBpbiBMT0NBTCBhcnJheQBkQ29sbGlkZVJheUJveABkQ29sbGlkZUJveEJveABkQ29sbGlkZUNvbnZleEJveABkeEJveABkQ29sbGlkZUN5bGluZGVyQm94AGRDb2xsaWRlU3BoZXJlQm94AGRDb2xsaWRlQ2Fwc3VsZUJveABkSW52ZXJ0UERNYXRyaXgAZENvbGxpZGVSYXlDb252ZXgAZENvbGxpZGVDb252ZXhDb252ZXgAZENvbGxpZGVTcGhlcmVDb252ZXgALSsgICAwWDB4AC0wWCswWCAwWC0weCsweCAweABkTWFzc0FkanVzdABkQm9keUdldEpvaW50AGNyZWF0ZUpvaW50AGRDb2xsaWRlSGVpZ2h0ZmllbGRVbml0AGRKb2ludEluaXQAZEdlb21SYXlHZXRDbG9zZXN0SGl0AEdldEhlaWdodABkR2VvbVJheVNldABkR2VvbVJheUdldABkSm9pbnRDcmVhdGVDb250YWN0AGRHZW9tU3BoZXJlU2V0UmFkaXVzAGRHZW9tU3BoZXJlR2V0UmFkaXVzAHdhcm5pbmc6IGRlc3Ryb3lpbmcgd29ybGQgY29udGFpbmluZyBncm91cGVkIGpvaW50cwBjdWxsUG9pbnRzAGRCb2R5R2V0TnVtSm9pbnRzAGRCb2R5U2V0QXV0b0Rpc2FibGVEZWZhdWx0cwBkR2VvbUdldENsYXNzAGRCb2R5U2V0TWFzcwBkQm9keUdldE1hc3MAZE1hc3NTZXRQYXJhbWV0ZXJzAGRXb3JsZEdldEF1dG9EaXNhYmxlU3RlcHMAZEJvZHlHZXRSZWxQb2ludFBvcwBkQm9keUFkZFJlbEZvcmNlQXRQb3MAZEJvZHlBZGRGb3JjZUF0UG9zAGRCb2R5QWRkUmVsRm9yY2VBdFJlbFBvcwBkQm9keUFkZEZvcmNlQXRSZWxQb3MAZFdvcmxkU2V0UXVpY2tTdGVwTnVtSXRlcmF0aW9ucwBkR2VvbVBsYW5lU2V0UGFyYW1zAGRHZW9tQ2Fwc3VsZVNldFBhcmFtcwBkR2VvbVJheUdldFBhcmFtcwBkR2VvbUN5bGluZGVyR2V0UGFyYW1zAGRHZW9tUGxhbmVHZXRQYXJhbXMAZEdlb21DYXBzdWxlR2V0UGFyYW1zAHN3YXBSb3dzQW5kQ29scwBzZXRMZXZlbHMAZEhhc2hTcGFjZVNldExldmVscwBkSGFzaFNwYWNlR2V0TGV2ZWxzAGRKb2ludFNldEFNb3RvckF4aXMAZEpvaW50R2V0QU1vdG9yQXhpcwBkSm9pbnRTZXRTbGlkZXJBeGlzAGRKb2ludEdldFNsaWRlckF4aXMAZEpvaW50U2V0SGluZ2VBeGlzAGRKb2ludEdldEhpbmdlQXhpcwBkR2VvbUJveFNldExlbmd0aHMAZEdlb21Cb3hHZXRMZW5ndGhzAGRKb2ludFNldEFNb3Rvck51bUF4ZXMAZEpvaW50R2V0QU1vdG9yTnVtQXhlcwBkUkZyb20yQXhlcwBkUkZyb21FdWxlckFuZ2xlcwBkR2VvbUhlaWdodGZpZWxkRGF0YVNldEJvdW5kcwBkeFByb2Nlc3NJc2xhbmRzAGNvbGxpZGVBQUJCcwBjb21wdXRlUG9zcgBkSm9pbnRDcmVhdGVBTW90b3IAZEpvaW50U2V0QmFsbEFuY2hvcgBkSm9pbnRHZXRCYWxsQW5jaG9yAGRKb2ludFNldFVuaXZlcnNhbEFuY2hvcgBkSm9pbnRHZXRVbml2ZXJzYWxBbmNob3IAZEpvaW50U2V0SGluZ2VBbmNob3IAZEpvaW50R2V0SGluZ2VBbmNob3IAZEpvaW50U2V0SGluZ2UyQW5jaG9yAGRKb2ludEdldEhpbmdlMkFuY2hvcgBkV29ybGRTZXRDb250YWN0U3VyZmFjZUxheWVyAGRXb3JsZEdldENvbnRhY3RTdXJmYWNlTGF5ZXIAZHhRdWlja1N0ZXBwZXIAZENvbGxpZGVSYXlDeWxpbmRlcgBkeEN5bGluZGVyAFRlc3RPbmVUcmlhbmdsZVZzQ3lsaW5kZXIAX2NsZENsaXBCb3hUb0N5bGluZGVyAGRKb2ludENyZWF0ZVNsaWRlcgBNdWx0aXBseTJfcDhyAE11bHRpcGx5QWRkMl9wOHIAZEdlb21UcmFuc2Zvcm1TZXRDbGVhbnVwAGRTcGFjZVNldENsZWFudXAAZEdlb21UcmFuc2Zvcm1HZXRDbGVhbnVwAGRTcGFjZUdldENsZWFudXAAb2RlL3NyYy9yYXkuY3BwAG9kZS9zcmMvY29sbGlzaW9uX2N5bGluZGVyX2JveC5jcHAAb2RlL3NyYy9ib3guY3BwAG9kZS9zcmMvbWF0cml4LmNwcABvZGUvc3JjL2NvbnZleC5jcHAAb2RlL3NyYy9tYXNzLmNwcABvZGUvc3JjL3F1aWNrc3RlcC5jcHAAb2RlL3NyYy9zdGVwLmNwcABvZGUvc3JjL2xjcC5jcHAAb2RlL3NyYy9yb3RhdGlvbi5jcHAAb2RlL3NyYy9jb2xsaXNpb25fdHJhbnNmb3JtLmNwcABvZGUvc3JjL3V0aWwuY3BwAG9kZS9zcmMvY29sbGlzaW9uX2tlcm5lbC5jcHAAb2RlL3NyYy9vZGVtYXRoLmNwcABvZGUvc3JjL2NvbGxpc2lvbl9jeWxpbmRlcl90cmltZXNoLmNwcABvZGUvc3JjL2NvbGxpc2lvbl90cmltZXNoLmNwcABvZGUvc3JjL3NwaGVyZS5jcHAAb2RlL3NyYy9jb2xsaXNpb25fY3lsaW5kZXJfcGxhbmUuY3BwAG9kZS9zcmMvY29sbGlzaW9uX3RyaW1lc2hfcGxhbmUuY3BwAG9kZS9zcmMvY2Fwc3VsZS5jcHAAb2RlL3NyYy9vZGUuY3BwAG9kZS9zcmMvY29sbGlzaW9uX3NwYWNlLmNwcABvZGUvc3JjL2hlaWdodGZpZWxkLmNwcABkV29ybGRRdWlja1N0ZXAAZFdvcmxkU3RlcABkTWFzc1NldFplcm8AZFNldFplcm8AZEJvZHlTZXRQb3NpdGlvbgBkR2VvbVNldFBvc2l0aW9uAGRCb2R5R2V0UG9zaXRpb24AZEdlb21HZXRQb3NpdGlvbgBkSm9pbnRHZXRTbGlkZXJQb3NpdGlvbgBkQm9keVNldFJvdGF0aW9uAGRHZW9tU2V0Um90YXRpb24AZEJvZHlHZXRSb3RhdGlvbgBkR2VvbUdldFJvdGF0aW9uAGRCb2R5U2V0UXVhdGVybmlvbgBkQm9keUdldFF1YXRlcm5pb24AZEdlb21HZXRRdWF0ZXJuaW9uAG5hbgBkQ29sbGlkZVRyYW5zZm9ybQBnZXRHZW9tAGRHZW9tVHJhbnNmb3JtU2V0R2VvbQBkR2VvbVRyYW5zZm9ybUdldEdlb20Ac3dhcFByb2JsZW0AZEpvaW50U2V0QU1vdG9yUGFyYW0AZEpvaW50R2V0QU1vdG9yUGFyYW0AZEpvaW50U2V0U2xpZGVyUGFyYW0AZEpvaW50R2V0U2xpZGVyUGFyYW0AZEpvaW50U2V0VW5pdmVyc2FsUGFyYW0AZEpvaW50R2V0VW5pdmVyc2FsUGFyYW0AZEpvaW50U2V0SGluZ2VQYXJhbQBkSm9pbnRHZXRIaW5nZVBhcmFtAGRKb2ludFNldEhpbmdlMlBhcmFtAGRKb2ludEdldEhpbmdlMlBhcmFtAGRSZW1vdmVSb3dDb2wAZEpvaW50Q3JlYXRlTnVsbABkSm9pbnRDcmVhdGVCYWxsAGRCb2R5R2V0UmVsUG9pbnRWZWwAZEJvZHlTZXRBbmd1bGFyVmVsAGRCb2R5R2V0QW5ndWxhclZlbABkQm9keVNldExpbmVhclZlbABkQm9keUdldExpbmVhclZlbABkV29ybGRTZXRDb250YWN0TWF4Q29ycmVjdGluZ1ZlbABkV29ybGRHZXRDb250YWN0TWF4Q29ycmVjdGluZ1ZlbABkSm9pbnRHZXRBTW90b3JBeGlzUmVsAGRNYXNzU2V0Qm94VG90YWwAZE1hc3NTZXRDeWxpbmRlclRvdGFsAGRNYXNzU2V0U3BoZXJlVG90YWwAZEpvaW50Q3JlYXRlVW5pdmVyc2FsAGRNYXNzQ2hlY2sAZEdlb21IZWlnaHRmaWVsZERhdGFCdWlsZENhbGxiYWNrAGRHZW9tQm94UG9pbnREZXB0aABkR2VvbVNwaGVyZVBvaW50RGVwdGgAZEdlb21DYXBzdWxlUG9pbnREZXB0aABkR2VvbVJheUdldExlbmd0aABkSm9pbnRBdHRhY2gAb2RlL3NyYy9jb2xsaXNpb25fdXRpbC5oAG9kZS9zcmMvY29sbGlzaW9uX3NwYWNlX2ludGVybmFsLmgAaW5mAHJlbW92ZQBkU3BhY2VSZW1vdmUAZExETFRSZW1vdmUAZEJvZHlHZXRUb3JxdWUAZEJvZHlBZGRSZWxUb3JxdWUAZEJvZHlBZGRUb3JxdWUAZFNldFZhbHVlAGRJc1Bvc2l0aXZlRGVmaW5pdGUAZE1hc3NSb3RhdGUAZE1hc3NUcmFuc2xhdGUAZEJvZHlDcmVhdGUAZEpvaW50R2V0U2xpZGVyUG9zaXRpb25SYXRlAGRKb2ludEdldEhpbmdlQW5nbGVSYXRlAGRKb2ludEdldFVuaXZlcnNhbEFuZ2xlMlJhdGUAZEpvaW50R2V0SGluZ2UyQW5nbGUyUmF0ZQBkSm9pbnRHZXRVbml2ZXJzYWxBbmdsZTFSYXRlAGRKb2ludEdldEhpbmdlMkFuZ2xlMVJhdGUAZENvbGxpZGVSYXlTcGhlcmUAZHhTcGhlcmUAZENvbGxpZGVTcGhlcmVTcGhlcmUAZENvbGxpZGVDYXBzdWxlU3BoZXJlAGRKb2ludEdldFR5cGUAZENvbGxpZGVSYXlQbGFuZQBkQ29sbGlkZUJveFBsYW5lAGRDb2xsaWRlQ29udmV4UGxhbmUAZENvbGxpZGVDeWxpbmRlclBsYW5lAGRDb2xsaWRlVHJpbWVzaFBsYW5lAGRDb2xsaWRlU3BoZXJlUGxhbmUAZENvbGxpZGVDYXBzdWxlUGxhbmUAZFdvcmxkR2V0QXV0b0Rpc2FibGVUaW1lAGRDb2xsaWRlUmF5Q2Fwc3VsZQBkQ29sbGlkZUNvbnZleENhcHN1bGUAZHhDYXBzdWxlAGRNYXNzU2V0Q2Fwc3VsZQBkQ29sbGlkZUNhcHN1bGVDYXBzdWxlAF9jbGRDbGlwQ3lsaW5kZXJUb1RyaWFuZ2xlAGRKb2ludFNldEFNb3RvckFuZ2xlAGRKb2ludEdldEFNb3RvckFuZ2xlAGRKb2ludEdldEhpbmdlQW5nbGUAZFJGcm9tQXhpc0FuZEFuZ2xlAGRRRnJvbUF4aXNBbmRBbmdsZQBkQm9keURpc2FibGUAZEJvZHlFbmFibGUAZFZlY3RvclNjYWxlAG51bV9ieXRlcyB0b28gbGFyZ2UAZEpvaW50Q3JlYXRlSGluZ2UAT0RFIE1lc3NhZ2UAZEpvaW50U2V0QU1vdG9yTW9kZQBkSm9pbnRHZXRBTW90b3JNb2RlAGNvbGxpZGUAZFNwYWNlQ29sbGlkZQBkQ29sbGlkZQBkQm9keUdldEZvcmNlAGRCb2R5QWRkUmVsRm9yY2UAZEJvZHlBZGRGb3JjZQB+ZHhTcGFjZQBkR2VvbUlzU3BhY2UAZFBsYW5lU3BhY2UAZENvbGxpZGVIZWlnaHRmaWVsZABkSm9pbnRTZXRGaXhlZABkSm9pbnRDcmVhdGVGaXhlZABkR2VvbU1vdmVkAG5vdCB5ZXQgaW1wbGVtZW50ZWQAZEFyZUNvbm5lY3RlZAB0aGlzIHNob3VsZCBuZXZlciBnZXQgY2FsbGVkAGRCb2R5SXNFbmFibGVkAGRpc2FibGVkIGJvZHkgdGFnZ2VkAGVuYWJsZWQgYm9keSBub3QgdGFnZ2VkAGF0dGFjaGVkIGVuYWJsZWQgam9pbnQgbm90IHRhZ2dlZAB1bmF0dGFjaGVkIG9yIGRpc2FibGVkIGpvaW50IHRhZ2dlZABhZGQAZE1hc3NBZGQAZFNwYWNlQWRkAGNlbnRlciBvZiBtYXNzIGluY29uc2lzdGVudCB3aXRoIG1hc3MgcGFyYW1ldGVycyBpbiAlcygpIEZpbGUgJXMgTGluZSAlZAB6ZXJvIGxlbmd0aCB2ZWN0b3IgaW4gJXMoKSBGaWxlICVzIExpbmUgJWQAdmVjdG9yIGhhcyB6ZXJvIHNpemUgaW4gJXMoKSBGaWxlICVzIExpbmUgJWQAaW5lcnRpYSBtdXN0IGJlIHBvc2l0aXZlIGRlZmluaXRlIGluICVzKCkgRmlsZSAlcyBMaW5lICVkAG1hc3MgbXVzdCBiZSA+IDAgaW4gJXMoKSBGaWxlICVzIExpbmUgJWQAaW5lcnRpYSBtdXN0IGJlIHBvc2l0aXZlIGRlZmluaXRlISBpbiAlcygpIEZpbGUgJXMgTGluZSAlZABTZXREYXRhAH5keEhlaWdodGZpZWxkRGF0YQBhc3NlcnRpb24gImJvZHkiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJudW1UZXJyYWluQ29udGFjdHMgPD0gbnVtTWF4VGVycmFpbkNvbnRhY3RzIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAibzEtPnR5cGUgPT0gZFJheUNsYXNzIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAibzItPnR5cGUgPT0gZEJveENsYXNzIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAibzEtPnR5cGUgPT0gZEJveENsYXNzIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAibzItPnR5cGUgPT0gZENvbnZleENsYXNzIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAibzEtPnR5cGUgPT0gZENvbnZleENsYXNzIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAibzItPnR5cGUgPT0gZEN5bGluZGVyQ2xhc3MiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJvMS0+dHlwZSA9PSBkR2VvbVRyYW5zZm9ybUNsYXNzIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAibzEtPnR5cGUgPT0gZFRyaU1lc2hDbGFzcyIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gIm8yLT50eXBlID09IGRTcGhlcmVDbGFzcyIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gIm8xLT50eXBlID09IGRTcGhlcmVDbGFzcyIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gIm8yLT50eXBlID09IGRQbGFuZUNsYXNzIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAibzItPnR5cGUgPT0gZENhcHN1bGVDbGFzcyIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gIm8xLT50eXBlID09IGRDYXBzdWxlQ2xhc3MiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJvMS0+dHlwZSA9PSBkSGVpZ2h0ZmllbGRDbGFzcyIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gIm9mZnNldF9wb3NyIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAiaj09bSIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gImluZm9baV0ubSA+PSAwICYmIGluZm9baV0ubSA8PSA2ICYmIGluZm9baV0ubnViID49IDAgJiYgaW5mb1tpXS5udWIgPD0gaW5mb1tpXS5tIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAiamJfcHRyID09IGpiKzIqbSIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gInBDYWxsYmFjayIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gInN0YWNrc2l6ZSA8PSB3b3JsZC0+bmoiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJ3ICYmIGoiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJmYWxzZSIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gIncgJiYgdnRhYmxlIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAic3RhY2tzaXplIDw9IHdvcmxkLT5uYiIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gIm1fcEhlaWdodERhdGEiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJpVG1wQ291bnRlcjIgPj0gMCAmJiBpVG1wQ291bnRlcjIgPD0gTUFYX0NZTEJPWF9DTElQX1BPSU5UUyIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gImlUbXBDb3VudGVyMSA+PSAwICYmIGlUbXBDb3VudGVyMSA8PSBNQVhfQ1lMQk9YX0NMSVBfUE9JTlRTIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAiaVRtcENvdW50ZXIyID49IDAgJiYgaVRtcENvdW50ZXIyIDw9IG5NQVhfQ1lMSU5ERVJfVFJJQU5HTEVfQ0xJUF9QT0lOVFMiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJpVG1wQ291bnRlcjEgPj0gMCAmJiBpVG1wQ291bnRlcjEgPD0gbk1BWF9DWUxJTkRFUl9UUklBTkdMRV9DTElQX1BPSU5UUyIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gImsgPCBuQyIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gImogPCBuQyIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gInA+MCAmJiByPjAgJiYgQSAmJiBCICYmIEMiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJxPjAgJiYgQSAmJiBCICYmIEMiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJwPjAgJiYgQSAmJiBCICYmIEMiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJheGlzbGVuPj0wLjk5OTkiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJuPjAgJiYgaTEgPj0wICYmIGkyID49IDAgJiYgaTEgPCBuICYmIGkyIDwgbiAmJiBuc2tpcCA+PSBuICYmIGkxIDw9IGkyIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAiZGVwdGhTYW1wbGVzID49IDIiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJ3aWR0aFNhbXBsZXMgPj0gMiIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gInBbaV0gPj0gMCAmJiBwW2ldIDwgbjEiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJheGlzbGVuPD0xLjAwMDEiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICIoZmxhZ3MgJiAweGZmZmYpID49IDEiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICIqaXJldCAhPSBpMCIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gImpvaW50W2oyXS0+bm9kZVsxXS5ib2R5IHx8IGpiMj09MCIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gImpvaW50W2oxXS0+bm9kZVsxXS5ib2R5IHx8IGpiMT09MCIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gIihnMi0+Z2ZsYWdzICYgR0VPTV9BQUJCX0JBRCk9PTAiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICIoZzEtPmdmbGFncyAmIEdFT01fQUFCQl9CQUQpPT0wIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAiMCIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gIm5EZXB0aFNhbXBsZXMgPiAwIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAibldpZHRoU2FtcGxlcyA+IDAiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJsb1trXSA8PSAwICYmIGhpW2tdID49IDAiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJkTWFzc0NoZWNrKG1hc3MpIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAiaSA+PSAwICYmIGkgPCAodGVzdGVkX3Jvd3NpemUqbikiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJza2lwID49IChpbnQpc2l6ZW9mKGRDb250YWN0R2VvbSkiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJJbmRleCA+PSAwICYmIEluZGV4IDwgKEZsYWdzICYgMHgwZmZmZikiIGZhaWxlZCBpbiAlcygpIFslc10AYXNzZXJ0aW9uICJza2lwID49IChpbnQpc2l6ZW9mKCBkQ29udGFjdEdlb20gKSIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gIiggZHogKyBkRXBzaWxvbiA+PSAwLjBmICkgJiYgKCBkeiAtIGRFcHNpbG9uIDw9IDEuMGYgKSIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gIiggZHggKyBkRXBzaWxvbiA+PSAwLjBmICkgJiYgKCBkeCAtIGRFcHNpbG9uIDw9IDEuMGYgKSIgZmFpbGVkIGluICVzKCkgWyVzXQBhc3NlcnRpb24gImZEZXB0aCA+IFJFQUwoIDAuMCApIiBmYWlsZWQgaW4gJXMoKSBbJXNdAGFzc2VydGlvbiAiZldpZHRoID4gUkVBTCggMC4wICkiIGZhaWxlZCBpbiAlcygpIFslc10AZERRZnJvbVcAZFNvbHZlTERMVABTQUZFQ09OVEFDVABkUWZyb21SAE9ERSBJTlRFUk5BTCBFUlJPUgBkUmZyb21RAGRXb3JsZFNldEVSUABkV29ybGRHZXRFUlAAZFNvbHZlTENQAFNPUl9MQ1AAdHJhbnNmZXJfaV9mcm9tX0NfdG9fTgBOQU4AZFdvcmxkU2V0Q0ZNAGRXb3JsZEdldENGTQBkTERMVEFkZFRMAElORgBkR2VvbUdldEFBQkIAZEludmVydE1hdHJpeDQAZE5vcm1hbGl6ZTQAZFFNdWx0aXBseTMAZE5vcm1hbGl6ZTMAZFFNdWx0aXBseTIAZEludGVybmFsU3RlcElzbGFuZF94MgBkSm9pbnRTZXRVbml2ZXJzYWxBeGlzMgBkSm9pbnRHZXRVbml2ZXJzYWxBeGlzMgBkSm9pbnRTZXRIaW5nZTJBeGlzMgBkSm9pbnRHZXRIaW5nZTJBeGlzMgBkSm9pbnRHZXRVbml2ZXJzYWxBbmNob3IyAGRKb2ludEdldFVuaXZlcnNhbEFuZ2xlMgBkSm9pbnRDcmVhdGVIaW5nZTIAY29sbGlkZTIAZFNwYWNlQ29sbGlkZTIAZE11bHRpcGx5MQBkUU11bHRpcGx5MQBkSm9pbnRTZXRVbml2ZXJzYWxBeGlzMQBkSm9pbnRHZXRVbml2ZXJzYWxBeGlzMQBkSm9pbnRTZXRIaW5nZTJBeGlzMQBkSm9pbnRHZXRIaW5nZTJBeGlzMQBNdWx0aXBseTFfOHExAE11bHRpcGx5QWRkMV84cTEATXVsdGlwbHkxXzEycTEAZEdlb21UcmlNZXNoRGF0YUJ1aWxkU2luZ2xlMQBkSm9pbnRHZXRVbml2ZXJzYWxBbmdsZTEAZEpvaW50R2V0SGluZ2UyQW5nbGUxAE11bHRpcGx5MF9wODEATXVsdGlwbHlBZGQwX3A4MQBkTXVsdGlwbHkwAGRRTXVsdGlwbHkwAC4AKG51bGwpAExDUCBpbnRlcm5hbCBlcnJvciwgcyA8PSAwIChzPSUuNGUpAFNraXBQcmltaXRpdmVUZXN0cyBub3QgcG9zc2libGUgZm9yIFJheUNvbGxpZGVyICEgKG5vdCBpbXBsZW1lbnRlZCkAICglczolZCkAam9pbnQgY2FuIG5vdCBiZSBhdHRhY2hlZCB0byBqdXN0IG9uZSBib2R5IGluICVzKCkAR2VvbVRyYW5zZm9ybSBlbmNhcHN1bGF0ZWQgb2JqZWN0IG11c3Qgbm90IGJlIGF0dGFjaGVkIHRvIGEgYm9keSBpbiAlcygpAGFyZ3VtZW50IG5vdCBhIHJheSBpbiAlcygpAGFyZ3VtZW50IG5vdCBhIGJveCBpbiAlcygpAGJhZCBqb2ludCBhcmd1bWVudCBpbiAlcygpAGJhZCByZXN1bHQgYXJndW1lbnQgaW4gJXMoKQBiYWQgd29ybGQgYXJndW1lbnQgaW4gJXMoKQBqb2ludCBpcyBub3QgYW4gYW1vdG9yIGluICVzKCkAYXJndW1lbnQgbm90IGEgY2N5bGluZGVyIGluICVzKCkAam9pbnQgaXMgbm90IGEgc2xpZGVyIGluICVzKCkAYmFkIG8yIGNsYXNzIG51bWJlciBpbiAlcygpAGJhZCBvMSBjbGFzcyBudW1iZXIgaW4gJXMoKQBiYWQgZGlyZWN0aW9uIG51bWJlciBpbiAlcygpAGFyZ3VtZW50IG5vdCBhIGdlb20gdHJhbnNmb3JtIGluICVzKCkAam9pbnQgaXMgbm90IGEgYmFsbCBpbiAlcygpAG11c3QgaGF2ZSBtaW5sZXZlbCA8PSBtYXhsZXZlbCBpbiAlcygpAGpvaW50IGlzIG5vdCBhIHVuaXZlcnNhbCBpbiAlcygpAGFyZ3VtZW50IG5vdCBhIHNwaGVyZSBpbiAlcygpAGFyZ3VtZW50IG5vdCBhIHBsYW5lIGluICVzKCkAZ2VvbSBtdXN0IGJlIHBsYWNlYWJsZSBpbiAlcygpAGpvaW50IGlzIG5vdCBhIGhpbmdlIGluICVzKCkAam9pbnQgaXMgbm90IGEgSGluZ2UgaW4gJXMoKQBpbmRleCBvdXQgb2YgcmFuZ2UgaW4gJXMoKQBvYmplY3QgaXMgbm90IGluIHRoaXMgc3BhY2UgaW4gJXMoKQBhcmd1bWVudCBtdXN0IGJlIGEgaGFzaCBzcGFjZSBpbiAlcygpAGludmFsaWQgb3BlcmF0aW9uIGZvciBsb2NrZWQgc3BhY2UgaW4gJXMoKQBpbnZhbGlkIG9wZXJhdGlvbiBmb3IgZ2VvbSBpbiBsb2NrZWQgc3BhY2UgaW4gJXMoKQBhcmd1bWVudCBub3QgYSBzcGFjZSBpbiAlcygpAGdlb20gaXMgYWxyZWFkeSBpbiBhIHNwYWNlIGluICVzKCkAR2VvbVRyYW5zZm9ybSBlbmNhcHN1bGF0ZWQgb2JqZWN0IG11c3Qgbm90IGJlIGluIGEgc3BhY2UgaW4gJXMoKQBqb2ludCBhbmQgYm9kaWVzIG11c3QgYmUgaW4gc2FtZSB3b3JsZCBpbiAlcygpAGNvbGxpZGVycyBhcnJheSBub3QgaW5pdGlhbGl6ZWQgaW4gJXMoKQBqb2ludCBpcyBub3QgZml4ZWQgaW4gJXMoKQBhcmd1bWVudCBub3QgdHJpbWVzaCBkYXRhIGluICVzKCkAYXJndW1lbnQgbm90IEhlaWdodGZpZWxkIGRhdGEgaW4gJXMoKQBBcmd1bWVudCBub3QgSGVpZ2h0ZmllbGQgZGF0YSBpbiAlcygpAGNhbid0IGhhdmUgYm9keTE9PWJvZHkyIGluICVzKCkAam9pbnQgaXMgbm90IGEgaGluZ2UyIGluICVzKCkAbm8gc2Vjb25kIGJvZHksIGNhbid0IHNldCBheGlzIHJlbD0yIGluICVzKCkAbm8gZmlyc3QgYm9keSwgY2FuJ3Qgc2V0IGF4aXMgcmVsPTEgaW4gJXMoKQBzdGVwc2l6ZSBtdXN0IGJlID4gMCBpbiAlcygpAEJhZCBhcmd1bWVudChzKSBpbiAlcygpAFRlbXBvcmFsIGNvaGVyZW5jZSBjYW4ndCBndWFyYW50ZWUgdG8gcmVwb3J0IGNsb3Nlc3QgaGl0IQBIaWdoZXIgZGlzdGFuY2UgYm91bmQgbXVzdCBiZSBwb3NpdGl2ZSEAVGVtcG9yYWwgY29oZXJlbmNlIG9ubHkgd29ya3Mgd2l0aCBGaXJzdCBjb250YWN0IG1vZGUhAENsb3Nlc3QgaGl0IGRvZXNuJ3Qgd29yayB3aXRoIEZpcnN0IGNvbnRhY3QgbW9kZSEAUHVyZSB2aXJ0dWFsIGZ1bmN0aW9uIGNhbGxlZCEACiVzOiAACiVzICVkOiAAd2lkdGggJWYKAAAAAAAAFDEAAAEAAAACAAAAAwAAAAQAAAA1ZHhCb3gAAHBGAAAMMQAAgDEAAAAAAABEMQAAAQAAAAUAAAAGAAAABAAAADlkeENhcHN1bGUAAHBGAAA4MQAAgDEAAAAAAACAMQAAAQAAACkAAAAqAAAABAAAADZkeEdlb20ANWRCYXNlAABIRgAAcDEAAHBGAABoMQAAeDEAAAAAAAC4MgAAKwAAACwAAAAtAAAABAAAAC4AAAAvAAAAMAAAADEAAAAqAAAAKgAAACoAAAAAAAAA1DIAACsAAAAyAAAALQAAAAQAAAAuAAAALwAAADAAAAAxAAAAMwAAADQAAAA1AAAAAAAAAPAyAAArAAAANgAAAC0AAAAEAAAALgAAAC8AAAAwAAAAMQAAADcAAAA4AAAAOQBBsOQAC/ciAQAAAAIAAAADAAAABwAAAA0AAAAfAAAAPQAAAH8AAAD7AAAA/QEAAP0DAAD3BwAA/Q8AAP8fAAD9PwAA7X8AAPH/AAD//wEA+/8DAP//BwD9/w8A9/8fAP3/PwDx/38A/f//ANn//wH7//8D2f//B8f//w/9//8f3f//PzdkeFNwYWNlAAAAAHBGAACsMgAAgDEAADEzZHhTaW1wbGVTcGFjZQBwRgAAxDIAALgyAAAxMWR4SGFzaFNwYWNlAAAAcEYAAOAyAAC4MgAAAAAAACgzAAA6AAAAOwAAADwAAAAEAAAAMTVkeEdlb21UcmFuc2Zvcm0AAABwRgAAFDMAAIAxAAAAAAAAWDMAAEcAAABIAAAASQAAAEoAAAA5ZHhUcmlNZXNoAABwRgAATDMAAIAxAAAAAAAAjDMAAAEAAABLAAAATAAAAAQAAAAxMGR4Q3lsaW5kZXIAAAAAcEYAAHwzAACAMQAAAAAAAMAzAABRAAAAUgAAAFMAAAAEAAAAMTNkeEhlaWdodGZpZWxkAHBGAACwMwAAgDEAAAAAAADwMwAAAQAAAHAAAABxAAAABAAAADdkeFBsYW5lAAAAAHBGAADkMwAAgDEAAAAAAAAcNAAAAQAAAHIAAABzAAAABAAAADVkeFJheQAAcEYAABQ0AACAMQAAAAAAAEw0AAABAAAAdAAAAHUAAAAEAAAAOGR4U3BoZXJlAAAAcEYAAEA0AACAMQAAAAAAAAEAAAACAAAAAAAAAJQ0AAB2AAAAdwAAACoAAAAqAAAAeAAAAE42T3Bjb2RlOUJhc2VNb2RlbEUASEYAAIA0AAAAAAAAyDQAAHkAAAB6AAAAKgAAAHsAAABONk9wY29kZThDb2xsaWRlckUAAEhGAAC0NAAAAAAAAAA1AAB8AAAAfQAAAH4AAAB/AAAATjZPcGNvZGUxMUxTU0NvbGxpZGVyRQAAcEYAAOg0AAB8OAAAAAAAADg1AACAAAAAgQAAAIIAAACDAAAAeAAAAE42T3Bjb2RlNU1vZGVsRQBwRgAAKDUAAJQ0AAAAAAAAdDUAAIQAAACFAAAAhgAAAH8AAABONk9wY29kZTExT0JCQ29sbGlkZXJFAABwRgAAXDUAAHw4AAAAAAAARDYAAIcAAACIAAAAiQAAAIoAAACLAAAAjAAAAAAAAABsNgAAjQAAAI4AAACPAAAAkAAAAJEAAACSAAAAAAAAAJg2AACTAAAAlAAAAJUAAACWAAAAlwAAAJgAAAAAAAAAyDYAAJkAAACaAAAAmwAAAJwAAACdAAAAngAAAE42T3Bjb2RlMTdBQUJCQ29sbGlzaW9uVHJlZUUATjZPcGNvZGUxN0FBQkJPcHRpbWl6ZWRUcmVlRQAAAEhGAAAdNgAAcEYAAAA2AAA8NgAATjZPcGNvZGUxNEFBQkJOb0xlYWZUcmVlRQAAAHBGAABQNgAAPDYAAE42T3Bjb2RlMTdBQUJCUXVhbnRpemVkVHJlZUUAAAAAcEYAAHg2AAA8NgAATjZPcGNvZGUyM0FBQkJRdWFudGl6ZWROb0xlYWZUcmVlRQAAcEYAAKQ2AAA8NgAAAAAAAAg3AACfAAAAoAAAAKEAAAB/AAAATjZPcGNvZGUxNFBsYW5lc0NvbGxpZGVyRQAAAHBGAADsNgAAfDgAAAAAAABENwAAogAAAKMAAACkAAAAewAAAE42T3Bjb2RlMTFSYXlDb2xsaWRlckUAAHBGAAAsNwAAyDQAAAAAAACENwAApQAAAKYAAAB+AAAAfwAAAE42T3Bjb2RlMTRTcGhlcmVDb2xsaWRlckUAAABwRgAAaDcAAHw4AABONk9wY29kZTE1QUFCQlRyZWVCdWlsZGVyRQAASEYAAJA3AAAAAAAA/DcAAKcAAACoAAAAqQAAAKoAAACrAAAArAAAAE42T3Bjb2RlMjZBQUJCVHJlZU9mVHJpYW5nbGVzQnVpbGRlckUAAABwRgAA1DcAAKw3AAAAAAAAPDgAAK0AAACuAAAArwAAAHsAAABONk9wY29kZTE2QUFCQlRyZWVDb2xsaWRlckUAcEYAACA4AADINAAAAAAAAHw4AAAqAAAAKgAAAH4AAAB/AAAATjZPcGNvZGUxNFZvbHVtZUNvbGxpZGVyRQAAAHBGAABgOAAAyDQAANsPST/bD0m/5MsWQOTLFsAAAAAAAAAAgNsPSUDbD0nAAAAAAAAAAAA4Y+0+2g9JP16Yez/aD8k/aTesMWghIjO0DxQzaCGiMwMAAAAEAAAABAAAAAYAAACD+aIARE5uAPwpFQDRVycA3TT1AGLbwAA8mZUAQZBDAGNR/gC73qsAt2HFADpuJADSTUIASQbgAAnqLgAcktEA6x3+ACmxHADoPqcA9TWCAES7LgCc6YQAtCZwAEF+XwDWkTkAU4M5AJz0OQCLX4QAKPm9APgfOwDe/5cAD5gFABEv7wAKWosAbR9tAM9+NgAJyycARk+3AJ5mPwAt6l8Auid1AOXrxwA9e/EA9zkHAJJSigD7a+oAH7FfAAhdjQAwA1YAe/xGAPCrawAgvM8ANvSaAOOpHQBeYZEACBvmAIWZZQCgFF8AjUBoAIDY/wAnc00ABgYxAMpWFQDJqHMAe+JgAGuMwAAZxEcAzWfDAAno3ABZgyoAi3bEAKYclgBEr90AGVfRAKU+BQAFB/8AM34/AMIy6ACYT94Au30yACY9wwAea+8An/heADUfOgB/8soA8YcdAHyQIQBqJHwA1W76ADAtdwAVO0MAtRTGAMMZnQCtxMIALE1BAAwAXQCGfUYA43EtAJvGmgAzYgAAtNJ8ALSnlwA3VdUA1z72AKMQGABNdvwAZJ0qAHDXqwBjfPgAerBXABcV5wDASVYAO9bZAKeEOAAkI8sA1op3AFpUIwAAH7kA8QobABnO3wCfMf8AZh5qAJlXYQCs+0cAfn/YACJltwAy6IkA5r9gAO/EzQBsNgkAXT/UABbe1wBYO94A3puSANIiKAAohugA4lhNAMbKMgAI4xYA4H3LABfAUADzHacAGOBbAC4TNACDEmIAg0gBAPWOWwCtsH8AHunyAEhKQwAQZ9MAqt3YAK5fQgBqYc4ACiikANOZtAAGpvIAXHd/AKPCgwBhPIgAinN4AK+MWgBv170ALaZjAPS/ywCNge8AJsFnAFXKRQDK2TYAKKjSAMJhjQASyXcABCYUABJGmwDEWcQAyMVEAE2ykQAAF/MA1EOtAClJ5QD91RAAAL78AB6UzABwzu4AEz71AOzxgACz58MAx/goAJMFlADBcT4ALgmzAAtF8wCIEpwAqyB7AC61nwBHksIAezIvAAxVbQByp5AAa+cfADHLlgB5FkoAQXniAPTfiQDolJcA4uaEAJkxlwCI7WsAX182ALv9DgBImrQAZ6RsAHFyQgCNXTIAnxW4ALzlCQCNMSUA93Q5ADAFHAANDAEASwhoACzuWABHqpAAdOcCAL3WJAD3faYAbkhyAJ8W7wCOlKYAtJH2ANFTUQDPCvIAIJgzAPVLfgCyY2gA3T5fAEBdAwCFiX8AVVIpADdkwABt2BAAMkgyAFtMdQBOcdQARVRuAAsJwQAq9WkAFGbVACcHnQBdBFAAtDvbAOp2xQCH+RcASWt9AB0nugCWaSkAxsysAK0UVACQ4moAiNmJACxyUAAEpL4AdweUAPMwcAAA/CcA6nGoAGbCSQBk4D0Al92DAKM/lwBDlP0ADYaMADFB3gCSOZ0A3XCMABe35wAI3zsAFTcrAFyAoABagJMAEBGSAA/o2ABsgK8A2/9LADiQDwBZGHYAYqUVAGHLuwDHibkAEEC9ANLyBABJdScA67b2ANsiuwAKFKoAiSYvAGSDdgAJOzMADpQaAFE6qgAdo8IAr+2uAFwmEgBtwk0ALXqcAMBWlwADP4MACfD2ACtAjABtMZkAObQHAAwgFQDYw1sA9ZLEAMatSwBOyqUApzfNAOapNgCrkpQA3UJoABlj3gB2jO8AaItSAPzbNwCuoasA3xUxAACuoQAM+9oAZE1mAO0FtwApZTAAV1a/AEf/OgBq+bkAdb7zACiT3wCrgDAAZoz2AATLFQD6IgYA2eQdAD2zpABXG48ANs0JAE5C6QATvqQAMyO1APCqGgBPZagA0sGlAAs/DwBbeM0AI/l2AHuLBACJF3IAxqZTAG9u4gDv6wAAm0pYAMTatwCqZroAds/PANECHQCx8S0AjJnBAMOtdwCGSNoA912gAMaA9ACs8C8A3eyaAD9cvADQ3m0AkMcfACrbtgCjJToAAK+aAK1TkwC2VwQAKS20AEuAfgDaB6cAdqoOAHtZoQAWEioA3LctAPrl/QCJ2/4Aib79AOR2bAAGqfwAPoBwAIVuFQD9h/8AKD4HAGFnMwAqGIYATb3qALPnrwCPbW4AlWc5ADG/WwCE10gAMN8WAMctQwAlYTUAyXDOADDLuAC/bP0ApACiAAVs5ABa3aAAIW9HAGIS0gC5XIQAcGFJAGtW4ACZUgEAUFU3AB7VtwAz8cQAE25fAF0w5ACFLqkAHbLDAKEyNgAIt6QA6rHUABb3IQCPaeQAJ/93AAwDgACNQC0AT82gACClmQCzotMAL10KALT5QgAR2ssAfb7QAJvbwQCrF70AyqKBAAhqXAAuVRcAJwBVAH8U8ADhB4YAFAtkAJZBjQCHvt4A2v0qAGsltgB7iTQABfP+ALm/ngBoak8ASiqoAE/EWgAt+LwA11qYAPTHlQANTY0AIDqmAKRXXwAUP7EAgDiVAMwgAQBx3YYAyd62AL9g9QBNZREAAQdrAIywrACywNAAUVVIAB77DgCVcsMAowY7AMBANQAG3HsA4EXMAE4p+gDWysgA6PNBAHxk3gCbZNgA2b4xAKSXwwB3WNQAaePFAPDaEwC6OjwARhhGAFV1XwDSvfUAbpLGAKwuXQAORO0AHD5CAGHEhwAp/ekA59bzACJ8ygBvkTUACODFAP/XjQBuauIAsP3GAJMIwQB8XXQAa62yAM1unQA+cnsAxhFqAPfPqQApc98Atcm6ALcAUQDisg0AdLokAOV9YAB02IoADRUsAIEYDAB+ZpQAASkWAJ96dgD9/b4AVkXvANl+NgDs2RMAi7q5AMSX/AAxqCcA8W7DAJTFNgDYqFYAtKi1AM/MDgASiS0Ab1c0ACxWiQCZzuMA1iC5AGteqgA+KpwAEV/MAP0LSgDh9PsAjjttAOKGLADp1IQA/LSpAO/u0QAuNckALzlhADghRAAb2cgAgfwKAPtKagAvHNgAU7SEAE6ZjABUIswAKlXcAMDG1gALGZYAGnC4AGmVZAAmWmAAP1LuAH8RDwD0tREA/Mv1ADS8LQA0vO4A6F3MAN1eYABnjpsAkjPvAMkXuABhWJsA4Ve8AFGDxgDYPhAA3XFIAC0c3QCvGKEAISxGAFnz1wDZepgAnlTAAE+G+gBWBvwA5XmuAIkiNgA4rSIAZ5PcAFXoqgCCJjgAyuebAFENpACZM7EAqdcOAGkFSABlsvAAf4inAIhMlwD50TYAIZKzAHuCSgCYzyEAQJ/cANxHVQDhdDoAZ+tCAP6d3wBe1F8Ae2ekALqsegBV9qIAK4gjAEG6VQBZbggAISqGADlHgwCJ4+YA5Z7UAEn7QAD/VukAHA/KAMVZigCU+isA08HFAA/FzwDbWq4AR8WGAIVDYgAhhjsALHmUABBhhwAqTHsAgCwaAEO/EgCIJpAAeDyJAKjE5ADl23sAxDrCACb06gD3Z4oADZK/AGWjKwA9k7EAvXwLAKRR3AAn3WMAaeHdAJqUGQCoKZUAaM4oAAnttABEnyAATpjKAHCCYwB+fCMAD7kyAKf1jgAUVucAIfEIALWdKgBvfk0ApRlRALX5qwCC39YAlt1hABY2AgDEOp8Ag6KhAHLtbQA5jXoAgripAGsyXABGJ1sAADTtANIAdwD89FUAAVlNAOBxgABBs4cBC0NA+yH5PwAAAAAtRHQ+AAAAgJhG+DwAAABgUcx4OwAAAICDG/A5AAAAQCAlejgAAACAIoLjNgAAAAAd82k1mEcAADBIAEGAiAELQRkACgAZGRkAAAAABQAAAAAAAAkAAAAACwAAAAAAAAAAGQARChkZGQMKBwABAAkLGAAACQYLAAALAAYZAAAAGRkZAEHRiAELIQ4AAAAAAAAAABkACg0ZGRkADQAAAgAJDgAAAAkADgAADgBBi4kBCwEMAEGXiQELFRMAAAAAEwAAAAAJDAAAAAAADAAADABBxYkBCwEQAEHRiQELFQ8AAAAEDwAAAAAJEAAAAAAAEAAAEABB/4kBCwESAEGLigELHhEAAAAAEQAAAAAJEgAAAAAAEgAAEgAAGgAAABoaGgBBwooBCw4aAAAAGhoaAAAAAAAACQBB84oBCwEUAEH/igELFRcAAAAAFwAAAAAJFAAAAAAAFAAAFABBrYsBCwEWAEG5iwELoQIVAAAAABUAAAAACRYAAAAAABYAABYAADAxMjM0NTY3ODlBQkNERUZOMTBfX2N4eGFiaXYxMTZfX3NoaW1fdHlwZV9pbmZvRQAAAABwRgAA4EUAANRGAABOMTBfX2N4eGFiaXYxMTdfX2NsYXNzX3R5cGVfaW5mb0UAAABwRgAAEEYAAARGAAAAAAAANEYAALcAAAC4AAAAuQAAALoAAAC7AAAAvAAAAL0AAAC+AAAAAAAAALhGAAC3AAAAvwAAALkAAAC6AAAAuwAAAMAAAADBAAAAwgAAAE4xMF9fY3h4YWJpdjEyMF9fc2lfY2xhc3NfdHlwZV9pbmZvRQAAAABwRgAAkEYAADRGAABTdDl0eXBlX2luZm8AAAAASEYAAMRGAEHgjQELuQFwAAAAVAAAAFUAAABWAAAAAQAAAMwAAABXAAAAWAAAAFkAAAACAAAArAAAAFoAAABbAAAAXAAAAAMAAADEAAAAXQAAAF4AAABfAAAABAAAABgBAABgAAAAYQAAAGIAAAAGAAAACAEAAGMAAABkAAAAZQAAAAUAAABEAQAAZgAAAGcAAABoAAAACQAAAHAAAABpAAAAagAAAGsAAAAHAAAAUAAAAAAAAABsAAAAbQAAAAgAAAAAAAAABQBBpI8BCwGwAEG8jwELCrEAAACyAAAAfFoAQdSPAQsBAgBB5I8BCwj//////////wBBqJABCwmYRwAAAAAAAAUAQbyQAQsBswBB1JABCw6xAAAAtAAAAIhaAAAABABB7JABCwEBAEH8kAELBf////8KAEHAkQELBzBIAACQYAE=";if(!isDataURI(wasmBinaryFile)){wasmBinaryFile=locateFile(wasmBinaryFile)}function getBinarySync(file){if(file==wasmBinaryFile&&wasmBinary){return new Uint8Array(wasmBinary)}var binary=tryParseAsDataURI(file);if(binary){return binary}if(readBinary){return readBinary(file)}throw"both async and sync fetching of the wasm failed"}function getBinaryPromise(binaryFile){return Promise.resolve().then(()=>getBinarySync(binaryFile))}function instantiateArrayBuffer(binaryFile,imports,receiver){return getBinaryPromise(binaryFile).then(binary=>WebAssembly.instantiate(binary,imports)).then(instance=>instance).then(receiver,reason=>{err(`failed to asynchronously prepare wasm: ${reason}`);abort(reason)})}function instantiateAsync(binary,binaryFile,imports,callback){return instantiateArrayBuffer(binaryFile,imports,callback)}function createWasm(){var info={"env":wasmImports,"wasi_snapshot_preview1":wasmImports};function receiveInstance(instance,module){wasmExports=instance.exports;wasmMemory=wasmExports["memory"];updateMemoryViews();wasmTable=wasmExports["__indirect_function_table"];addOnInit(wasmExports["__wasm_call_ctors"]);removeRunDependency("wasm-instantiate");return wasmExports}addRunDependency("wasm-instantiate");function receiveInstantiationResult(result){receiveInstance(result["instance"])}if(Module["instantiateWasm"]){try{return Module["instantiateWasm"](info,receiveInstance)}catch(e){err(`Module.instantiateWasm callback failed with error: ${e}`);return false}}instantiateAsync(wasmBinary,wasmBinaryFile,info,receiveInstantiationResult);return{}}function ExitStatus(status){this.name="ExitStatus";this.message=`Program terminated with exit(${status})`;this.status=status}var callRuntimeCallbacks=callbacks=>{while(callbacks.length>0){callbacks.shift()(Module)}};function getValue(ptr,type="i8"){if(type.endsWith("*"))type="*";switch(type){case"i1":return HEAP8[ptr>>0];case"i8":return HEAP8[ptr>>0];case"i16":return HEAP16[ptr>>1];case"i32":return HEAP32[ptr>>2];case"i64":abort("to do getValue(i64) use WASM_BIGINT");case"float":return HEAPF32[ptr>>2];case"double":return HEAPF64[ptr>>3];case"*":return HEAPU32[ptr>>2];default:abort(`invalid type for getValue: ${type}`)}}function setValue(ptr,value,type="i8"){if(type.endsWith("*"))type="*";switch(type){case"i1":HEAP8[ptr>>0]=value;break;case"i8":HEAP8[ptr>>0]=value;break;case"i16":HEAP16[ptr>>1]=value;break;case"i32":HEAP32[ptr>>2]=value;break;case"i64":abort("to do setValue(i64) use WASM_BIGINT");case"float":HEAPF32[ptr>>2]=value;break;case"double":HEAPF64[ptr>>3]=value;break;case"*":HEAPU32[ptr>>2]=value;break;default:abort(`invalid type for setValue: ${type}`)}}var _abort=()=>{abort("")};var _emscripten_memcpy_js=(dest,src,num)=>HEAPU8.copyWithin(dest,src,src+num);var abortOnCannotGrowMemory=requestedSize=>{abort("OOM")};var _emscripten_resize_heap=requestedSize=>{var oldSize=HEAPU8.length;requestedSize>>>=0;abortOnCannotGrowMemory(requestedSize)};var UTF8Decoder=typeof TextDecoder!="undefined"?new TextDecoder("utf8"):undefined;var UTF8ArrayToString=(heapOrArray,idx,maxBytesToRead)=>{var endIdx=idx+maxBytesToRead;var endPtr=idx;while(heapOrArray[endPtr]&&!(endPtr>=endIdx))++endPtr;if(endPtr-idx>16&&heapOrArray.buffer&&UTF8Decoder){return UTF8Decoder.decode(heapOrArray.subarray(idx,endPtr))}var str="";while(idx<endPtr){var u0=heapOrArray[idx++];if(!(u0&128)){str+=String.fromCharCode(u0);continue}var u1=heapOrArray[idx++]&63;if((u0&224)==192){str+=String.fromCharCode((u0&31)<<6|u1);continue}var u2=heapOrArray[idx++]&63;if((u0&240)==224){u0=(u0&15)<<12|u1<<6|u2}else{u0=(u0&7)<<18|u1<<12|u2<<6|heapOrArray[idx++]&63}if(u0<65536){str+=String.fromCharCode(u0)}else{var ch=u0-65536;str+=String.fromCharCode(55296|ch>>10,56320|ch&1023)}}return str};var UTF8ToString=(ptr,maxBytesToRead)=>ptr?UTF8ArrayToString(HEAPU8,ptr,maxBytesToRead):"";var SYSCALLS={varargs:undefined,get(){var ret=HEAP32[+SYSCALLS.varargs>>2];SYSCALLS.varargs+=4;return ret},getp(){return SYSCALLS.get()},getStr(ptr){var ret=UTF8ToString(ptr);return ret}};var _fd_close=fd=>52;var convertI32PairToI53Checked=(lo,hi)=>hi+2097152>>>0<4194305-!!lo?(lo>>>0)+hi*4294967296:NaN;function _fd_seek(fd,offset_low,offset_high,whence,newOffset){var offset=convertI32PairToI53Checked(offset_low,offset_high);return 70}var printCharBuffers=[null,[],[]];var printChar=(stream,curr)=>{var buffer=printCharBuffers[stream];if(curr===0||curr===10){(stream===1?out:err)(UTF8ArrayToString(buffer,0));buffer.length=0}else{buffer.push(curr)}};var _fd_write=(fd,iov,iovcnt,pnum)=>{var num=0;for(var i=0;i<iovcnt;i++){var ptr=HEAPU32[iov>>2];var len=HEAPU32[iov+4>>2];iov+=8;for(var j=0;j<len;j++){printChar(fd,HEAPU8[ptr+j])}num+=len}HEAPU32[pnum>>2]=num;return 0};var getCFunc=ident=>{var func=Module["_"+ident];return func};var writeArrayToMemory=(array,buffer)=>{HEAP8.set(array,buffer)};var lengthBytesUTF8=str=>{var len=0;for(var i=0;i<str.length;++i){var c=str.charCodeAt(i);if(c<=127){len++}else if(c<=2047){len+=2}else if(c>=55296&&c<=57343){len+=4;++i}else{len+=3}}return len};var stringToUTF8Array=(str,heap,outIdx,maxBytesToWrite)=>{if(!(maxBytesToWrite>0))return 0;var startIdx=outIdx;var endIdx=outIdx+maxBytesToWrite-1;for(var i=0;i<str.length;++i){var u=str.charCodeAt(i);if(u>=55296&&u<=57343){var u1=str.charCodeAt(++i);u=65536+((u&1023)<<10)|u1&1023}if(u<=127){if(outIdx>=endIdx)break;heap[outIdx++]=u}else if(u<=2047){if(outIdx+1>=endIdx)break;heap[outIdx++]=192|u>>6;heap[outIdx++]=128|u&63}else if(u<=65535){if(outIdx+2>=endIdx)break;heap[outIdx++]=224|u>>12;heap[outIdx++]=128|u>>6&63;heap[outIdx++]=128|u&63}else{if(outIdx+3>=endIdx)break;heap[outIdx++]=240|u>>18;heap[outIdx++]=128|u>>12&63;heap[outIdx++]=128|u>>6&63;heap[outIdx++]=128|u&63}}heap[outIdx]=0;return outIdx-startIdx};var stringToUTF8=(str,outPtr,maxBytesToWrite)=>stringToUTF8Array(str,HEAPU8,outPtr,maxBytesToWrite);var stringToUTF8OnStack=str=>{var size=lengthBytesUTF8(str)+1;var ret=stackAlloc(size);stringToUTF8(str,ret,size);return ret};var ccall=(ident,returnType,argTypes,args,opts)=>{var toC={"string":str=>{var ret=0;if(str!==null&&str!==undefined&&str!==0){ret=stringToUTF8OnStack(str)}return ret},"array":arr=>{var ret=stackAlloc(arr.length);writeArrayToMemory(arr,ret);return ret}};function convertReturnValue(ret){if(returnType==="string"){return UTF8ToString(ret)}if(returnType==="boolean")return Boolean(ret);return ret}var func=getCFunc(ident);var cArgs=[];var stack=0;if(args){for(var i=0;i<args.length;i++){var converter=toC[argTypes[i]];if(converter){if(stack===0)stack=stackSave();cArgs[i]=converter(args[i])}else{cArgs[i]=args[i]}}}var ret=func.apply(null,cArgs);function onDone(ret){if(stack!==0)stackRestore(stack);return convertReturnValue(ret)}ret=onDone(ret);return ret};var cwrap=(ident,returnType,argTypes,opts)=>{var numericArgs=!argTypes||argTypes.every(type=>type==="number"||type==="boolean");var numericRet=returnType!=="string";if(numericRet&&numericArgs&&!opts){return getCFunc(ident)}return function(){return ccall(ident,returnType,argTypes,arguments,opts)}};var uleb128Encode=(n,target)=>{if(n<128){target.push(n)}else{target.push(n%128|128,n>>7)}};var sigToWasmTypes=sig=>{var typeNames={"i":"i32","j":"i64","f":"f32","d":"f64","p":"i32"};var type={parameters:[],results:sig[0]=="v"?[]:[typeNames[sig[0]]]};for(var i=1;i<sig.length;++i){type.parameters.push(typeNames[sig[i]])}return type};var generateFuncType=(sig,target)=>{var sigRet=sig.slice(0,1);var sigParam=sig.slice(1);var typeCodes={"i":127,"p":127,"j":126,"f":125,"d":124};target.push(96);uleb128Encode(sigParam.length,target);for(var i=0;i<sigParam.length;++i){target.push(typeCodes[sigParam[i]])}if(sigRet=="v"){target.push(0)}else{target.push(1,typeCodes[sigRet])}};var convertJsFunctionToWasm=(func,sig)=>{if(typeof WebAssembly.Function=="function"){return new WebAssembly.Function(sigToWasmTypes(sig),func)}var typeSectionBody=[1];generateFuncType(sig,typeSectionBody);var bytes=[0,97,115,109,1,0,0,0,1];uleb128Encode(typeSectionBody.length,bytes);bytes.push.apply(bytes,typeSectionBody);bytes.push(2,7,1,1,101,1,102,0,0,7,5,1,1,102,0,0);var module=new WebAssembly.Module(new Uint8Array(bytes));var instance=new WebAssembly.Instance(module,{"e":{"f":func}});var wrappedFunc=instance.exports["f"];return wrappedFunc};var wasmTableMirror=[];var wasmTable;var getWasmTableEntry=funcPtr=>{var func=wasmTableMirror[funcPtr];if(!func){if(funcPtr>=wasmTableMirror.length)wasmTableMirror.length=funcPtr+1;wasmTableMirror[funcPtr]=func=wasmTable.get(funcPtr)}return func};var updateTableMap=(offset,count)=>{if(functionsInTableMap){for(var i=offset;i<offset+count;i++){var item=getWasmTableEntry(i);if(item){functionsInTableMap.set(item,i)}}}};var functionsInTableMap;var getFunctionAddress=func=>{if(!functionsInTableMap){functionsInTableMap=new WeakMap;updateTableMap(0,wasmTable.length)}return functionsInTableMap.get(func)||0};var freeTableIndexes=[];var getEmptyTableSlot=()=>{if(freeTableIndexes.length){return freeTableIndexes.pop()}try{wasmTable.grow(1)}catch(err){if(!(err instanceof RangeError)){throw err}throw"Unable to grow wasm table. Set ALLOW_TABLE_GROWTH."}return wasmTable.length-1};var setWasmTableEntry=(idx,func)=>{wasmTable.set(idx,func);wasmTableMirror[idx]=wasmTable.get(idx)};var addFunction=(func,sig)=>{var rtn=getFunctionAddress(func);if(rtn){return rtn}var ret=getEmptyTableSlot();try{setWasmTableEntry(ret,func)}catch(err){if(!(err instanceof TypeError)){throw err}var wrapped=convertJsFunctionToWasm(func,sig);setWasmTableEntry(ret,wrapped)}functionsInTableMap.set(func,ret);return ret};var removeFunction=index=>{functionsInTableMap.delete(getWasmTableEntry(index));setWasmTableEntry(index,null);freeTableIndexes.push(index)};var wasmImports={abort:_abort,emscripten_memcpy_js:_emscripten_memcpy_js,emscripten_resize_heap:_emscripten_resize_heap,fd_close:_fd_close,fd_seek:_fd_seek,fd_write:_fd_write};var wasmExports=createWasm();var ___wasm_call_ctors=()=>(___wasm_call_ctors=wasmExports["__wasm_call_ctors"])();var _dCreateBox=Module["_dCreateBox"]=(a0,a1,a2,a3)=>(_dCreateBox=Module["_dCreateBox"]=wasmExports["dCreateBox"])(a0,a1,a2,a3);var _dGeomBoxSetLengths=Module["_dGeomBoxSetLengths"]=(a0,a1,a2,a3)=>(_dGeomBoxSetLengths=Module["_dGeomBoxSetLengths"]=wasmExports["dGeomBoxSetLengths"])(a0,a1,a2,a3);var _dGeomBoxGetLengths=Module["_dGeomBoxGetLengths"]=(a0,a1)=>(_dGeomBoxGetLengths=Module["_dGeomBoxGetLengths"]=wasmExports["dGeomBoxGetLengths"])(a0,a1);var _dCreateCapsule=Module["_dCreateCapsule"]=(a0,a1,a2)=>(_dCreateCapsule=Module["_dCreateCapsule"]=wasmExports["dCreateCapsule"])(a0,a1,a2);var _dGeomCapsuleSetParams=Module["_dGeomCapsuleSetParams"]=(a0,a1,a2)=>(_dGeomCapsuleSetParams=Module["_dGeomCapsuleSetParams"]=wasmExports["dGeomCapsuleSetParams"])(a0,a1,a2);var _dGeomCapsuleGetParams=Module["_dGeomCapsuleGetParams"]=(a0,a1,a2)=>(_dGeomCapsuleGetParams=Module["_dGeomCapsuleGetParams"]=wasmExports["dGeomCapsuleGetParams"])(a0,a1,a2);var _dGeomGetRotation=Module["_dGeomGetRotation"]=a0=>(_dGeomGetRotation=Module["_dGeomGetRotation"]=wasmExports["dGeomGetRotation"])(a0);var _dGeomGetPosition=Module["_dGeomGetPosition"]=a0=>(_dGeomGetPosition=Module["_dGeomGetPosition"]=wasmExports["dGeomGetPosition"])(a0);var _dRSetIdentity=Module["_dRSetIdentity"]=a0=>(_dRSetIdentity=Module["_dRSetIdentity"]=wasmExports["dRSetIdentity"])(a0);var _dGeomPlaneGetParams=Module["_dGeomPlaneGetParams"]=(a0,a1)=>(_dGeomPlaneGetParams=Module["_dGeomPlaneGetParams"]=wasmExports["dGeomPlaneGetParams"])(a0,a1);var _dGeomSphereGetRadius=Module["_dGeomSphereGetRadius"]=a0=>(_dGeomSphereGetRadius=Module["_dGeomSphereGetRadius"]=wasmExports["dGeomSphereGetRadius"])(a0);var _dGeomGetBody=Module["_dGeomGetBody"]=a0=>(_dGeomGetBody=Module["_dGeomGetBody"]=wasmExports["dGeomGetBody"])(a0);var _dBodyGetLinearVel=Module["_dBodyGetLinearVel"]=a0=>(_dBodyGetLinearVel=Module["_dBodyGetLinearVel"]=wasmExports["dBodyGetLinearVel"])(a0);var _dCollide=Module["_dCollide"]=(a0,a1,a2,a3,a4)=>(_dCollide=Module["_dCollide"]=wasmExports["dCollide"])(a0,a1,a2,a3,a4);var _dSpaceAdd=Module["_dSpaceAdd"]=(a0,a1)=>(_dSpaceAdd=Module["_dSpaceAdd"]=wasmExports["dSpaceAdd"])(a0,a1);var _dSpaceRemove=Module["_dSpaceRemove"]=(a0,a1)=>(_dSpaceRemove=Module["_dSpaceRemove"]=wasmExports["dSpaceRemove"])(a0,a1);var _dGeomDestroy=Module["_dGeomDestroy"]=a0=>(_dGeomDestroy=Module["_dGeomDestroy"]=wasmExports["dGeomDestroy"])(a0);var _dGeomSetBody=Module["_dGeomSetBody"]=(a0,a1)=>(_dGeomSetBody=Module["_dGeomSetBody"]=wasmExports["dGeomSetBody"])(a0,a1);var _dGeomSetPosition=Module["_dGeomSetPosition"]=(a0,a1,a2,a3)=>(_dGeomSetPosition=Module["_dGeomSetPosition"]=wasmExports["dGeomSetPosition"])(a0,a1,a2,a3);var _dBodySetPosition=Module["_dBodySetPosition"]=(a0,a1,a2,a3)=>(_dBodySetPosition=Module["_dBodySetPosition"]=wasmExports["dBodySetPosition"])(a0,a1,a2,a3);var _dGeomSetRotation=Module["_dGeomSetRotation"]=(a0,a1)=>(_dGeomSetRotation=Module["_dGeomSetRotation"]=wasmExports["dGeomSetRotation"])(a0,a1);var _dBodySetRotation=Module["_dBodySetRotation"]=(a0,a1)=>(_dBodySetRotation=Module["_dBodySetRotation"]=wasmExports["dBodySetRotation"])(a0,a1);var _dBodySetQuaternion=Module["_dBodySetQuaternion"]=(a0,a1)=>(_dBodySetQuaternion=Module["_dBodySetQuaternion"]=wasmExports["dBodySetQuaternion"])(a0,a1);var _dBodyGetQuaternion=Module["_dBodyGetQuaternion"]=a0=>(_dBodyGetQuaternion=Module["_dBodyGetQuaternion"]=wasmExports["dBodyGetQuaternion"])(a0);var _dGeomGetAABB=Module["_dGeomGetAABB"]=(a0,a1)=>(_dGeomGetAABB=Module["_dGeomGetAABB"]=wasmExports["dGeomGetAABB"])(a0,a1);var _dGeomGetClass=Module["_dGeomGetClass"]=a0=>(_dGeomGetClass=Module["_dGeomGetClass"]=wasmExports["dGeomGetClass"])(a0);var _dSimpleSpaceCreate=Module["_dSimpleSpaceCreate"]=a0=>(_dSimpleSpaceCreate=Module["_dSimpleSpaceCreate"]=wasmExports["dSimpleSpaceCreate"])(a0);var _dHashSpaceCreate=Module["_dHashSpaceCreate"]=a0=>(_dHashSpaceCreate=Module["_dHashSpaceCreate"]=wasmExports["dHashSpaceCreate"])(a0);var _dHashSpaceSetLevels=Module["_dHashSpaceSetLevels"]=(a0,a1,a2)=>(_dHashSpaceSetLevels=Module["_dHashSpaceSetLevels"]=wasmExports["dHashSpaceSetLevels"])(a0,a1,a2);var _dHashSpaceGetLevels=Module["_dHashSpaceGetLevels"]=(a0,a1,a2)=>(_dHashSpaceGetLevels=Module["_dHashSpaceGetLevels"]=wasmExports["dHashSpaceGetLevels"])(a0,a1,a2);var _dSpaceDestroy=Module["_dSpaceDestroy"]=a0=>(_dSpaceDestroy=Module["_dSpaceDestroy"]=wasmExports["dSpaceDestroy"])(a0);var _dSpaceSetCleanup=Module["_dSpaceSetCleanup"]=(a0,a1)=>(_dSpaceSetCleanup=Module["_dSpaceSetCleanup"]=wasmExports["dSpaceSetCleanup"])(a0,a1);var _dSpaceGetCleanup=Module["_dSpaceGetCleanup"]=a0=>(_dSpaceGetCleanup=Module["_dSpaceGetCleanup"]=wasmExports["dSpaceGetCleanup"])(a0);var _dSpaceCollide=Module["_dSpaceCollide"]=(a0,a1,a2)=>(_dSpaceCollide=Module["_dSpaceCollide"]=wasmExports["dSpaceCollide"])(a0,a1,a2);var _dCreateGeomTransform=Module["_dCreateGeomTransform"]=a0=>(_dCreateGeomTransform=Module["_dCreateGeomTransform"]=wasmExports["dCreateGeomTransform"])(a0);var _dGeomTransformSetGeom=Module["_dGeomTransformSetGeom"]=(a0,a1)=>(_dGeomTransformSetGeom=Module["_dGeomTransformSetGeom"]=wasmExports["dGeomTransformSetGeom"])(a0,a1);var _dGeomTransformGetGeom=Module["_dGeomTransformGetGeom"]=a0=>(_dGeomTransformGetGeom=Module["_dGeomTransformGetGeom"]=wasmExports["dGeomTransformGetGeom"])(a0);var _dGeomTransformSetCleanup=Module["_dGeomTransformSetCleanup"]=(a0,a1)=>(_dGeomTransformSetCleanup=Module["_dGeomTransformSetCleanup"]=wasmExports["dGeomTransformSetCleanup"])(a0,a1);var _dGeomTransformGetCleanup=Module["_dGeomTransformGetCleanup"]=a0=>(_dGeomTransformGetCleanup=Module["_dGeomTransformGetCleanup"]=wasmExports["dGeomTransformGetCleanup"])(a0);var _dGeomTriMeshDataCreate=Module["_dGeomTriMeshDataCreate"]=()=>(_dGeomTriMeshDataCreate=Module["_dGeomTriMeshDataCreate"]=wasmExports["dGeomTriMeshDataCreate"])();var _dGeomTriMeshDataDestroy=Module["_dGeomTriMeshDataDestroy"]=a0=>(_dGeomTriMeshDataDestroy=Module["_dGeomTriMeshDataDestroy"]=wasmExports["dGeomTriMeshDataDestroy"])(a0);var _dGeomTriMeshDataBuildSingle1=Module["_dGeomTriMeshDataBuildSingle1"]=(a0,a1,a2,a3,a4,a5,a6,a7)=>(_dGeomTriMeshDataBuildSingle1=Module["_dGeomTriMeshDataBuildSingle1"]=wasmExports["dGeomTriMeshDataBuildSingle1"])(a0,a1,a2,a3,a4,a5,a6,a7);var _dGeomTriMeshDataBuildSingle=Module["_dGeomTriMeshDataBuildSingle"]=(a0,a1,a2,a3,a4,a5,a6)=>(_dGeomTriMeshDataBuildSingle=Module["_dGeomTriMeshDataBuildSingle"]=wasmExports["dGeomTriMeshDataBuildSingle"])(a0,a1,a2,a3,a4,a5,a6);var _dCreateTriMesh=Module["_dCreateTriMesh"]=(a0,a1,a2,a3,a4)=>(_dCreateTriMesh=Module["_dCreateTriMesh"]=wasmExports["dCreateTriMesh"])(a0,a1,a2,a3,a4);var _dCreateCylinder=Module["_dCreateCylinder"]=(a0,a1,a2)=>(_dCreateCylinder=Module["_dCreateCylinder"]=wasmExports["dCreateCylinder"])(a0,a1,a2);var _dGeomHeightfieldDataCreate=Module["_dGeomHeightfieldDataCreate"]=()=>(_dGeomHeightfieldDataCreate=Module["_dGeomHeightfieldDataCreate"]=wasmExports["dGeomHeightfieldDataCreate"])();var _dGeomHeightfieldDataBuildCallback=Module["_dGeomHeightfieldDataBuildCallback"]=(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10)=>(_dGeomHeightfieldDataBuildCallback=Module["_dGeomHeightfieldDataBuildCallback"]=wasmExports["dGeomHeightfieldDataBuildCallback"])(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10);var _dGeomHeightfieldDataSetBounds=Module["_dGeomHeightfieldDataSetBounds"]=(a0,a1,a2)=>(_dGeomHeightfieldDataSetBounds=Module["_dGeomHeightfieldDataSetBounds"]=wasmExports["dGeomHeightfieldDataSetBounds"])(a0,a1,a2);var _dGeomHeightfieldDataDestroy=Module["_dGeomHeightfieldDataDestroy"]=a0=>(_dGeomHeightfieldDataDestroy=Module["_dGeomHeightfieldDataDestroy"]=wasmExports["dGeomHeightfieldDataDestroy"])(a0);var _dCreateHeightfield=Module["_dCreateHeightfield"]=(a0,a1,a2)=>(_dCreateHeightfield=Module["_dCreateHeightfield"]=wasmExports["dCreateHeightfield"])(a0,a1,a2);var _dBodyAddTorque=Module["_dBodyAddTorque"]=(a0,a1,a2,a3)=>(_dBodyAddTorque=Module["_dBodyAddTorque"]=wasmExports["dBodyAddTorque"])(a0,a1,a2,a3);var _dBodyAddForce=Module["_dBodyAddForce"]=(a0,a1,a2,a3)=>(_dBodyAddForce=Module["_dBodyAddForce"]=wasmExports["dBodyAddForce"])(a0,a1,a2,a3);var _dJointSetBallAnchor=Module["_dJointSetBallAnchor"]=(a0,a1,a2,a3)=>(_dJointSetBallAnchor=Module["_dJointSetBallAnchor"]=wasmExports["dJointSetBallAnchor"])(a0,a1,a2,a3);var _dJointGetBallAnchor=Module["_dJointGetBallAnchor"]=(a0,a1)=>(_dJointGetBallAnchor=Module["_dJointGetBallAnchor"]=wasmExports["dJointGetBallAnchor"])(a0,a1);var _dJointSetHingeAnchor=Module["_dJointSetHingeAnchor"]=(a0,a1,a2,a3)=>(_dJointSetHingeAnchor=Module["_dJointSetHingeAnchor"]=wasmExports["dJointSetHingeAnchor"])(a0,a1,a2,a3);var _dJointSetHingeAxis=Module["_dJointSetHingeAxis"]=(a0,a1,a2,a3)=>(_dJointSetHingeAxis=Module["_dJointSetHingeAxis"]=wasmExports["dJointSetHingeAxis"])(a0,a1,a2,a3);var _dJointGetHingeAnchor=Module["_dJointGetHingeAnchor"]=(a0,a1)=>(_dJointGetHingeAnchor=Module["_dJointGetHingeAnchor"]=wasmExports["dJointGetHingeAnchor"])(a0,a1);var _dJointGetHingeAxis=Module["_dJointGetHingeAxis"]=(a0,a1)=>(_dJointGetHingeAxis=Module["_dJointGetHingeAxis"]=wasmExports["dJointGetHingeAxis"])(a0,a1);var _dJointSetHingeParam=Module["_dJointSetHingeParam"]=(a0,a1,a2)=>(_dJointSetHingeParam=Module["_dJointSetHingeParam"]=wasmExports["dJointSetHingeParam"])(a0,a1,a2);var _dJointGetHingeParam=Module["_dJointGetHingeParam"]=(a0,a1)=>(_dJointGetHingeParam=Module["_dJointGetHingeParam"]=wasmExports["dJointGetHingeParam"])(a0,a1);var _dJointGetHingeAngle=Module["_dJointGetHingeAngle"]=a0=>(_dJointGetHingeAngle=Module["_dJointGetHingeAngle"]=wasmExports["dJointGetHingeAngle"])(a0);var _dJointGetHingeAngleRate=Module["_dJointGetHingeAngleRate"]=a0=>(_dJointGetHingeAngleRate=Module["_dJointGetHingeAngleRate"]=wasmExports["dJointGetHingeAngleRate"])(a0);var _dJointGetSliderPosition=Module["_dJointGetSliderPosition"]=a0=>(_dJointGetSliderPosition=Module["_dJointGetSliderPosition"]=wasmExports["dJointGetSliderPosition"])(a0);var _dJointGetSliderPositionRate=Module["_dJointGetSliderPositionRate"]=a0=>(_dJointGetSliderPositionRate=Module["_dJointGetSliderPositionRate"]=wasmExports["dJointGetSliderPositionRate"])(a0);var _dJointSetSliderAxis=Module["_dJointSetSliderAxis"]=(a0,a1,a2,a3)=>(_dJointSetSliderAxis=Module["_dJointSetSliderAxis"]=wasmExports["dJointSetSliderAxis"])(a0,a1,a2,a3);var _dJointGetSliderAxis=Module["_dJointGetSliderAxis"]=(a0,a1)=>(_dJointGetSliderAxis=Module["_dJointGetSliderAxis"]=wasmExports["dJointGetSliderAxis"])(a0,a1);var _dJointSetSliderParam=Module["_dJointSetSliderParam"]=(a0,a1,a2)=>(_dJointSetSliderParam=Module["_dJointSetSliderParam"]=wasmExports["dJointSetSliderParam"])(a0,a1,a2);var _dJointGetSliderParam=Module["_dJointGetSliderParam"]=(a0,a1)=>(_dJointGetSliderParam=Module["_dJointGetSliderParam"]=wasmExports["dJointGetSliderParam"])(a0,a1);var _dJointSetHinge2Anchor=Module["_dJointSetHinge2Anchor"]=(a0,a1,a2,a3)=>(_dJointSetHinge2Anchor=Module["_dJointSetHinge2Anchor"]=wasmExports["dJointSetHinge2Anchor"])(a0,a1,a2,a3);var _dJointSetHinge2Axis1=Module["_dJointSetHinge2Axis1"]=(a0,a1,a2,a3)=>(_dJointSetHinge2Axis1=Module["_dJointSetHinge2Axis1"]=wasmExports["dJointSetHinge2Axis1"])(a0,a1,a2,a3);var _dJointSetHinge2Axis2=Module["_dJointSetHinge2Axis2"]=(a0,a1,a2,a3)=>(_dJointSetHinge2Axis2=Module["_dJointSetHinge2Axis2"]=wasmExports["dJointSetHinge2Axis2"])(a0,a1,a2,a3);var _dJointSetHinge2Param=Module["_dJointSetHinge2Param"]=(a0,a1,a2)=>(_dJointSetHinge2Param=Module["_dJointSetHinge2Param"]=wasmExports["dJointSetHinge2Param"])(a0,a1,a2);var _dJointGetHinge2Anchor=Module["_dJointGetHinge2Anchor"]=(a0,a1)=>(_dJointGetHinge2Anchor=Module["_dJointGetHinge2Anchor"]=wasmExports["dJointGetHinge2Anchor"])(a0,a1);var _dJointGetHinge2Axis1=Module["_dJointGetHinge2Axis1"]=(a0,a1)=>(_dJointGetHinge2Axis1=Module["_dJointGetHinge2Axis1"]=wasmExports["dJointGetHinge2Axis1"])(a0,a1);var _dJointGetHinge2Axis2=Module["_dJointGetHinge2Axis2"]=(a0,a1)=>(_dJointGetHinge2Axis2=Module["_dJointGetHinge2Axis2"]=wasmExports["dJointGetHinge2Axis2"])(a0,a1);var _dJointGetHinge2Param=Module["_dJointGetHinge2Param"]=(a0,a1)=>(_dJointGetHinge2Param=Module["_dJointGetHinge2Param"]=wasmExports["dJointGetHinge2Param"])(a0,a1);var _dJointGetHinge2Angle1=Module["_dJointGetHinge2Angle1"]=a0=>(_dJointGetHinge2Angle1=Module["_dJointGetHinge2Angle1"]=wasmExports["dJointGetHinge2Angle1"])(a0);var _dJointGetHinge2Angle1Rate=Module["_dJointGetHinge2Angle1Rate"]=a0=>(_dJointGetHinge2Angle1Rate=Module["_dJointGetHinge2Angle1Rate"]=wasmExports["dJointGetHinge2Angle1Rate"])(a0);var _dJointGetHinge2Angle2Rate=Module["_dJointGetHinge2Angle2Rate"]=a0=>(_dJointGetHinge2Angle2Rate=Module["_dJointGetHinge2Angle2Rate"]=wasmExports["dJointGetHinge2Angle2Rate"])(a0);var _dJointSetUniversalAnchor=Module["_dJointSetUniversalAnchor"]=(a0,a1,a2,a3)=>(_dJointSetUniversalAnchor=Module["_dJointSetUniversalAnchor"]=wasmExports["dJointSetUniversalAnchor"])(a0,a1,a2,a3);var _dRFrom2Axes=Module["_dRFrom2Axes"]=(a0,a1,a2,a3,a4,a5,a6)=>(_dRFrom2Axes=Module["_dRFrom2Axes"]=wasmExports["dRFrom2Axes"])(a0,a1,a2,a3,a4,a5,a6);var _dJointSetUniversalAxis1=Module["_dJointSetUniversalAxis1"]=(a0,a1,a2,a3)=>(_dJointSetUniversalAxis1=Module["_dJointSetUniversalAxis1"]=wasmExports["dJointSetUniversalAxis1"])(a0,a1,a2,a3);var _dJointSetUniversalAxis2=Module["_dJointSetUniversalAxis2"]=(a0,a1,a2,a3)=>(_dJointSetUniversalAxis2=Module["_dJointSetUniversalAxis2"]=wasmExports["dJointSetUniversalAxis2"])(a0,a1,a2,a3);var _dJointGetUniversalAnchor=Module["_dJointGetUniversalAnchor"]=(a0,a1)=>(_dJointGetUniversalAnchor=Module["_dJointGetUniversalAnchor"]=wasmExports["dJointGetUniversalAnchor"])(a0,a1);var _dJointGetUniversalAnchor2=Module["_dJointGetUniversalAnchor2"]=(a0,a1)=>(_dJointGetUniversalAnchor2=Module["_dJointGetUniversalAnchor2"]=wasmExports["dJointGetUniversalAnchor2"])(a0,a1);var _dJointGetUniversalAxis1=Module["_dJointGetUniversalAxis1"]=(a0,a1)=>(_dJointGetUniversalAxis1=Module["_dJointGetUniversalAxis1"]=wasmExports["dJointGetUniversalAxis1"])(a0,a1);var _dJointGetUniversalAxis2=Module["_dJointGetUniversalAxis2"]=(a0,a1)=>(_dJointGetUniversalAxis2=Module["_dJointGetUniversalAxis2"]=wasmExports["dJointGetUniversalAxis2"])(a0,a1);var _dJointSetUniversalParam=Module["_dJointSetUniversalParam"]=(a0,a1,a2)=>(_dJointSetUniversalParam=Module["_dJointSetUniversalParam"]=wasmExports["dJointSetUniversalParam"])(a0,a1,a2);var _dJointGetUniversalParam=Module["_dJointGetUniversalParam"]=(a0,a1)=>(_dJointGetUniversalParam=Module["_dJointGetUniversalParam"]=wasmExports["dJointGetUniversalParam"])(a0,a1);var _dJointGetUniversalAngle1=Module["_dJointGetUniversalAngle1"]=a0=>(_dJointGetUniversalAngle1=Module["_dJointGetUniversalAngle1"]=wasmExports["dJointGetUniversalAngle1"])(a0);var _dJointGetUniversalAngle2=Module["_dJointGetUniversalAngle2"]=a0=>(_dJointGetUniversalAngle2=Module["_dJointGetUniversalAngle2"]=wasmExports["dJointGetUniversalAngle2"])(a0);var _dJointGetUniversalAngle1Rate=Module["_dJointGetUniversalAngle1Rate"]=a0=>(_dJointGetUniversalAngle1Rate=Module["_dJointGetUniversalAngle1Rate"]=wasmExports["dJointGetUniversalAngle1Rate"])(a0);var _dJointGetUniversalAngle2Rate=Module["_dJointGetUniversalAngle2Rate"]=a0=>(_dJointGetUniversalAngle2Rate=Module["_dJointGetUniversalAngle2Rate"]=wasmExports["dJointGetUniversalAngle2Rate"])(a0);var _dJointSetAMotorNumAxes=Module["_dJointSetAMotorNumAxes"]=(a0,a1)=>(_dJointSetAMotorNumAxes=Module["_dJointSetAMotorNumAxes"]=wasmExports["dJointSetAMotorNumAxes"])(a0,a1);var _dJointSetAMotorAxis=Module["_dJointSetAMotorAxis"]=(a0,a1,a2,a3,a4,a5)=>(_dJointSetAMotorAxis=Module["_dJointSetAMotorAxis"]=wasmExports["dJointSetAMotorAxis"])(a0,a1,a2,a3,a4,a5);var _dJointSetAMotorAngle=Module["_dJointSetAMotorAngle"]=(a0,a1,a2)=>(_dJointSetAMotorAngle=Module["_dJointSetAMotorAngle"]=wasmExports["dJointSetAMotorAngle"])(a0,a1,a2);var _dJointSetAMotorParam=Module["_dJointSetAMotorParam"]=(a0,a1,a2)=>(_dJointSetAMotorParam=Module["_dJointSetAMotorParam"]=wasmExports["dJointSetAMotorParam"])(a0,a1,a2);var _dJointSetAMotorMode=Module["_dJointSetAMotorMode"]=(a0,a1)=>(_dJointSetAMotorMode=Module["_dJointSetAMotorMode"]=wasmExports["dJointSetAMotorMode"])(a0,a1);var _dJointGetAMotorNumAxes=Module["_dJointGetAMotorNumAxes"]=a0=>(_dJointGetAMotorNumAxes=Module["_dJointGetAMotorNumAxes"]=wasmExports["dJointGetAMotorNumAxes"])(a0);var _dJointGetAMotorAxis=Module["_dJointGetAMotorAxis"]=(a0,a1,a2)=>(_dJointGetAMotorAxis=Module["_dJointGetAMotorAxis"]=wasmExports["dJointGetAMotorAxis"])(a0,a1,a2);var _dJointGetAMotorAxisRel=Module["_dJointGetAMotorAxisRel"]=(a0,a1)=>(_dJointGetAMotorAxisRel=Module["_dJointGetAMotorAxisRel"]=wasmExports["dJointGetAMotorAxisRel"])(a0,a1);var _dJointGetAMotorAngle=Module["_dJointGetAMotorAngle"]=(a0,a1)=>(_dJointGetAMotorAngle=Module["_dJointGetAMotorAngle"]=wasmExports["dJointGetAMotorAngle"])(a0,a1);var _dJointGetAMotorAngleRate=Module["_dJointGetAMotorAngleRate"]=(a0,a1)=>(_dJointGetAMotorAngleRate=Module["_dJointGetAMotorAngleRate"]=wasmExports["dJointGetAMotorAngleRate"])(a0,a1);var _dJointGetAMotorParam=Module["_dJointGetAMotorParam"]=(a0,a1)=>(_dJointGetAMotorParam=Module["_dJointGetAMotorParam"]=wasmExports["dJointGetAMotorParam"])(a0,a1);var _dJointGetAMotorMode=Module["_dJointGetAMotorMode"]=a0=>(_dJointGetAMotorMode=Module["_dJointGetAMotorMode"]=wasmExports["dJointGetAMotorMode"])(a0);var _dJointSetFixed=Module["_dJointSetFixed"]=a0=>(_dJointSetFixed=Module["_dJointSetFixed"]=wasmExports["dJointSetFixed"])(a0);var _dMassSetZero=Module["_dMassSetZero"]=a0=>(_dMassSetZero=Module["_dMassSetZero"]=wasmExports["dMassSetZero"])(a0);var _dMassSetParameters=Module["_dMassSetParameters"]=(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10)=>(_dMassSetParameters=Module["_dMassSetParameters"]=wasmExports["dMassSetParameters"])(a0,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10);var _dMassSetSphere=Module["_dMassSetSphere"]=(a0,a1,a2)=>(_dMassSetSphere=Module["_dMassSetSphere"]=wasmExports["dMassSetSphere"])(a0,a1,a2);var _dMassSetSphereTotal=Module["_dMassSetSphereTotal"]=(a0,a1,a2)=>(_dMassSetSphereTotal=Module["_dMassSetSphereTotal"]=wasmExports["dMassSetSphereTotal"])(a0,a1,a2);var _dMassSetCapsule=Module["_dMassSetCapsule"]=(a0,a1,a2,a3,a4)=>(_dMassSetCapsule=Module["_dMassSetCapsule"]=wasmExports["dMassSetCapsule"])(a0,a1,a2,a3,a4);var _dMassSetCapsuleTotal=Module["_dMassSetCapsuleTotal"]=(a0,a1,a2,a3,a4)=>(_dMassSetCapsuleTotal=Module["_dMassSetCapsuleTotal"]=wasmExports["dMassSetCapsuleTotal"])(a0,a1,a2,a3,a4);var _dMassAdjust=Module["_dMassAdjust"]=(a0,a1)=>(_dMassAdjust=Module["_dMassAdjust"]=wasmExports["dMassAdjust"])(a0,a1);var _dMassSetCylinder=Module["_dMassSetCylinder"]=(a0,a1,a2,a3,a4)=>(_dMassSetCylinder=Module["_dMassSetCylinder"]=wasmExports["dMassSetCylinder"])(a0,a1,a2,a3,a4);var _dMassSetCylinderTotal=Module["_dMassSetCylinderTotal"]=(a0,a1,a2,a3,a4)=>(_dMassSetCylinderTotal=Module["_dMassSetCylinderTotal"]=wasmExports["dMassSetCylinderTotal"])(a0,a1,a2,a3,a4);var _dMassSetBox=Module["_dMassSetBox"]=(a0,a1,a2,a3,a4)=>(_dMassSetBox=Module["_dMassSetBox"]=wasmExports["dMassSetBox"])(a0,a1,a2,a3,a4);var _dMassSetBoxTotal=Module["_dMassSetBoxTotal"]=(a0,a1,a2,a3,a4)=>(_dMassSetBoxTotal=Module["_dMassSetBoxTotal"]=wasmExports["dMassSetBoxTotal"])(a0,a1,a2,a3,a4);var _dMassTranslate=Module["_dMassTranslate"]=(a0,a1,a2,a3)=>(_dMassTranslate=Module["_dMassTranslate"]=wasmExports["dMassTranslate"])(a0,a1,a2,a3);var _dMassRotate=Module["_dMassRotate"]=(a0,a1)=>(_dMassRotate=Module["_dMassRotate"]=wasmExports["dMassRotate"])(a0,a1);var _dMassAdd=Module["_dMassAdd"]=(a0,a1)=>(_dMassAdd=Module["_dMassAdd"]=wasmExports["dMassAdd"])(a0,a1);var _dBodyCreate=Module["_dBodyCreate"]=a0=>(_dBodyCreate=Module["_dBodyCreate"]=wasmExports["dBodyCreate"])(a0);var _dBodyDestroy=Module["_dBodyDestroy"]=a0=>(_dBodyDestroy=Module["_dBodyDestroy"]=wasmExports["dBodyDestroy"])(a0);var _dBodySetLinearVel=Module["_dBodySetLinearVel"]=(a0,a1,a2,a3)=>(_dBodySetLinearVel=Module["_dBodySetLinearVel"]=wasmExports["dBodySetLinearVel"])(a0,a1,a2,a3);var _dBodySetAngularVel=Module["_dBodySetAngularVel"]=(a0,a1,a2,a3)=>(_dBodySetAngularVel=Module["_dBodySetAngularVel"]=wasmExports["dBodySetAngularVel"])(a0,a1,a2,a3);var _dBodyGetPosition=Module["_dBodyGetPosition"]=a0=>(_dBodyGetPosition=Module["_dBodyGetPosition"]=wasmExports["dBodyGetPosition"])(a0);var _dBodyGetRotation=Module["_dBodyGetRotation"]=a0=>(_dBodyGetRotation=Module["_dBodyGetRotation"]=wasmExports["dBodyGetRotation"])(a0);var _dBodyGetAngularVel=Module["_dBodyGetAngularVel"]=a0=>(_dBodyGetAngularVel=Module["_dBodyGetAngularVel"]=wasmExports["dBodyGetAngularVel"])(a0);var _dBodySetMass=Module["_dBodySetMass"]=(a0,a1)=>(_dBodySetMass=Module["_dBodySetMass"]=wasmExports["dBodySetMass"])(a0,a1);var _dBodyGetMass=Module["_dBodyGetMass"]=(a0,a1)=>(_dBodyGetMass=Module["_dBodyGetMass"]=wasmExports["dBodyGetMass"])(a0,a1);var _dBodyAddRelForce=Module["_dBodyAddRelForce"]=(a0,a1,a2,a3)=>(_dBodyAddRelForce=Module["_dBodyAddRelForce"]=wasmExports["dBodyAddRelForce"])(a0,a1,a2,a3);var _dBodyAddRelTorque=Module["_dBodyAddRelTorque"]=(a0,a1,a2,a3)=>(_dBodyAddRelTorque=Module["_dBodyAddRelTorque"]=wasmExports["dBodyAddRelTorque"])(a0,a1,a2,a3);var _dBodyAddForceAtPos=Module["_dBodyAddForceAtPos"]=(a0,a1,a2,a3,a4,a5,a6)=>(_dBodyAddForceAtPos=Module["_dBodyAddForceAtPos"]=wasmExports["dBodyAddForceAtPos"])(a0,a1,a2,a3,a4,a5,a6);var _dBodyAddForceAtRelPos=Module["_dBodyAddForceAtRelPos"]=(a0,a1,a2,a3,a4,a5,a6)=>(_dBodyAddForceAtRelPos=Module["_dBodyAddForceAtRelPos"]=wasmExports["dBodyAddForceAtRelPos"])(a0,a1,a2,a3,a4,a5,a6);var _dBodyAddRelForceAtPos=Module["_dBodyAddRelForceAtPos"]=(a0,a1,a2,a3,a4,a5,a6)=>(_dBodyAddRelForceAtPos=Module["_dBodyAddRelForceAtPos"]=wasmExports["dBodyAddRelForceAtPos"])(a0,a1,a2,a3,a4,a5,a6);var _dBodyAddRelForceAtRelPos=Module["_dBodyAddRelForceAtRelPos"]=(a0,a1,a2,a3,a4,a5,a6)=>(_dBodyAddRelForceAtRelPos=Module["_dBodyAddRelForceAtRelPos"]=wasmExports["dBodyAddRelForceAtRelPos"])(a0,a1,a2,a3,a4,a5,a6);var _dBodyGetForce=Module["_dBodyGetForce"]=a0=>(_dBodyGetForce=Module["_dBodyGetForce"]=wasmExports["dBodyGetForce"])(a0);var _dBodyGetTorque=Module["_dBodyGetTorque"]=a0=>(_dBodyGetTorque=Module["_dBodyGetTorque"]=wasmExports["dBodyGetTorque"])(a0);var _dBodyGetRelPointPos=Module["_dBodyGetRelPointPos"]=(a0,a1,a2,a3,a4)=>(_dBodyGetRelPointPos=Module["_dBodyGetRelPointPos"]=wasmExports["dBodyGetRelPointPos"])(a0,a1,a2,a3,a4);var _dBodyGetRelPointVel=Module["_dBodyGetRelPointVel"]=(a0,a1,a2,a3,a4)=>(_dBodyGetRelPointVel=Module["_dBodyGetRelPointVel"]=wasmExports["dBodyGetRelPointVel"])(a0,a1,a2,a3,a4);var _dBodyGetNumJoints=Module["_dBodyGetNumJoints"]=a0=>(_dBodyGetNumJoints=Module["_dBodyGetNumJoints"]=wasmExports["dBodyGetNumJoints"])(a0);var _dBodyGetJoint=Module["_dBodyGetJoint"]=(a0,a1)=>(_dBodyGetJoint=Module["_dBodyGetJoint"]=wasmExports["dBodyGetJoint"])(a0,a1);var _dBodyEnable=Module["_dBodyEnable"]=a0=>(_dBodyEnable=Module["_dBodyEnable"]=wasmExports["dBodyEnable"])(a0);var _dBodyDisable=Module["_dBodyDisable"]=a0=>(_dBodyDisable=Module["_dBodyDisable"]=wasmExports["dBodyDisable"])(a0);var _dBodyIsEnabled=Module["_dBodyIsEnabled"]=a0=>(_dBodyIsEnabled=Module["_dBodyIsEnabled"]=wasmExports["dBodyIsEnabled"])(a0);var _dJointCreateBall=Module["_dJointCreateBall"]=(a0,a1)=>(_dJointCreateBall=Module["_dJointCreateBall"]=wasmExports["dJointCreateBall"])(a0,a1);var _dJointCreateHinge=Module["_dJointCreateHinge"]=(a0,a1)=>(_dJointCreateHinge=Module["_dJointCreateHinge"]=wasmExports["dJointCreateHinge"])(a0,a1);var _dJointCreateSlider=Module["_dJointCreateSlider"]=(a0,a1)=>(_dJointCreateSlider=Module["_dJointCreateSlider"]=wasmExports["dJointCreateSlider"])(a0,a1);var _dJointCreateContact=Module["_dJointCreateContact"]=(a0,a1,a2)=>(_dJointCreateContact=Module["_dJointCreateContact"]=wasmExports["dJointCreateContact"])(a0,a1,a2);var _dJointCreateHinge2=Module["_dJointCreateHinge2"]=(a0,a1)=>(_dJointCreateHinge2=Module["_dJointCreateHinge2"]=wasmExports["dJointCreateHinge2"])(a0,a1);var _dJointCreateUniversal=Module["_dJointCreateUniversal"]=(a0,a1)=>(_dJointCreateUniversal=Module["_dJointCreateUniversal"]=wasmExports["dJointCreateUniversal"])(a0,a1);var _dJointCreateFixed=Module["_dJointCreateFixed"]=(a0,a1)=>(_dJointCreateFixed=Module["_dJointCreateFixed"]=wasmExports["dJointCreateFixed"])(a0,a1);var _dJointCreateNull=Module["_dJointCreateNull"]=(a0,a1)=>(_dJointCreateNull=Module["_dJointCreateNull"]=wasmExports["dJointCreateNull"])(a0,a1);var _dJointCreateAMotor=Module["_dJointCreateAMotor"]=(a0,a1)=>(_dJointCreateAMotor=Module["_dJointCreateAMotor"]=wasmExports["dJointCreateAMotor"])(a0,a1);var _dJointDestroy=Module["_dJointDestroy"]=a0=>(_dJointDestroy=Module["_dJointDestroy"]=wasmExports["dJointDestroy"])(a0);var _dJointGroupCreate=Module["_dJointGroupCreate"]=a0=>(_dJointGroupCreate=Module["_dJointGroupCreate"]=wasmExports["dJointGroupCreate"])(a0);var _dJointGroupDestroy=Module["_dJointGroupDestroy"]=a0=>(_dJointGroupDestroy=Module["_dJointGroupDestroy"]=wasmExports["dJointGroupDestroy"])(a0);var _dJointGroupEmpty=Module["_dJointGroupEmpty"]=a0=>(_dJointGroupEmpty=Module["_dJointGroupEmpty"]=wasmExports["dJointGroupEmpty"])(a0);var _dJointAttach=Module["_dJointAttach"]=(a0,a1,a2)=>(_dJointAttach=Module["_dJointAttach"]=wasmExports["dJointAttach"])(a0,a1,a2);var _dJointGetType=Module["_dJointGetType"]=a0=>(_dJointGetType=Module["_dJointGetType"]=wasmExports["dJointGetType"])(a0);var _dJointGetBody=Module["_dJointGetBody"]=(a0,a1)=>(_dJointGetBody=Module["_dJointGetBody"]=wasmExports["dJointGetBody"])(a0,a1);var _dAreConnected=Module["_dAreConnected"]=(a0,a1)=>(_dAreConnected=Module["_dAreConnected"]=wasmExports["dAreConnected"])(a0,a1);var _dWorldCreate=Module["_dWorldCreate"]=()=>(_dWorldCreate=Module["_dWorldCreate"]=wasmExports["dWorldCreate"])();var _dWorldDestroy=Module["_dWorldDestroy"]=a0=>(_dWorldDestroy=Module["_dWorldDestroy"]=wasmExports["dWorldDestroy"])(a0);var _dWorldSetGravity=Module["_dWorldSetGravity"]=(a0,a1,a2,a3)=>(_dWorldSetGravity=Module["_dWorldSetGravity"]=wasmExports["dWorldSetGravity"])(a0,a1,a2,a3);var _dWorldGetGravity=Module["_dWorldGetGravity"]=(a0,a1)=>(_dWorldGetGravity=Module["_dWorldGetGravity"]=wasmExports["dWorldGetGravity"])(a0,a1);var _dWorldSetERP=Module["_dWorldSetERP"]=(a0,a1)=>(_dWorldSetERP=Module["_dWorldSetERP"]=wasmExports["dWorldSetERP"])(a0,a1);var _dWorldGetERP=Module["_dWorldGetERP"]=a0=>(_dWorldGetERP=Module["_dWorldGetERP"]=wasmExports["dWorldGetERP"])(a0);var _dWorldSetCFM=Module["_dWorldSetCFM"]=(a0,a1)=>(_dWorldSetCFM=Module["_dWorldSetCFM"]=wasmExports["dWorldSetCFM"])(a0,a1);var _dWorldGetCFM=Module["_dWorldGetCFM"]=a0=>(_dWorldGetCFM=Module["_dWorldGetCFM"]=wasmExports["dWorldGetCFM"])(a0);var _dWorldStep=Module["_dWorldStep"]=(a0,a1)=>(_dWorldStep=Module["_dWorldStep"]=wasmExports["dWorldStep"])(a0,a1);var _dWorldQuickStep=Module["_dWorldQuickStep"]=(a0,a1)=>(_dWorldQuickStep=Module["_dWorldQuickStep"]=wasmExports["dWorldQuickStep"])(a0,a1);var _dWorldSetQuickStepNumIterations=Module["_dWorldSetQuickStepNumIterations"]=(a0,a1)=>(_dWorldSetQuickStepNumIterations=Module["_dWorldSetQuickStepNumIterations"]=wasmExports["dWorldSetQuickStepNumIterations"])(a0,a1);var _dWorldSetContactMaxCorrectingVel=Module["_dWorldSetContactMaxCorrectingVel"]=(a0,a1)=>(_dWorldSetContactMaxCorrectingVel=Module["_dWorldSetContactMaxCorrectingVel"]=wasmExports["dWorldSetContactMaxCorrectingVel"])(a0,a1);var _dWorldGetContactMaxCorrectingVel=Module["_dWorldGetContactMaxCorrectingVel"]=a0=>(_dWorldGetContactMaxCorrectingVel=Module["_dWorldGetContactMaxCorrectingVel"]=wasmExports["dWorldGetContactMaxCorrectingVel"])(a0);var _dWorldSetContactSurfaceLayer=Module["_dWorldSetContactSurfaceLayer"]=(a0,a1)=>(_dWorldSetContactSurfaceLayer=Module["_dWorldSetContactSurfaceLayer"]=wasmExports["dWorldSetContactSurfaceLayer"])(a0,a1);var _dWorldGetContactSurfaceLayer=Module["_dWorldGetContactSurfaceLayer"]=a0=>(_dWorldGetContactSurfaceLayer=Module["_dWorldGetContactSurfaceLayer"]=wasmExports["dWorldGetContactSurfaceLayer"])(a0);var _dCreatePlane=Module["_dCreatePlane"]=(a0,a1,a2,a3,a4)=>(_dCreatePlane=Module["_dCreatePlane"]=wasmExports["dCreatePlane"])(a0,a1,a2,a3,a4);var _dGeomPlaneSetParams=Module["_dGeomPlaneSetParams"]=(a0,a1,a2,a3,a4)=>(_dGeomPlaneSetParams=Module["_dGeomPlaneSetParams"]=wasmExports["dGeomPlaneSetParams"])(a0,a1,a2,a3,a4);var _dRFromAxisAndAngle=Module["_dRFromAxisAndAngle"]=(a0,a1,a2,a3,a4)=>(_dRFromAxisAndAngle=Module["_dRFromAxisAndAngle"]=wasmExports["dRFromAxisAndAngle"])(a0,a1,a2,a3,a4);var _dQFromAxisAndAngle=Module["_dQFromAxisAndAngle"]=(a0,a1,a2,a3,a4)=>(_dQFromAxisAndAngle=Module["_dQFromAxisAndAngle"]=wasmExports["dQFromAxisAndAngle"])(a0,a1,a2,a3,a4);var _dRFromEulerAngles=Module["_dRFromEulerAngles"]=(a0,a1,a2,a3)=>(_dRFromEulerAngles=Module["_dRFromEulerAngles"]=wasmExports["dRFromEulerAngles"])(a0,a1,a2,a3);var _dQSetIdentity=Module["_dQSetIdentity"]=a0=>(_dQSetIdentity=Module["_dQSetIdentity"]=wasmExports["dQSetIdentity"])(a0);var _dCreateSphere=Module["_dCreateSphere"]=(a0,a1)=>(_dCreateSphere=Module["_dCreateSphere"]=wasmExports["dCreateSphere"])(a0,a1);var _dGeomSphereSetRadius=Module["_dGeomSphereSetRadius"]=(a0,a1)=>(_dGeomSphereSetRadius=Module["_dGeomSphereSetRadius"]=wasmExports["dGeomSphereSetRadius"])(a0,a1);var ___errno_location=()=>(___errno_location=wasmExports["__errno_location"])();var _setThrew=(a0,a1)=>(_setThrew=wasmExports["setThrew"])(a0,a1);var stackSave=()=>(stackSave=wasmExports["stackSave"])();var stackRestore=a0=>(stackRestore=wasmExports["stackRestore"])(a0);var stackAlloc=a0=>(stackAlloc=wasmExports["stackAlloc"])(a0);var dynCall_jiji=Module["dynCall_jiji"]=(a0,a1,a2,a3,a4)=>(dynCall_jiji=Module["dynCall_jiji"]=wasmExports["dynCall_jiji"])(a0,a1,a2,a3,a4);function intArrayFromBase64(s){if(typeof ENVIRONMENT_IS_NODE!="undefined"&&ENVIRONMENT_IS_NODE){var buf=Buffer.from(s,"base64");return new Uint8Array(buf.buffer,buf.byteOffset,buf.length)}try{var decoded=atob(s);var bytes=new Uint8Array(decoded.length);for(var i=0;i<decoded.length;++i){bytes[i]=decoded.charCodeAt(i)}return bytes}catch(_){throw new Error("Converting base64 string to bytes failed.")}}function tryParseAsDataURI(filename){if(!isDataURI(filename)){return}return intArrayFromBase64(filename.slice(dataURIPrefix.length))}Module["ccall"]=ccall;Module["cwrap"]=cwrap;Module["addFunction"]=addFunction;Module["removeFunction"]=removeFunction;Module["setValue"]=setValue;Module["getValue"]=getValue;var calledRun;dependenciesFulfilled=function runCaller(){if(!calledRun)run();if(!calledRun)dependenciesFulfilled=runCaller};function run(){if(runDependencies>0){return}preRun();if(runDependencies>0){return}function doRun(){if(calledRun)return;calledRun=true;Module["calledRun"]=true;if(ABORT)return;initRuntime();if(Module["onRuntimeInitialized"])Module["onRuntimeInitialized"]();postRun()}if(Module["setStatus"]){Module["setStatus"]("Running...");setTimeout(function(){setTimeout(function(){Module["setStatus"]("")},1);doRun()},1)}else{doRun()}}if(Module["preInit"]){if(typeof Module["preInit"]=="function")Module["preInit"]=[Module["preInit"]];while(Module["preInit"].length>0){Module["preInit"].pop()()}}run();var _resolve;var ODE={ready:false,readyPromise:new Promise(function(resolve){_resolve=resolve})};addOnPostRun(function(){var javascriptHeap={};var vec4=Module._malloc(4*4);var mat3=Module._malloc(4*3*4);var mass=Module._malloc((1+4+4*3)*4);var vec6=Module._malloc(6*4);function getVec6(){var mat=new Array(6);for(var i=0;i<6;i++)mat[i]=Module.getValue(vec6+i*4,"float");return mat}var sizeOfRotation=4*3*4;var dRSetIdentity=Module.cwrap("dRSetIdentity",null,["number"]);var dRFromAxisAndAngle=Module.cwrap("dRFromAxisAndAngle",null,["number","number","number","number","number"]);var dRFromEulerAngles=Module.cwrap("dRFromEulerAngles",null,["number","number","number","number"]);var dRFrom2Axes=Module.cwrap("dRFrom2Axes",null,["number","number","number","number","number","number","number"]);ODE.Rotation=function(){var pointer=arguments[0]||Module._malloc(sizeOfRotation);if(!javascriptHeap[pointer]){javascriptHeap[pointer]=this}this.getPointer=function(){return pointer};this.setIdentity=function(){dRSetIdentity(pointer);return this};this.setArray=function(mat){for(var i=0;i<12;i++)Module.setValue(pointer+i*4,mat[i],"float");return this};this.getArray=function(){return Module.HEAPF32.slice(pointer/4,pointer/4+12)};this.fromAxisAndAngle=function(ax,ay,az,angle){dRFromAxisAndAngle(pointer,ax,ay,az,angle);return this};this.fromEulerAngles=function(phi,theta,psi){dRFromEulerAngles(pointer,phi,theta,psi);return this}};var sizeOfQuaternion=4*4;var dQSetIdentity=Module.cwrap("dQSetIdentity",null,["number"]);var dQFromAxisAndAngle=Module.cwrap("dQFromAxisAndAngle",null,["number","number","number","number","number"]);ODE.Quaternion=function(){var pointer=arguments[0]||Module._malloc(sizeOfQuaternion);if(!javascriptHeap[pointer]){javascriptHeap[pointer]=this}this.getPointer=function(){return pointer};this.setIdentity=function(){dQSetIdentity(pointer);return this};this.setArray=function(quat){for(var i=0;i<4;i++)Module.setValue(pointer+i*4,quat[i],"float");return this};this.getArray=function(geom){return Module.HEAPF32.slice(pointer/4,pointer/4+4)};this.fromAxisAndAngle=function(ax,ay,az,angle){dQFromAxisAndAngle(pointer,ax,ay,az,angle);return this}};var sizeOfMass=(1+4+4*3)*4;var dMassSetZero=Module.cwrap("dMassSetZero",null,["number"]);var dMassSetParameters=Module.cwrap("dMassSetParameters",null,["number","number","number","number","number","number","number","number","number","number","number"]);var dMassSetSphere=Module.cwrap("dMassSetSphere",null,["number","number","number"]);var dMassSetSphereTotal=Module.cwrap("dMassSetSphereTotal",null,["number","number","number"]);var dMassSetCapsule=Module.cwrap("dMassSetCapsule",null,["number","number","number","number","number"]);var dMassSetCapsuleTotal=Module.cwrap("dMassSetCapsuleTotal",null,["number","number","number","number","number"]);var dMassSetCylinder=Module.cwrap("dMassSetCylinder",null,["number","number","number","number","number"]);var dMassSetCylinderTotal=Module.cwrap("dMassSetCylinderTotal",null,["number","number","number","number","number"]);var dMassSetBox=Module.cwrap("dMassSetBox",null,["number","number","number","number","number"]);var dMassSetBoxTotal=Module.cwrap("dMassSetBoxTotal",null,["number","number","number","number","number"]);var dMassAdjust=Module.cwrap("dMassAdjust",null,["number","number"]);var dMassTranslate=Module.cwrap("dMassTranslate",null,["number","number","number","number"]);var dMassRotate=Module.cwrap("dMassRotate",null,["number","number"]);var dMassAdd=Module.cwrap("dMassAdd",null,["number","number"]);ODE.Mass=function(){var pointer=arguments[0]||Module._malloc(sizeOfMass);this.getPointer=function(){return pointer};this.destroy=function(){return Module._free(pointer)};this.setZero=function(){dMassSetZero(pointer);return this};this.setParameters=function(mass,cgx,cgy,cgz,I11,I22,I33,I12,I13,I23){dMassSetParameters(pointer,mass,cgx,cgy,cgz,I11,I22,I33,I12,I13,I23);return this};this.setSphere=function(density,radius){dMassSetSphere(pointer,density,radius);return this};this.setSphereTotal=function(total_mass,radius){dMassSetSphereTotal(pointer,total_mass,radius);return this};this.setCapsule=function(density,direction,a,b){dMassSetCapsule(pointer,density,direction,a,b);return this};this.setCapsuleTotal=function(total_mass,direction,a,b){dMassSetCapsuleTotal(pointer,total_mass,direction,a,b);return this};this.setCylinder=function(density,direction,a,b){dMassSetCylinder(pointer,density,direction,a,b);return this};this.setCylinderTotal=function(total_mass,direction,a,b){dMassSetCylinderTotal(pointer,total_mass,direction,a,b);return this};this.setBox=function(density,lx,ly,lz){dMassSetBox(pointer,density,lx,ly,lz);return this};this.setBoxTotal=function(total_mass,lx,ly,lz){dMassSetBoxTotal(pointer,total_mass,lx,ly,lz);return this};this.adjust=function(newmass){dMassAdjust(pointer,newmass);return this};this.translate=function(x,y,z){dMassTranslate(pointer,x,y,z);return this};this.rotate=function(rotation){dMassRotate(mass,rotation.getPointer());return this};this.add=function(mass){dMassAdd(pointer,mass.getPointer());return this}};var dJointGroupCreate=Module.cwrap("dJointGroupCreate","number",["number"]);var dJointGroupDestroy=Module.cwrap("dJointGroupDestroy",null,["number"]);var dJointGroupEmpty=Module.cwrap("dJointGroupEmpty",null,["number"]);ODE.Joint={Types:{Unknown:0,Ball:1,Hinge:2,Slider:3,Contact:4,Universal:5,Hinge2:6,Fixed:7,Null:8,AMotor:9,LMotor:10,Plane2D:11},Parameters:{LoStop:0,HiStop:1,Vel:2,FMax:3,FudgeFactor:4,Bounce:5,StopERP:6,StopCFM:7,SuspensionERP:8,SuspensionCFM:9,LoStop2:256+0,HiStop2:256+1,Vel2:256+2,FMax2:256+3,FudgeFactor2:256+4,Bounce2:256+5,StopERP2:256+6,StopCFM2:256+7,SuspensionERP2:256+8,SuspensionCFM2:256+9,LoStop3:512+0,HiStop3:512+1,Vel3:512+2,FMax3:512+3,FudgeFactor3:512+4,Bounce3:512+5,StopERP3:512+6,StopCFM3:512+7,SuspensionERP3:512+8,SuspensionCFM3:512+9},AMotorModes:{User:0,Euler:1},Group:function(max_size){var pointer=dJointGroupCreate(max_size);if(!javascriptHeap[pointer]){javascriptHeap[pointer]=this}this.getPointer=function(){return pointer};this.destroy=function(){dJointDestroy(pointer)};this.empty=function(){dJointGroupEmpty(pointer);return this}}};var dJointCreateBall=Module.cwrap("dJointCreateBall","number",["number","number"]);var dJointCreateHinge=Module.cwrap("dJointCreateHinge","number",["number","number"]);var dJointCreateSlider=Module.cwrap("dJointCreateSlider","number",["number","number"]);var dJointCreateContact=Module.cwrap("dJointCreateContact","number",["number","number","number"]);var dJointCreateUniversal=Module.cwrap("dJointCreateUniversal","number",["number","number"]);var dJointCreateHinge2=Module.cwrap("dJointCreateHinge2","number",["number","number"]);var dJointCreateFixed=Module.cwrap("dJointCreateFixed","number",["number","number"]);var dJointCreateNull=Module.cwrap("dJointCreateNull","number",["number","number"]);var dJointCreateAMotor=Module.cwrap("dJointCreateAMotor","number",["number","number"]);var dJointDestroy=Module.cwrap("dJointDestroy",null,["number"]);var dJointAttach=Module.cwrap("dJointAttach",null,["number","number","number"]);var dJointGetType=Module.cwrap("dJointGetType","number",["number"]);var dJointGetBody=Module.cwrap("dJointGetBody","number",["number","number"]);var dJointSetBallAnchor=Module.cwrap("dJointSetBallAnchor",null,["number","number","number","number"]);var dJointGetBallAnchor=Module.cwrap("dJointGetBallAnchor",null,["number","number"]);var dJointSetHingeAnchor=Module.cwrap("dJointSetHingeAnchor",null,["number","number","number","number"]);var dJointGetHingeAnchor=Module.cwrap("dJointGetHingeAnchor",null,["number","number"]);var dJointSetHingeAxis=Module.cwrap("dJointSetHingeAxis",null,["number","number","number","number"]);var dJointGetHingeAxis=Module.cwrap("dJointGetHingeAxis",null,["number","number"]);var dJointSetHingeParam=Module.cwrap("dJointSetHingeParam",null,["number","number","number"]);var dJointGetHingeParam=Module.cwrap("dJointGetHingeParam","number",["number","number"]);var dJointGetHingeAngle=Module.cwrap("dJointGetHingeAngle","number",["number"]);var dJointGetHingeAngleRate=Module.cwrap("dJointGetHingeAngleRate","number",["number"]);var dJointSetSliderAxis=Module.cwrap("dJointSetSliderAxis",null,["number","number","number","number"]);var dJointGetSliderAxis=Module.cwrap("dJointGetSliderAxis",null,["number","number"]);var dJointSetSliderParam=Module.cwrap("dJointSetSliderParam",null,["number","number","number"]);var dJointGetSliderParam=Module.cwrap("dJointGetSliderParam","number",["number","number"]);var dJointGetSliderPosition=Module.cwrap("dJointGetSliderPosition","number",["number"]);var dJointGetSliderPositionRate=Module.cwrap("dJointGetSliderPositionRate","number",["number"]);var dJointSetUniversalAnchor=Module.cwrap("dJointSetUniversalAnchor",null,["number","number","number","number"]);var dJointSetUniversalAxis1=Module.cwrap("dJointSetUniversalAxis1",null,["number","number","number","number"]);var dJointSetUniversalAxis2=Module.cwrap("dJointSetUniversalAxis2",null,["number","number","number","number"]);var dJointSetUniversalParam=Module.cwrap("dJointSetUniversalParam",null,["number","number","number"]);var dJointGetUniversalAnchor=Module.cwrap("dJointGetUniversalAnchor",null,["number","number"]);var dJointGetUniversalAnchor2=Module.cwrap("dJointGetUniversalAnchor2",null,["number","number"]);var dJointGetUniversalAxis1=Module.cwrap("dJointGetUniversalAxis1",null,["number","number"]);var dJointGetUniversalAxis2=Module.cwrap("dJointGetUniversalAxis2",null,["number","number"]);var dJointGetUniversalParam=Module.cwrap("dJointGetUniversalParam","number",["number","number"]);var dJointGetUniversalAngle1=Module.cwrap("dJointGetUniversalAngle1","number",["number"]);var dJointGetUniversalAngle2=Module.cwrap("dJointGetUniversalAngle2","number",["number"]);var dJointGetUniversalAngle1Rate=Module.cwrap("dJointGetUniversalAngle1Rate","number",["number"]);var dJointGetUniversalAngle2Rate=Module.cwrap("dJointGetUniversalAngle2Rate","number",["number"]);var dJointSetHinge2Anchor=Module.cwrap("dJointSetHinge2Anchor",null,["number","number","number","number"]);var dJointGetHinge2Anchor=Module.cwrap("dJointGetHinge2Anchor",null,["number","number"]);var dJointSetHinge2Axis1=Module.cwrap("dJointSetHinge2Axis1",null,["number","number","number","number"]);var dJointSetHinge2Axis2=Module.cwrap("dJointSetHinge2Axis2",null,["number","number","number","number"]);var dJointGetHinge2Axis1=Module.cwrap("dJointGetHinge2Axis1",null,["number","number"]);var dJointGetHinge2Axis2=Module.cwrap("dJointGetHinge2Axis2",null,["number","number"]);var dJointSetHinge2Param=Module.cwrap("dJointSetHinge2Param",null,["number","number","number"]);var dJointGetHinge2Param=Module.cwrap("dJointGetHinge2Param","number",["number","number"]);var dJointGetHinge2Angle1=Module.cwrap("dJointGetHinge2Angle1","number",["number"]);var dJointGetHinge2Angle1Rate=Module.cwrap("dJointGetHinge2Angle1Rate","number",["number"]);var dJointGetHinge2Angle2Rate=Module.cwrap("dJointGetHinge2Angle2Rate","number",["number"]);var dJointSetAMotorParam=Module.cwrap("dJointSetAMotorParam",null,["number","number","number"]);var dJointGetAMotorParam=Module.cwrap("dJointGetAMotorParam","number",["number","number"]);var dJointSetAMotorMode=Module.cwrap("dJointSetAMotorMode",null,["number","number"]);var dJointGetAMotorMode=Module.cwrap("dJointGetAMotorMode","number",["number"]);var dJointSetAMotorNumAxes=Module.cwrap("dJointSetAMotorNumAxes",null,["number","number"]);var dJointGetAMotorNumAxes=Module.cwrap("dJointGetAMotorNumAxes","number",["number"]);var dJointSetAMotorAxis=Module.cwrap("dJointSetAMotorAxis",null,["number","number","number","number","number","number"]);var dJointGetAMotorAxis=Module.cwrap("dJointGetAMotorAxis",null,["number","number","number"]);var dJointGetAMotorAxisRel=Module.cwrap("dJointGetAMotorAxisRel","number",["number","number"]);var dJointSetAMotorAngle=Module.cwrap("dJointSetAMotorAngle",null,["number","number","number"]);var dJointGetAMotorAngle=Module.cwrap("dJointGetAMotorAngle","number",["number","number"]);var dJointGetAMotorAngleRate=Module.cwrap("dJointGetAMotorAngleRate","number",["number","number"]);var dJointSetFixed=Module.cwrap("dJointSetFixed",null,["number"]);function Joint(pointer){if(!javascriptHeap[pointer]){javascriptHeap[pointer]=this}var type=dJointGetType(pointer);this.getPointer=function(){return pointer};this.destroy=function(){dJointDestroy(pointer)};Object.defineProperty(this,"type",{value:type,writable:false,enumerable:true,configurable:false});this.attach=function(b1,b2){dJointAttach(pointer,b1?b1.getPointer():0,b2?b2.getPointer():0);return this};this.getBody=function(idx){var b=dJointGetBody(pointer,idx);return b?!javascriptHeap[b]?new Body(b):javascriptHeap[b]:null};this.setFixed=function(){dJointSetFixed(pointer);return this};switch(type){case ODE.Joint.Types.Ball:this.setAnchor=function(x,y,z){dJointSetBallAnchor(pointer,x,y,z);return this};this.getAnchor=function(){dJointGetBallAnchor(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};break;case ODE.Joint.Types.Hinge:this.setAnchor=function(x,y,z){dJointSetHingeAnchor(pointer,x,y,z);return this};this.getAnchor=function(){dJointGetHingeAnchor(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.setAxis=function(x,y,z){dJointSetHingeAxis(pointer,x,y,z);return this};this.getAxis=function(){dJointGetHingeAxis(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.setParam=function(parameter,val){dJointSetHingeParam(pointer,parameter,val);return this};this.getParam=function(parameter){return dJointGetHingeParam(pointer,parameter)};this.getAngle=function(){return dJointGetHingeAngle(pointer)};this.getAngleRate=function(){return dJointGetHingeAngleRate(pointer)};break;case ODE.Joint.Types.Slider:this.setAxis=function(x,y,z){dJointSetSliderAxis(pointer,x,y,z);return this};this.getAxis=function(){dJointGetSliderAxis(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.setParam=function(parameter,val){dJointSetSliderParam(pointer,parameter,val);return this};this.getParam=function(parameter){return dJointGetSliderParam(pointer,parameter)};this.getPosition=function(){return dJointGetSliderPosition(pointer)};this.getPositionRate=function(){return dJointGetSliderPositionRate(pointer)};break;case ODE.Joint.Types.Universal:this.setAnchor=function(x,y,z){dJointSetUniversalAnchor(pointer,x,y,z);return this};this.getAnchor=function(){dJointGetUniversalAnchor(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.getAnchor2=function(){dJointGetUniversalAnchor2(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.setAxis1=function(x,y,z){dJointSetUniversalAxis1(pointer,x,y,z);return this};this.getAxis1=function(){dJointGetUniversalAxis1(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.setAxis2=function(x,y,z){dJointSetUniversalAxis2(pointer,x,y,z);return this};this.getAxis2=function(){dJointGetUniversalAxis2(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.setParam=function(parameter,val){dJointSetUniversalParam(pointer,parameter,val);return this};this.getParam=function(parameter){return dJointGetUniversalParam(pointer,parameter)};this.getAngle1=function(){return dJointGetUniversalAngle1(pointer)};this.getAngle2=function(){return dJointGetUniversalAngle2(pointer)};this.getAngleRate1=function(){return dJointGetUniversalAngleRate1(pointer)};this.getAngleRate2=function(){return dJointGetUniversalAngleRate2(pointer)};break;case ODE.Joint.Types.Hinge2:this.setAnchor=function(x,y,z){dJointSetHinge2Anchor(pointer,x,y,z);return this};this.getAnchor=function(){dJointGetHinge2Anchor(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.setAxis1=function(x,y,z){dJointSetHinge2Axis1(pointer,x,y,z);return this};this.getAxis1=function(){dJointGetHinge2Axis1(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.setAxis2=function(x,y,z){dJointSetHinge2Axis2(pointer,x,y,z);return this};this.getAxis2=function(){dJointGetHinge2Axis2(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.setParam=function(parameter,val){dJointSetHinge2Param(pointer,parameter,val);return this};this.getParam=function(parameter){return dJointGetHinge2Param(pointer,parameter)};this.getAngle1=function(){return dJointGetHinge2Angle1(pointer)};this.getAngle1Rate=function(){return dJointGetHinge2Angle1Rate(pointer)};this.getAngle2Rate=function(){return dJointGetHinge2Angle2Rate(pointer)};break;case ODE.Joint.Types.AMotor:this.setParam=function(parameter,val){dJointSetAMotorParam(pointer,parameter,val);return this};this.getParam=function(parameter){return dJointGetAMotorParam(pointer,parameter)};this.setAMotorMode=function(mode){dJointSetAMotorMode(pointer,mode);return this};this.getAMotorMode=function(){return dJointGetAMotorMode(pointer)};this.setNumAxes=function(num){dJointSetAMotorNumAxes(pointer,num);return this};this.getNumAxes=function(){return dJointGetAMotorNumAxes(pointer)};this.setAxis=function(anum,rel,x,y,z){dJointSetAMotorAxis(pointer,anum,rel,x,y,z);return this};this.getAxis=function(anum){dJointGetAMotorAxis(pointer,anum,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.getAxisRel=function(anum){return dJointGetAMotorAxisRel(pointer,anum)};this.setAngle=function(anum,angle){dJointSetAMotorAngle(anum,angle);return this};this.getAngle=function(anum){return dJointGetAMotorAngle(pointer,anum)};this.getAngleRate=function(anum){return dJointGetAMotorAngleRate(pointer,anum)};break;default:break}}var sizeOfCantact=104;ODE.Contact=function(){var contact=function(){var pointer=arguments[0]||Module._malloc(sizeOfCantact);this.getPointer=function(){return pointer};this.surface={};Object.defineProperties(this.surface,{mode:{enumerable:true,get:function(){return Module.getValue(pointer,"i32")},set:function(val){Module.setValue(pointer,val,"i32")}},mu:{enumerable:true,get:function(){return Module.getValue(pointer+4,"float")},set:function(val){Module.setValue(pointer+4,val,"float")}},mu2:{enumerable:true,get:function(){return Module.getValue(pointer+8,"float")},set:function(val){Module.setValue(pointer+8,val,"float")}},bounce:{enumerable:true,get:function(){return Module.getValue(pointer+12,"float")},set:function(val){Module.setValue(pointer+12,val,"float")}},bounce_vel:{enumerable:true,get:function(){return Module.getValue(pointer+16,"float")},set:function(val){Module.setValue(pointer+16,val,"float")}},soft_erp:{enumerable:true,get:function(){return Module.getValue(pointer+20,"float")},set:function(val){Module.setValue(pointer+20,val,"float")}},soft_cfm:{enumerable:true,get:function(){return Module.getValue(pointer+24,"float")},set:function(val){Module.setValue(pointer+24,val,"float")}},motion1:{enumerable:true,get:function(){return Module.getValue(pointer+28,"float")},set:function(val){Module.setValue(pointer+24,val,"float")}},motion2:{enumerable:true,get:function(){return Module.getValue(pointer+32,"float")},set:function(val){Module.setValue(pointer+32,val,"float")}},slip1:{enumerable:true,get:function(){return Module.getValue(pointer+36,"float")},set:function(val){Module.setValue(pointer+36,val,"float")}},slip2:{enumerable:true,get:function(){return Module.getValue(pointer+40,"float")},set:function(val){Module.setValue(pointer+40,val,"float")}}});this.geom={};Object.defineProperties(this.geom,{pos:{enumerable:true,get:function(){return[Module.getValue(pointer+44,"float"),Module.getValue(vec4+48,"float"),Module.getValue(vec4+52,"float")]},set:function(val){Module.setValue(pointer+44,val[0],"float"),Module.setValue(pointer+48,val[1],"float"),Module.setValue(pointer+52,val[2],"float")}},normal:{enumerable:true,get:function(){return[Module.getValue(pointer+60,"float"),Module.getValue(vec4+64,"float"),Module.getValue(vec4+68,"float")]},set:function(val){Module.setValue(pointer+60,val[0],"float"),Module.setValue(pointer+64,val[1],"float"),Module.setValue(pointer+68,val[2],"float")}},depth:{enumerable:true,get:function(){return Module.getValue(pointer+76,"float")},set:function(val){Module.setValue(pointer+76,val,"float")}},g1:{enumerable:true,get:function(){var p=Module.getValue(pointer+80,"i32");return p?!javascriptHeap[p]?new Geom(p):javascriptHeap[p]:null},set:function(val){Module.setValue(pointer+80,val.getPointer(),"i32")}},g2:{enumerable:true,get:function(){var p=Module.getValue(pointer+84,"i32");return p?!javascriptHeap[p]?new Geom(p):javascriptHeap[p]:null},set:function(val){Module.setValue(pointer+84,val.getPointer(),"i32")}}});Object.defineProperty(this,"fdir1",{enumerable:true,get:function(){return[Module.getValue(pointer+88,"float"),Module.getValue(vec4+92,"float"),Module.getValue(vec4+96,"float")]},set:function(val){Module.setValue(pointer+88,val[0],"float"),Module.setValue(pointer+92,val[1],"float"),Module.setValue(pointer+96,val[2],"float")}})};contact.Mode={Mu2:1,FDir1:2,Bounce:4,SoftERP:8,SoftCFM:16,Motion1:32,Motion2:64,Slip1:128,Slip2:256,Approx0:0,Approx1_1:4096,Approx1_2:8192,Approx1:12288};return contact}();var dBodyCreate=Module.cwrap("dBodyCreate","number",["number"]);var dBodyDestroy=Module.cwrap("dBodyDestroy",null,["number"]);var dBodySetPosition=Module.cwrap("dBodySetPosition",null,["number","number","number","number"]);var dBodySetLinearVel=Module.cwrap("dBodySetLinearVel",null,["number","number","number","number"]);var dBodySetAngularVel=Module.cwrap("dBodySetAngularVel",null,["number","number","number","number"]);var dBodySetRotation=Module.cwrap("dBodySetRotation",null,["number","number"]);var dBodySetQuaternion=Module.cwrap("dBodySetQuaternion",null,["number","number"]);var dBodyGetPosition=Module.cwrap("dBodyGetPosition","number",["number"]);var dBodyGetRotation=Module.cwrap("dBodyGetRotation","number",["number"]);var dBodyGetQuaternion=Module.cwrap("dBodyGetQuaternion","number",["number"]);var dBodyGetLinearVel=Module.cwrap("dBodyGetLinearVel","number",["number"]);var dBodyGetAngularVel=Module.cwrap("dBodyGetAngularVel","number",["number"]);var dBodySetMass=Module.cwrap("dBodySetMass",null,["number","number"]);var dBodyGetMass=Module.cwrap("dBodyGetMass",null,["number","number"]);var dBodyAddForce=Module.cwrap("dBodyAddForce",null,["number","number","number","number"]);var dBodyGetForce=Module.cwrap("dBodyGetForce","number",["number"]);var dBodyAddTorque=Module.cwrap("dBodyAddTorque",null,["number","number","number","number"]);var dBodyGetTorque=Module.cwrap("dBodyGetTorque","number",["number"]);var dBodyAddRelForce=Module.cwrap("dBodyAddRelForce",null,["number","number","number","number"]);var dBodyAddRelTorque=Module.cwrap("dBodyAddRelTorque",null,["number","number","number","number"]);var dBodyAddForceAtPos=Module.cwrap("dBodyAddForceAtPos",null,["number","number","number","number","number","number","number"]);var dBodyAddForceAtRelPos=Module.cwrap("dBodyAddForceAtRelPos",null,["number","number","number","number","number","number","number"]);var dBodyAddRelForceAtPos=Module.cwrap("dBodyAddRelForceAtPos",null,["number","number","number","number","number","number","number"]);var dBodyAddRelForceAtRelPos=Module.cwrap("dBodyAddRelForceAtRelPos",null,["number","number","number","number","number","number","number"]);var dBodyGetRelPointPos=Module.cwrap("dBodyGetRelPointPos",null,["number","number","number","number","number"]);var dBodyGetRelPointVel=Module.cwrap("dBodyGetRelPointVel",null,["number","number","number","number","number"]);var dBodyEnable=Module.cwrap("dBodyEnable",null,["number"]);var dBodyDisable=Module.cwrap("dBodyDisable",null,["number"]);var dBodyIsEnabled=Module.cwrap("dBodyIsEnabled","number",["number"]);var dBodyGetNumJoints=Module.cwrap("dBodyGetNumJoints","number",["number"]);var dBodyGetJoint=Module.cwrap("dBodyGetJoint","number",["number","number"]);var dAreConnected=Module.cwrap("dAreConnected","number",["number","number"]);function Body(pointer){if(!javascriptHeap[pointer]){javascriptHeap[pointer]=this}this.getPointer=function(){return pointer};this.destroy=function(){dBodyDestroy(pointer)};this.setPosition=function(x,y,z){dBodySetPosition(pointer,x,y,z);return this};this.setRotation=function(rotation){dBodySetRotation(pointer,rotation.getPointer());return this};this.setQuaternion=function(quat){dBodySetQuaternion(pointer,quat.getPointer());return this};this.setLinearVel=function(x,y,z){dBodySetLinearVel(pointer,x,y,z);return this};this.setAngularVel=function(x,y,z){dBodySetAngularVel(pointer,x,y,z);return this};this.getPosition=function(){var p=dBodyGetPosition(pointer);return Module.HEAPF32.slice(p/4,p/4+3)};this.getRotation=function(){var p=dBodyGetRotation(pointer);return p?!javascriptHeap[p]?new ODE.Rotation(p):javascriptHeap[p]:null};this.getQuaternion=function(){var p=dBodyGetQuaternion(pointer);return p?!javascriptHeap[p]?new ODE.Quaternion(p):javascriptHeap[p]:null};this.getLinearVel=function(){var p=dBodyGetLinearVel(pointer);return Module.HEAPF32.slice(p/4,p/4+3)};this.getAngularVel=function(){var p=dBodyGetAngularVel(pointer);return Module.HEAPF32.slice(p/4,p/4+3)};this.setMass=function(mass){dBodySetMass(pointer,mass.getPointer());return this};this.getMass=function(){var pmass=Module._malloc(sizeOfMass);dBodyGetMass(pointer,pmass);return new ODE.Mass(pmass)};this.addForce=function(fx,fy,fz){dBodyAddForce(pointer,fx,fy,fz);return this};this.addTorque=function(fx,fy,fz){dBodyAddTorque(pointer,fx,fy,fz);return this};this.addRelForce=function(fx,fy,fz){dBodyAddRelForce(pointer,fx,fy,fz);return this};this.addRelTorque=function(fx,fy,fz){dBodyAddRelTorque(pointer,fx,fy,fz);return this};this.addForceAtPos=function(fx,fy,fz,px,py,pz){dBodyAddForceAtPos(pointer,fx,fy,fz,px,py,pz);return this};this.addForceAtRelPos=function(fx,fy,fz,px,py,pz){dBodyAddForceAtRelPos(pointer,fx,fy,fz,px,py,pz);return this};this.addRelForceAtPos=function(fx,fy,fz,px,py,pz){dBodyAddRelForceAtPos(pointer,fx,fy,fz,px,py,pz);return this};this.addRelForceAtRelPos=function(fx,fy,fz,px,py,pz){dBodyAddRelForceAtRelPos(pointer,fx,fy,fz,px,py,pz);return this};this.getForce=function(){var p=dBodyGetForce(pointer);return Module.HEAPF32.slice(p/4,p/4+3)};this.getTorque=function(){var p=dBodyGetTorque(pointer);return Module.HEAPF32.slice(p/4,p/4+3)};this.getRelPointPos=function(px,py,pz){dBodyGetRelPointPos(pointer,px,py,pz,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.getRelPointVel=function(px,py,pz){dBodyGetRelPointVel(pointer,px,py,pz,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};this.enable=function(){dBodyEnable(pointer);return this};this.disable=function(){dBodyDisable(pointer);return this};this.isEnabled=function(){return dBodyIsEnabled(pointer)};this.getNumJoints=function(){return dBodyGetNumJoints(pointer)};this.getJoint=function(idx){var j=dBodyGetJoint(pointer,idx);return j?!javascriptHeap[j]?new Joint(j):javascriptHeap[b]:null}}ODE.Body={areConnected:function(b1,b2){return dAreConnected(b1?b1.getPointer():0,b2?b2.getPointer():0)}};var dWorldCreate=Module.cwrap("dWorldCreate","number",[]);var dWorldDestroy=Module.cwrap("dWorldDestroy",null,["number"]);var dWorldSetGravity=Module.cwrap("dWorldSetGravity",null,["number","number","number","number"]);var dWorldGetGravity=Module.cwrap("dWorldGetGravity",null,["number","number"]);var dWorldSetERP=Module.cwrap("dWorldSetERP",null,["number","number"]);var dWorldGetERP=Module.cwrap("dWorldGetERP","number",["number"]);var dWorldSetCFM=Module.cwrap("dWorldSetCFM",null,["number","number"]);var dWorldGetCFM=Module.cwrap("dWorldGetCFM","number",["number"]);var dWorldSetContactMaxCorrectingVel=Module.cwrap("dWorldSetContactMaxCorrectingVel",null,["number","number"]);var dWorldGetContactMaxCorrectingVel=Module.cwrap("dWorldGetContactMaxCorrectingVel","number",["number"]);var dWorldSetContactSurfaceLayer=Module.cwrap("dWorldSetContactSurfaceLayer",null,["number","number"]);var dWorldGetContactSurfaceLayer=Module.cwrap("dWorldGetContactSurfaceLayer","number",["number"]);var dWorldStep=Module.cwrap("dWorldStep",null,["number","number"]);var dWorldSetQuickStepNumIterations=Module.cwrap("dWorldSetQuickStepNumIterations",null,["number","number"]);var dWorldQuickStep=Module.cwrap("dWorldQuickStep",null,["number","number"]);ODE.World=function(){var pointer=arguments[0]||dWorldCreate();this.getPointer=function(){return pointer};this.destroy=function(){dWorldDestroy(pointer)};this.setGravity=function(x,y,z){dWorldSetGravity(pointer,x,y,z);return this};this.getGravity=function(){dWorldGetGravity(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};Object.defineProperties(this,{ERP:{enumerable:true,get:function(){return dWorldGetERP(pointer)},set:function(val){dWorldSetERP(pointer,val)}},CFM:{enumerable:true,get:function(){return dWorldGetCFM(pointer)},set:function(val){dWorldSetCFM(pointer,val)}},ContactMaxCorrectingVel:{enumerable:true,get:function(){return dWorldGetContactMaxCorrectingVel(pointer)},set:function(val){dWorldSetContactMaxCorrectingVel(pointer,val)}},ContactSurfaceLayer:{enumerable:true,get:function(){return dWorldGetContactSurfaceLayer(pointer)},set:function(val){dWorldSetContactSurfaceLayer(pointer,val)}}});this.step=function(stepsize){dWorldStep(pointer,stepsize);return this};this.quickStep=function(stepsize){dWorldQuickStep(pointer,stepsize);return this};this.setQuickStepNumIterations=function(num){dWorldSetQuickStepNumIterations(pointer,num);return this};this.createBody=function(){return new Body(dBodyCreate(pointer))};this.createBallJoint=function(group){return new Joint(dJointCreateBall(pointer,group?group.getPointer():0))};this.createHingeJoint=function(group){return new Joint(dJointCreateHinge(pointer,group?group.getPointer():0))};this.createSliderJoint=function(group){return new Joint(dJointCreateSlider(pointer,group?group.getPointer():0))};this.createContactJoint=function(group,contact){return new Joint(dJointCreateContact(pointer,group?group.getPointer():0,contact.getPointer()))};this.createHinge2Joint=function(group){return new Joint(dJointCreateHinge2(pointer,group?group.getPointer():0))};this.createFixedJoint=function(group){return new Joint(dJointCreateFixed(pointer,group?group.getPointer():0))};this.createNullJoint=function(group){return new Joint(dJointCreateNull(pointer,group?group.getPointer():0))};this.createAMotorJoint=function(group){return new Joint(dJointCreateAMotor(pointer,group?group.getPointer():0))}};var dCreateSphere=Module.cwrap("dCreateSphere","number",["number","number"]);var dCreateBox=Module.cwrap("dCreateBox","number",["number","number","number","number"]);var dCreatePlane=Module.cwrap("dCreatePlane","number",["number","number","number","number","number"]);var dCreateCapsule=Module.cwrap("dCreateCapsule","number",["number","number","number"]);var dCreateCylinder=Module.cwrap("dCreateCylinder","number",["number","number","number"]);var dCreateGeomTransform=Module.cwrap("dCreateGeomTransform","number",["number"]);var dGeomGetClass=Module.cwrap("dGeomGetClass","number",["number"]);var dGeomDestroy=Module.cwrap("dGeomDestroy",null,["number"]);var dGeomSetPosition=Module.cwrap("dGeomSetPosition",null,["number","number","number","number"]);var dGeomSetRotation=Module.cwrap("dGeomSetRotation",null,["number","number"]);var dGeomGetPosition=Module.cwrap("dGeomGetPosition","number",["number"]);var dGeomGetRotation=Module.cwrap("dGeomGetRotation","number",["number"]);var dGeomSetBody=Module.cwrap("dGeomSetBody",null,["number","number"]);var dGeomGetBody=Module.cwrap("dGeomGetBody","number",["number"]);var dGeomGetAABB=Module.cwrap("dGeomGetAABB",null,["number","number"]);var dGeomGetSpaceAABB=Module.cwrap("dGeomGetRotation","number",["number"]);var dGeomSphereSetRadius=Module.cwrap("dGeomSphereSetRadius",null,["number","number"]);var dGeomBoxSetLengths=Module.cwrap("dGeomBoxSetLengths",null,["number","number","number","number"]);var dGeomPlaneSetParams=Module.cwrap("dGeomPlaneSetParams",null,["number","number","number","number","number"]);var dGeomCapsuleSetParams=Module.cwrap("dGeomCapsuleSetParams",null,["number","number","number"]);var dGeomSphereGetRadius=Module.cwrap("dGeomSphereGetRadius","number",["number"]);var dGeomBoxGetLengths=Module.cwrap("dGeomBoxGetLengths",null,["number","number"]);var dGeomPlaneGetParams=Module.cwrap("dGeomPlaneGetParams",null,["number","number"]);var dGeomCapsuleGetParams=Module.cwrap("dGeomCapsuleGetParams",null,["number","number","number"]);var dGeomTransformSetGeom=Module.cwrap("dGeomTransformSetGeom",null,["number","number"]);var dGeomTransformGetGeom=Module.cwrap("dGeomTransformGetGeom","number",["number"]);var dGeomTransformSetCleanup=Module.cwrap("dGeomTransformSetCleanup",null,["number","number"]);var dGeomTransformGetCleanup=Module.cwrap("dGeomTransformGetCleanup","number",["number"]);var dCollide=Module.cwrap("dCollide","number",["number","number","number","number","number"]);ODE.Geom={Types:{Sphere:1,Box:2,Capsule:3,Cylinder:4,Plane:5,Ray:6,Convex:7,Transform:8,TriMesh:9,Heightfield:10},collide:function(g1,g2,MaxContact,contactCB){var contacts=Module._malloc(MaxContact*sizeOfCantact);var n=dCollide(g1?g1.getPointer():0,g2?g2.getPointer():0,MaxContact,contacts+44,sizeOfCantact);for(var i=0;i<n;i++){contactCB(new ODE.Contact(contacts+i*sizeOfCantact))}Module._free(contacts)}};function Geom(pointer){if(!javascriptHeap[pointer]){javascriptHeap[pointer]=this}var type=dGeomGetClass(pointer);this.getPointer=function(){return pointer};this.destroy=function(){dGeomDestroy(pointer)};Object.defineProperty(this,"type",{value:type,writable:false,enumerable:true,configurable:false});this.setPosition=function(x,y,z){dGeomSetPosition(pointer,x,y,z);return this};this.setRotation=function(rotation){dGeomSetRotation(pointer,rotation.getPointer());return this};this.getPosition=function(){var p=dGeomGetPosition(pointer);return Module.HEAPF32.slice(p/4,p/4+3)};this.getRotation=function(){var p=dGeomGetRotation(pointer);return p?!javascriptHeap[p]?new ODE.Rotation(p):javascriptHeap[p]:null};this.setBody=function(body){dGeomSetBody(pointer,body.getPointer());return this};this.getBody=function(){var b=dGeomGetBody(pointer);return b?!javascriptHeap[b]?new Body(b):javascriptHeap[b]:null};this.getAABB=function(){dGeomGetAABB(pointer,vec6);return getVec6()};this.getSpaceAABB=function(){var p=dGeomGetSpaceAABB(pointer);return Module.HEAPF32.slice(p/4,p/4+6)};switch(type){case ODE.Geom.Types.Sphere:Object.defineProperty(this,"radius",{enumerable:true,get:function(){return dGeomSphereSetRadius(pointer)},set:function(val){dGeomSphereGetRadius(pointer,val)}});break;case ODE.Geom.Types.Box:this.setLengths=function(x,y,z){dGeomBoxSetLengths(pointer,x,y,z);return this};this.getLengths=function(){dGeomBoxGetLengths(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float")]};break;case ODE.Geom.Types.Capsule:this.setParams=function(radius,length){dGeomCapsuleSetParams(pointer,radius,length);return this};this.getParams=function(){dGeomCapsuleGetParams(pointer,vec4,vec4+4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float")]};break;case ODE.Geom.Types.Plan:this.setParams=function(a,b,c,d){dGeomPlaneSetParams(pointer,a,b,c,d);return this};this.getParams=function(){dGeomPlaneGetParams(pointer,vec4);return[Module.getValue(vec4,"float"),Module.getValue(vec4+4,"float"),Module.getValue(vec4+8,"float"),Module.getValue(vec4+12,"float")]};break;case ODE.Geom.Types.Transform:this.setGeom=function(geom){dGeomTransformSetGeom(pointer,geom.getPointer());return this};this.getGeom=function(){var g=dGeomTransformGetGeom(pointer);return g?!javascriptHeap[g]?new Geom(g):javascriptHeap[g]:null};Object.defineProperty(this,"cleanup",{enumerable:true,get:function(){return dGeomTransformGetCleanup(pointer)},set:function(val){dGeomTransformSetCleanup(pointer,val)}});break;default:break}}ODE.Geom.createSphere=function(radius){var g=dCreateSphere(0,radius);return new Geom(g)};ODE.Geom.createBox=function(lx,ly,lz){var g=dCreateBox(0,lx,ly,lz);return new Geom(g)};ODE.Geom.createCapsule=function(radius,length){var g=dCreateCapsule(0,radius,length);return new Geom(g)};ODE.Geom.createCylinder=function(radius,length){var g=dCreateCylinder(0,radius,length);return new Geom(g)};ODE.Geom.createPlane=function(a,b,c,d){var g=dCreatePlane(0,a,b,c,d);return new Geom(g)};ODE.Geom.createTransform=function(){var g=dCreateGeomTransform(0);return new Geom(g)};var dGeomTriMeshDataCreate=Module.cwrap("dGeomTriMeshDataCreate","number",[]);var dGeomTriMeshDataDestroy=Module.cwrap("dGeomTriMeshDataDestroy",null,["number"]);var dGeomTriMeshDataBuildSingle=Module.cwrap("dGeomTriMeshDataBuildSingle",null,["number","number","number","number","number","number","number"]);var dGeomTriMeshDataBuildSingle1=Module.cwrap("dGeomTriMeshDataBuildSingle1",null,["number","number","number","number","number","number","number","number"]);var dCreateTriMesh=Module.cwrap("dCreateTriMesh",null,["number","number","number","number","number"]);ODE.Geom.createTriMeshData=function(Vertices,Indices,Normals){var pointer=dGeomTriMeshDataCreate();var vbo=Module._malloc(Vertices.length*4);for(var i=0;i<Vertices.length;i++)Module.setValue(vbo+i*4,Vertices[i],"float");var ibo=Module._malloc(Indices.length*4);for(var i=0;i<Indices.length;i++)Module.setValue(ibo+i*4,Indices[i],"i32");var nbo;if(arguments.length==2){dGeomTriMeshDataBuildSingle(pointer,vbo,12,Vertices.length/3,ibo,Indices.length,12)}else{nbo=Module._malloc(Normals.length*4);for(var i=0;i<Normals.length;i++)Module.setValue(vbo+i*4,Normals[i],"float");dGeomTriMeshDataBuildSingle1(pointer,vbo,12,Vertices.length/3,ibo,Indices.length,12,nbo)}return{getPointer:function(){return pointer},destroy:function(){dGeomTriMeshDataDestroy(pointer);Module._free(vbo);Module._free(ibo);if(nbo)Module._free(nbo)}}};ODE.Geom.createTriMesh=function(triMeshData){var g=dCreateTriMesh(0,triMeshData.getPointer(),0,0,0);return new Geom(g)};var dGeomHeightfieldDataCreate=Module.cwrap("dGeomHeightfieldDataCreate","number",[]);var dGeomHeightfieldDataDestroy=Module.cwrap("dGeomHeightfieldDataDestroy",null,["number"]);var dGeomHeightfieldDataBuildCallback=Module.cwrap("dGeomHeightfieldDataBuildCallback",null,["number","number","number","number","number","number","number","number","number","number","number"]);var dGeomHeightfieldDataSetBounds=Module.cwrap("dGeomHeightfieldDataSetBounds",null,["number","number","number"]);var dCreateHeightfield=Module.cwrap("dCreateHeightfield",null,["number","number","number"]);ODE.Geom.createHeightfieldData=function(callback,width,depth,widthSamples,depthSamples,scale,offset,thickness,bWrap){var pointer=dGeomHeightfieldDataCreate();var ptrFunc=Module.addFunction(function(data,x,y){return callback(x,y)},"fiii");dGeomHeightfieldDataBuildCallback(pointer,0,ptrFunc,width,depth,widthSamples,depthSamples,scale,offset,thickness,bWrap);return{getPointer:function(){return pointer},setBounds:function(minHeight,maxHeight){dGeomHeightfieldDataSetBounds(pointer,minHeight,maxHeight)},destroy:function(){dGeomHeightfieldDataDestroy(pointer);Module.removeFunction(ptrFunc)}}};ODE.Geom.createHeightfield=function(data,bPlaceable){var g=dCreateHeightfield(0,data.getPointer(),bPlaceable);return new Geom(g)};var dSimpleSpaceCreate=Module.cwrap("dSimpleSpaceCreate","number",[]);var dHashSpaceCreate=Module.cwrap("dHashSpaceCreate","number",[]);var dSpaceDestroy=Module.cwrap("dSpaceDestroy",null,["number"]);var dSpaceAdd=Module.cwrap("dSpaceAdd",null,["number","number"]);var dSpaceRemove=Module.cwrap("dSpaceRemove",null,["number","number"]);var dHashSpaceSetLevels=Module.cwrap("dHashSpaceSetLevels",null,["number","number","number"]);var dHashSpaceGetLevels=Module.cwrap("dHashSpaceGetLevels",null,["number","number","number"]);var dSpaceCollide=Module.cwrap("dSpaceCollide",null,["number","number","number"]);var dSpaceSetCleanup=Module.cwrap("dSpaceSetCleanup",null,["number","number"]);var dSpaceGetCleanup=Module.cwrap("dSpaceGetCleanup","number",["number"]);function Space(pointer){this.getPointer=function(){return pointer};this.destroy=function(){dSpaceDestroy(pointer)};this.add=function(geom){dSpaceAdd(pointer,geom.getPointer());return this};this.remove=function(geom){dSpaceRemove(pointer,geom.getPointer());return this};Object.defineProperty(this,"autoCleanup",{enumerable:true,get:function(){return dSpaceGetCleanup(pointer)==1},set:function(val){dSpaceSetCleanup(pointer,val?1:0)}});this.collide=function(nearCallback){var ptrFunc=Module.addFunction(function(data,g1,g2){var geom1=g1?!javascriptHeap[g1]?new Geom(g1):javascriptHeap[g1]:null;var geom2=g2?!javascriptHeap[g2]?new Geom(g2):javascriptHeap[g2]:null;if(geom1&&geom2)nearCallback(geom1,geom2)},"viii");dSpaceCollide(pointer,0,ptrFunc);Module.removeFunction(ptrFunc)};this.createSphere=function(radius){var g=dCreateSphere(pointer,radius);return new Geom(g)};this.createBox=function(lx,ly,lz){var g=dCreateBox(pointer,lx,ly,lz);return new Geom(g)};this.createCapsule=function(radius,length){var g=dCreateCapsule(pointer,radius,length);return new Geom(g)};this.createCylinder=function(radius,length){var g=dCreateCylinder(pointer,radius,length);return new Geom(g)};this.createPlane=function(a,b,c,d){var g=dCreatePlane(pointer,a,b,c,d);return new Geom(g)};this.createTriMesh=function(triMeshData){var g=dCreateTriMesh(pointer,triMeshData.getPointer(),0,0,0);return new Geom(g)};this.createHeightfield=function(data,bPlaceable){var g=dCreateHeightfield(pointer,data.getPointer(),bPlaceable);return new Geom(g)};this.createTransform=function(){var g=dCreateGeomTransform(pointer);return new Geom(g)};this.createSimpleGroup=function(){var gp=dSimpleSpaceCreate(pointer);dSpaceSetCleanup(gp,0);return new Space(gp)}}ODE.Space={Simple:function(){Space.call(this,dSimpleSpaceCreate())},Hash:function(){Space.call(this,dSimpleSpaceCreate());this.setHashLevels=function(minlevel,maxlevel){dHashSpaceSetLevels(this.getPointer(),minlevel,maxlevel);return this};this.getHashLevels=function(){dHashSpaceGetLevels(this.getPointer(),vec4,vec4+4);return[Module.getValue(vec4,"i32"),Module.getValue(vec4+4,"i32")]}}};ODE.ready=true;_resolve(ODE)});if(ENVIRONMENT_IS_NODE)module.exports=ODE;return ODE}();
--- /dev/null
+#Check for Emscripten
+cleand0=false
+cleandp=false
+cleanqcc=false
+cleanqc=false
+compiled0=
+if [ -z $EMSDK ]
+then
+ echo "EMSDK not installed/set up correctly, cloning and setting up temporarily"
+ mkdir -f .tmp
+ git clone "https://github.com/emscripten-core/emsdk" ".tmp/emsdk"
+ .tmp/emsdk install latest
+ .tmp/emsdk activate latest
+ . .tmp/emsdk/emsdk_env.sh
+
+fi
+
+export CC="emcc -sUSE_SDL=2 -sUSE_LIBJPEG=1"
+
+export MAKE="emmake make"
+while :; do
+ case "$1" in
+ -0)
+ compiled0=true
+ shift
+ ;;
+ -1)
+ compiled0=false
+ shift
+ ;;
+ -c)
+ cleand0=true
+ cleandp=true
+ cleanqcc=true
+ cleanqc=true
+ shift
+ ;;
+ -qc)
+ cleanqc=true
+ shift
+ ;;
+ -d|-p|-r)
+ case "$1" in
+ -d)
+ debug=debug
+ ;;
+ -p)
+ debug=profile
+ ;;
+ -r)
+ debug=release
+ ;;
+ esac
+ export CC="$CC -g"
+ case "`$CC -dumpversion`" in
+ [5-9]*|[1-9][0-9]*|4.[3-9]*|4.[1-9][0-9]*)
+ # gcc 4.3 or higher
+ # -march=native is broken < 4.3
+ if $CC -mtune=native -march=native misc/tools/conftest.c -o conftest >/dev/null 2>&1; then
+ export CC="$CC -mtune=native -march=native"
+ fi
+ ;;
+ esac
+ if [ -n "$WE_HATE_OUR_USERS" ]; then
+ export CC="$CC -fno-common"
+ fi
+ shift
+ ;;
+ *)
+ break
+ ;;
+ esac
+done
+TARGETS="sdl-$debug"
+if [ x"`uname`" = x"Darwin" ]; then
+ export CC="$CC -fno-reorder-blocks"
+fi
+
+if [ $# -gt 0 ] && [ x"$1" = x"" ]; then
+ # if we give the command make the arg "", it will surely fail (invalid filename),
+ # so better handle it as an empty client option
+ BAD_TARGETS=" "
+ shift
+elif [ -n "$1" ]; then
+ BAD_TARGETS=
+ TARGETS_SAVE=$TARGETS
+ TARGETS=
+ for X in $1; do
+ case "$X" in
+ sdl)
+ TARGETS="$TARGETS sdl-$debug"
+ ;;
+ dedicated)
+ export MAKE="make"
+ export CC="gcc"
+ TARGETS="$TARGETS sv-$debug"
+ ;;
+ *)
+ BAD_TARGETS="$BAD_TARGETS $X"
+ ;;
+ esac
+ done
+ if [ -n "$TARGETS" ]; then # at least a valid client
+ shift
+ else # no valid client, let's assume this option is not meant to be a client then
+ TARGETS=$TARGETS_SAVE
+ BAD_TARGETS=
+ fi
+fi
+if [ -z "$MAKEFLAGS" ]; then
+ ncpus=`getconf _NPROCESSORS_ONLN 2>/dev/null || getconf NPROCESSORS_ONLN 2>/dev/null || echo 1`
+ if [ $ncpus -gt 1 ]; then
+ MAKEFLAGS=-j$ncpus
+ fi
+elif echo $MAKEFLAGS | head -c1 | grep -qv -; then # MAKEFLAGS starts with a single letter option
+ MAKEFLAGS=-$(echo $MAKEFLAGS) # echo here and above will trim whitespaces
+fi
+# No cp commands, we want to use static linking instead.
+export CC="$CC -I../../../../misc/builddeps/emscripten/d0_blind_id/include"
+export CC="$CC -L../../../../misc/builddeps/emscripten/d0_blind_id/lib"
+export CC="$CC -Wl,-rpath,../../../../misc/builddeps/emscripten/d0_blind_id/lib"
+export CC="$CC -I../../../../misc/builddeps/emscripten/gmp/include"
+export CC="$CC -L../../../../misc/builddeps/emscripten/gmp/lib"
+export CC="$CC -Wl,-rpath,../../../../misc/builddeps/emscripten/gmp/lib"
+MAKEFLAGS="$MAKEFLAGS DP_LINK_CRYPTO=shared DP_LINK_CRYPTO_RIJNDAEL=shared LIB_CRYPTO=../../../../misc/builddeps/emscripten/d0_blind_id/lib/libd0_blind_id.a LIB_CRYPTO+=../../../../misc/builddeps/emscripten/gmp/lib/libgmp.a LIB_CRYPTO_RIJNDAEL=../../../../misc/builddeps/emscripten/d0_blind_id/lib/libd0_rijndael.a"
+compiled0=false
+;;
\ No newline at end of file
fi
done
;;
+ compile-emscripten)
+ misc/tools/all/emscripten.subr $1
+ ;;
compile)
cleand0=false
cleandp=false
projects / xonotic / xonotic.git / commitdiff