Ape Curtis Testnet

Token

GobsNFT (GOBS)
ERC-721

Overview

Max Total Supply

0 GOBS

Holders

1

Total Transfers

-

Market

Onchain Market Cap

$0.00

Circulating Supply Market Cap

-
Loading...
Loading
Loading...
Loading
Loading...
Loading

Click here to update the token information / general information

Contract Source Code Verified (Exact Match)

Contract Name:
Gobs

Compiler Version
v0.8.28+commit.7893614a

Optimization Enabled:
No with 200 runs

Other Settings:
default evmVersion, None license

Contract Source Code (Solidity)

/**
 *Submitted for verification at curtis.apescan.io on 2024-12-27
*/

// File: @openzeppelin/contracts/utils/Base64.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/Base64.sol)

pragma solidity ^0.8.20;

/**
 * @dev Provides a set of functions to operate with Base64 strings.
 */
library Base64 {
    /**
     * @dev Base64 Encoding/Decoding Table
     * See sections 4 and 5 of https://datatracker.ietf.org/doc/html/rfc4648
     */
    string internal constant _TABLE = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
    string internal constant _TABLE_URL = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_";

    /**
     * @dev Converts a `bytes` to its Bytes64 `string` representation.
     */
    function encode(bytes memory data) internal pure returns (string memory) {
        return _encode(data, _TABLE, true);
    }

    /**
     * @dev Converts a `bytes` to its Bytes64Url `string` representation.
     * Output is not padded with `=` as specified in https://www.rfc-editor.org/rfc/rfc4648[rfc4648].
     */
    function encodeURL(bytes memory data) internal pure returns (string memory) {
        return _encode(data, _TABLE_URL, false);
    }

    /**
     * @dev Internal table-agnostic conversion
     */
    function _encode(bytes memory data, string memory table, bool withPadding) private pure returns (string memory) {
        /**
         * Inspired by Brecht Devos (Brechtpd) implementation - MIT licence
         * https://github.com/Brechtpd/base64/blob/e78d9fd951e7b0977ddca77d92dc85183770daf4/base64.sol
         */
        if (data.length == 0) return "";

        // If padding is enabled, the final length should be `bytes` data length divided by 3 rounded up and then
        // multiplied by 4 so that it leaves room for padding the last chunk
        // - `data.length + 2`  -> Prepare for division rounding up
        // - `/ 3`              -> Number of 3-bytes chunks (rounded up)
        // - `4 *`              -> 4 characters for each chunk
        // This is equivalent to: 4 * Math.ceil(data.length / 3)
        //
        // If padding is disabled, the final length should be `bytes` data length multiplied by 4/3 rounded up as
        // opposed to when padding is required to fill the last chunk.
        // - `4 * data.length`  -> 4 characters for each chunk
        // - ` + 2`             -> Prepare for division rounding up
        // - `/ 3`              -> Number of 3-bytes chunks (rounded up)
        // This is equivalent to: Math.ceil((4 * data.length) / 3)
        uint256 resultLength = withPadding ? 4 * ((data.length + 2) / 3) : (4 * data.length + 2) / 3;

        string memory result = new string(resultLength);

        assembly ("memory-safe") {
            // Prepare the lookup table (skip the first "length" byte)
            let tablePtr := add(table, 1)

            // Prepare result pointer, jump over length
            let resultPtr := add(result, 0x20)
            let dataPtr := data
            let endPtr := add(data, mload(data))

            // In some cases, the last iteration will read bytes after the end of the data. We cache the value, and
            // set it to zero to make sure no dirty bytes are read in that section.
            let afterPtr := add(endPtr, 0x20)
            let afterCache := mload(afterPtr)
            mstore(afterPtr, 0x00)

            // Run over the input, 3 bytes at a time
            for {

            } lt(dataPtr, endPtr) {

            } {
                // Advance 3 bytes
                dataPtr := add(dataPtr, 3)
                let input := mload(dataPtr)

                // To write each character, shift the 3 byte (24 bits) chunk
                // 4 times in blocks of 6 bits for each character (18, 12, 6, 0)
                // and apply logical AND with 0x3F to bitmask the least significant 6 bits.
                // Use this as an index into the lookup table, mload an entire word
                // so the desired character is in the least significant byte, and
                // mstore8 this least significant byte into the result and continue.

                mstore8(resultPtr, mload(add(tablePtr, and(shr(18, input), 0x3F))))
                resultPtr := add(resultPtr, 1) // Advance

                mstore8(resultPtr, mload(add(tablePtr, and(shr(12, input), 0x3F))))
                resultPtr := add(resultPtr, 1) // Advance

                mstore8(resultPtr, mload(add(tablePtr, and(shr(6, input), 0x3F))))
                resultPtr := add(resultPtr, 1) // Advance

                mstore8(resultPtr, mload(add(tablePtr, and(input, 0x3F))))
                resultPtr := add(resultPtr, 1) // Advance
            }

            // Reset the value that was cached
            mstore(afterPtr, afterCache)

            if withPadding {
                // When data `bytes` is not exactly 3 bytes long
                // it is padded with `=` characters at the end
                switch mod(mload(data), 3)
                case 1 {
                    mstore8(sub(resultPtr, 1), 0x3d)
                    mstore8(sub(resultPtr, 2), 0x3d)
                }
                case 2 {
                    mstore8(sub(resultPtr, 1), 0x3d)
                }
            }
        }

        return result;
    }
}

// File: @openzeppelin/contracts/utils/Panic.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)

pragma solidity ^0.8.20;

/**
 * @dev Helper library for emitting standardized panic codes.
 *
 * ```solidity
 * contract Example {
 *      using Panic for uint256;
 *
 *      // Use any of the declared internal constants
 *      function foo() { Panic.GENERIC.panic(); }
 *
 *      // Alternatively
 *      function foo() { Panic.panic(Panic.GENERIC); }
 * }
 * ```
 *
 * Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].
 *
 * _Available since v5.1._
 */
// slither-disable-next-line unused-state
library Panic {
    /// @dev generic / unspecified error
    uint256 internal constant GENERIC = 0x00;
    /// @dev used by the assert() builtin
    uint256 internal constant ASSERT = 0x01;
    /// @dev arithmetic underflow or overflow
    uint256 internal constant UNDER_OVERFLOW = 0x11;
    /// @dev division or modulo by zero
    uint256 internal constant DIVISION_BY_ZERO = 0x12;
    /// @dev enum conversion error
    uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;
    /// @dev invalid encoding in storage
    uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;
    /// @dev empty array pop
    uint256 internal constant EMPTY_ARRAY_POP = 0x31;
    /// @dev array out of bounds access
    uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;
    /// @dev resource error (too large allocation or too large array)
    uint256 internal constant RESOURCE_ERROR = 0x41;
    /// @dev calling invalid internal function
    uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;

    /// @dev Reverts with a panic code. Recommended to use with
    /// the internal constants with predefined codes.
    function panic(uint256 code) internal pure {
        assembly ("memory-safe") {
            mstore(0x00, 0x4e487b71)
            mstore(0x20, code)
            revert(0x1c, 0x24)
        }
    }
}

// File: @openzeppelin/contracts/utils/math/SafeCast.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SafeCast.sol)
// This file was procedurally generated from scripts/generate/templates/SafeCast.js.

pragma solidity ^0.8.20;

/**
 * @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow
 * checks.
 *
 * Downcasting from uint256/int256 in Solidity does not revert on overflow. This can
 * easily result in undesired exploitation or bugs, since developers usually
 * assume that overflows raise errors. `SafeCast` restores this intuition by
 * reverting the transaction when such an operation overflows.
 *
 * Using this library instead of the unchecked operations eliminates an entire
 * class of bugs, so it's recommended to use it always.
 */
library SafeCast {
    /**
     * @dev Value doesn't fit in an uint of `bits` size.
     */
    error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);

    /**
     * @dev An int value doesn't fit in an uint of `bits` size.
     */
    error SafeCastOverflowedIntToUint(int256 value);

    /**
     * @dev Value doesn't fit in an int of `bits` size.
     */
    error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);

    /**
     * @dev An uint value doesn't fit in an int of `bits` size.
     */
    error SafeCastOverflowedUintToInt(uint256 value);

    /**
     * @dev Returns the downcasted uint248 from uint256, reverting on
     * overflow (when the input is greater than largest uint248).
     *
     * Counterpart to Solidity's `uint248` operator.
     *
     * Requirements:
     *
     * - input must fit into 248 bits
     */
    function toUint248(uint256 value) internal pure returns (uint248) {
        if (value > type(uint248).max) {
            revert SafeCastOverflowedUintDowncast(248, value);
        }
        return uint248(value);
    }

    /**
     * @dev Returns the downcasted uint240 from uint256, reverting on
     * overflow (when the input is greater than largest uint240).
     *
     * Counterpart to Solidity's `uint240` operator.
     *
     * Requirements:
     *
     * - input must fit into 240 bits
     */
    function toUint240(uint256 value) internal pure returns (uint240) {
        if (value > type(uint240).max) {
            revert SafeCastOverflowedUintDowncast(240, value);
        }
        return uint240(value);
    }

    /**
     * @dev Returns the downcasted uint232 from uint256, reverting on
     * overflow (when the input is greater than largest uint232).
     *
     * Counterpart to Solidity's `uint232` operator.
     *
     * Requirements:
     *
     * - input must fit into 232 bits
     */
    function toUint232(uint256 value) internal pure returns (uint232) {
        if (value > type(uint232).max) {
            revert SafeCastOverflowedUintDowncast(232, value);
        }
        return uint232(value);
    }

    /**
     * @dev Returns the downcasted uint224 from uint256, reverting on
     * overflow (when the input is greater than largest uint224).
     *
     * Counterpart to Solidity's `uint224` operator.
     *
     * Requirements:
     *
     * - input must fit into 224 bits
     */
    function toUint224(uint256 value) internal pure returns (uint224) {
        if (value > type(uint224).max) {
            revert SafeCastOverflowedUintDowncast(224, value);
        }
        return uint224(value);
    }

    /**
     * @dev Returns the downcasted uint216 from uint256, reverting on
     * overflow (when the input is greater than largest uint216).
     *
     * Counterpart to Solidity's `uint216` operator.
     *
     * Requirements:
     *
     * - input must fit into 216 bits
     */
    function toUint216(uint256 value) internal pure returns (uint216) {
        if (value > type(uint216).max) {
            revert SafeCastOverflowedUintDowncast(216, value);
        }
        return uint216(value);
    }

    /**
     * @dev Returns the downcasted uint208 from uint256, reverting on
     * overflow (when the input is greater than largest uint208).
     *
     * Counterpart to Solidity's `uint208` operator.
     *
     * Requirements:
     *
     * - input must fit into 208 bits
     */
    function toUint208(uint256 value) internal pure returns (uint208) {
        if (value > type(uint208).max) {
            revert SafeCastOverflowedUintDowncast(208, value);
        }
        return uint208(value);
    }

    /**
     * @dev Returns the downcasted uint200 from uint256, reverting on
     * overflow (when the input is greater than largest uint200).
     *
     * Counterpart to Solidity's `uint200` operator.
     *
     * Requirements:
     *
     * - input must fit into 200 bits
     */
    function toUint200(uint256 value) internal pure returns (uint200) {
        if (value > type(uint200).max) {
            revert SafeCastOverflowedUintDowncast(200, value);
        }
        return uint200(value);
    }

    /**
     * @dev Returns the downcasted uint192 from uint256, reverting on
     * overflow (when the input is greater than largest uint192).
     *
     * Counterpart to Solidity's `uint192` operator.
     *
     * Requirements:
     *
     * - input must fit into 192 bits
     */
    function toUint192(uint256 value) internal pure returns (uint192) {
        if (value > type(uint192).max) {
            revert SafeCastOverflowedUintDowncast(192, value);
        }
        return uint192(value);
    }

    /**
     * @dev Returns the downcasted uint184 from uint256, reverting on
     * overflow (when the input is greater than largest uint184).
     *
     * Counterpart to Solidity's `uint184` operator.
     *
     * Requirements:
     *
     * - input must fit into 184 bits
     */
    function toUint184(uint256 value) internal pure returns (uint184) {
        if (value > type(uint184).max) {
            revert SafeCastOverflowedUintDowncast(184, value);
        }
        return uint184(value);
    }

    /**
     * @dev Returns the downcasted uint176 from uint256, reverting on
     * overflow (when the input is greater than largest uint176).
     *
     * Counterpart to Solidity's `uint176` operator.
     *
     * Requirements:
     *
     * - input must fit into 176 bits
     */
    function toUint176(uint256 value) internal pure returns (uint176) {
        if (value > type(uint176).max) {
            revert SafeCastOverflowedUintDowncast(176, value);
        }
        return uint176(value);
    }

    /**
     * @dev Returns the downcasted uint168 from uint256, reverting on
     * overflow (when the input is greater than largest uint168).
     *
     * Counterpart to Solidity's `uint168` operator.
     *
     * Requirements:
     *
     * - input must fit into 168 bits
     */
    function toUint168(uint256 value) internal pure returns (uint168) {
        if (value > type(uint168).max) {
            revert SafeCastOverflowedUintDowncast(168, value);
        }
        return uint168(value);
    }

    /**
     * @dev Returns the downcasted uint160 from uint256, reverting on
     * overflow (when the input is greater than largest uint160).
     *
     * Counterpart to Solidity's `uint160` operator.
     *
     * Requirements:
     *
     * - input must fit into 160 bits
     */
    function toUint160(uint256 value) internal pure returns (uint160) {
        if (value > type(uint160).max) {
            revert SafeCastOverflowedUintDowncast(160, value);
        }
        return uint160(value);
    }

    /**
     * @dev Returns the downcasted uint152 from uint256, reverting on
     * overflow (when the input is greater than largest uint152).
     *
     * Counterpart to Solidity's `uint152` operator.
     *
     * Requirements:
     *
     * - input must fit into 152 bits
     */
    function toUint152(uint256 value) internal pure returns (uint152) {
        if (value > type(uint152).max) {
            revert SafeCastOverflowedUintDowncast(152, value);
        }
        return uint152(value);
    }

    /**
     * @dev Returns the downcasted uint144 from uint256, reverting on
     * overflow (when the input is greater than largest uint144).
     *
     * Counterpart to Solidity's `uint144` operator.
     *
     * Requirements:
     *
     * - input must fit into 144 bits
     */
    function toUint144(uint256 value) internal pure returns (uint144) {
        if (value > type(uint144).max) {
            revert SafeCastOverflowedUintDowncast(144, value);
        }
        return uint144(value);
    }

    /**
     * @dev Returns the downcasted uint136 from uint256, reverting on
     * overflow (when the input is greater than largest uint136).
     *
     * Counterpart to Solidity's `uint136` operator.
     *
     * Requirements:
     *
     * - input must fit into 136 bits
     */
    function toUint136(uint256 value) internal pure returns (uint136) {
        if (value > type(uint136).max) {
            revert SafeCastOverflowedUintDowncast(136, value);
        }
        return uint136(value);
    }

    /**
     * @dev Returns the downcasted uint128 from uint256, reverting on
     * overflow (when the input is greater than largest uint128).
     *
     * Counterpart to Solidity's `uint128` operator.
     *
     * Requirements:
     *
     * - input must fit into 128 bits
     */
    function toUint128(uint256 value) internal pure returns (uint128) {
        if (value > type(uint128).max) {
            revert SafeCastOverflowedUintDowncast(128, value);
        }
        return uint128(value);
    }

    /**
     * @dev Returns the downcasted uint120 from uint256, reverting on
     * overflow (when the input is greater than largest uint120).
     *
     * Counterpart to Solidity's `uint120` operator.
     *
     * Requirements:
     *
     * - input must fit into 120 bits
     */
    function toUint120(uint256 value) internal pure returns (uint120) {
        if (value > type(uint120).max) {
            revert SafeCastOverflowedUintDowncast(120, value);
        }
        return uint120(value);
    }

    /**
     * @dev Returns the downcasted uint112 from uint256, reverting on
     * overflow (when the input is greater than largest uint112).
     *
     * Counterpart to Solidity's `uint112` operator.
     *
     * Requirements:
     *
     * - input must fit into 112 bits
     */
    function toUint112(uint256 value) internal pure returns (uint112) {
        if (value > type(uint112).max) {
            revert SafeCastOverflowedUintDowncast(112, value);
        }
        return uint112(value);
    }

    /**
     * @dev Returns the downcasted uint104 from uint256, reverting on
     * overflow (when the input is greater than largest uint104).
     *
     * Counterpart to Solidity's `uint104` operator.
     *
     * Requirements:
     *
     * - input must fit into 104 bits
     */
    function toUint104(uint256 value) internal pure returns (uint104) {
        if (value > type(uint104).max) {
            revert SafeCastOverflowedUintDowncast(104, value);
        }
        return uint104(value);
    }

    /**
     * @dev Returns the downcasted uint96 from uint256, reverting on
     * overflow (when the input is greater than largest uint96).
     *
     * Counterpart to Solidity's `uint96` operator.
     *
     * Requirements:
     *
     * - input must fit into 96 bits
     */
    function toUint96(uint256 value) internal pure returns (uint96) {
        if (value > type(uint96).max) {
            revert SafeCastOverflowedUintDowncast(96, value);
        }
        return uint96(value);
    }

    /**
     * @dev Returns the downcasted uint88 from uint256, reverting on
     * overflow (when the input is greater than largest uint88).
     *
     * Counterpart to Solidity's `uint88` operator.
     *
     * Requirements:
     *
     * - input must fit into 88 bits
     */
    function toUint88(uint256 value) internal pure returns (uint88) {
        if (value > type(uint88).max) {
            revert SafeCastOverflowedUintDowncast(88, value);
        }
        return uint88(value);
    }

    /**
     * @dev Returns the downcasted uint80 from uint256, reverting on
     * overflow (when the input is greater than largest uint80).
     *
     * Counterpart to Solidity's `uint80` operator.
     *
     * Requirements:
     *
     * - input must fit into 80 bits
     */
    function toUint80(uint256 value) internal pure returns (uint80) {
        if (value > type(uint80).max) {
            revert SafeCastOverflowedUintDowncast(80, value);
        }
        return uint80(value);
    }

    /**
     * @dev Returns the downcasted uint72 from uint256, reverting on
     * overflow (when the input is greater than largest uint72).
     *
     * Counterpart to Solidity's `uint72` operator.
     *
     * Requirements:
     *
     * - input must fit into 72 bits
     */
    function toUint72(uint256 value) internal pure returns (uint72) {
        if (value > type(uint72).max) {
            revert SafeCastOverflowedUintDowncast(72, value);
        }
        return uint72(value);
    }

    /**
     * @dev Returns the downcasted uint64 from uint256, reverting on
     * overflow (when the input is greater than largest uint64).
     *
     * Counterpart to Solidity's `uint64` operator.
     *
     * Requirements:
     *
     * - input must fit into 64 bits
     */
    function toUint64(uint256 value) internal pure returns (uint64) {
        if (value > type(uint64).max) {
            revert SafeCastOverflowedUintDowncast(64, value);
        }
        return uint64(value);
    }

    /**
     * @dev Returns the downcasted uint56 from uint256, reverting on
     * overflow (when the input is greater than largest uint56).
     *
     * Counterpart to Solidity's `uint56` operator.
     *
     * Requirements:
     *
     * - input must fit into 56 bits
     */
    function toUint56(uint256 value) internal pure returns (uint56) {
        if (value > type(uint56).max) {
            revert SafeCastOverflowedUintDowncast(56, value);
        }
        return uint56(value);
    }

    /**
     * @dev Returns the downcasted uint48 from uint256, reverting on
     * overflow (when the input is greater than largest uint48).
     *
     * Counterpart to Solidity's `uint48` operator.
     *
     * Requirements:
     *
     * - input must fit into 48 bits
     */
    function toUint48(uint256 value) internal pure returns (uint48) {
        if (value > type(uint48).max) {
            revert SafeCastOverflowedUintDowncast(48, value);
        }
        return uint48(value);
    }

    /**
     * @dev Returns the downcasted uint40 from uint256, reverting on
     * overflow (when the input is greater than largest uint40).
     *
     * Counterpart to Solidity's `uint40` operator.
     *
     * Requirements:
     *
     * - input must fit into 40 bits
     */
    function toUint40(uint256 value) internal pure returns (uint40) {
        if (value > type(uint40).max) {
            revert SafeCastOverflowedUintDowncast(40, value);
        }
        return uint40(value);
    }

    /**
     * @dev Returns the downcasted uint32 from uint256, reverting on
     * overflow (when the input is greater than largest uint32).
     *
     * Counterpart to Solidity's `uint32` operator.
     *
     * Requirements:
     *
     * - input must fit into 32 bits
     */
    function toUint32(uint256 value) internal pure returns (uint32) {
        if (value > type(uint32).max) {
            revert SafeCastOverflowedUintDowncast(32, value);
        }
        return uint32(value);
    }

    /**
     * @dev Returns the downcasted uint24 from uint256, reverting on
     * overflow (when the input is greater than largest uint24).
     *
     * Counterpart to Solidity's `uint24` operator.
     *
     * Requirements:
     *
     * - input must fit into 24 bits
     */
    function toUint24(uint256 value) internal pure returns (uint24) {
        if (value > type(uint24).max) {
            revert SafeCastOverflowedUintDowncast(24, value);
        }
        return uint24(value);
    }

    /**
     * @dev Returns the downcasted uint16 from uint256, reverting on
     * overflow (when the input is greater than largest uint16).
     *
     * Counterpart to Solidity's `uint16` operator.
     *
     * Requirements:
     *
     * - input must fit into 16 bits
     */
    function toUint16(uint256 value) internal pure returns (uint16) {
        if (value > type(uint16).max) {
            revert SafeCastOverflowedUintDowncast(16, value);
        }
        return uint16(value);
    }

    /**
     * @dev Returns the downcasted uint8 from uint256, reverting on
     * overflow (when the input is greater than largest uint8).
     *
     * Counterpart to Solidity's `uint8` operator.
     *
     * Requirements:
     *
     * - input must fit into 8 bits
     */
    function toUint8(uint256 value) internal pure returns (uint8) {
        if (value > type(uint8).max) {
            revert SafeCastOverflowedUintDowncast(8, value);
        }
        return uint8(value);
    }

    /**
     * @dev Converts a signed int256 into an unsigned uint256.
     *
     * Requirements:
     *
     * - input must be greater than or equal to 0.
     */
    function toUint256(int256 value) internal pure returns (uint256) {
        if (value < 0) {
            revert SafeCastOverflowedIntToUint(value);
        }
        return uint256(value);
    }

    /**
     * @dev Returns the downcasted int248 from int256, reverting on
     * overflow (when the input is less than smallest int248 or
     * greater than largest int248).
     *
     * Counterpart to Solidity's `int248` operator.
     *
     * Requirements:
     *
     * - input must fit into 248 bits
     */
    function toInt248(int256 value) internal pure returns (int248 downcasted) {
        downcasted = int248(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(248, value);
        }
    }

    /**
     * @dev Returns the downcasted int240 from int256, reverting on
     * overflow (when the input is less than smallest int240 or
     * greater than largest int240).
     *
     * Counterpart to Solidity's `int240` operator.
     *
     * Requirements:
     *
     * - input must fit into 240 bits
     */
    function toInt240(int256 value) internal pure returns (int240 downcasted) {
        downcasted = int240(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(240, value);
        }
    }

    /**
     * @dev Returns the downcasted int232 from int256, reverting on
     * overflow (when the input is less than smallest int232 or
     * greater than largest int232).
     *
     * Counterpart to Solidity's `int232` operator.
     *
     * Requirements:
     *
     * - input must fit into 232 bits
     */
    function toInt232(int256 value) internal pure returns (int232 downcasted) {
        downcasted = int232(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(232, value);
        }
    }

    /**
     * @dev Returns the downcasted int224 from int256, reverting on
     * overflow (when the input is less than smallest int224 or
     * greater than largest int224).
     *
     * Counterpart to Solidity's `int224` operator.
     *
     * Requirements:
     *
     * - input must fit into 224 bits
     */
    function toInt224(int256 value) internal pure returns (int224 downcasted) {
        downcasted = int224(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(224, value);
        }
    }

    /**
     * @dev Returns the downcasted int216 from int256, reverting on
     * overflow (when the input is less than smallest int216 or
     * greater than largest int216).
     *
     * Counterpart to Solidity's `int216` operator.
     *
     * Requirements:
     *
     * - input must fit into 216 bits
     */
    function toInt216(int256 value) internal pure returns (int216 downcasted) {
        downcasted = int216(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(216, value);
        }
    }

    /**
     * @dev Returns the downcasted int208 from int256, reverting on
     * overflow (when the input is less than smallest int208 or
     * greater than largest int208).
     *
     * Counterpart to Solidity's `int208` operator.
     *
     * Requirements:
     *
     * - input must fit into 208 bits
     */
    function toInt208(int256 value) internal pure returns (int208 downcasted) {
        downcasted = int208(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(208, value);
        }
    }

    /**
     * @dev Returns the downcasted int200 from int256, reverting on
     * overflow (when the input is less than smallest int200 or
     * greater than largest int200).
     *
     * Counterpart to Solidity's `int200` operator.
     *
     * Requirements:
     *
     * - input must fit into 200 bits
     */
    function toInt200(int256 value) internal pure returns (int200 downcasted) {
        downcasted = int200(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(200, value);
        }
    }

    /**
     * @dev Returns the downcasted int192 from int256, reverting on
     * overflow (when the input is less than smallest int192 or
     * greater than largest int192).
     *
     * Counterpart to Solidity's `int192` operator.
     *
     * Requirements:
     *
     * - input must fit into 192 bits
     */
    function toInt192(int256 value) internal pure returns (int192 downcasted) {
        downcasted = int192(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(192, value);
        }
    }

    /**
     * @dev Returns the downcasted int184 from int256, reverting on
     * overflow (when the input is less than smallest int184 or
     * greater than largest int184).
     *
     * Counterpart to Solidity's `int184` operator.
     *
     * Requirements:
     *
     * - input must fit into 184 bits
     */
    function toInt184(int256 value) internal pure returns (int184 downcasted) {
        downcasted = int184(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(184, value);
        }
    }

    /**
     * @dev Returns the downcasted int176 from int256, reverting on
     * overflow (when the input is less than smallest int176 or
     * greater than largest int176).
     *
     * Counterpart to Solidity's `int176` operator.
     *
     * Requirements:
     *
     * - input must fit into 176 bits
     */
    function toInt176(int256 value) internal pure returns (int176 downcasted) {
        downcasted = int176(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(176, value);
        }
    }

    /**
     * @dev Returns the downcasted int168 from int256, reverting on
     * overflow (when the input is less than smallest int168 or
     * greater than largest int168).
     *
     * Counterpart to Solidity's `int168` operator.
     *
     * Requirements:
     *
     * - input must fit into 168 bits
     */
    function toInt168(int256 value) internal pure returns (int168 downcasted) {
        downcasted = int168(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(168, value);
        }
    }

    /**
     * @dev Returns the downcasted int160 from int256, reverting on
     * overflow (when the input is less than smallest int160 or
     * greater than largest int160).
     *
     * Counterpart to Solidity's `int160` operator.
     *
     * Requirements:
     *
     * - input must fit into 160 bits
     */
    function toInt160(int256 value) internal pure returns (int160 downcasted) {
        downcasted = int160(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(160, value);
        }
    }

    /**
     * @dev Returns the downcasted int152 from int256, reverting on
     * overflow (when the input is less than smallest int152 or
     * greater than largest int152).
     *
     * Counterpart to Solidity's `int152` operator.
     *
     * Requirements:
     *
     * - input must fit into 152 bits
     */
    function toInt152(int256 value) internal pure returns (int152 downcasted) {
        downcasted = int152(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(152, value);
        }
    }

    /**
     * @dev Returns the downcasted int144 from int256, reverting on
     * overflow (when the input is less than smallest int144 or
     * greater than largest int144).
     *
     * Counterpart to Solidity's `int144` operator.
     *
     * Requirements:
     *
     * - input must fit into 144 bits
     */
    function toInt144(int256 value) internal pure returns (int144 downcasted) {
        downcasted = int144(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(144, value);
        }
    }

    /**
     * @dev Returns the downcasted int136 from int256, reverting on
     * overflow (when the input is less than smallest int136 or
     * greater than largest int136).
     *
     * Counterpart to Solidity's `int136` operator.
     *
     * Requirements:
     *
     * - input must fit into 136 bits
     */
    function toInt136(int256 value) internal pure returns (int136 downcasted) {
        downcasted = int136(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(136, value);
        }
    }

    /**
     * @dev Returns the downcasted int128 from int256, reverting on
     * overflow (when the input is less than smallest int128 or
     * greater than largest int128).
     *
     * Counterpart to Solidity's `int128` operator.
     *
     * Requirements:
     *
     * - input must fit into 128 bits
     */
    function toInt128(int256 value) internal pure returns (int128 downcasted) {
        downcasted = int128(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(128, value);
        }
    }

    /**
     * @dev Returns the downcasted int120 from int256, reverting on
     * overflow (when the input is less than smallest int120 or
     * greater than largest int120).
     *
     * Counterpart to Solidity's `int120` operator.
     *
     * Requirements:
     *
     * - input must fit into 120 bits
     */
    function toInt120(int256 value) internal pure returns (int120 downcasted) {
        downcasted = int120(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(120, value);
        }
    }

    /**
     * @dev Returns the downcasted int112 from int256, reverting on
     * overflow (when the input is less than smallest int112 or
     * greater than largest int112).
     *
     * Counterpart to Solidity's `int112` operator.
     *
     * Requirements:
     *
     * - input must fit into 112 bits
     */
    function toInt112(int256 value) internal pure returns (int112 downcasted) {
        downcasted = int112(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(112, value);
        }
    }

    /**
     * @dev Returns the downcasted int104 from int256, reverting on
     * overflow (when the input is less than smallest int104 or
     * greater than largest int104).
     *
     * Counterpart to Solidity's `int104` operator.
     *
     * Requirements:
     *
     * - input must fit into 104 bits
     */
    function toInt104(int256 value) internal pure returns (int104 downcasted) {
        downcasted = int104(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(104, value);
        }
    }

    /**
     * @dev Returns the downcasted int96 from int256, reverting on
     * overflow (when the input is less than smallest int96 or
     * greater than largest int96).
     *
     * Counterpart to Solidity's `int96` operator.
     *
     * Requirements:
     *
     * - input must fit into 96 bits
     */
    function toInt96(int256 value) internal pure returns (int96 downcasted) {
        downcasted = int96(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(96, value);
        }
    }

    /**
     * @dev Returns the downcasted int88 from int256, reverting on
     * overflow (when the input is less than smallest int88 or
     * greater than largest int88).
     *
     * Counterpart to Solidity's `int88` operator.
     *
     * Requirements:
     *
     * - input must fit into 88 bits
     */
    function toInt88(int256 value) internal pure returns (int88 downcasted) {
        downcasted = int88(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(88, value);
        }
    }

    /**
     * @dev Returns the downcasted int80 from int256, reverting on
     * overflow (when the input is less than smallest int80 or
     * greater than largest int80).
     *
     * Counterpart to Solidity's `int80` operator.
     *
     * Requirements:
     *
     * - input must fit into 80 bits
     */
    function toInt80(int256 value) internal pure returns (int80 downcasted) {
        downcasted = int80(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(80, value);
        }
    }

    /**
     * @dev Returns the downcasted int72 from int256, reverting on
     * overflow (when the input is less than smallest int72 or
     * greater than largest int72).
     *
     * Counterpart to Solidity's `int72` operator.
     *
     * Requirements:
     *
     * - input must fit into 72 bits
     */
    function toInt72(int256 value) internal pure returns (int72 downcasted) {
        downcasted = int72(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(72, value);
        }
    }

    /**
     * @dev Returns the downcasted int64 from int256, reverting on
     * overflow (when the input is less than smallest int64 or
     * greater than largest int64).
     *
     * Counterpart to Solidity's `int64` operator.
     *
     * Requirements:
     *
     * - input must fit into 64 bits
     */
    function toInt64(int256 value) internal pure returns (int64 downcasted) {
        downcasted = int64(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(64, value);
        }
    }

    /**
     * @dev Returns the downcasted int56 from int256, reverting on
     * overflow (when the input is less than smallest int56 or
     * greater than largest int56).
     *
     * Counterpart to Solidity's `int56` operator.
     *
     * Requirements:
     *
     * - input must fit into 56 bits
     */
    function toInt56(int256 value) internal pure returns (int56 downcasted) {
        downcasted = int56(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(56, value);
        }
    }

    /**
     * @dev Returns the downcasted int48 from int256, reverting on
     * overflow (when the input is less than smallest int48 or
     * greater than largest int48).
     *
     * Counterpart to Solidity's `int48` operator.
     *
     * Requirements:
     *
     * - input must fit into 48 bits
     */
    function toInt48(int256 value) internal pure returns (int48 downcasted) {
        downcasted = int48(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(48, value);
        }
    }

    /**
     * @dev Returns the downcasted int40 from int256, reverting on
     * overflow (when the input is less than smallest int40 or
     * greater than largest int40).
     *
     * Counterpart to Solidity's `int40` operator.
     *
     * Requirements:
     *
     * - input must fit into 40 bits
     */
    function toInt40(int256 value) internal pure returns (int40 downcasted) {
        downcasted = int40(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(40, value);
        }
    }

    /**
     * @dev Returns the downcasted int32 from int256, reverting on
     * overflow (when the input is less than smallest int32 or
     * greater than largest int32).
     *
     * Counterpart to Solidity's `int32` operator.
     *
     * Requirements:
     *
     * - input must fit into 32 bits
     */
    function toInt32(int256 value) internal pure returns (int32 downcasted) {
        downcasted = int32(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(32, value);
        }
    }

    /**
     * @dev Returns the downcasted int24 from int256, reverting on
     * overflow (when the input is less than smallest int24 or
     * greater than largest int24).
     *
     * Counterpart to Solidity's `int24` operator.
     *
     * Requirements:
     *
     * - input must fit into 24 bits
     */
    function toInt24(int256 value) internal pure returns (int24 downcasted) {
        downcasted = int24(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(24, value);
        }
    }

    /**
     * @dev Returns the downcasted int16 from int256, reverting on
     * overflow (when the input is less than smallest int16 or
     * greater than largest int16).
     *
     * Counterpart to Solidity's `int16` operator.
     *
     * Requirements:
     *
     * - input must fit into 16 bits
     */
    function toInt16(int256 value) internal pure returns (int16 downcasted) {
        downcasted = int16(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(16, value);
        }
    }

    /**
     * @dev Returns the downcasted int8 from int256, reverting on
     * overflow (when the input is less than smallest int8 or
     * greater than largest int8).
     *
     * Counterpart to Solidity's `int8` operator.
     *
     * Requirements:
     *
     * - input must fit into 8 bits
     */
    function toInt8(int256 value) internal pure returns (int8 downcasted) {
        downcasted = int8(value);
        if (downcasted != value) {
            revert SafeCastOverflowedIntDowncast(8, value);
        }
    }

    /**
     * @dev Converts an unsigned uint256 into a signed int256.
     *
     * Requirements:
     *
     * - input must be less than or equal to maxInt256.
     */
    function toInt256(uint256 value) internal pure returns (int256) {
        // Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive
        if (value > uint256(type(int256).max)) {
            revert SafeCastOverflowedUintToInt(value);
        }
        return int256(value);
    }

    /**
     * @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.
     */
    function toUint(bool b) internal pure returns (uint256 u) {
        assembly ("memory-safe") {
            u := iszero(iszero(b))
        }
    }
}

// File: @openzeppelin/contracts/utils/math/Math.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/Math.sol)

pragma solidity ^0.8.20;



/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Floor, // Toward negative infinity
        Ceil, // Toward positive infinity
        Trunc, // Toward zero
        Expand // Away from zero
    }

    /**
     * @dev Returns the addition of two unsigned integers, with an success flag (no overflow).
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a + b;
            if (c < a) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with an success flag (no overflow).
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b > a) return (false, 0);
            return (true, a - b);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with an success flag (no overflow).
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            // Gas optimization: this is cheaper than requiring 'a' not being zero, but the
            // benefit is lost if 'b' is also tested.
            // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
            if (a == 0) return (true, 0);
            uint256 c = a * b;
            if (c / a != b) return (false, 0);
            return (true, c);
        }
    }

    /**
     * @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a / b);
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            if (b == 0) return (false, 0);
            return (true, a % b);
        }
    }

    /**
     * @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
     *
     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
     * one branch when needed, making this function more expensive.
     */
    function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * SafeCast.toUint(condition));
        }
    }

    /**
     * @dev Returns the largest of two numbers.
     */
    function max(uint256 a, uint256 b) internal pure returns (uint256) {
        return ternary(a > b, a, b);
    }

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return ternary(a < b, a, b);
    }

    /**
     * @dev Returns the average of two numbers. The result is rounded towards
     * zero.
     */
    function average(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b) / 2 can overflow.
        return (a & b) + (a ^ b) / 2;
    }

    /**
     * @dev Returns the ceiling of the division of two numbers.
     *
     * This differs from standard division with `/` in that it rounds towards infinity instead
     * of rounding towards zero.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        if (b == 0) {
            // Guarantee the same behavior as in a regular Solidity division.
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }

        // The following calculation ensures accurate ceiling division without overflow.
        // Since a is non-zero, (a - 1) / b will not overflow.
        // The largest possible result occurs when (a - 1) / b is type(uint256).max,
        // but the largest value we can obtain is type(uint256).max - 1, which happens
        // when a = type(uint256).max and b = 1.
        unchecked {
            return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);
        }
    }

    /**
     * @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
     * denominator == 0.
     *
     * Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
     * Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
            // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2²⁵⁶ + prod0.
            uint256 prod0 = x * y; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                // Solidity will revert if denominator == 0, unlike the div opcode on its own.
                // The surrounding unchecked block does not change this fact.
                // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
                return prod0 / denominator;
            }

            // Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.
            if (denominator <= prod1) {
                Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));
            }

            ///////////////////////////////////////////////
            // 512 by 256 division.
            ///////////////////////////////////////////////

            // Make division exact by subtracting the remainder from [prod1 prod0].
            uint256 remainder;
            assembly {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

                // Subtract 256 bit number from 512 bit number.
                prod1 := sub(prod1, gt(remainder, prod0))
                prod0 := sub(prod0, remainder)
            }

            // Factor powers of two out of denominator and compute largest power of two divisor of denominator.
            // Always >= 1. See https://cs.stackexchange.com/q/138556/92363.

            uint256 twos = denominator & (0 - denominator);
            assembly {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

                // Divide [prod1 prod0] by twos.
                prod0 := div(prod0, twos)

                // Flip twos such that it is 2²⁵⁶ / twos. If twos is zero, then it becomes one.
                twos := add(div(sub(0, twos), twos), 1)
            }

            // Shift in bits from prod1 into prod0.
            prod0 |= prod1 * twos;

            // Invert denominator mod 2²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such
            // that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv ≡ 1 mod 2⁴.
            uint256 inverse = (3 * denominator) ^ 2;

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also
            // works in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2⁸
            inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶
            inverse *= 2 - denominator * inverse; // inverse mod 2³²
            inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴
            inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸
            inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶

            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
            // This will give us the correct result modulo 2²⁵⁶. Since the preconditions guarantee that the outcome is
            // less than 2²⁵⁶, this is the final result. We don't need to compute the high bits of the result and prod1
            // is no longer required.
            result = prod0 * inverse;
            return result;
        }
    }

    /**
     * @dev Calculates x * y / denominator with full precision, following the selected rounding direction.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
        return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);
    }

    /**
     * @dev Calculate the modular multiplicative inverse of a number in Z/nZ.
     *
     * If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.
     * If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.
     *
     * If the input value is not inversible, 0 is returned.
     *
     * NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the
     * inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.
     */
    function invMod(uint256 a, uint256 n) internal pure returns (uint256) {
        unchecked {
            if (n == 0) return 0;

            // The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)
            // Used to compute integers x and y such that: ax + ny = gcd(a, n).
            // When the gcd is 1, then the inverse of a modulo n exists and it's x.
            // ax + ny = 1
            // ax = 1 + (-y)n
            // ax ≡ 1 (mod n) # x is the inverse of a modulo n

            // If the remainder is 0 the gcd is n right away.
            uint256 remainder = a % n;
            uint256 gcd = n;

            // Therefore the initial coefficients are:
            // ax + ny = gcd(a, n) = n
            // 0a + 1n = n
            int256 x = 0;
            int256 y = 1;

            while (remainder != 0) {
                uint256 quotient = gcd / remainder;

                (gcd, remainder) = (
                    // The old remainder is the next gcd to try.
                    remainder,
                    // Compute the next remainder.
                    // Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd
                    // where gcd is at most n (capped to type(uint256).max)
                    gcd - remainder * quotient
                );

                (x, y) = (
                    // Increment the coefficient of a.
                    y,
                    // Decrement the coefficient of n.
                    // Can overflow, but the result is casted to uint256 so that the
                    // next value of y is "wrapped around" to a value between 0 and n - 1.
                    x - y * int256(quotient)
                );
            }

            if (gcd != 1) return 0; // No inverse exists.
            return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.
        }
    }

    /**
     * @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.
     *
     * From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is
     * prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that
     * `a**(p-2)` is the modular multiplicative inverse of a in Fp.
     *
     * NOTE: this function does NOT check that `p` is a prime greater than `2`.
     */
    function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {
        unchecked {
            return Math.modExp(a, p - 2, p);
        }
    }

    /**
     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)
     *
     * Requirements:
     * - modulus can't be zero
     * - underlying staticcall to precompile must succeed
     *
     * IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make
     * sure the chain you're using it on supports the precompiled contract for modular exponentiation
     * at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,
     * the underlying function will succeed given the lack of a revert, but the result may be incorrectly
     * interpreted as 0.
     */
    function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {
        (bool success, uint256 result) = tryModExp(b, e, m);
        if (!success) {
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }
        return result;
    }

    /**
     * @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).
     * It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying
     * to operate modulo 0 or if the underlying precompile reverted.
     *
     * IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain
     * you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in
     * https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack
     * of a revert, but the result may be incorrectly interpreted as 0.
     */
    function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {
        if (m == 0) return (false, 0);
        assembly ("memory-safe") {
            let ptr := mload(0x40)
            // | Offset    | Content    | Content (Hex)                                                      |
            // |-----------|------------|--------------------------------------------------------------------|
            // | 0x00:0x1f | size of b  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x20:0x3f | size of e  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x40:0x5f | size of m  | 0x0000000000000000000000000000000000000000000000000000000000000020 |
            // | 0x60:0x7f | value of b | 0x<.............................................................b> |
            // | 0x80:0x9f | value of e | 0x<.............................................................e> |
            // | 0xa0:0xbf | value of m | 0x<.............................................................m> |
            mstore(ptr, 0x20)
            mstore(add(ptr, 0x20), 0x20)
            mstore(add(ptr, 0x40), 0x20)
            mstore(add(ptr, 0x60), b)
            mstore(add(ptr, 0x80), e)
            mstore(add(ptr, 0xa0), m)

            // Given the result < m, it's guaranteed to fit in 32 bytes,
            // so we can use the memory scratch space located at offset 0.
            success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)
            result := mload(0x00)
        }
    }

    /**
     * @dev Variant of {modExp} that supports inputs of arbitrary length.
     */
    function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {
        (bool success, bytes memory result) = tryModExp(b, e, m);
        if (!success) {
            Panic.panic(Panic.DIVISION_BY_ZERO);
        }
        return result;
    }

    /**
     * @dev Variant of {tryModExp} that supports inputs of arbitrary length.
     */
    function tryModExp(
        bytes memory b,
        bytes memory e,
        bytes memory m
    ) internal view returns (bool success, bytes memory result) {
        if (_zeroBytes(m)) return (false, new bytes(0));

        uint256 mLen = m.length;

        // Encode call args in result and move the free memory pointer
        result = abi.encodePacked(b.length, e.length, mLen, b, e, m);

        assembly ("memory-safe") {
            let dataPtr := add(result, 0x20)
            // Write result on top of args to avoid allocating extra memory.
            success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)
            // Overwrite the length.
            // result.length > returndatasize() is guaranteed because returndatasize() == m.length
            mstore(result, mLen)
            // Set the memory pointer after the returned data.
            mstore(0x40, add(dataPtr, mLen))
        }
    }

    /**
     * @dev Returns whether the provided byte array is zero.
     */
    function _zeroBytes(bytes memory byteArray) private pure returns (bool) {
        for (uint256 i = 0; i < byteArray.length; ++i) {
            if (byteArray[i] != 0) {
                return false;
            }
        }
        return true;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
     * towards zero.
     *
     * This method is based on Newton's method for computing square roots; the algorithm is restricted to only
     * using integer operations.
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        unchecked {
            // Take care of easy edge cases when a == 0 or a == 1
            if (a <= 1) {
                return a;
            }

            // In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a
            // sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between
            // the current value as `ε_n = | x_n - sqrt(a) |`.
            //
            // For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root
            // of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is
            // bigger than any uint256.
            //
            // By noticing that
            // `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`
            // we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar
            // to the msb function.
            uint256 aa = a;
            uint256 xn = 1;

            if (aa >= (1 << 128)) {
                aa >>= 128;
                xn <<= 64;
            }
            if (aa >= (1 << 64)) {
                aa >>= 64;
                xn <<= 32;
            }
            if (aa >= (1 << 32)) {
                aa >>= 32;
                xn <<= 16;
            }
            if (aa >= (1 << 16)) {
                aa >>= 16;
                xn <<= 8;
            }
            if (aa >= (1 << 8)) {
                aa >>= 8;
                xn <<= 4;
            }
            if (aa >= (1 << 4)) {
                aa >>= 4;
                xn <<= 2;
            }
            if (aa >= (1 << 2)) {
                xn <<= 1;
            }

            // We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).
            //
            // We can refine our estimation by noticing that the middle of that interval minimizes the error.
            // If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).
            // This is going to be our x_0 (and ε_0)
            xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)

            // From here, Newton's method give us:
            // x_{n+1} = (x_n + a / x_n) / 2
            //
            // One should note that:
            // x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a
            //              = ((x_n² + a) / (2 * x_n))² - a
            //              = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a
            //              = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)
            //              = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)
            //              = (x_n² - a)² / (2 * x_n)²
            //              = ((x_n² - a) / (2 * x_n))²
            //              ≥ 0
            // Which proves that for all n ≥ 1, sqrt(a) ≤ x_n
            //
            // This gives us the proof of quadratic convergence of the sequence:
            // ε_{n+1} = | x_{n+1} - sqrt(a) |
            //         = | (x_n + a / x_n) / 2 - sqrt(a) |
            //         = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |
            //         = | (x_n - sqrt(a))² / (2 * x_n) |
            //         = | ε_n² / (2 * x_n) |
            //         = ε_n² / | (2 * x_n) |
            //
            // For the first iteration, we have a special case where x_0 is known:
            // ε_1 = ε_0² / | (2 * x_0) |
            //     ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))
            //     ≤ 2**(2*e-4) / (3 * 2**(e-1))
            //     ≤ 2**(e-3) / 3
            //     ≤ 2**(e-3-log2(3))
            //     ≤ 2**(e-4.5)
            //
            // For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:
            // ε_{n+1} = ε_n² / | (2 * x_n) |
            //         ≤ (2**(e-k))² / (2 * 2**(e-1))
            //         ≤ 2**(2*e-2*k) / 2**e
            //         ≤ 2**(e-2*k)
            xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5)  -- special case, see above
            xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9)    -- general case with k = 4.5
            xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18)   -- general case with k = 9
            xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36)   -- general case with k = 18
            xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72)   -- general case with k = 36
            xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144)  -- general case with k = 72

            // Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision
            // ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either
            // sqrt(a) or sqrt(a) + 1.
            return xn - SafeCast.toUint(xn > a / xn);
        }
    }

    /**
     * @dev Calculates sqrt(a), following the selected rounding direction.
     */
    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = sqrt(a);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);
        }
    }

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        uint256 exp;
        unchecked {
            exp = 128 * SafeCast.toUint(value > (1 << 128) - 1);
            value >>= exp;
            result += exp;

            exp = 64 * SafeCast.toUint(value > (1 << 64) - 1);
            value >>= exp;
            result += exp;

            exp = 32 * SafeCast.toUint(value > (1 << 32) - 1);
            value >>= exp;
            result += exp;

            exp = 16 * SafeCast.toUint(value > (1 << 16) - 1);
            value >>= exp;
            result += exp;

            exp = 8 * SafeCast.toUint(value > (1 << 8) - 1);
            value >>= exp;
            result += exp;

            exp = 4 * SafeCast.toUint(value > (1 << 4) - 1);
            value >>= exp;
            result += exp;

            exp = 2 * SafeCast.toUint(value > (1 << 2) - 1);
            value >>= exp;
            result += exp;

            result += SafeCast.toUint(value > 1);
        }
        return result;
    }

    /**
     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log2(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);
        }
    }

    /**
     * @dev Return the log in base 10 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log10(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >= 10 ** 64) {
                value /= 10 ** 64;
                result += 64;
            }
            if (value >= 10 ** 32) {
                value /= 10 ** 32;
                result += 32;
            }
            if (value >= 10 ** 16) {
                value /= 10 ** 16;
                result += 16;
            }
            if (value >= 10 ** 8) {
                value /= 10 ** 8;
                result += 8;
            }
            if (value >= 10 ** 4) {
                value /= 10 ** 4;
                result += 4;
            }
            if (value >= 10 ** 2) {
                value /= 10 ** 2;
                result += 2;
            }
            if (value >= 10 ** 1) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log10(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);
        }
    }

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        uint256 isGt;
        unchecked {
            isGt = SafeCast.toUint(value > (1 << 128) - 1);
            value >>= isGt * 128;
            result += isGt * 16;

            isGt = SafeCast.toUint(value > (1 << 64) - 1);
            value >>= isGt * 64;
            result += isGt * 8;

            isGt = SafeCast.toUint(value > (1 << 32) - 1);
            value >>= isGt * 32;
            result += isGt * 4;

            isGt = SafeCast.toUint(value > (1 << 16) - 1);
            value >>= isGt * 16;
            result += isGt * 2;

            result += SafeCast.toUint(value > (1 << 8) - 1);
        }
        return result;
    }

    /**
     * @dev Return the log in base 256, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log256(value);
            return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);
        }
    }

    /**
     * @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
     */
    function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
        return uint8(rounding) % 2 == 1;
    }
}

// File: @openzeppelin/contracts/utils/math/SignedMath.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SignedMath.sol)

pragma solidity ^0.8.20;


/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
     *
     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
     * one branch when needed, making this function more expensive.
     */
    function ternary(bool condition, int256 a, int256 b) internal pure returns (int256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * int256(SafeCast.toUint(condition)));
        }
    }

    /**
     * @dev Returns the largest of two signed numbers.
     */
    function max(int256 a, int256 b) internal pure returns (int256) {
        return ternary(a > b, a, b);
    }

    /**
     * @dev Returns the smallest of two signed numbers.
     */
    function min(int256 a, int256 b) internal pure returns (int256) {
        return ternary(a < b, a, b);
    }

    /**
     * @dev Returns the average of two signed numbers without overflow.
     * The result is rounded towards zero.
     */
    function average(int256 a, int256 b) internal pure returns (int256) {
        // Formula from the book "Hacker's Delight"
        int256 x = (a & b) + ((a ^ b) >> 1);
        return x + (int256(uint256(x) >> 255) & (a ^ b));
    }

    /**
     * @dev Returns the absolute unsigned value of a signed value.
     */
    function abs(int256 n) internal pure returns (uint256) {
        unchecked {
            // Formula from the "Bit Twiddling Hacks" by Sean Eron Anderson.
            // Since `n` is a signed integer, the generated bytecode will use the SAR opcode to perform the right shift,
            // taking advantage of the most significant (or "sign" bit) in two's complement representation.
            // This opcode adds new most significant bits set to the value of the previous most significant bit. As a result,
            // the mask will either be `bytes32(0)` (if n is positive) or `~bytes32(0)` (if n is negative).
            int256 mask = n >> 255;

            // A `bytes32(0)` mask leaves the input unchanged, while a `~bytes32(0)` mask complements it.
            return uint256((n + mask) ^ mask);
        }
    }
}

// File: @openzeppelin/contracts/utils/Strings.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/Strings.sol)

pragma solidity ^0.8.20;



/**
 * @dev String operations.
 */
library Strings {
    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;

    /**
     * @dev The `value` string doesn't fit in the specified `length`.
     */
    error StringsInsufficientHexLength(uint256 value, uint256 length);

    /**
     * @dev Converts a `uint256` to its ASCII `string` decimal representation.
     */
    function toString(uint256 value) internal pure returns (string memory) {
        unchecked {
            uint256 length = Math.log10(value) + 1;
            string memory buffer = new string(length);
            uint256 ptr;
            assembly ("memory-safe") {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                assembly ("memory-safe") {
                    mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toStringSigned(int256 value) internal pure returns (string memory) {
        return string.concat(value < 0 ? "-" : "", toString(SignedMath.abs(value)));
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
     */
    function toHexString(uint256 value) internal pure returns (string memory) {
        unchecked {
            return toHexString(value, Math.log256(value) + 1);
        }
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
     */
    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
        uint256 localValue = value;
        bytes memory buffer = new bytes(2 * length + 2);
        buffer[0] = "0";
        buffer[1] = "x";
        for (uint256 i = 2 * length + 1; i > 1; --i) {
            buffer[i] = HEX_DIGITS[localValue & 0xf];
            localValue >>= 4;
        }
        if (localValue != 0) {
            revert StringsInsufficientHexLength(value, length);
        }
        return string(buffer);
    }

    /**
     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal
     * representation.
     */
    function toHexString(address addr) internal pure returns (string memory) {
        return toHexString(uint256(uint160(addr)), ADDRESS_LENGTH);
    }

    /**
     * @dev Converts an `address` with fixed length of 20 bytes to its checksummed ASCII `string` hexadecimal
     * representation, according to EIP-55.
     */
    function toChecksumHexString(address addr) internal pure returns (string memory) {
        bytes memory buffer = bytes(toHexString(addr));

        // hash the hex part of buffer (skip length + 2 bytes, length 40)
        uint256 hashValue;
        assembly ("memory-safe") {
            hashValue := shr(96, keccak256(add(buffer, 0x22), 40))
        }

        for (uint256 i = 41; i > 1; --i) {
            // possible values for buffer[i] are 48 (0) to 57 (9) and 97 (a) to 102 (f)
            if (hashValue & 0xf > 7 && uint8(buffer[i]) > 96) {
                // case shift by xoring with 0x20
                buffer[i] ^= 0x20;
            }
            hashValue >>= 4;
        }
        return string(buffer);
    }

    /**
     * @dev Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
    }
}

// File: @openzeppelin/contracts/utils/introspection/IERC165.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/IERC165.sol)

pragma solidity ^0.8.20;

/**
 * @dev Interface of the ERC-165 standard, as defined in the
 * https://eips.ethereum.org/EIPS/eip-165[ERC].
 *
 * Implementers can declare support of contract interfaces, which can then be
 * queried by others ({ERC165Checker}).
 *
 * For an implementation, see {ERC165}.
 */
interface IERC165 {
    /**
     * @dev Returns true if this contract implements the interface defined by
     * `interfaceId`. See the corresponding
     * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[ERC section]
     * to learn more about how these ids are created.
     *
     * This function call must use less than 30 000 gas.
     */
    function supportsInterface(bytes4 interfaceId) external view returns (bool);
}

// File: @openzeppelin/contracts/token/ERC721/IERC721.sol


// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/IERC721.sol)

pragma solidity ^0.8.20;


/**
 * @dev Required interface of an ERC-721 compliant contract.
 */
interface IERC721 is IERC165 {
    /**
     * @dev Emitted when `tokenId` token is transferred from `from` to `to`.
     */
    event Transfer(address indexed from, address indexed to, uint256 indexed tokenId);

    /**
     * @dev Emitted when `owner` enables `approved` to manage the `tokenId` token.
     */
    event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId);

    /**
     * @dev Emitted when `owner` enables or disables (`approved`) `operator` to manage all of its assets.
     */
    event ApprovalForAll(address indexed owner, address indexed operator, bool approved);

    /**
     * @dev Returns the number of tokens in ``owner``'s account.
     */
    function balanceOf(address owner) external view returns (uint256 balance);

    /**
     * @dev Returns the owner of the `tokenId` token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     */
    function ownerOf(uint256 tokenId) external view returns (address owner);

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must exist and be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon
     *   a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId, bytes calldata data) external;

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`, checking first that contract recipients
     * are aware of the ERC-721 protocol to prevent tokens from being forever locked.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must exist and be owned by `from`.
     * - If the caller is not `from`, it must have been allowed to move this token by either {approve} or
     *   {setApprovalForAll}.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon
     *   a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId) external;

    /**
     * @dev Transfers `tokenId` token from `from` to `to`.
     *
     * WARNING: Note that the caller is responsible to confirm that the recipient is capable of receiving ERC-721
     * or else they may be permanently lost. Usage of {safeTransferFrom} prevents loss, though the caller must
     * understand this adds an external call which potentially creates a reentrancy vulnerability.
     *
     * Requirements:
     *
     * - `from` cannot be the zero address.
     * - `to` cannot be the zero address.
     * - `tokenId` token must be owned by `from`.
     * - If the caller is not `from`, it must be approved to move this token by either {approve} or {setApprovalForAll}.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(address from, address to, uint256 tokenId) external;

    /**
     * @dev Gives permission to `to` to transfer `tokenId` token to another account.
     * The approval is cleared when the token is transferred.
     *
     * Only a single account can be approved at a time, so approving the zero address clears previous approvals.
     *
     * Requirements:
     *
     * - The caller must own the token or be an approved operator.
     * - `tokenId` must exist.
     *
     * Emits an {Approval} event.
     */
    function approve(address to, uint256 tokenId) external;

    /**
     * @dev Approve or remove `operator` as an operator for the caller.
     * Operators can call {transferFrom} or {safeTransferFrom} for any token owned by the caller.
     *
     * Requirements:
     *
     * - The `operator` cannot be the address zero.
     *
     * Emits an {ApprovalForAll} event.
     */
    function setApprovalForAll(address operator, bool approved) external;

    /**
     * @dev Returns the account approved for `tokenId` token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     */
    function getApproved(uint256 tokenId) external view returns (address operator);

    /**
     * @dev Returns if the `operator` is allowed to manage all of the assets of `owner`.
     *
     * See {setApprovalForAll}
     */
    function isApprovedForAll(address owner, address operator) external view returns (bool);
}

// File: @openzeppelin/contracts/token/ERC721/extensions/IERC721Metadata.sol


// OpenZeppelin Contracts (last updated v5.0.0) (token/ERC721/extensions/IERC721Metadata.sol)

pragma solidity ^0.8.20;


/**
 * @title ERC-721 Non-Fungible Token Standard, optional metadata extension
 * @dev See https://eips.ethereum.org/EIPS/eip-721
 */
interface IERC721Metadata is IERC721 {
    /**
     * @dev Returns the token collection name.
     */
    function name() external view returns (string memory);

    /**
     * @dev Returns the token collection symbol.
     */
    function symbol() external view returns (string memory);

    /**
     * @dev Returns the Uniform Resource Identifier (URI) for `tokenId` token.
     */
    function tokenURI(uint256 tokenId) external view returns (string memory);
}

// File: @openzeppelin/contracts/token/ERC721/IERC721Receiver.sol


// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/IERC721Receiver.sol)

pragma solidity ^0.8.20;

/**
 * @title ERC-721 token receiver interface
 * @dev Interface for any contract that wants to support safeTransfers
 * from ERC-721 asset contracts.
 */
interface IERC721Receiver {
    /**
     * @dev Whenever an {IERC721} `tokenId` token is transferred to this contract via {IERC721-safeTransferFrom}
     * by `operator` from `from`, this function is called.
     *
     * It must return its Solidity selector to confirm the token transfer.
     * If any other value is returned or the interface is not implemented by the recipient, the transfer will be
     * reverted.
     *
     * The selector can be obtained in Solidity with `IERC721Receiver.onERC721Received.selector`.
     */
    function onERC721Received(
        address operator,
        address from,
        uint256 tokenId,
        bytes calldata data
    ) external returns (bytes4);
}

// File: @openzeppelin/contracts/interfaces/draft-IERC6093.sol


// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/draft-IERC6093.sol)
pragma solidity ^0.8.20;

/**
 * @dev Standard ERC-20 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-20 tokens.
 */
interface IERC20Errors {
    /**
     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param balance Current balance for the interacting account.
     * @param needed Minimum amount required to perform a transfer.
     */
    error ERC20InsufficientBalance(address sender, uint256 balance, uint256 needed);

    /**
     * @dev Indicates a failure with the token `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     */
    error ERC20InvalidSender(address sender);

    /**
     * @dev Indicates a failure with the token `receiver`. Used in transfers.
     * @param receiver Address to which tokens are being transferred.
     */
    error ERC20InvalidReceiver(address receiver);

    /**
     * @dev Indicates a failure with the `spender`’s `allowance`. Used in transfers.
     * @param spender Address that may be allowed to operate on tokens without being their owner.
     * @param allowance Amount of tokens a `spender` is allowed to operate with.
     * @param needed Minimum amount required to perform a transfer.
     */
    error ERC20InsufficientAllowance(address spender, uint256 allowance, uint256 needed);

    /**
     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
     * @param approver Address initiating an approval operation.
     */
    error ERC20InvalidApprover(address approver);

    /**
     * @dev Indicates a failure with the `spender` to be approved. Used in approvals.
     * @param spender Address that may be allowed to operate on tokens without being their owner.
     */
    error ERC20InvalidSpender(address spender);
}

/**
 * @dev Standard ERC-721 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-721 tokens.
 */
interface IERC721Errors {
    /**
     * @dev Indicates that an address can't be an owner. For example, `address(0)` is a forbidden owner in ERC-20.
     * Used in balance queries.
     * @param owner Address of the current owner of a token.
     */
    error ERC721InvalidOwner(address owner);

    /**
     * @dev Indicates a `tokenId` whose `owner` is the zero address.
     * @param tokenId Identifier number of a token.
     */
    error ERC721NonexistentToken(uint256 tokenId);

    /**
     * @dev Indicates an error related to the ownership over a particular token. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param tokenId Identifier number of a token.
     * @param owner Address of the current owner of a token.
     */
    error ERC721IncorrectOwner(address sender, uint256 tokenId, address owner);

    /**
     * @dev Indicates a failure with the token `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     */
    error ERC721InvalidSender(address sender);

    /**
     * @dev Indicates a failure with the token `receiver`. Used in transfers.
     * @param receiver Address to which tokens are being transferred.
     */
    error ERC721InvalidReceiver(address receiver);

    /**
     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     * @param tokenId Identifier number of a token.
     */
    error ERC721InsufficientApproval(address operator, uint256 tokenId);

    /**
     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
     * @param approver Address initiating an approval operation.
     */
    error ERC721InvalidApprover(address approver);

    /**
     * @dev Indicates a failure with the `operator` to be approved. Used in approvals.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     */
    error ERC721InvalidOperator(address operator);
}

/**
 * @dev Standard ERC-1155 Errors
 * Interface of the https://eips.ethereum.org/EIPS/eip-6093[ERC-6093] custom errors for ERC-1155 tokens.
 */
interface IERC1155Errors {
    /**
     * @dev Indicates an error related to the current `balance` of a `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     * @param balance Current balance for the interacting account.
     * @param needed Minimum amount required to perform a transfer.
     * @param tokenId Identifier number of a token.
     */
    error ERC1155InsufficientBalance(address sender, uint256 balance, uint256 needed, uint256 tokenId);

    /**
     * @dev Indicates a failure with the token `sender`. Used in transfers.
     * @param sender Address whose tokens are being transferred.
     */
    error ERC1155InvalidSender(address sender);

    /**
     * @dev Indicates a failure with the token `receiver`. Used in transfers.
     * @param receiver Address to which tokens are being transferred.
     */
    error ERC1155InvalidReceiver(address receiver);

    /**
     * @dev Indicates a failure with the `operator`’s approval. Used in transfers.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     * @param owner Address of the current owner of a token.
     */
    error ERC1155MissingApprovalForAll(address operator, address owner);

    /**
     * @dev Indicates a failure with the `approver` of a token to be approved. Used in approvals.
     * @param approver Address initiating an approval operation.
     */
    error ERC1155InvalidApprover(address approver);

    /**
     * @dev Indicates a failure with the `operator` to be approved. Used in approvals.
     * @param operator Address that may be allowed to operate on tokens without being their owner.
     */
    error ERC1155InvalidOperator(address operator);

    /**
     * @dev Indicates an array length mismatch between ids and values in a safeBatchTransferFrom operation.
     * Used in batch transfers.
     * @param idsLength Length of the array of token identifiers
     * @param valuesLength Length of the array of token amounts
     */
    error ERC1155InvalidArrayLength(uint256 idsLength, uint256 valuesLength);
}

// File: @openzeppelin/contracts/token/ERC721/utils/ERC721Utils.sol


// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/utils/ERC721Utils.sol)

pragma solidity ^0.8.20;



/**
 * @dev Library that provide common ERC-721 utility functions.
 *
 * See https://eips.ethereum.org/EIPS/eip-721[ERC-721].
 *
 * _Available since v5.1._
 */
library ERC721Utils {
    /**
     * @dev Performs an acceptance check for the provided `operator` by calling {IERC721-onERC721Received}
     * on the `to` address. The `operator` is generally the address that initiated the token transfer (i.e. `msg.sender`).
     *
     * The acceptance call is not executed and treated as a no-op if the target address doesn't contain code (i.e. an EOA).
     * Otherwise, the recipient must implement {IERC721Receiver-onERC721Received} and return the acceptance magic value to accept
     * the transfer.
     */
    function checkOnERC721Received(
        address operator,
        address from,
        address to,
        uint256 tokenId,
        bytes memory data
    ) internal {
        if (to.code.length > 0) {
            try IERC721Receiver(to).onERC721Received(operator, from, tokenId, data) returns (bytes4 retval) {
                if (retval != IERC721Receiver.onERC721Received.selector) {
                    // Token rejected
                    revert IERC721Errors.ERC721InvalidReceiver(to);
                }
            } catch (bytes memory reason) {
                if (reason.length == 0) {
                    // non-IERC721Receiver implementer
                    revert IERC721Errors.ERC721InvalidReceiver(to);
                } else {
                    assembly ("memory-safe") {
                        revert(add(32, reason), mload(reason))
                    }
                }
            }
        }
    }
}

// File: @openzeppelin/contracts/utils/Context.sol


// OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)

pragma solidity ^0.8.20;

/**
 * @dev Provides information about the current execution context, including the
 * sender of the transaction and its data. While these are generally available
 * via msg.sender and msg.data, they should not be accessed in such a direct
 * manner, since when dealing with meta-transactions the account sending and
 * paying for execution may not be the actual sender (as far as an application
 * is concerned).
 *
 * This contract is only required for intermediate, library-like contracts.
 */
abstract contract Context {
    function _msgSender() internal view virtual returns (address) {
        return msg.sender;
    }

    function _msgData() internal view virtual returns (bytes calldata) {
        return msg.data;
    }

    function _contextSuffixLength() internal view virtual returns (uint256) {
        return 0;
    }
}

// File: @openzeppelin/contracts/utils/introspection/ERC165.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/ERC165.sol)

pragma solidity ^0.8.20;


/**
 * @dev Implementation of the {IERC165} interface.
 *
 * Contracts that want to implement ERC-165 should inherit from this contract and override {supportsInterface} to check
 * for the additional interface id that will be supported. For example:
 *
 * ```solidity
 * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
 *     return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);
 * }
 * ```
 */
abstract contract ERC165 is IERC165 {
    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {
        return interfaceId == type(IERC165).interfaceId;
    }
}

// File: @openzeppelin/contracts/token/ERC721/ERC721.sol


// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/ERC721.sol)

pragma solidity ^0.8.20;








/**
 * @dev Implementation of https://eips.ethereum.org/EIPS/eip-721[ERC-721] Non-Fungible Token Standard, including
 * the Metadata extension, but not including the Enumerable extension, which is available separately as
 * {ERC721Enumerable}.
 */
abstract contract ERC721 is Context, ERC165, IERC721, IERC721Metadata, IERC721Errors {
    using Strings for uint256;

    // Token name
    string private _name;

    // Token symbol
    string private _symbol;

    mapping(uint256 tokenId => address) private _owners;

    mapping(address owner => uint256) private _balances;

    mapping(uint256 tokenId => address) private _tokenApprovals;

    mapping(address owner => mapping(address operator => bool)) private _operatorApprovals;

    /**
     * @dev Initializes the contract by setting a `name` and a `symbol` to the token collection.
     */
    constructor(string memory name_, string memory symbol_) {
        _name = name_;
        _symbol = symbol_;
    }

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override(ERC165, IERC165) returns (bool) {
        return
            interfaceId == type(IERC721).interfaceId ||
            interfaceId == type(IERC721Metadata).interfaceId ||
            super.supportsInterface(interfaceId);
    }

    /**
     * @dev See {IERC721-balanceOf}.
     */
    function balanceOf(address owner) public view virtual returns (uint256) {
        if (owner == address(0)) {
            revert ERC721InvalidOwner(address(0));
        }
        return _balances[owner];
    }

    /**
     * @dev See {IERC721-ownerOf}.
     */
    function ownerOf(uint256 tokenId) public view virtual returns (address) {
        return _requireOwned(tokenId);
    }

    /**
     * @dev See {IERC721Metadata-name}.
     */
    function name() public view virtual returns (string memory) {
        return _name;
    }

    /**
     * @dev See {IERC721Metadata-symbol}.
     */
    function symbol() public view virtual returns (string memory) {
        return _symbol;
    }

    /**
     * @dev See {IERC721Metadata-tokenURI}.
     */
    function tokenURI(uint256 tokenId) public view virtual returns (string memory) {
        _requireOwned(tokenId);

        string memory baseURI = _baseURI();
        return bytes(baseURI).length > 0 ? string.concat(baseURI, tokenId.toString()) : "";
    }

    /**
     * @dev Base URI for computing {tokenURI}. If set, the resulting URI for each
     * token will be the concatenation of the `baseURI` and the `tokenId`. Empty
     * by default, can be overridden in child contracts.
     */
    function _baseURI() internal view virtual returns (string memory) {
        return "";
    }

    /**
     * @dev See {IERC721-approve}.
     */
    function approve(address to, uint256 tokenId) public virtual {
        _approve(to, tokenId, _msgSender());
    }

    /**
     * @dev See {IERC721-getApproved}.
     */
    function getApproved(uint256 tokenId) public view virtual returns (address) {
        _requireOwned(tokenId);

        return _getApproved(tokenId);
    }

    /**
     * @dev See {IERC721-setApprovalForAll}.
     */
    function setApprovalForAll(address operator, bool approved) public virtual {
        _setApprovalForAll(_msgSender(), operator, approved);
    }

    /**
     * @dev See {IERC721-isApprovedForAll}.
     */
    function isApprovedForAll(address owner, address operator) public view virtual returns (bool) {
        return _operatorApprovals[owner][operator];
    }

    /**
     * @dev See {IERC721-transferFrom}.
     */
    function transferFrom(address from, address to, uint256 tokenId) public virtual {
        if (to == address(0)) {
            revert ERC721InvalidReceiver(address(0));
        }
        // Setting an "auth" arguments enables the `_isAuthorized` check which verifies that the token exists
        // (from != 0). Therefore, it is not needed to verify that the return value is not 0 here.
        address previousOwner = _update(to, tokenId, _msgSender());
        if (previousOwner != from) {
            revert ERC721IncorrectOwner(from, tokenId, previousOwner);
        }
    }

    /**
     * @dev See {IERC721-safeTransferFrom}.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId) public {
        safeTransferFrom(from, to, tokenId, "");
    }

    /**
     * @dev See {IERC721-safeTransferFrom}.
     */
    function safeTransferFrom(address from, address to, uint256 tokenId, bytes memory data) public virtual {
        transferFrom(from, to, tokenId);
        ERC721Utils.checkOnERC721Received(_msgSender(), from, to, tokenId, data);
    }

    /**
     * @dev Returns the owner of the `tokenId`. Does NOT revert if token doesn't exist
     *
     * IMPORTANT: Any overrides to this function that add ownership of tokens not tracked by the
     * core ERC-721 logic MUST be matched with the use of {_increaseBalance} to keep balances
     * consistent with ownership. The invariant to preserve is that for any address `a` the value returned by
     * `balanceOf(a)` must be equal to the number of tokens such that `_ownerOf(tokenId)` is `a`.
     */
    function _ownerOf(uint256 tokenId) internal view virtual returns (address) {
        return _owners[tokenId];
    }

    /**
     * @dev Returns the approved address for `tokenId`. Returns 0 if `tokenId` is not minted.
     */
    function _getApproved(uint256 tokenId) internal view virtual returns (address) {
        return _tokenApprovals[tokenId];
    }

    /**
     * @dev Returns whether `spender` is allowed to manage `owner`'s tokens, or `tokenId` in
     * particular (ignoring whether it is owned by `owner`).
     *
     * WARNING: This function assumes that `owner` is the actual owner of `tokenId` and does not verify this
     * assumption.
     */
    function _isAuthorized(address owner, address spender, uint256 tokenId) internal view virtual returns (bool) {
        return
            spender != address(0) &&
            (owner == spender || isApprovedForAll(owner, spender) || _getApproved(tokenId) == spender);
    }

    /**
     * @dev Checks if `spender` can operate on `tokenId`, assuming the provided `owner` is the actual owner.
     * Reverts if:
     * - `spender` does not have approval from `owner` for `tokenId`.
     * - `spender` does not have approval to manage all of `owner`'s assets.
     *
     * WARNING: This function assumes that `owner` is the actual owner of `tokenId` and does not verify this
     * assumption.
     */
    function _checkAuthorized(address owner, address spender, uint256 tokenId) internal view virtual {
        if (!_isAuthorized(owner, spender, tokenId)) {
            if (owner == address(0)) {
                revert ERC721NonexistentToken(tokenId);
            } else {
                revert ERC721InsufficientApproval(spender, tokenId);
            }
        }
    }

    /**
     * @dev Unsafe write access to the balances, used by extensions that "mint" tokens using an {ownerOf} override.
     *
     * NOTE: the value is limited to type(uint128).max. This protect against _balance overflow. It is unrealistic that
     * a uint256 would ever overflow from increments when these increments are bounded to uint128 values.
     *
     * WARNING: Increasing an account's balance using this function tends to be paired with an override of the
     * {_ownerOf} function to resolve the ownership of the corresponding tokens so that balances and ownership
     * remain consistent with one another.
     */
    function _increaseBalance(address account, uint128 value) internal virtual {
        unchecked {
            _balances[account] += value;
        }
    }

    /**
     * @dev Transfers `tokenId` from its current owner to `to`, or alternatively mints (or burns) if the current owner
     * (or `to`) is the zero address. Returns the owner of the `tokenId` before the update.
     *
     * The `auth` argument is optional. If the value passed is non 0, then this function will check that
     * `auth` is either the owner of the token, or approved to operate on the token (by the owner).
     *
     * Emits a {Transfer} event.
     *
     * NOTE: If overriding this function in a way that tracks balances, see also {_increaseBalance}.
     */
    function _update(address to, uint256 tokenId, address auth) internal virtual returns (address) {
        address from = _ownerOf(tokenId);

        // Perform (optional) operator check
        if (auth != address(0)) {
            _checkAuthorized(from, auth, tokenId);
        }

        // Execute the update
        if (from != address(0)) {
            // Clear approval. No need to re-authorize or emit the Approval event
            _approve(address(0), tokenId, address(0), false);

            unchecked {
                _balances[from] -= 1;
            }
        }

        if (to != address(0)) {
            unchecked {
                _balances[to] += 1;
            }
        }

        _owners[tokenId] = to;

        emit Transfer(from, to, tokenId);

        return from;
    }

    /**
     * @dev Mints `tokenId` and transfers it to `to`.
     *
     * WARNING: Usage of this method is discouraged, use {_safeMint} whenever possible
     *
     * Requirements:
     *
     * - `tokenId` must not exist.
     * - `to` cannot be the zero address.
     *
     * Emits a {Transfer} event.
     */
    function _mint(address to, uint256 tokenId) internal {
        if (to == address(0)) {
            revert ERC721InvalidReceiver(address(0));
        }
        address previousOwner = _update(to, tokenId, address(0));
        if (previousOwner != address(0)) {
            revert ERC721InvalidSender(address(0));
        }
    }

    /**
     * @dev Mints `tokenId`, transfers it to `to` and checks for `to` acceptance.
     *
     * Requirements:
     *
     * - `tokenId` must not exist.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function _safeMint(address to, uint256 tokenId) internal {
        _safeMint(to, tokenId, "");
    }

    /**
     * @dev Same as {xref-ERC721-_safeMint-address-uint256-}[`_safeMint`], with an additional `data` parameter which is
     * forwarded in {IERC721Receiver-onERC721Received} to contract recipients.
     */
    function _safeMint(address to, uint256 tokenId, bytes memory data) internal virtual {
        _mint(to, tokenId);
        ERC721Utils.checkOnERC721Received(_msgSender(), address(0), to, tokenId, data);
    }

    /**
     * @dev Destroys `tokenId`.
     * The approval is cleared when the token is burned.
     * This is an internal function that does not check if the sender is authorized to operate on the token.
     *
     * Requirements:
     *
     * - `tokenId` must exist.
     *
     * Emits a {Transfer} event.
     */
    function _burn(uint256 tokenId) internal {
        address previousOwner = _update(address(0), tokenId, address(0));
        if (previousOwner == address(0)) {
            revert ERC721NonexistentToken(tokenId);
        }
    }

    /**
     * @dev Transfers `tokenId` from `from` to `to`.
     *  As opposed to {transferFrom}, this imposes no restrictions on msg.sender.
     *
     * Requirements:
     *
     * - `to` cannot be the zero address.
     * - `tokenId` token must be owned by `from`.
     *
     * Emits a {Transfer} event.
     */
    function _transfer(address from, address to, uint256 tokenId) internal {
        if (to == address(0)) {
            revert ERC721InvalidReceiver(address(0));
        }
        address previousOwner = _update(to, tokenId, address(0));
        if (previousOwner == address(0)) {
            revert ERC721NonexistentToken(tokenId);
        } else if (previousOwner != from) {
            revert ERC721IncorrectOwner(from, tokenId, previousOwner);
        }
    }

    /**
     * @dev Safely transfers `tokenId` token from `from` to `to`, checking that contract recipients
     * are aware of the ERC-721 standard to prevent tokens from being forever locked.
     *
     * `data` is additional data, it has no specified format and it is sent in call to `to`.
     *
     * This internal function is like {safeTransferFrom} in the sense that it invokes
     * {IERC721Receiver-onERC721Received} on the receiver, and can be used to e.g.
     * implement alternative mechanisms to perform token transfer, such as signature-based.
     *
     * Requirements:
     *
     * - `tokenId` token must exist and be owned by `from`.
     * - `to` cannot be the zero address.
     * - `from` cannot be the zero address.
     * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called upon a safe transfer.
     *
     * Emits a {Transfer} event.
     */
    function _safeTransfer(address from, address to, uint256 tokenId) internal {
        _safeTransfer(from, to, tokenId, "");
    }

    /**
     * @dev Same as {xref-ERC721-_safeTransfer-address-address-uint256-}[`_safeTransfer`], with an additional `data` parameter which is
     * forwarded in {IERC721Receiver-onERC721Received} to contract recipients.
     */
    function _safeTransfer(address from, address to, uint256 tokenId, bytes memory data) internal virtual {
        _transfer(from, to, tokenId);
        ERC721Utils.checkOnERC721Received(_msgSender(), from, to, tokenId, data);
    }

    /**
     * @dev Approve `to` to operate on `tokenId`
     *
     * The `auth` argument is optional. If the value passed is non 0, then this function will check that `auth` is
     * either the owner of the token, or approved to operate on all tokens held by this owner.
     *
     * Emits an {Approval} event.
     *
     * Overrides to this logic should be done to the variant with an additional `bool emitEvent` argument.
     */
    function _approve(address to, uint256 tokenId, address auth) internal {
        _approve(to, tokenId, auth, true);
    }

    /**
     * @dev Variant of `_approve` with an optional flag to enable or disable the {Approval} event. The event is not
     * emitted in the context of transfers.
     */
    function _approve(address to, uint256 tokenId, address auth, bool emitEvent) internal virtual {
        // Avoid reading the owner unless necessary
        if (emitEvent || auth != address(0)) {
            address owner = _requireOwned(tokenId);

            // We do not use _isAuthorized because single-token approvals should not be able to call approve
            if (auth != address(0) && owner != auth && !isApprovedForAll(owner, auth)) {
                revert ERC721InvalidApprover(auth);
            }

            if (emitEvent) {
                emit Approval(owner, to, tokenId);
            }
        }

        _tokenApprovals[tokenId] = to;
    }

    /**
     * @dev Approve `operator` to operate on all of `owner` tokens
     *
     * Requirements:
     * - operator can't be the address zero.
     *
     * Emits an {ApprovalForAll} event.
     */
    function _setApprovalForAll(address owner, address operator, bool approved) internal virtual {
        if (operator == address(0)) {
            revert ERC721InvalidOperator(operator);
        }
        _operatorApprovals[owner][operator] = approved;
        emit ApprovalForAll(owner, operator, approved);
    }

    /**
     * @dev Reverts if the `tokenId` doesn't have a current owner (it hasn't been minted, or it has been burned).
     * Returns the owner.
     *
     * Overrides to ownership logic should be done to {_ownerOf}.
     */
    function _requireOwned(uint256 tokenId) internal view returns (address) {
        address owner = _ownerOf(tokenId);
        if (owner == address(0)) {
            revert ERC721NonexistentToken(tokenId);
        }
        return owner;
    }
}

// File: @openzeppelin/contracts/access/Ownable.sol


// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)

pragma solidity ^0.8.20;


/**
 * @dev Contract module which provides a basic access control mechanism, where
 * there is an account (an owner) that can be granted exclusive access to
 * specific functions.
 *
 * The initial owner is set to the address provided by the deployer. This can
 * later be changed with {transferOwnership}.
 *
 * This module is used through inheritance. It will make available the modifier
 * `onlyOwner`, which can be applied to your functions to restrict their use to
 * the owner.
 */
abstract contract Ownable is Context {
    address private _owner;

    /**
     * @dev The caller account is not authorized to perform an operation.
     */
    error OwnableUnauthorizedAccount(address account);

    /**
     * @dev The owner is not a valid owner account. (eg. `address(0)`)
     */
    error OwnableInvalidOwner(address owner);

    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);

    /**
     * @dev Initializes the contract setting the address provided by the deployer as the initial owner.
     */
    constructor(address initialOwner) {
        if (initialOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _transferOwnership(initialOwner);
    }

    /**
     * @dev Throws if called by any account other than the owner.
     */
    modifier onlyOwner() {
        _checkOwner();
        _;
    }

    /**
     * @dev Returns the address of the current owner.
     */
    function owner() public view virtual returns (address) {
        return _owner;
    }

    /**
     * @dev Throws if the sender is not the owner.
     */
    function _checkOwner() internal view virtual {
        if (owner() != _msgSender()) {
            revert OwnableUnauthorizedAccount(_msgSender());
        }
    }

    /**
     * @dev Leaves the contract without owner. It will not be possible to call
     * `onlyOwner` functions. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby disabling any functionality that is only available to the owner.
     */
    function renounceOwnership() public virtual onlyOwner {
        _transferOwnership(address(0));
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        if (newOwner == address(0)) {
            revert OwnableInvalidOwner(address(0));
        }
        _transferOwnership(newOwner);
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Internal function without access restriction.
     */
    function _transferOwnership(address newOwner) internal virtual {
        address oldOwner = _owner;
        _owner = newOwner;
        emit OwnershipTransferred(oldOwner, newOwner);
    }
}

// File: @openzeppelin/contracts/token/ERC20/IERC20.sol


// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC20/IERC20.sol)

pragma solidity ^0.8.20;

/**
 * @dev Interface of the ERC-20 standard as defined in the ERC.
 */
interface IERC20 {
    /**
     * @dev Emitted when `value` tokens are moved from one account (`from`) to
     * another (`to`).
     *
     * Note that `value` may be zero.
     */
    event Transfer(address indexed from, address indexed to, uint256 value);

    /**
     * @dev Emitted when the allowance of a `spender` for an `owner` is set by
     * a call to {approve}. `value` is the new allowance.
     */
    event Approval(address indexed owner, address indexed spender, uint256 value);

    /**
     * @dev Returns the value of tokens in existence.
     */
    function totalSupply() external view returns (uint256);

    /**
     * @dev Returns the value of tokens owned by `account`.
     */
    function balanceOf(address account) external view returns (uint256);

    /**
     * @dev Moves a `value` amount of tokens from the caller's account to `to`.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transfer(address to, uint256 value) external returns (bool);

    /**
     * @dev Returns the remaining number of tokens that `spender` will be
     * allowed to spend on behalf of `owner` through {transferFrom}. This is
     * zero by default.
     *
     * This value changes when {approve} or {transferFrom} are called.
     */
    function allowance(address owner, address spender) external view returns (uint256);

    /**
     * @dev Sets a `value` amount of tokens as the allowance of `spender` over the
     * caller's tokens.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * IMPORTANT: Beware that changing an allowance with this method brings the risk
     * that someone may use both the old and the new allowance by unfortunate
     * transaction ordering. One possible solution to mitigate this race
     * condition is to first reduce the spender's allowance to 0 and set the
     * desired value afterwards:
     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
     *
     * Emits an {Approval} event.
     */
    function approve(address spender, uint256 value) external returns (bool);

    /**
     * @dev Moves a `value` amount of tokens from `from` to `to` using the
     * allowance mechanism. `value` is then deducted from the caller's
     * allowance.
     *
     * Returns a boolean value indicating whether the operation succeeded.
     *
     * Emits a {Transfer} event.
     */
    function transferFrom(address from, address to, uint256 value) external returns (bool);
}

// File: @openzeppelin/contracts/utils/cryptography/Hashes.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/Hashes.sol)

pragma solidity ^0.8.20;

/**
 * @dev Library of standard hash functions.
 *
 * _Available since v5.1._
 */
library Hashes {
    /**
     * @dev Commutative Keccak256 hash of a sorted pair of bytes32. Frequently used when working with merkle proofs.
     *
     * NOTE: Equivalent to the `standardNodeHash` in our https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
     */
    function commutativeKeccak256(bytes32 a, bytes32 b) internal pure returns (bytes32) {
        return a < b ? _efficientKeccak256(a, b) : _efficientKeccak256(b, a);
    }

    /**
     * @dev Implementation of keccak256(abi.encode(a, b)) that doesn't allocate or expand memory.
     */
    function _efficientKeccak256(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
        assembly ("memory-safe") {
            mstore(0x00, a)
            mstore(0x20, b)
            value := keccak256(0x00, 0x40)
        }
    }
}

// File: @openzeppelin/contracts/utils/cryptography/MerkleProof.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/MerkleProof.sol)
// This file was procedurally generated from scripts/generate/templates/MerkleProof.js.

pragma solidity ^0.8.20;


/**
 * @dev These functions deal with verification of Merkle Tree proofs.
 *
 * The tree and the proofs can be generated using our
 * https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
 * You will find a quickstart guide in the readme.
 *
 * WARNING: You should avoid using leaf values that are 64 bytes long prior to
 * hashing, or use a hash function other than keccak256 for hashing leaves.
 * This is because the concatenation of a sorted pair of internal nodes in
 * the Merkle tree could be reinterpreted as a leaf value.
 * OpenZeppelin's JavaScript library generates Merkle trees that are safe
 * against this attack out of the box.
 *
 * IMPORTANT: Consider memory side-effects when using custom hashing functions
 * that access memory in an unsafe way.
 *
 * NOTE: This library supports proof verification for merkle trees built using
 * custom _commutative_ hashing functions (i.e. `H(a, b) == H(b, a)`). Proving
 * leaf inclusion in trees built using non-commutative hashing functions requires
 * additional logic that is not supported by this library.
 */
library MerkleProof {
    /**
     *@dev The multiproof provided is not valid.
     */
    error MerkleProofInvalidMultiproof();

    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with the default hashing function.
     */
    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProof(proof, leaf) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with the default hashing function.
     */
    function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with a custom hashing function.
     */
    function verify(
        bytes32[] memory proof,
        bytes32 root,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processProof(proof, leaf, hasher) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in memory with a custom hashing function.
     */
    function processProof(
        bytes32[] memory proof,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = hasher(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with the default hashing function.
     */
    function verifyCalldata(bytes32[] calldata proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProofCalldata(proof, leaf) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with the default hashing function.
     */
    function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = Hashes.commutativeKeccak256(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
     * defined by `root`. For this, a `proof` must be provided, containing
     * sibling hashes on the branch from the leaf to the root of the tree. Each
     * pair of leaves and each pair of pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with a custom hashing function.
     */
    function verifyCalldata(
        bytes32[] calldata proof,
        bytes32 root,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processProofCalldata(proof, leaf, hasher) == root;
    }

    /**
     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
     * hash matches the root of the tree. When processing the proof, the pairs
     * of leaves & pre-images are assumed to be sorted.
     *
     * This version handles proofs in calldata with a custom hashing function.
     */
    function processProofCalldata(
        bytes32[] calldata proof,
        bytes32 leaf,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = hasher(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * This version handles multiproofs in memory with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProof}.
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProof(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * This version handles multiproofs in memory with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the Merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](proofFlagsLen);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = Hashes.commutativeKeccak256(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * This version handles multiproofs in memory with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProof}.
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processMultiProof(proof, proofFlags, leaves, hasher) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * This version handles multiproofs in memory with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProof(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the Merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](proofFlagsLen);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = hasher(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * This version handles multiproofs in calldata with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProofCalldata}.
     */
    function multiProofVerifyCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProofCalldata(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * This version handles multiproofs in calldata with the default hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves
    ) internal pure returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the Merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](proofFlagsLen);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = Hashes.commutativeKeccak256(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
     *
     * This version handles multiproofs in calldata with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * NOTE: Consider the case where `root == proof[0] && leaves.length == 0` as it will return `true`.
     * The `leaves` must be validated independently. See {processMultiProofCalldata}.
     */
    function multiProofVerifyCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32 root,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bool) {
        return processMultiProofCalldata(proof, proofFlags, leaves, hasher) == root;
    }

    /**
     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
     * respectively.
     *
     * This version handles multiproofs in calldata with a custom hashing function.
     *
     * CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
     *
     * NOTE: The _empty set_ (i.e. the case where `proof.length == 1 && leaves.length == 0`) is considered a no-op,
     * and therefore a valid multiproof (i.e. it returns `proof[0]`). Consider disallowing this case if you're not
     * validating the leaves elsewhere.
     */
    function processMultiProofCalldata(
        bytes32[] calldata proof,
        bool[] calldata proofFlags,
        bytes32[] memory leaves,
        function(bytes32, bytes32) view returns (bytes32) hasher
    ) internal view returns (bytes32 merkleRoot) {
        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
        // the Merkle tree.
        uint256 leavesLen = leaves.length;
        uint256 proofFlagsLen = proofFlags.length;

        // Check proof validity.
        if (leavesLen + proof.length != proofFlagsLen + 1) {
            revert MerkleProofInvalidMultiproof();
        }

        // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
        bytes32[] memory hashes = new bytes32[](proofFlagsLen);
        uint256 leafPos = 0;
        uint256 hashPos = 0;
        uint256 proofPos = 0;
        // At each step, we compute the next hash using two values:
        // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
        //   get the next hash.
        // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
        //   `proof` array.
        for (uint256 i = 0; i < proofFlagsLen; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = hasher(a, b);
        }

        if (proofFlagsLen > 0) {
            if (proofPos != proof.length) {
                revert MerkleProofInvalidMultiproof();
            }
            unchecked {
                return hashes[proofFlagsLen - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }
}

// File: @openzeppelin/contracts/utils/Errors.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/Errors.sol)

pragma solidity ^0.8.20;

/**
 * @dev Collection of common custom errors used in multiple contracts
 *
 * IMPORTANT: Backwards compatibility is not guaranteed in future versions of the library.
 * It is recommended to avoid relying on the error API for critical functionality.
 *
 * _Available since v5.1._
 */
library Errors {
    /**
     * @dev The ETH balance of the account is not enough to perform the operation.
     */
    error InsufficientBalance(uint256 balance, uint256 needed);

    /**
     * @dev A call to an address target failed. The target may have reverted.
     */
    error FailedCall();

    /**
     * @dev The deployment failed.
     */
    error FailedDeployment();

    /**
     * @dev A necessary precompile is missing.
     */
    error MissingPrecompile(address);
}

// File: @openzeppelin/contracts/utils/Address.sol


// OpenZeppelin Contracts (last updated v5.1.0) (utils/Address.sol)

pragma solidity ^0.8.20;


/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev There's no code at `target` (it is not a contract).
     */
    error AddressEmptyCode(address target);

    /**
     * @dev Replacement for Solidity's `transfer`: sends `amount` wei to
     * `recipient`, forwarding all available gas and reverting on errors.
     *
     * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
     * of certain opcodes, possibly making contracts go over the 2300 gas limit
     * imposed by `transfer`, making them unable to receive funds via
     * `transfer`. {sendValue} removes this limitation.
     *
     * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].
     *
     * IMPORTANT: because control is transferred to `recipient`, care must be
     * taken to not create reentrancy vulnerabilities. Consider using
     * {ReentrancyGuard} or the
     * https://solidity.readthedocs.io/en/v0.8.20/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
     */
    function sendValue(address payable recipient, uint256 amount) internal {
        if (address(this).balance < amount) {
            revert Errors.InsufficientBalance(address(this).balance, amount);
        }

        (bool success, ) = recipient.call{value: amount}("");
        if (!success) {
            revert Errors.FailedCall();
        }
    }

    /**
     * @dev Performs a Solidity function call using a low level `call`. A
     * plain `call` is an unsafe replacement for a function call: use this
     * function instead.
     *
     * If `target` reverts with a revert reason or custom error, it is bubbled
     * up by this function (like regular Solidity function calls). However, if
     * the call reverted with no returned reason, this function reverts with a
     * {Errors.FailedCall} error.
     *
     * Returns the raw returned data. To convert to the expected return value,
     * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
     *
     * Requirements:
     *
     * - `target` must be a contract.
     * - calling `target` with `data` must not revert.
     */
    function functionCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but also transferring `value` wei to `target`.
     *
     * Requirements:
     *
     * - the calling contract must have an ETH balance of at least `value`.
     * - the called Solidity function must be `payable`.
     */
    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {
        if (address(this).balance < value) {
            revert Errors.InsufficientBalance(address(this).balance, value);
        }
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a static call.
     */
    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
        (bool success, bytes memory returndata) = target.staticcall(data);
        return verifyCallResultFromTarget(target, success, returndata);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a delegate call.
     */
    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
        (bool success, bytes memory returndata) = target.delegatecall(data);
        return verifyCallResultFromTarget(target, success, returndata);
    }

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and reverts if the target
     * was not a contract or bubbling up the revert reason (falling back to {Errors.FailedCall}) in case
     * of an unsuccessful call.
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata
    ) internal view returns (bytes memory) {
        if (!success) {
            _revert(returndata);
        } else {
            // only check if target is a contract if the call was successful and the return data is empty
            // otherwise we already know that it was a contract
            if (returndata.length == 0 && target.code.length == 0) {
                revert AddressEmptyCode(target);
            }
            return returndata;
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and reverts if it wasn't, either by bubbling the
     * revert reason or with a default {Errors.FailedCall} error.
     */
    function verifyCallResult(bool success, bytes memory returndata) internal pure returns (bytes memory) {
        if (!success) {
            _revert(returndata);
        } else {
            return returndata;
        }
    }

    /**
     * @dev Reverts with returndata if present. Otherwise reverts with {Errors.FailedCall}.
     */
    function _revert(bytes memory returndata) private pure {
        // Look for revert reason and bubble it up if present
        if (returndata.length > 0) {
            // The easiest way to bubble the revert reason is using memory via assembly
            assembly ("memory-safe") {
                let returndata_size := mload(returndata)
                revert(add(32, returndata), returndata_size)
            }
        } else {
            revert Errors.FailedCall();
        }
    }
}

// File: contracts/Gobs.sol


pragma solidity ^0.8.0;









interface IGobsDataSource {
    function getGobSVG(uint256 tokenId) external view returns (string memory);
    function getTraits(uint256 tokenId) external view returns (string memory);
}

contract Gobs is ERC721, Ownable {
    uint256 public constant MAX_SUPPLY = 2222;
    uint256 private _tokenIdCounter;
    address public dataSource;
    using Strings for uint256;
    bool public mintActive;

    uint256 private hands;
    mapping(address => uint256) public userTokenCount;
    
    // Mapping to track which ERC721 contracts are allowed
    mapping(address => bool) public allowedERC721Contracts;
    
    // Mapping to track which token IDs of the allowed ERC721 contracts have been claimed
    mapping(address => mapping(uint256 => bool)) public claimedTokens;

    mapping(address => uint256) public contractClaimCount;
    mapping(address => uint256) public maxClaimsPerContract;

    uint256 public MAX_CLAIMS_PER_WALLET = 2;
    mapping(address => uint256) public walletClaimCount;

    event OpenTheMine();

    constructor(
        address _dataSource,
        address[] memory contractAddresses,
        uint256[] memory maxClaimsPerContract_
    ) ERC721("GobsNFT", "GOBS") Ownable(msg.sender) {
        require(
            contractAddresses.length == maxClaimsPerContract_.length,
            "Arrays length mismatch"
        );
        dataSource = _dataSource;
        
        // Set initial max claims for each contract
        for (uint256 i = 0; i < contractAddresses.length; i++) {
            maxClaimsPerContract[contractAddresses[i]] = maxClaimsPerContract_[i];
            allowedERC721Contracts[contractAddresses[i]] = true;
        }
    }

    function setDataSource(address _dataSource) public onlyOwner {
        dataSource = _dataSource;
    }

    function addAllowedERC721Contract(address contractAddress) public onlyOwner {
        allowedERC721Contracts[contractAddress] = true;
    }

    function removeAllowedERC721Contract(address contractAddress) public onlyOwner {
        allowedERC721Contracts[contractAddress] = false;
    }

    function hasTokenClaimed(address contractAddress, uint256 tokenId) public view returns (bool) {
        return claimedTokens[contractAddress][tokenId];
    }

    function mint(address erc721Contract, uint256 erc721TokenId) public {
        require(mintActive == true, "Mint not active");
        require(_tokenIdCounter < MAX_SUPPLY, "Max supply reached");
        
        // Add wallet claim check
        require(walletClaimCount[msg.sender] < MAX_CLAIMS_PER_WALLET, "Max claims per wallet reached");
        
        // Ensure the ERC721 contract is in the list of allowed contracts
        require(allowedERC721Contracts[erc721Contract], "ERC721 contract not allowed");
        
        // Check that the msg.sender is the owner of the ERC721 token
        require(verifyTokenOwnership(erc721Contract, erc721TokenId), "You do not own the specified token");
        
        // Check if this specific token has already been used to claim
        require(!claimedTokens[erc721Contract][erc721TokenId], "This token has already been used to claim");

        // Check contract claim count
        uint256 maxClaims = maxClaimsPerContract[erc721Contract];
        require(maxClaims > 0, "Contract not configured for minting");
        require(contractClaimCount[erc721Contract] < maxClaims, "Max claims reached for this contract");

        // Increment the contract claim count
        contractClaimCount[erc721Contract]++;
        
        // Increment the wallet claim count
        walletClaimCount[msg.sender]++;
        
        // Mark the token as claimed
        claimedTokens[erc721Contract][erc721TokenId] = true;
        
        _tokenIdCounter++;
        _safeMint(msg.sender, _tokenIdCounter);
    }

    function toggleMintActive() public onlyOwner {
        mintActive = !mintActive;
    }

    function tokenURI(uint256 tokenId) public view override returns (string memory) {
        require(tokenId <= _tokenIdCounter, "Token does not exist");

        string memory svg = IGobsDataSource(dataSource).getGobSVG(tokenId);
        string memory traits = IGobsDataSource(dataSource).getTraits(tokenId);

        bytes memory json = abi.encodePacked(
            '{"name": "Gob #', tokenId.toString(),
            '", "description": "On-chain Gob NFT", "image": "data:image/svg+xml;base64,',
            Base64.encode(bytes(svg)),
            '", "attributes": ', traits, '}'
        );

        return string(
            abi.encodePacked(
                "data:application/json;base64,",
                Base64.encode(json)
            )
        );
    }

    function placeHand() public {
        uint256 userBalance = balanceOf(msg.sender);
        uint256 newTokens = userBalance - userTokenCount[msg.sender];

        require(newTokens > 0, "No new tokens to place");

        userTokenCount[msg.sender] = userBalance;
        hands += newTokens;

        if (hands >= 555) {
            emit OpenTheMine();
        }
    }

    function withdrawERC20(address tokenAddress, uint256 amount) public onlyOwner {
        IERC20 token = IERC20(tokenAddress);
        require(token.transfer(msg.sender, amount), "Transfer failed");
    }

    function withdrawNFT(address nftAddress, uint256 tokenId) public onlyOwner {
        IERC721 nft = IERC721(nftAddress);
        nft.safeTransferFrom(address(this), msg.sender, tokenId);
    }

    function verifyTokenOwnership(address erc721Contract, uint256 erc721TokenId) public view returns (bool) {
        require(allowedERC721Contracts[erc721Contract], "ERC721 contract not allowed");

        // Check if msg.sender owns the token
        address tokenOwner = IERC721(erc721Contract).ownerOf(erc721TokenId);
        return (tokenOwner == msg.sender);
    }

    function setMaxClaimsPerContract(address contractAddress, uint256 maxClaims) public onlyOwner {
        require(allowedERC721Contracts[contractAddress], "Contract not allowed");
        require(maxClaims > 0, "Max claims must be greater than 0");
        maxClaimsPerContract[contractAddress] = maxClaims;
    }

    function setBatchMaxClaimsPerContract(
        address[] memory contractAddresses,
        uint256[] memory maxClaims
    ) public onlyOwner {
        require(
            contractAddresses.length == maxClaims.length,
            "Arrays length mismatch"
        );
        
        for (uint256 i = 0; i < contractAddresses.length; i++) {
            require(allowedERC721Contracts[contractAddresses[i]], "Contract not allowed");
            require(maxClaims[i] > 0, "Max claims must be greater than 0");
            maxClaimsPerContract[contractAddresses[i]] = maxClaims[i];
        }
    }

    function getRemainingClaims(address contractAddress) public view returns (uint256) {
        uint256 maxClaims = maxClaimsPerContract[contractAddress];
        require(maxClaims > 0, "Contract not configured for minting");
        
        uint256 currentClaims = contractClaimCount[contractAddress];
        if (currentClaims >= maxClaims) {
            return 0;
        }
        return maxClaims - currentClaims;
    }

    function getRemainingWalletClaims(address wallet) public view returns (uint256) {
        uint256 claimed = walletClaimCount[wallet];
        if (claimed >= MAX_CLAIMS_PER_WALLET) {
            return 0;
        }
        return MAX_CLAIMS_PER_WALLET - claimed;
    }

    function setMaxClaimsPerWallet(uint256 newMaxClaims) public onlyOwner {
        require(newMaxClaims > 0, "Max claims must be greater than 0");
        MAX_CLAIMS_PER_WALLET = newMaxClaims;
    }
}

Contract ABI

[{"inputs":[{"internalType":"address","name":"_dataSource","type":"address"},{"internalType":"address[]","name":"contractAddresses","type":"address[]"},{"internalType":"uint256[]","name":"maxClaimsPerContract_","type":"uint256[]"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721IncorrectOwner","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721InsufficientApproval","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC721InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC721InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721InvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC721InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC721InvalidSender","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721NonexistentToken","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[],"name":"OpenTheMine","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"MAX_CLAIMS_PER_WALLET","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"addAllowedERC721Contract","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"allowedERC721Contracts","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"uint256","name":"","type":"uint256"}],"name":"claimedTokens","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"contractClaimCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"dataSource","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"getRemainingClaims","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"wallet","type":"address"}],"name":"getRemainingWalletClaims","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"hasTokenClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"maxClaimsPerContract","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"erc721Contract","type":"address"},{"internalType":"uint256","name":"erc721TokenId","type":"uint256"}],"name":"mint","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"mintActive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"placeHand","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"}],"name":"removeAllowedERC721Contract","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address[]","name":"contractAddresses","type":"address[]"},{"internalType":"uint256[]","name":"maxClaims","type":"uint256[]"}],"name":"setBatchMaxClaimsPerContract","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_dataSource","type":"address"}],"name":"setDataSource","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"contractAddress","type":"address"},{"internalType":"uint256","name":"maxClaims","type":"uint256"}],"name":"setMaxClaimsPerContract","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"newMaxClaims","type":"uint256"}],"name":"setMaxClaimsPerWallet","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"toggleMintActive","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"userTokenCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"erc721Contract","type":"address"},{"internalType":"uint256","name":"erc721TokenId","type":"uint256"}],"name":"verifyTokenOwnership","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"walletClaimCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"tokenAddress","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"withdrawERC20","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"nftAddress","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"withdrawNFT","outputs":[],"stateMutability":"nonpayable","type":"function"}]

60806040526002600f55348015610014575f5ffd5b50604051614f3b380380614f3b83398181016040528101906100369190610642565b336040518060400160405280600781526020017f476f62734e4654000000000000000000000000000000000000000000000000008152506040518060400160405280600481526020017f474f425300000000000000000000000000000000000000000000000000000000815250815f90816100b191906108d1565b5080600190816100c191906108d1565b5050505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1603610134575f6040517f1e4fbdf700000000000000000000000000000000000000000000000000000000815260040161012b91906109af565b60405180910390fd5b610143816102d160201b60201c565b508051825114610188576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161017f90610a22565b60405180910390fd5b8260085f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055505f5f90505b82518110156102c8578181815181106101e9576101e8610a40565b5b6020026020010151600e5f85848151811061020757610206610a40565b5b602002602001015173ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055506001600b5f85848151811061026457610263610a40565b5b602002602001015173ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff02191690831515021790555080806001019150506101cd565b50505050610a6d565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1690508160065f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b5f604051905090565b5f5ffd5b5f5ffd5b5f73ffffffffffffffffffffffffffffffffffffffff82169050919050565b5f6103ce826103a5565b9050919050565b6103de816103c4565b81146103e8575f5ffd5b50565b5f815190506103f9816103d5565b92915050565b5f5ffd5b5f601f19601f8301169050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b61044982610403565b810181811067ffffffffffffffff8211171561046857610467610413565b5b80604052505050565b5f61047a610394565b90506104868282610440565b919050565b5f67ffffffffffffffff8211156104a5576104a4610413565b5b602082029050602081019050919050565b5f5ffd5b5f6104cc6104c78461048b565b610471565b905080838252602082019050602084028301858111156104ef576104ee6104b6565b5b835b81811015610518578061050488826103eb565b8452602084019350506020810190506104f1565b5050509392505050565b5f82601f830112610536576105356103ff565b5b81516105468482602086016104ba565b91505092915050565b5f67ffffffffffffffff82111561056957610568610413565b5b602082029050602081019050919050565b5f819050919050565b61058c8161057a565b8114610596575f5ffd5b50565b5f815190506105a781610583565b92915050565b5f6105bf6105ba8461054f565b610471565b905080838252602082019050602084028301858111156105e2576105e16104b6565b5b835b8181101561060b57806105f78882610599565b8452602084019350506020810190506105e4565b5050509392505050565b5f82601f830112610629576106286103ff565b5b81516106398482602086016105ad565b91505092915050565b5f5f5f606084860312156106595761065861039d565b5b5f610666868287016103eb565b935050602084015167ffffffffffffffff811115610687576106866103a1565b5b61069386828701610522565b925050604084015167ffffffffffffffff8111156106b4576106b36103a1565b5b6106c086828701610615565b9150509250925092565b5f81519050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f600282049050600182168061071857607f821691505b60208210810361072b5761072a6106d4565b5b50919050565b5f819050815f5260205f209050919050565b5f6020601f8301049050919050565b5f82821b905092915050565b5f6008830261078d7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff82610752565b6107978683610752565b95508019841693508086168417925050509392505050565b5f819050919050565b5f6107d26107cd6107c88461057a565b6107af565b61057a565b9050919050565b5f819050919050565b6107eb836107b8565b6107ff6107f7826107d9565b84845461075e565b825550505050565b5f5f905090565b610816610807565b6108218184846107e2565b505050565b5b81811015610844576108395f8261080e565b600181019050610827565b5050565b601f8211156108895761085a81610731565b61086384610743565b81016020851015610872578190505b61088661087e85610743565b830182610826565b50505b505050565b5f82821c905092915050565b5f6108a95f198460080261088e565b1980831691505092915050565b5f6108c1838361089a565b9150826002028217905092915050565b6108da826106ca565b67ffffffffffffffff8111156108f3576108f2610413565b5b6108fd8254610701565b610908828285610848565b5f60209050601f831160018114610939575f8415610927578287015190505b61093185826108b6565b865550610998565b601f19841661094786610731565b5f5b8281101561096e57848901518255600182019150602085019450602081019050610949565b8683101561098b5784890151610987601f89168261089a565b8355505b6001600288020188555050505b505050505050565b6109a9816103c4565b82525050565b5f6020820190506109c25f8301846109a0565b92915050565b5f82825260208201905092915050565b7f417272617973206c656e677468206d69736d61746368000000000000000000005f82015250565b5f610a0c6016836109c8565b9150610a17826109d8565b602082019050919050565b5f6020820190508181035f830152610a3981610a00565b9050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52603260045260245ffd5b6144c180610a7a5f395ff3fe608060405234801561000f575f5ffd5b5060043610610251575f3560e01c8063755e67b111610144578063c87b56dd116100c1578063e1eda59211610085578063e1eda59214610705578063e348da6214610735578063e985e9c514610751578063e9daa87e14610781578063ef42c2d3146107b1578063f2fde38b146107cd57610251565b8063c87b56dd1461064d578063d02c2bf21461067d578063d199168d14610687578063d7a11fef146106b7578063dc027438146106d557610251565b80639878982a116101085780639878982a14610599578063a1db9782146105c9578063a22cb465146105e5578063b88d4fde14610601578063c8314a4c1461061d57610251565b8063755e67b1146104e15780638d2615ec146104fd5780638da5cb5b1461052d5780639478c8b31461054b57806395d89b411461057b57610251565b806333711f9b116101d25780636088e93a116101965780636088e93a146104515780636352211e1461046d578063695b314b1461049d57806370a08231146104a7578063715018a6146104d757610251565b806333711f9b146103b15780633b8a292d146103cd57806340c10f19146103e957806342842e0e146104055780634352ab411461042157610251565b80631b076edc116102195780631b076edc1461031f57806323b872dd1461033d57806325fd90f31461035957806325fe33011461037757806332cb6b0c1461039357610251565b806301ffc9a71461025557806306fdde0314610285578063081812fc146102a3578063095ea7b3146102d35780630b34b01b146102ef575b5f5ffd5b61026f600480360381019061026a9190612f9c565b6107e9565b60405161027c9190612fe1565b60405180910390f35b61028d6108ca565b60405161029a919061306a565b60405180910390f35b6102bd60048036038101906102b891906130bd565b610959565b6040516102ca9190613127565b60405180910390f35b6102ed60048036038101906102e8919061316a565b610974565b005b610309600480360381019061030491906131a8565b61098a565b60405161031691906131e2565b60405180910390f35b6103276109f5565b6040516103349190613127565b60405180910390f35b610357600480360381019061035291906131fb565b610a1a565b005b610361610b19565b60405161036e9190612fe1565b60405180910390f35b610391600480360381019061038c919061344b565b610b2c565b005b61039b610d0d565b6040516103a891906131e2565b60405180910390f35b6103cb60048036038101906103c691906130bd565b610d13565b005b6103e760048036038101906103e2919061316a565b610d67565b005b61040360048036038101906103fe919061316a565b610e80565b005b61041f600480360381019061041a91906131fb565b61133a565b005b61043b600480360381019061043691906131a8565b611359565b60405161044891906131e2565b60405180910390f35b61046b6004803603810190610466919061316a565b61136e565b005b610487600480360381019061048291906130bd565b6113e9565b6040516104949190613127565b60405180910390f35b6104a56113fa565b005b6104c160048036038101906104bc91906131a8565b61152a565b6040516104ce91906131e2565b60405180910390f35b6104df6115e0565b005b6104fb60048036038101906104f691906131a8565b6115f3565b005b610517600480360381019061051291906131a8565b61163e565b60405161052491906131e2565b60405180910390f35b610535611653565b6040516105429190613127565b60405180910390f35b610565600480360381019061056091906131a8565b61167b565b60405161057291906131e2565b60405180910390f35b610583611767565b604051610590919061306a565b60405180910390f35b6105b360048036038101906105ae91906131a8565b6117f7565b6040516105c09190612fe1565b60405180910390f35b6105e360048036038101906105de919061316a565b611814565b005b6105ff60048036038101906105fa91906134eb565b6118df565b005b61061b600480360381019061061691906135d9565b6118f5565b005b610637600480360381019061063291906131a8565b61191a565b60405161064491906131e2565b60405180910390f35b610667600480360381019061066291906130bd565b61192f565b604051610674919061306a565b60405180910390f35b610685611b1d565b005b6106a1600480360381019061069c919061316a565b611b51565b6040516106ae9190612fe1565b60405180910390f35b6106bf611b7b565b6040516106cc91906131e2565b60405180910390f35b6106ef60048036038101906106ea91906131a8565b611b81565b6040516106fc91906131e2565b60405180910390f35b61071f600480360381019061071a919061316a565b611b96565b60405161072c9190612fe1565b60405180910390f35b61074f600480360381019061074a91906131a8565b611cd3565b005b61076b60048036038101906107669190613659565b611d32565b6040516107789190612fe1565b60405180910390f35b61079b6004803603810190610796919061316a565b611dc0565b6040516107a89190612fe1565b60405180910390f35b6107cb60048036038101906107c691906131a8565b611e22565b005b6107e760048036038101906107e291906131a8565b611e82565b005b5f7f80ac58cd000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff191614806108b357507f5b5e139f000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916145b806108c357506108c282611f06565b5b9050919050565b60605f80546108d8906136c4565b80601f0160208091040260200160405190810160405280929190818152602001828054610904906136c4565b801561094f5780601f106109265761010080835404028352916020019161094f565b820191905f5260205f20905b81548152906001019060200180831161093257829003601f168201915b5050505050905090565b5f61096382611f6f565b5061096d82611ff5565b9050919050565b610986828261098161202e565b612035565b5050565b5f5f60105f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050600f5481106109de575f9150506109f0565b80600f546109ec9190613721565b9150505b919050565b60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1681565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603610a8a575f6040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401610a819190613127565b60405180910390fd5b5f610a9d8383610a9861202e565b612047565b90508373ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614610b13578382826040517f64283d7b000000000000000000000000000000000000000000000000000000008152600401610b0a93929190613754565b60405180910390fd5b50505050565b600860149054906101000a900460ff1681565b610b34612252565b8051825114610b78576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610b6f906137d3565b60405180910390fd5b5f5f90505b8251811015610d0857600b5f848381518110610b9c57610b9b6137f1565b5b602002602001015173ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16610c29576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610c2090613868565b60405180910390fd5b5f828281518110610c3d57610c3c6137f1565b5b602002602001015111610c85576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610c7c906138f6565b60405180910390fd5b818181518110610c9857610c976137f1565b5b6020026020010151600e5f858481518110610cb657610cb56137f1565b5b602002602001015173ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055508080600101915050610b7d565b505050565b6108ae81565b610d1b612252565b5f8111610d5d576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610d54906138f6565b60405180910390fd5b80600f8190555050565b610d6f612252565b600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16610df8576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610def90613868565b60405180910390fd5b5f8111610e3a576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610e31906138f6565b60405180910390fd5b80600e5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055505050565b60011515600860149054906101000a900460ff16151514610ed6576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610ecd9061395e565b60405180910390fd5b6108ae60075410610f1c576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610f13906139c6565b60405180910390fd5b600f5460105f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205410610f9d576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610f9490613a2e565b60405180910390fd5b600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16611026576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161101d90613a96565b60405180910390fd5b6110308282611b96565b61106f576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161106690613b24565b60405180910390fd5b600c5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8281526020019081526020015f205f9054906101000a900460ff1615611108576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016110ff90613bb2565b60405180910390fd5b5f600e5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205490505f811161118b576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161118290613c40565b60405180910390fd5b80600d5f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20541061120a576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161120190613cce565b60405180910390fd5b600d5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f81548092919061125790613cec565b919050555060105f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8154809291906112a990613cec565b91905055506001600c5f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8481526020019081526020015f205f6101000a81548160ff02191690831515021790555060075f81548092919061132490613cec565b9190505550611335336007546122d9565b505050565b61135483838360405180602001604052805f8152506118f5565b505050565b6010602052805f5260405f205f915090505481565b611376612252565b5f8290508073ffffffffffffffffffffffffffffffffffffffff166342842e0e3033856040518463ffffffff1660e01b81526004016113b793929190613d33565b5f604051808303815f87803b1580156113ce575f5ffd5b505af11580156113e0573d5f5f3e3d5ffd5b50505050505050565b5f6113f382611f6f565b9050919050565b5f6114043361152a565b90505f600a5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054826114509190613721565b90505f8111611494576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161148b90613db2565b60405180910390fd5b81600a5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055508060095f8282546114e79190613dd0565b9250508190555061022b60095410611526577f46b612c06ed0b37523aea4d54cebeaa959f59311bcce3201eeff7d4c84f2274760405160405180910390a15b5050565b5f5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff160361159b575f6040517f89c62b640000000000000000000000000000000000000000000000000000000081526004016115929190613127565b60405180910390fd5b60035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050919050565b6115e8612252565b6115f15f6122f6565b565b6115fb612252565b8060085f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050565b600e602052805f5260405f205f915090505481565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff16905090565b5f5f600e5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205490505f81116116ff576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016116f690613c40565b60405180910390fd5b5f600d5f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050818110611751575f92505050611762565b808261175d9190613721565b925050505b919050565b606060018054611776906136c4565b80601f01602080910402602001604051908101604052809291908181526020018280546117a2906136c4565b80156117ed5780601f106117c4576101008083540402835291602001916117ed565b820191905f5260205f20905b8154815290600101906020018083116117d057829003601f168201915b5050505050905090565b600b602052805f5260405f205f915054906101000a900460ff1681565b61181c612252565b5f8290508073ffffffffffffffffffffffffffffffffffffffff1663a9059cbb33846040518363ffffffff1660e01b815260040161185b929190613e03565b6020604051808303815f875af1158015611877573d5f5f3e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061189b9190613e3e565b6118da576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016118d190613eb3565b60405180910390fd5b505050565b6118f16118ea61202e565b83836123b9565b5050565b611900848484610a1a565b61191461190b61202e565b85858585612522565b50505050565b600d602052805f5260405f205f915090505481565b6060600754821115611976576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161196d90613f1b565b60405180910390fd5b5f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff16633efabdf4846040518263ffffffff1660e01b81526004016119d191906131e2565b5f60405180830381865afa1580156119eb573d5f5f3e3d5ffd5b505050506040513d5f823e3d601f19601f82011682018060405250810190611a139190613fd7565b90505f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1663e1dc0761856040518263ffffffff1660e01b8152600401611a7091906131e2565b5f60405180830381865afa158015611a8a573d5f5f3e3d5ffd5b505050506040513d5f823e3d601f19601f82011682018060405250810190611ab29190613fd7565b90505f611abe856126ce565b611ac784612798565b83604051602001611ada939291906141cc565b6040516020818303038152906040529050611af481612798565b604051602001611b049190614272565b6040516020818303038152906040529350505050919050565b611b25612252565b600860149054906101000a900460ff1615600860146101000a81548160ff021916908315150217905550565b600c602052815f5260405f20602052805f5260405f205f915091509054906101000a900460ff1681565b600f5481565b600a602052805f5260405f205f915090505481565b5f600b5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16611c20576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611c1790613a96565b60405180910390fd5b5f8373ffffffffffffffffffffffffffffffffffffffff16636352211e846040518263ffffffff1660e01b8152600401611c5a91906131e2565b602060405180830381865afa158015611c75573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611c9991906142a7565b90503373ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff161491505092915050565b611cdb612252565b5f600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff02191690831515021790555050565b5f60055f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16905092915050565b5f600c5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8381526020019081526020015f205f9054906101000a900460ff16905092915050565b611e2a612252565b6001600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff02191690831515021790555050565b611e8a612252565b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1603611efa575f6040517f1e4fbdf7000000000000000000000000000000000000000000000000000000008152600401611ef19190613127565b60405180910390fd5b611f03816122f6565b50565b5f7f01ffc9a7000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916149050919050565b5f5f611f7a836127c5565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1603611fec57826040517f7e273289000000000000000000000000000000000000000000000000000000008152600401611fe391906131e2565b60405180910390fd5b80915050919050565b5f60045f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b5f33905090565b61204283838360016127fe565b505050565b5f5f612052846127c5565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1614612093576120928184866129bd565b5b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff161461211e576120d25f855f5f6127fe565b600160035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825403925050819055505b5f73ffffffffffffffffffffffffffffffffffffffff168573ffffffffffffffffffffffffffffffffffffffff161461219d57600160035f8773ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825401925050819055505b8460025f8681526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff160217905550838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a4809150509392505050565b61225a61202e565b73ffffffffffffffffffffffffffffffffffffffff16612278611653565b73ffffffffffffffffffffffffffffffffffffffff16146122d75761229b61202e565b6040517f118cdaa70000000000000000000000000000000000000000000000000000000081526004016122ce9190613127565b60405180910390fd5b565b6122f2828260405180602001604052805f815250612a80565b5050565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1690508160065f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff160361242957816040517f5b08ba180000000000000000000000000000000000000000000000000000000081526004016124209190613127565b60405180910390fd5b8060055f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff0219169083151502179055508173ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31836040516125159190612fe1565b60405180910390a3505050565b5f8373ffffffffffffffffffffffffffffffffffffffff163b11156126c7578273ffffffffffffffffffffffffffffffffffffffff1663150b7a02868685856040518563ffffffff1660e01b81526004016125809493929190614324565b6020604051808303815f875af19250505080156125bb57506040513d601f19601f820116820180604052508101906125b89190614382565b60015b61263c573d805f81146125e9576040519150601f19603f3d011682016040523d82523d5f602084013e6125ee565b606091505b505f81510361263457836040517f64a0ae9200000000000000000000000000000000000000000000000000000000815260040161262b9190613127565b60405180910390fd5b805181602001fd5b63150b7a0260e01b7bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916817bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916146126c557836040517f64a0ae920000000000000000000000000000000000000000000000000000000081526004016126bc9190613127565b60405180910390fd5b505b5050505050565b60605f60016126dc84612aa3565b0190505f8167ffffffffffffffff8111156126fa576126f961324f565b5b6040519080825280601f01601f19166020018201604052801561272c5781602001600182028036833780820191505090505b5090505f82602001820190505b60011561278d578080600190039150507f3031323334353637383961626364656600000000000000000000000000000000600a86061a8153600a8581612782576127816143ad565b5b0494505f8503612739575b819350505050919050565b60606127be8260405180606001604052806040815260200161444c604091396001612bf4565b9050919050565b5f60025f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b808061283657505f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b15612968575f61284584611f6f565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff16141580156128af57508273ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614155b80156128c257506128c08184611d32565b155b1561290457826040517fa9fbf51f0000000000000000000000000000000000000000000000000000000081526004016128fb9190613127565b60405180910390fd5b811561296657838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b8360045f8581526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050505050565b6129c8838383612d83565b612a7b575f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1603612a3c57806040517f7e273289000000000000000000000000000000000000000000000000000000008152600401612a3391906131e2565b60405180910390fd5b81816040517f177e802f000000000000000000000000000000000000000000000000000000008152600401612a72929190613e03565b60405180910390fd5b505050565b612a8a8383612e43565b612a9e612a9561202e565b5f858585612522565b505050565b5f5f5f90507a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008310612aff577a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008381612af557612af46143ad565b5b0492506040810190505b6d04ee2d6d415b85acef81000000008310612b3c576d04ee2d6d415b85acef81000000008381612b3257612b316143ad565b5b0492506020810190505b662386f26fc100008310612b6b57662386f26fc100008381612b6157612b606143ad565b5b0492506010810190505b6305f5e1008310612b94576305f5e1008381612b8a57612b896143ad565b5b0492506008810190505b6127108310612bb9576127108381612baf57612bae6143ad565b5b0492506004810190505b60648310612bdc5760648381612bd257612bd16143ad565b5b0492506002810190505b600a8310612beb576001810190505b80915050919050565b60605f845103612c145760405180602001604052805f8152509050612d7c565b5f82612c45576003600286516004612c2c91906143da565b612c369190613dd0565b612c40919061441b565b612c6c565b600360028651612c559190613dd0565b612c5f919061441b565b6004612c6b91906143da565b5b90505f8167ffffffffffffffff811115612c8957612c8861324f565b5b6040519080825280601f01601f191660200182016040528015612cbb5781602001600182028036833780820191505090505b509050600185016020820187885189016020810180515f82525b82841015612d30576003840193508351603f8160121c168701518653600186019550603f81600c1c168701518653600186019550603f8160061c168701518653600186019550603f8116870151865360018601955050612cd5565b8082528915612d705760038c510660018114612d535760028114612d6657612d6e565b603d6001870353603d6002870353612d6e565b603d60018703535b505b50505050505080925050505b9392505050565b5f5f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1614158015612e3a57508273ffffffffffffffffffffffffffffffffffffffff168473ffffffffffffffffffffffffffffffffffffffff161480612dfb5750612dfa8484611d32565b5b80612e3957508273ffffffffffffffffffffffffffffffffffffffff16612e2183611ff5565b73ffffffffffffffffffffffffffffffffffffffff16145b5b90509392505050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603612eb3575f6040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401612eaa9190613127565b60405180910390fd5b5f612ebf83835f612047565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614612f31575f6040517f73c6ac6e000000000000000000000000000000000000000000000000000000008152600401612f289190613127565b60405180910390fd5b505050565b5f604051905090565b5f5ffd5b5f5ffd5b5f7fffffffff0000000000000000000000000000000000000000000000000000000082169050919050565b612f7b81612f47565b8114612f85575f5ffd5b50565b5f81359050612f9681612f72565b92915050565b5f60208284031215612fb157612fb0612f3f565b5b5f612fbe84828501612f88565b91505092915050565b5f8115159050919050565b612fdb81612fc7565b82525050565b5f602082019050612ff45f830184612fd2565b92915050565b5f81519050919050565b5f82825260208201905092915050565b8281835e5f83830152505050565b5f601f19601f8301169050919050565b5f61303c82612ffa565b6130468185613004565b9350613056818560208601613014565b61305f81613022565b840191505092915050565b5f6020820190508181035f8301526130828184613032565b905092915050565b5f819050919050565b61309c8161308a565b81146130a6575f5ffd5b50565b5f813590506130b781613093565b92915050565b5f602082840312156130d2576130d1612f3f565b5b5f6130df848285016130a9565b91505092915050565b5f73ffffffffffffffffffffffffffffffffffffffff82169050919050565b5f613111826130e8565b9050919050565b61312181613107565b82525050565b5f60208201905061313a5f830184613118565b92915050565b61314981613107565b8114613153575f5ffd5b50565b5f8135905061316481613140565b92915050565b5f5f604083850312156131805761317f612f3f565b5b5f61318d85828601613156565b925050602061319e858286016130a9565b9150509250929050565b5f602082840312156131bd576131bc612f3f565b5b5f6131ca84828501613156565b91505092915050565b6131dc8161308a565b82525050565b5f6020820190506131f55f8301846131d3565b92915050565b5f5f5f6060848603121561321257613211612f3f565b5b5f61321f86828701613156565b935050602061323086828701613156565b9250506040613241868287016130a9565b9150509250925092565b5f5ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b61328582613022565b810181811067ffffffffffffffff821117156132a4576132a361324f565b5b80604052505050565b5f6132b6612f36565b90506132c2828261327c565b919050565b5f67ffffffffffffffff8211156132e1576132e061324f565b5b602082029050602081019050919050565b5f5ffd5b5f613308613303846132c7565b6132ad565b9050808382526020820190506020840283018581111561332b5761332a6132f2565b5b835b8181101561335457806133408882613156565b84526020840193505060208101905061332d565b5050509392505050565b5f82601f8301126133725761337161324b565b5b81356133828482602086016132f6565b91505092915050565b5f67ffffffffffffffff8211156133a5576133a461324f565b5b602082029050602081019050919050565b5f6133c86133c38461338b565b6132ad565b905080838252602082019050602084028301858111156133eb576133ea6132f2565b5b835b81811015613414578061340088826130a9565b8452602084019350506020810190506133ed565b5050509392505050565b5f82601f8301126134325761343161324b565b5b81356134428482602086016133b6565b91505092915050565b5f5f6040838503121561346157613460612f3f565b5b5f83013567ffffffffffffffff81111561347e5761347d612f43565b5b61348a8582860161335e565b925050602083013567ffffffffffffffff8111156134ab576134aa612f43565b5b6134b78582860161341e565b9150509250929050565b6134ca81612fc7565b81146134d4575f5ffd5b50565b5f813590506134e5816134c1565b92915050565b5f5f6040838503121561350157613500612f3f565b5b5f61350e85828601613156565b925050602061351f858286016134d7565b9150509250929050565b5f5ffd5b5f67ffffffffffffffff8211156135475761354661324f565b5b61355082613022565b9050602081019050919050565b828183375f83830152505050565b5f61357d6135788461352d565b6132ad565b90508281526020810184848401111561359957613598613529565b5b6135a484828561355d565b509392505050565b5f82601f8301126135c0576135bf61324b565b5b81356135d084826020860161356b565b91505092915050565b5f5f5f5f608085870312156135f1576135f0612f3f565b5b5f6135fe87828801613156565b945050602061360f87828801613156565b9350506040613620878288016130a9565b925050606085013567ffffffffffffffff81111561364157613640612f43565b5b61364d878288016135ac565b91505092959194509250565b5f5f6040838503121561366f5761366e612f3f565b5b5f61367c85828601613156565b925050602061368d85828601613156565b9150509250929050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f60028204905060018216806136db57607f821691505b6020821081036136ee576136ed613697565b5b50919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b5f61372b8261308a565b91506137368361308a565b925082820390508181111561374e5761374d6136f4565b5b92915050565b5f6060820190506137675f830186613118565b61377460208301856131d3565b6137816040830184613118565b949350505050565b7f417272617973206c656e677468206d69736d61746368000000000000000000005f82015250565b5f6137bd601683613004565b91506137c882613789565b602082019050919050565b5f6020820190508181035f8301526137ea816137b1565b9050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52603260045260245ffd5b7f436f6e7472616374206e6f7420616c6c6f7765640000000000000000000000005f82015250565b5f613852601483613004565b915061385d8261381e565b602082019050919050565b5f6020820190508181035f83015261387f81613846565b9050919050565b7f4d617820636c61696d73206d7573742062652067726561746572207468616e205f8201527f3000000000000000000000000000000000000000000000000000000000000000602082015250565b5f6138e0602183613004565b91506138eb82613886565b604082019050919050565b5f6020820190508181035f83015261390d816138d4565b9050919050565b7f4d696e74206e6f742061637469766500000000000000000000000000000000005f82015250565b5f613948600f83613004565b915061395382613914565b602082019050919050565b5f6020820190508181035f8301526139758161393c565b9050919050565b7f4d617820737570706c79207265616368656400000000000000000000000000005f82015250565b5f6139b0601283613004565b91506139bb8261397c565b602082019050919050565b5f6020820190508181035f8301526139dd816139a4565b9050919050565b7f4d617820636c61696d73207065722077616c6c657420726561636865640000005f82015250565b5f613a18601d83613004565b9150613a23826139e4565b602082019050919050565b5f6020820190508181035f830152613a4581613a0c565b9050919050565b7f45524337323120636f6e7472616374206e6f7420616c6c6f77656400000000005f82015250565b5f613a80601b83613004565b9150613a8b82613a4c565b602082019050919050565b5f6020820190508181035f830152613aad81613a74565b9050919050565b7f596f7520646f206e6f74206f776e207468652073706563696669656420746f6b5f8201527f656e000000000000000000000000000000000000000000000000000000000000602082015250565b5f613b0e602283613004565b9150613b1982613ab4565b604082019050919050565b5f6020820190508181035f830152613b3b81613b02565b9050919050565b7f5468697320746f6b656e2068617320616c7265616479206265656e20757365645f8201527f20746f20636c61696d0000000000000000000000000000000000000000000000602082015250565b5f613b9c602983613004565b9150613ba782613b42565b604082019050919050565b5f6020820190508181035f830152613bc981613b90565b9050919050565b7f436f6e7472616374206e6f7420636f6e6669677572656420666f72206d696e745f8201527f696e670000000000000000000000000000000000000000000000000000000000602082015250565b5f613c2a602383613004565b9150613c3582613bd0565b604082019050919050565b5f6020820190508181035f830152613c5781613c1e565b9050919050565b7f4d617820636c61696d73207265616368656420666f72207468697320636f6e745f8201527f7261637400000000000000000000000000000000000000000000000000000000602082015250565b5f613cb8602483613004565b9150613cc382613c5e565b604082019050919050565b5f6020820190508181035f830152613ce581613cac565b9050919050565b5f613cf68261308a565b91507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203613d2857613d276136f4565b5b600182019050919050565b5f606082019050613d465f830186613118565b613d536020830185613118565b613d6060408301846131d3565b949350505050565b7f4e6f206e657720746f6b656e7320746f20706c616365000000000000000000005f82015250565b5f613d9c601683613004565b9150613da782613d68565b602082019050919050565b5f6020820190508181035f830152613dc981613d90565b9050919050565b5f613dda8261308a565b9150613de58361308a565b9250828201905080821115613dfd57613dfc6136f4565b5b92915050565b5f604082019050613e165f830185613118565b613e2360208301846131d3565b9392505050565b5f81519050613e38816134c1565b92915050565b5f60208284031215613e5357613e52612f3f565b5b5f613e6084828501613e2a565b91505092915050565b7f5472616e73666572206661696c656400000000000000000000000000000000005f82015250565b5f613e9d600f83613004565b9150613ea882613e69565b602082019050919050565b5f6020820190508181035f830152613eca81613e91565b9050919050565b7f546f6b656e20646f6573206e6f742065786973740000000000000000000000005f82015250565b5f613f05601483613004565b9150613f1082613ed1565b602082019050919050565b5f6020820190508181035f830152613f3281613ef9565b9050919050565b5f67ffffffffffffffff821115613f5357613f5261324f565b5b613f5c82613022565b9050602081019050919050565b5f613f7b613f7684613f39565b6132ad565b905082815260208101848484011115613f9757613f96613529565b5b613fa2848285613014565b509392505050565b5f82601f830112613fbe57613fbd61324b565b5b8151613fce848260208601613f69565b91505092915050565b5f60208284031215613fec57613feb612f3f565b5b5f82015167ffffffffffffffff81111561400957614008612f43565b5b61401584828501613faa565b91505092915050565b5f81905092915050565b7f7b226e616d65223a2022476f62202300000000000000000000000000000000005f82015250565b5f61405c600f8361401e565b915061406782614028565b600f82019050919050565b5f61407c82612ffa565b614086818561401e565b9350614096818560208601613014565b80840191505092915050565b7f222c20226465736372697074696f6e223a20224f6e2d636861696e20476f62205f8201527f4e4654222c2022696d616765223a2022646174613a696d6167652f7376672b7860208201527f6d6c3b6261736536342c00000000000000000000000000000000000000000000604082015250565b5f614122604a8361401e565b915061412d826140a2565b604a82019050919050565b7f222c202261747472696275746573223a200000000000000000000000000000005f82015250565b5f61416c60118361401e565b915061417782614138565b601182019050919050565b7f7d000000000000000000000000000000000000000000000000000000000000005f82015250565b5f6141b660018361401e565b91506141c182614182565b600182019050919050565b5f6141d682614050565b91506141e28286614072565b91506141ed82614116565b91506141f98285614072565b915061420482614160565b91506142108284614072565b915061421b826141aa565b9150819050949350505050565b7f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c0000005f82015250565b5f61425c601d8361401e565b915061426782614228565b601d82019050919050565b5f61427c82614250565b91506142888284614072565b915081905092915050565b5f815190506142a181613140565b92915050565b5f602082840312156142bc576142bb612f3f565b5b5f6142c984828501614293565b91505092915050565b5f81519050919050565b5f82825260208201905092915050565b5f6142f6826142d2565b61430081856142dc565b9350614310818560208601613014565b61431981613022565b840191505092915050565b5f6080820190506143375f830187613118565b6143446020830186613118565b61435160408301856131d3565b818103606083015261436381846142ec565b905095945050505050565b5f8151905061437c81612f72565b92915050565b5f6020828403121561439757614396612f3f565b5b5f6143a48482850161436e565b91505092915050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601260045260245ffd5b5f6143e48261308a565b91506143ef8361308a565b92508282026143fd8161308a565b91508282048414831517614414576144136136f4565b5b5092915050565b5f6144258261308a565b91506144308361308a565b9250826144405761443f6143ad565b5b82820490509291505056fe4142434445464748494a4b4c4d4e4f505152535455565758595a6162636465666768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2fa2646970667358221220a1a1ef1fa1e49ce5f4a630c9f7171b6a85a54389e49df2b7ef3984564cf9c58d64736f6c634300081c0033000000000000000000000000fe0a08926ea324ddae319a4843d8e7dabedbbd61000000000000000000000000000000000000000000000000000000000000006000000000000000000000000000000000000000000000000000000000000000e0000000000000000000000000000000000000000000000000000000000000000300000000000000000000000037ebd0c0515b946df88bd115a0233e3582b35883000000000000000000000000c29ee352c109f49927ccc92049290fcbde9a705d00000000000000000000000024d1d4306c62bf2e60eea3d5f0748f70249a08ba0000000000000000000000000000000000000000000000000000000000000003000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000001

Deployed Bytecode

0x608060405234801561000f575f5ffd5b5060043610610251575f3560e01c8063755e67b111610144578063c87b56dd116100c1578063e1eda59211610085578063e1eda59214610705578063e348da6214610735578063e985e9c514610751578063e9daa87e14610781578063ef42c2d3146107b1578063f2fde38b146107cd57610251565b8063c87b56dd1461064d578063d02c2bf21461067d578063d199168d14610687578063d7a11fef146106b7578063dc027438146106d557610251565b80639878982a116101085780639878982a14610599578063a1db9782146105c9578063a22cb465146105e5578063b88d4fde14610601578063c8314a4c1461061d57610251565b8063755e67b1146104e15780638d2615ec146104fd5780638da5cb5b1461052d5780639478c8b31461054b57806395d89b411461057b57610251565b806333711f9b116101d25780636088e93a116101965780636088e93a146104515780636352211e1461046d578063695b314b1461049d57806370a08231146104a7578063715018a6146104d757610251565b806333711f9b146103b15780633b8a292d146103cd57806340c10f19146103e957806342842e0e146104055780634352ab411461042157610251565b80631b076edc116102195780631b076edc1461031f57806323b872dd1461033d57806325fd90f31461035957806325fe33011461037757806332cb6b0c1461039357610251565b806301ffc9a71461025557806306fdde0314610285578063081812fc146102a3578063095ea7b3146102d35780630b34b01b146102ef575b5f5ffd5b61026f600480360381019061026a9190612f9c565b6107e9565b60405161027c9190612fe1565b60405180910390f35b61028d6108ca565b60405161029a919061306a565b60405180910390f35b6102bd60048036038101906102b891906130bd565b610959565b6040516102ca9190613127565b60405180910390f35b6102ed60048036038101906102e8919061316a565b610974565b005b610309600480360381019061030491906131a8565b61098a565b60405161031691906131e2565b60405180910390f35b6103276109f5565b6040516103349190613127565b60405180910390f35b610357600480360381019061035291906131fb565b610a1a565b005b610361610b19565b60405161036e9190612fe1565b60405180910390f35b610391600480360381019061038c919061344b565b610b2c565b005b61039b610d0d565b6040516103a891906131e2565b60405180910390f35b6103cb60048036038101906103c691906130bd565b610d13565b005b6103e760048036038101906103e2919061316a565b610d67565b005b61040360048036038101906103fe919061316a565b610e80565b005b61041f600480360381019061041a91906131fb565b61133a565b005b61043b600480360381019061043691906131a8565b611359565b60405161044891906131e2565b60405180910390f35b61046b6004803603810190610466919061316a565b61136e565b005b610487600480360381019061048291906130bd565b6113e9565b6040516104949190613127565b60405180910390f35b6104a56113fa565b005b6104c160048036038101906104bc91906131a8565b61152a565b6040516104ce91906131e2565b60405180910390f35b6104df6115e0565b005b6104fb60048036038101906104f691906131a8565b6115f3565b005b610517600480360381019061051291906131a8565b61163e565b60405161052491906131e2565b60405180910390f35b610535611653565b6040516105429190613127565b60405180910390f35b610565600480360381019061056091906131a8565b61167b565b60405161057291906131e2565b60405180910390f35b610583611767565b604051610590919061306a565b60405180910390f35b6105b360048036038101906105ae91906131a8565b6117f7565b6040516105c09190612fe1565b60405180910390f35b6105e360048036038101906105de919061316a565b611814565b005b6105ff60048036038101906105fa91906134eb565b6118df565b005b61061b600480360381019061061691906135d9565b6118f5565b005b610637600480360381019061063291906131a8565b61191a565b60405161064491906131e2565b60405180910390f35b610667600480360381019061066291906130bd565b61192f565b604051610674919061306a565b60405180910390f35b610685611b1d565b005b6106a1600480360381019061069c919061316a565b611b51565b6040516106ae9190612fe1565b60405180910390f35b6106bf611b7b565b6040516106cc91906131e2565b60405180910390f35b6106ef60048036038101906106ea91906131a8565b611b81565b6040516106fc91906131e2565b60405180910390f35b61071f600480360381019061071a919061316a565b611b96565b60405161072c9190612fe1565b60405180910390f35b61074f600480360381019061074a91906131a8565b611cd3565b005b61076b60048036038101906107669190613659565b611d32565b6040516107789190612fe1565b60405180910390f35b61079b6004803603810190610796919061316a565b611dc0565b6040516107a89190612fe1565b60405180910390f35b6107cb60048036038101906107c691906131a8565b611e22565b005b6107e760048036038101906107e291906131a8565b611e82565b005b5f7f80ac58cd000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff191614806108b357507f5b5e139f000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916145b806108c357506108c282611f06565b5b9050919050565b60605f80546108d8906136c4565b80601f0160208091040260200160405190810160405280929190818152602001828054610904906136c4565b801561094f5780601f106109265761010080835404028352916020019161094f565b820191905f5260205f20905b81548152906001019060200180831161093257829003601f168201915b5050505050905090565b5f61096382611f6f565b5061096d82611ff5565b9050919050565b610986828261098161202e565b612035565b5050565b5f5f60105f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050600f5481106109de575f9150506109f0565b80600f546109ec9190613721565b9150505b919050565b60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1681565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603610a8a575f6040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401610a819190613127565b60405180910390fd5b5f610a9d8383610a9861202e565b612047565b90508373ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614610b13578382826040517f64283d7b000000000000000000000000000000000000000000000000000000008152600401610b0a93929190613754565b60405180910390fd5b50505050565b600860149054906101000a900460ff1681565b610b34612252565b8051825114610b78576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610b6f906137d3565b60405180910390fd5b5f5f90505b8251811015610d0857600b5f848381518110610b9c57610b9b6137f1565b5b602002602001015173ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16610c29576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610c2090613868565b60405180910390fd5b5f828281518110610c3d57610c3c6137f1565b5b602002602001015111610c85576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610c7c906138f6565b60405180910390fd5b818181518110610c9857610c976137f1565b5b6020026020010151600e5f858481518110610cb657610cb56137f1565b5b602002602001015173ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055508080600101915050610b7d565b505050565b6108ae81565b610d1b612252565b5f8111610d5d576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610d54906138f6565b60405180910390fd5b80600f8190555050565b610d6f612252565b600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16610df8576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610def90613868565b60405180910390fd5b5f8111610e3a576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610e31906138f6565b60405180910390fd5b80600e5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055505050565b60011515600860149054906101000a900460ff16151514610ed6576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610ecd9061395e565b60405180910390fd5b6108ae60075410610f1c576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610f13906139c6565b60405180910390fd5b600f5460105f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205410610f9d576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610f9490613a2e565b60405180910390fd5b600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16611026576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161101d90613a96565b60405180910390fd5b6110308282611b96565b61106f576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161106690613b24565b60405180910390fd5b600c5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8281526020019081526020015f205f9054906101000a900460ff1615611108576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016110ff90613bb2565b60405180910390fd5b5f600e5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205490505f811161118b576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161118290613c40565b60405180910390fd5b80600d5f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20541061120a576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161120190613cce565b60405180910390fd5b600d5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f81548092919061125790613cec565b919050555060105f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8154809291906112a990613cec565b91905055506001600c5f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8481526020019081526020015f205f6101000a81548160ff02191690831515021790555060075f81548092919061132490613cec565b9190505550611335336007546122d9565b505050565b61135483838360405180602001604052805f8152506118f5565b505050565b6010602052805f5260405f205f915090505481565b611376612252565b5f8290508073ffffffffffffffffffffffffffffffffffffffff166342842e0e3033856040518463ffffffff1660e01b81526004016113b793929190613d33565b5f604051808303815f87803b1580156113ce575f5ffd5b505af11580156113e0573d5f5f3e3d5ffd5b50505050505050565b5f6113f382611f6f565b9050919050565b5f6114043361152a565b90505f600a5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054826114509190613721565b90505f8111611494576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161148b90613db2565b60405180910390fd5b81600a5f3373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055508060095f8282546114e79190613dd0565b9250508190555061022b60095410611526577f46b612c06ed0b37523aea4d54cebeaa959f59311bcce3201eeff7d4c84f2274760405160405180910390a15b5050565b5f5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff160361159b575f6040517f89c62b640000000000000000000000000000000000000000000000000000000081526004016115929190613127565b60405180910390fd5b60035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050919050565b6115e8612252565b6115f15f6122f6565b565b6115fb612252565b8060085f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050565b600e602052805f5260405f205f915090505481565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff16905090565b5f5f600e5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205490505f81116116ff576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016116f690613c40565b60405180910390fd5b5f600d5f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050818110611751575f92505050611762565b808261175d9190613721565b925050505b919050565b606060018054611776906136c4565b80601f01602080910402602001604051908101604052809291908181526020018280546117a2906136c4565b80156117ed5780601f106117c4576101008083540402835291602001916117ed565b820191905f5260205f20905b8154815290600101906020018083116117d057829003601f168201915b5050505050905090565b600b602052805f5260405f205f915054906101000a900460ff1681565b61181c612252565b5f8290508073ffffffffffffffffffffffffffffffffffffffff1663a9059cbb33846040518363ffffffff1660e01b815260040161185b929190613e03565b6020604051808303815f875af1158015611877573d5f5f3e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061189b9190613e3e565b6118da576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016118d190613eb3565b60405180910390fd5b505050565b6118f16118ea61202e565b83836123b9565b5050565b611900848484610a1a565b61191461190b61202e565b85858585612522565b50505050565b600d602052805f5260405f205f915090505481565b6060600754821115611976576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161196d90613f1b565b60405180910390fd5b5f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff16633efabdf4846040518263ffffffff1660e01b81526004016119d191906131e2565b5f60405180830381865afa1580156119eb573d5f5f3e3d5ffd5b505050506040513d5f823e3d601f19601f82011682018060405250810190611a139190613fd7565b90505f60085f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1663e1dc0761856040518263ffffffff1660e01b8152600401611a7091906131e2565b5f60405180830381865afa158015611a8a573d5f5f3e3d5ffd5b505050506040513d5f823e3d601f19601f82011682018060405250810190611ab29190613fd7565b90505f611abe856126ce565b611ac784612798565b83604051602001611ada939291906141cc565b6040516020818303038152906040529050611af481612798565b604051602001611b049190614272565b6040516020818303038152906040529350505050919050565b611b25612252565b600860149054906101000a900460ff1615600860146101000a81548160ff021916908315150217905550565b600c602052815f5260405f20602052805f5260405f205f915091509054906101000a900460ff1681565b600f5481565b600a602052805f5260405f205f915090505481565b5f600b5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16611c20576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611c1790613a96565b60405180910390fd5b5f8373ffffffffffffffffffffffffffffffffffffffff16636352211e846040518263ffffffff1660e01b8152600401611c5a91906131e2565b602060405180830381865afa158015611c75573d5f5f3e3d5ffd5b505050506040513d601f19601f82011682018060405250810190611c9991906142a7565b90503373ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff161491505092915050565b611cdb612252565b5f600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff02191690831515021790555050565b5f60055f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16905092915050565b5f600c5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8381526020019081526020015f205f9054906101000a900460ff16905092915050565b611e2a612252565b6001600b5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff02191690831515021790555050565b611e8a612252565b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1603611efa575f6040517f1e4fbdf7000000000000000000000000000000000000000000000000000000008152600401611ef19190613127565b60405180910390fd5b611f03816122f6565b50565b5f7f01ffc9a7000000000000000000000000000000000000000000000000000000007bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916827bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916149050919050565b5f5f611f7a836127c5565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1603611fec57826040517f7e273289000000000000000000000000000000000000000000000000000000008152600401611fe391906131e2565b60405180910390fd5b80915050919050565b5f60045f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b5f33905090565b61204283838360016127fe565b505050565b5f5f612052846127c5565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1614612093576120928184866129bd565b5b5f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff161461211e576120d25f855f5f6127fe565b600160035f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825403925050819055505b5f73ffffffffffffffffffffffffffffffffffffffff168573ffffffffffffffffffffffffffffffffffffffff161461219d57600160035f8773ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825401925050819055505b8460025f8681526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff160217905550838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef60405160405180910390a4809150509392505050565b61225a61202e565b73ffffffffffffffffffffffffffffffffffffffff16612278611653565b73ffffffffffffffffffffffffffffffffffffffff16146122d75761229b61202e565b6040517f118cdaa70000000000000000000000000000000000000000000000000000000081526004016122ce9190613127565b60405180910390fd5b565b6122f2828260405180602001604052805f815250612a80565b5050565b5f60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1690508160065f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055508173ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e060405160405180910390a35050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff160361242957816040517f5b08ba180000000000000000000000000000000000000000000000000000000081526004016124209190613127565b60405180910390fd5b8060055f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff0219169083151502179055508173ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31836040516125159190612fe1565b60405180910390a3505050565b5f8373ffffffffffffffffffffffffffffffffffffffff163b11156126c7578273ffffffffffffffffffffffffffffffffffffffff1663150b7a02868685856040518563ffffffff1660e01b81526004016125809493929190614324565b6020604051808303815f875af19250505080156125bb57506040513d601f19601f820116820180604052508101906125b89190614382565b60015b61263c573d805f81146125e9576040519150601f19603f3d011682016040523d82523d5f602084013e6125ee565b606091505b505f81510361263457836040517f64a0ae9200000000000000000000000000000000000000000000000000000000815260040161262b9190613127565b60405180910390fd5b805181602001fd5b63150b7a0260e01b7bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916817bffffffffffffffffffffffffffffffffffffffffffffffffffffffff1916146126c557836040517f64a0ae920000000000000000000000000000000000000000000000000000000081526004016126bc9190613127565b60405180910390fd5b505b5050505050565b60605f60016126dc84612aa3565b0190505f8167ffffffffffffffff8111156126fa576126f961324f565b5b6040519080825280601f01601f19166020018201604052801561272c5781602001600182028036833780820191505090505b5090505f82602001820190505b60011561278d578080600190039150507f3031323334353637383961626364656600000000000000000000000000000000600a86061a8153600a8581612782576127816143ad565b5b0494505f8503612739575b819350505050919050565b60606127be8260405180606001604052806040815260200161444c604091396001612bf4565b9050919050565b5f60025f8381526020019081526020015f205f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff169050919050565b808061283657505f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b15612968575f61284584611f6f565b90505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff16141580156128af57508273ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614155b80156128c257506128c08184611d32565b155b1561290457826040517fa9fbf51f0000000000000000000000000000000000000000000000000000000081526004016128fb9190613127565b60405180910390fd5b811561296657838573ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b8360045f8581526020019081526020015f205f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555050505050565b6129c8838383612d83565b612a7b575f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1603612a3c57806040517f7e273289000000000000000000000000000000000000000000000000000000008152600401612a3391906131e2565b60405180910390fd5b81816040517f177e802f000000000000000000000000000000000000000000000000000000008152600401612a72929190613e03565b60405180910390fd5b505050565b612a8a8383612e43565b612a9e612a9561202e565b5f858585612522565b505050565b5f5f5f90507a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008310612aff577a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008381612af557612af46143ad565b5b0492506040810190505b6d04ee2d6d415b85acef81000000008310612b3c576d04ee2d6d415b85acef81000000008381612b3257612b316143ad565b5b0492506020810190505b662386f26fc100008310612b6b57662386f26fc100008381612b6157612b606143ad565b5b0492506010810190505b6305f5e1008310612b94576305f5e1008381612b8a57612b896143ad565b5b0492506008810190505b6127108310612bb9576127108381612baf57612bae6143ad565b5b0492506004810190505b60648310612bdc5760648381612bd257612bd16143ad565b5b0492506002810190505b600a8310612beb576001810190505b80915050919050565b60605f845103612c145760405180602001604052805f8152509050612d7c565b5f82612c45576003600286516004612c2c91906143da565b612c369190613dd0565b612c40919061441b565b612c6c565b600360028651612c559190613dd0565b612c5f919061441b565b6004612c6b91906143da565b5b90505f8167ffffffffffffffff811115612c8957612c8861324f565b5b6040519080825280601f01601f191660200182016040528015612cbb5781602001600182028036833780820191505090505b509050600185016020820187885189016020810180515f82525b82841015612d30576003840193508351603f8160121c168701518653600186019550603f81600c1c168701518653600186019550603f8160061c168701518653600186019550603f8116870151865360018601955050612cd5565b8082528915612d705760038c510660018114612d535760028114612d6657612d6e565b603d6001870353603d6002870353612d6e565b603d60018703535b505b50505050505080925050505b9392505050565b5f5f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1614158015612e3a57508273ffffffffffffffffffffffffffffffffffffffff168473ffffffffffffffffffffffffffffffffffffffff161480612dfb5750612dfa8484611d32565b5b80612e3957508273ffffffffffffffffffffffffffffffffffffffff16612e2183611ff5565b73ffffffffffffffffffffffffffffffffffffffff16145b5b90509392505050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603612eb3575f6040517f64a0ae92000000000000000000000000000000000000000000000000000000008152600401612eaa9190613127565b60405180910390fd5b5f612ebf83835f612047565b90505f73ffffffffffffffffffffffffffffffffffffffff168173ffffffffffffffffffffffffffffffffffffffff1614612f31575f6040517f73c6ac6e000000000000000000000000000000000000000000000000000000008152600401612f289190613127565b60405180910390fd5b505050565b5f604051905090565b5f5ffd5b5f5ffd5b5f7fffffffff0000000000000000000000000000000000000000000000000000000082169050919050565b612f7b81612f47565b8114612f85575f5ffd5b50565b5f81359050612f9681612f72565b92915050565b5f60208284031215612fb157612fb0612f3f565b5b5f612fbe84828501612f88565b91505092915050565b5f8115159050919050565b612fdb81612fc7565b82525050565b5f602082019050612ff45f830184612fd2565b92915050565b5f81519050919050565b5f82825260208201905092915050565b8281835e5f83830152505050565b5f601f19601f8301169050919050565b5f61303c82612ffa565b6130468185613004565b9350613056818560208601613014565b61305f81613022565b840191505092915050565b5f6020820190508181035f8301526130828184613032565b905092915050565b5f819050919050565b61309c8161308a565b81146130a6575f5ffd5b50565b5f813590506130b781613093565b92915050565b5f602082840312156130d2576130d1612f3f565b5b5f6130df848285016130a9565b91505092915050565b5f73ffffffffffffffffffffffffffffffffffffffff82169050919050565b5f613111826130e8565b9050919050565b61312181613107565b82525050565b5f60208201905061313a5f830184613118565b92915050565b61314981613107565b8114613153575f5ffd5b50565b5f8135905061316481613140565b92915050565b5f5f604083850312156131805761317f612f3f565b5b5f61318d85828601613156565b925050602061319e858286016130a9565b9150509250929050565b5f602082840312156131bd576131bc612f3f565b5b5f6131ca84828501613156565b91505092915050565b6131dc8161308a565b82525050565b5f6020820190506131f55f8301846131d3565b92915050565b5f5f5f6060848603121561321257613211612f3f565b5b5f61321f86828701613156565b935050602061323086828701613156565b9250506040613241868287016130a9565b9150509250925092565b5f5ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b61328582613022565b810181811067ffffffffffffffff821117156132a4576132a361324f565b5b80604052505050565b5f6132b6612f36565b90506132c2828261327c565b919050565b5f67ffffffffffffffff8211156132e1576132e061324f565b5b602082029050602081019050919050565b5f5ffd5b5f613308613303846132c7565b6132ad565b9050808382526020820190506020840283018581111561332b5761332a6132f2565b5b835b8181101561335457806133408882613156565b84526020840193505060208101905061332d565b5050509392505050565b5f82601f8301126133725761337161324b565b5b81356133828482602086016132f6565b91505092915050565b5f67ffffffffffffffff8211156133a5576133a461324f565b5b602082029050602081019050919050565b5f6133c86133c38461338b565b6132ad565b905080838252602082019050602084028301858111156133eb576133ea6132f2565b5b835b81811015613414578061340088826130a9565b8452602084019350506020810190506133ed565b5050509392505050565b5f82601f8301126134325761343161324b565b5b81356134428482602086016133b6565b91505092915050565b5f5f6040838503121561346157613460612f3f565b5b5f83013567ffffffffffffffff81111561347e5761347d612f43565b5b61348a8582860161335e565b925050602083013567ffffffffffffffff8111156134ab576134aa612f43565b5b6134b78582860161341e565b9150509250929050565b6134ca81612fc7565b81146134d4575f5ffd5b50565b5f813590506134e5816134c1565b92915050565b5f5f6040838503121561350157613500612f3f565b5b5f61350e85828601613156565b925050602061351f858286016134d7565b9150509250929050565b5f5ffd5b5f67ffffffffffffffff8211156135475761354661324f565b5b61355082613022565b9050602081019050919050565b828183375f83830152505050565b5f61357d6135788461352d565b6132ad565b90508281526020810184848401111561359957613598613529565b5b6135a484828561355d565b509392505050565b5f82601f8301126135c0576135bf61324b565b5b81356135d084826020860161356b565b91505092915050565b5f5f5f5f608085870312156135f1576135f0612f3f565b5b5f6135fe87828801613156565b945050602061360f87828801613156565b9350506040613620878288016130a9565b925050606085013567ffffffffffffffff81111561364157613640612f43565b5b61364d878288016135ac565b91505092959194509250565b5f5f6040838503121561366f5761366e612f3f565b5b5f61367c85828601613156565b925050602061368d85828601613156565b9150509250929050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f60028204905060018216806136db57607f821691505b6020821081036136ee576136ed613697565b5b50919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b5f61372b8261308a565b91506137368361308a565b925082820390508181111561374e5761374d6136f4565b5b92915050565b5f6060820190506137675f830186613118565b61377460208301856131d3565b6137816040830184613118565b949350505050565b7f417272617973206c656e677468206d69736d61746368000000000000000000005f82015250565b5f6137bd601683613004565b91506137c882613789565b602082019050919050565b5f6020820190508181035f8301526137ea816137b1565b9050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52603260045260245ffd5b7f436f6e7472616374206e6f7420616c6c6f7765640000000000000000000000005f82015250565b5f613852601483613004565b915061385d8261381e565b602082019050919050565b5f6020820190508181035f83015261387f81613846565b9050919050565b7f4d617820636c61696d73206d7573742062652067726561746572207468616e205f8201527f3000000000000000000000000000000000000000000000000000000000000000602082015250565b5f6138e0602183613004565b91506138eb82613886565b604082019050919050565b5f6020820190508181035f83015261390d816138d4565b9050919050565b7f4d696e74206e6f742061637469766500000000000000000000000000000000005f82015250565b5f613948600f83613004565b915061395382613914565b602082019050919050565b5f6020820190508181035f8301526139758161393c565b9050919050565b7f4d617820737570706c79207265616368656400000000000000000000000000005f82015250565b5f6139b0601283613004565b91506139bb8261397c565b602082019050919050565b5f6020820190508181035f8301526139dd816139a4565b9050919050565b7f4d617820636c61696d73207065722077616c6c657420726561636865640000005f82015250565b5f613a18601d83613004565b9150613a23826139e4565b602082019050919050565b5f6020820190508181035f830152613a4581613a0c565b9050919050565b7f45524337323120636f6e7472616374206e6f7420616c6c6f77656400000000005f82015250565b5f613a80601b83613004565b9150613a8b82613a4c565b602082019050919050565b5f6020820190508181035f830152613aad81613a74565b9050919050565b7f596f7520646f206e6f74206f776e207468652073706563696669656420746f6b5f8201527f656e000000000000000000000000000000000000000000000000000000000000602082015250565b5f613b0e602283613004565b9150613b1982613ab4565b604082019050919050565b5f6020820190508181035f830152613b3b81613b02565b9050919050565b7f5468697320746f6b656e2068617320616c7265616479206265656e20757365645f8201527f20746f20636c61696d0000000000000000000000000000000000000000000000602082015250565b5f613b9c602983613004565b9150613ba782613b42565b604082019050919050565b5f6020820190508181035f830152613bc981613b90565b9050919050565b7f436f6e7472616374206e6f7420636f6e6669677572656420666f72206d696e745f8201527f696e670000000000000000000000000000000000000000000000000000000000602082015250565b5f613c2a602383613004565b9150613c3582613bd0565b604082019050919050565b5f6020820190508181035f830152613c5781613c1e565b9050919050565b7f4d617820636c61696d73207265616368656420666f72207468697320636f6e745f8201527f7261637400000000000000000000000000000000000000000000000000000000602082015250565b5f613cb8602483613004565b9150613cc382613c5e565b604082019050919050565b5f6020820190508181035f830152613ce581613cac565b9050919050565b5f613cf68261308a565b91507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8203613d2857613d276136f4565b5b600182019050919050565b5f606082019050613d465f830186613118565b613d536020830185613118565b613d6060408301846131d3565b949350505050565b7f4e6f206e657720746f6b656e7320746f20706c616365000000000000000000005f82015250565b5f613d9c601683613004565b9150613da782613d68565b602082019050919050565b5f6020820190508181035f830152613dc981613d90565b9050919050565b5f613dda8261308a565b9150613de58361308a565b9250828201905080821115613dfd57613dfc6136f4565b5b92915050565b5f604082019050613e165f830185613118565b613e2360208301846131d3565b9392505050565b5f81519050613e38816134c1565b92915050565b5f60208284031215613e5357613e52612f3f565b5b5f613e6084828501613e2a565b91505092915050565b7f5472616e73666572206661696c656400000000000000000000000000000000005f82015250565b5f613e9d600f83613004565b9150613ea882613e69565b602082019050919050565b5f6020820190508181035f830152613eca81613e91565b9050919050565b7f546f6b656e20646f6573206e6f742065786973740000000000000000000000005f82015250565b5f613f05601483613004565b9150613f1082613ed1565b602082019050919050565b5f6020820190508181035f830152613f3281613ef9565b9050919050565b5f67ffffffffffffffff821115613f5357613f5261324f565b5b613f5c82613022565b9050602081019050919050565b5f613f7b613f7684613f39565b6132ad565b905082815260208101848484011115613f9757613f96613529565b5b613fa2848285613014565b509392505050565b5f82601f830112613fbe57613fbd61324b565b5b8151613fce848260208601613f69565b91505092915050565b5f60208284031215613fec57613feb612f3f565b5b5f82015167ffffffffffffffff81111561400957614008612f43565b5b61401584828501613faa565b91505092915050565b5f81905092915050565b7f7b226e616d65223a2022476f62202300000000000000000000000000000000005f82015250565b5f61405c600f8361401e565b915061406782614028565b600f82019050919050565b5f61407c82612ffa565b614086818561401e565b9350614096818560208601613014565b80840191505092915050565b7f222c20226465736372697074696f6e223a20224f6e2d636861696e20476f62205f8201527f4e4654222c2022696d616765223a2022646174613a696d6167652f7376672b7860208201527f6d6c3b6261736536342c00000000000000000000000000000000000000000000604082015250565b5f614122604a8361401e565b915061412d826140a2565b604a82019050919050565b7f222c202261747472696275746573223a200000000000000000000000000000005f82015250565b5f61416c60118361401e565b915061417782614138565b601182019050919050565b7f7d000000000000000000000000000000000000000000000000000000000000005f82015250565b5f6141b660018361401e565b91506141c182614182565b600182019050919050565b5f6141d682614050565b91506141e28286614072565b91506141ed82614116565b91506141f98285614072565b915061420482614160565b91506142108284614072565b915061421b826141aa565b9150819050949350505050565b7f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c0000005f82015250565b5f61425c601d8361401e565b915061426782614228565b601d82019050919050565b5f61427c82614250565b91506142888284614072565b915081905092915050565b5f815190506142a181613140565b92915050565b5f602082840312156142bc576142bb612f3f565b5b5f6142c984828501614293565b91505092915050565b5f81519050919050565b5f82825260208201905092915050565b5f6142f6826142d2565b61430081856142dc565b9350614310818560208601613014565b61431981613022565b840191505092915050565b5f6080820190506143375f830187613118565b6143446020830186613118565b61435160408301856131d3565b818103606083015261436381846142ec565b905095945050505050565b5f8151905061437c81612f72565b92915050565b5f6020828403121561439757614396612f3f565b5b5f6143a48482850161436e565b91505092915050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601260045260245ffd5b5f6143e48261308a565b91506143ef8361308a565b92508282026143fd8161308a565b91508282048414831517614414576144136136f4565b5b5092915050565b5f6144258261308a565b91506144308361308a565b9250826144405761443f6143ad565b5b82820490509291505056fe4142434445464748494a4b4c4d4e4f505152535455565758595a6162636465666768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2fa2646970667358221220a1a1ef1fa1e49ce5f4a630c9f7171b6a85a54389e49df2b7ef3984564cf9c58d64736f6c634300081c0033

Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)

000000000000000000000000fe0a08926ea324ddae319a4843d8e7dabedbbd61000000000000000000000000000000000000000000000000000000000000006000000000000000000000000000000000000000000000000000000000000000e0000000000000000000000000000000000000000000000000000000000000000300000000000000000000000037ebd0c0515b946df88bd115a0233e3582b35883000000000000000000000000c29ee352c109f49927ccc92049290fcbde9a705d00000000000000000000000024d1d4306c62bf2e60eea3d5f0748f70249a08ba0000000000000000000000000000000000000000000000000000000000000003000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000010000000000000000000000000000000000000000000000000000000000000001

-----Decoded View---------------
Arg [0] : _dataSource (address): 0xfE0a08926ea324DDAE319A4843d8e7dabEdBbD61
Arg [1] : contractAddresses (address[]): 0x37EBD0C0515b946Df88BD115a0233E3582B35883,0xc29ee352C109f49927ccc92049290fcBDe9a705d,0x24D1d4306C62Bf2e60eEA3d5F0748F70249a08Ba
Arg [2] : maxClaimsPerContract_ (uint256[]): 1,1,1

-----Encoded View---------------
11 Constructor Arguments found :
Arg [0] : 000000000000000000000000fe0a08926ea324ddae319a4843d8e7dabedbbd61
Arg [1] : 0000000000000000000000000000000000000000000000000000000000000060
Arg [2] : 00000000000000000000000000000000000000000000000000000000000000e0
Arg [3] : 0000000000000000000000000000000000000000000000000000000000000003
Arg [4] : 00000000000000000000000037ebd0c0515b946df88bd115a0233e3582b35883
Arg [5] : 000000000000000000000000c29ee352c109f49927ccc92049290fcbde9a705d
Arg [6] : 00000000000000000000000024d1d4306c62bf2e60eea3d5f0748f70249a08ba
Arg [7] : 0000000000000000000000000000000000000000000000000000000000000003
Arg [8] : 0000000000000000000000000000000000000000000000000000000000000001
Arg [9] : 0000000000000000000000000000000000000000000000000000000000000001
Arg [10] : 0000000000000000000000000000000000000000000000000000000000000001


Deployed Bytecode Sourcemap

153550:7627:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;98821:305;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;99652:91;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;100824:158;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;100643:115;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;160695:273;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;153676:25;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;101493:588;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;153740:22;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;159641:607;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;153590:41;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;160976:198;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;159318:315;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;155662:1584;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;102152:134;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;154324:51;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;158736:194;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;99465:120;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;158136:379;;;:::i;:::-;;99190:213;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;116474:103;;;:::i;:::-;;155081:104;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;154213:55;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;115799:87;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;160256:431;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;99812:95;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;153921:54;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;158523:205;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;101054:146;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;102357:236;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;154153:53;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;157350:778;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;157254:88;;;:::i;:::-;;154079:65;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;154277:40;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;153799:49;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;158938:372;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;155342:145;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;101271:155;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;155495:159;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;155193:141;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;116732:220;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;98821:305;98923:4;98975:25;98960:40;;;:11;:40;;;;:105;;;;99032:33;99017:48;;;:11;:48;;;;98960:105;:158;;;;99082:36;99106:11;99082:23;:36::i;:::-;98960:158;98940:178;;98821:305;;;:::o;99652:91::-;99697:13;99730:5;99723:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;99652:91;:::o;100824:158::-;100891:7;100911:22;100925:7;100911:13;:22::i;:::-;;100953:21;100966:7;100953:12;:21::i;:::-;100946:28;;100824:158;;;:::o;100643:115::-;100715:35;100724:2;100728:7;100737:12;:10;:12::i;:::-;100715:8;:35::i;:::-;100643:115;;:::o;160695:273::-;160766:7;160786:15;160804:16;:24;160821:6;160804:24;;;;;;;;;;;;;;;;160786:42;;160854:21;;160843:7;:32;160839:73;;160899:1;160892:8;;;;;160839:73;160953:7;160929:21;;:31;;;;:::i;:::-;160922:38;;;160695:273;;;;:::o;153676:25::-;;;;;;;;;;;;;:::o;101493:588::-;101602:1;101588:16;;:2;:16;;;101584:89;;101658:1;101628:33;;;;;;;;;;;:::i;:::-;;;;;;;;101584:89;101894:21;101918:34;101926:2;101930:7;101939:12;:10;:12::i;:::-;101918:7;:34::i;:::-;101894:58;;101984:4;101967:21;;:13;:21;;;101963:111;;102033:4;102039:7;102048:13;102012:50;;;;;;;;;;;;;:::i;:::-;;;;;;;;101963:111;101573:508;101493:588;;;:::o;153740:22::-;;;;;;;;;;;;;:::o;159641:607::-;115685:13;:11;:13::i;:::-;159846:9:::1;:16;159818:17;:24;:44;159796:116;;;;;;;;;;;;:::i;:::-;;;;;;;;;159938:9;159950:1;159938:13;;159933:308;159957:17;:24;159953:1;:28;159933:308;;;160011:22;:44;160034:17;160052:1;160034:20;;;;;;;;:::i;:::-;;;;;;;;160011:44;;;;;;;;;;;;;;;;;;;;;;;;;160003:77;;;;;;;;;;;;:::i;:::-;;;;;;;;;160118:1;160103:9;160113:1;160103:12;;;;;;;;:::i;:::-;;;;;;;;:16;160095:62;;;;;;;;;;;;:::i;:::-;;;;;;;;;160217:9;160227:1;160217:12;;;;;;;;:::i;:::-;;;;;;;;160172:20;:42;160193:17;160211:1;160193:20;;;;;;;;:::i;:::-;;;;;;;;160172:42;;;;;;;;;;;;;;;:57;;;;159983:3;;;;;;;159933:308;;;;159641:607:::0;;:::o;153590:41::-;153627:4;153590:41;:::o;160976:198::-;115685:13;:11;:13::i;:::-;161080:1:::1;161065:12;:16;161057:62;;;;;;;;;;;;:::i;:::-;;;;;;;;;161154:12;161130:21;:36;;;;160976:198:::0;:::o;159318:315::-;115685:13;:11;:13::i;:::-;159431:22:::1;:39;159454:15;159431:39;;;;;;;;;;;;;;;;;;;;;;;;;159423:72;;;;;;;;;;;;:::i;:::-;;;;;;;;;159526:1;159514:9;:13;159506:59;;;;;;;;;;;;:::i;:::-;;;;;;;;;159616:9;159576:20;:37;159597:15;159576:37;;;;;;;;;;;;;;;:49;;;;159318:315:::0;;:::o;155662:1584::-;155763:4;155749:18;;:10;;;;;;;;;;;:18;;;155741:46;;;;;;;;;;;;:::i;:::-;;;;;;;;;153627:4;155806:15;;:28;155798:59;;;;;;;;;;;;:::i;:::-;;;;;;;;;155952:21;;155921:16;:28;155938:10;155921:28;;;;;;;;;;;;;;;;:52;155913:94;;;;;;;;;;;;:::i;:::-;;;;;;;;;156111:22;:38;156134:14;156111:38;;;;;;;;;;;;;;;;;;;;;;;;;156103:78;;;;;;;;;;;;:::i;:::-;;;;;;;;;156281:51;156302:14;156318:13;156281:20;:51::i;:::-;156273:98;;;;;;;;;;;;:::i;:::-;;;;;;;;;156473:13;:29;156487:14;156473:29;;;;;;;;;;;;;;;:44;156503:13;156473:44;;;;;;;;;;;;;;;;;;;;;156472:45;156464:99;;;;;;;;;;;;:::i;:::-;;;;;;;;;156615:17;156635:20;:36;156656:14;156635:36;;;;;;;;;;;;;;;;156615:56;;156702:1;156690:9;:13;156682:61;;;;;;;;;;;;:::i;:::-;;;;;;;;;156799:9;156762:18;:34;156781:14;156762:34;;;;;;;;;;;;;;;;:46;156754:95;;;;;;;;;;;;:::i;:::-;;;;;;;;;156909:18;:34;156928:14;156909:34;;;;;;;;;;;;;;;;:36;;;;;;;;;:::i;:::-;;;;;;157011:16;:28;157028:10;157011:28;;;;;;;;;;;;;;;;:30;;;;;;;;;:::i;:::-;;;;;;157147:4;157100:13;:29;157114:14;157100:29;;;;;;;;;;;;;;;:44;157130:13;157100:44;;;;;;;;;;;;:51;;;;;;;;;;;;;;;;;;157172:15;;:17;;;;;;;;;:::i;:::-;;;;;;157200:38;157210:10;157222:15;;157200:9;:38::i;:::-;155730:1516;155662:1584;;:::o;102152:134::-;102239:39;102256:4;102262:2;102266:7;102239:39;;;;;;;;;;;;:16;:39::i;:::-;102152:134;;;:::o;154324:51::-;;;;;;;;;;;;;;;;;:::o;158736:194::-;115685:13;:11;:13::i;:::-;158822:11:::1;158844:10;158822:33;;158866:3;:20;;;158895:4;158902:10;158914:7;158866:56;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;158811:119;158736:194:::0;;:::o;99465:120::-;99528:7;99555:22;99569:7;99555:13;:22::i;:::-;99548:29;;99465:120;;;:::o;158136:379::-;158175:19;158197:21;158207:10;158197:9;:21::i;:::-;158175:43;;158229:17;158263:14;:26;158278:10;158263:26;;;;;;;;;;;;;;;;158249:11;:40;;;;:::i;:::-;158229:60;;158322:1;158310:9;:13;158302:48;;;;;;;;;;;;:::i;:::-;;;;;;;;;158392:11;158363:14;:26;158378:10;158363:26;;;;;;;;;;;;;;;:40;;;;158423:9;158414:5;;:18;;;;;;;:::i;:::-;;;;;;;;158458:3;158449:5;;:12;158445:63;;158483:13;;;;;;;;;;158445:63;158164:351;;158136:379::o;99190:213::-;99253:7;99294:1;99277:19;;:5;:19;;;99273:89;;99347:1;99320:30;;;;;;;;;;;:::i;:::-;;;;;;;;99273:89;99379:9;:16;99389:5;99379:16;;;;;;;;;;;;;;;;99372:23;;99190:213;;;:::o;116474:103::-;115685:13;:11;:13::i;:::-;116539:30:::1;116566:1;116539:18;:30::i;:::-;116474:103::o:0;155081:104::-;115685:13;:11;:13::i;:::-;155166:11:::1;155153:10;;:24;;;;;;;;;;;;;;;;;;155081:104:::0;:::o;154213:55::-;;;;;;;;;;;;;;;;;:::o;115799:87::-;115845:7;115872:6;;;;;;;;;;;115865:13;;115799:87;:::o;160256:431::-;160330:7;160350:17;160370:20;:37;160391:15;160370:37;;;;;;;;;;;;;;;;160350:57;;160438:1;160426:9;:13;160418:61;;;;;;;;;;;;:::i;:::-;;;;;;;;;160500:21;160524:18;:35;160543:15;160524:35;;;;;;;;;;;;;;;;160500:59;;160591:9;160574:13;:26;160570:67;;160624:1;160617:8;;;;;;160570:67;160666:13;160654:9;:25;;;;:::i;:::-;160647:32;;;;160256:431;;;;:::o;99812:95::-;99859:13;99892:7;99885:14;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;99812:95;:::o;153921:54::-;;;;;;;;;;;;;;;;;;;;;;:::o;158523:205::-;115685:13;:11;:13::i;:::-;158612:12:::1;158634;158612:35;;158666:5;:14;;;158681:10;158693:6;158666:34;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;158658:62;;;;;;;;;;;;:::i;:::-;;;;;;;;;158601:127;158523:205:::0;;:::o;101054:146::-;101140:52;101159:12;:10;:12::i;:::-;101173:8;101183;101140:18;:52::i;:::-;101054:146;;:::o;102357:236::-;102471:31;102484:4;102490:2;102494:7;102471:12;:31::i;:::-;102513:72;102547:12;:10;:12::i;:::-;102561:4;102567:2;102571:7;102580:4;102513:33;:72::i;:::-;102357:236;;;;:::o;154153:53::-;;;;;;;;;;;;;;;;;:::o;157350:778::-;157415:13;157460:15;;157449:7;:26;;157441:59;;;;;;;;;;;;:::i;:::-;;;;;;;;;157513:17;157549:10;;;;;;;;;;;157533:37;;;157571:7;157533:46;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;157513:66;;157590:20;157629:10;;;;;;;;;;;157613:37;;;157651:7;157613:46;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;157590:69;;157672:17;157742:18;:7;:16;:18::i;:::-;157866:25;157886:3;157866:13;:25::i;:::-;157927:6;157692:257;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;157672:277;;158075:19;158089:4;158075:13;:19::i;:::-;157990:119;;;;;;;;:::i;:::-;;;;;;;;;;;;;157962:158;;;;;157350:778;;;:::o;157254:88::-;115685:13;:11;:13::i;:::-;157324:10:::1;;;;;;;;;;;157323:11;157310:10;;:24;;;;;;;;;;;;;;;;;;157254:88::o:0;154079:65::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;154277:40::-;;;;:::o;153799:49::-;;;;;;;;;;;;;;;;;:::o;158938:372::-;159036:4;159061:22;:38;159084:14;159061:38;;;;;;;;;;;;;;;;;;;;;;;;;159053:78;;;;;;;;;;;;:::i;:::-;;;;;;;;;159191:18;159220:14;159212:31;;;159244:13;159212:46;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;159191:67;;159291:10;159277:24;;:10;:24;;;159269:33;;;158938:372;;;;:::o;155342:145::-;115685:13;:11;:13::i;:::-;155474:5:::1;155432:22;:39;155455:15;155432:39;;;;;;;;;;;;;;;;:47;;;;;;;;;;;;;;;;;;155342:145:::0;:::o;101271:155::-;101359:4;101383:18;:25;101402:5;101383:25;;;;;;;;;;;;;;;:35;101409:8;101383:35;;;;;;;;;;;;;;;;;;;;;;;;;101376:42;;101271:155;;;;:::o;155495:159::-;155583:4;155607:13;:30;155621:15;155607:30;;;;;;;;;;;;;;;:39;155638:7;155607:39;;;;;;;;;;;;;;;;;;;;;155600:46;;155495:159;;;;:::o;155193:141::-;115685:13;:11;:13::i;:::-;155322:4:::1;155280:22;:39;155303:15;155280:39;;;;;;;;;;;;;;;;:46;;;;;;;;;;;;;;;;;;155193:141:::0;:::o;116732:220::-;115685:13;:11;:13::i;:::-;116837:1:::1;116817:22;;:8;:22;;::::0;116813:93:::1;;116891:1;116863:31;;;;;;;;;;;:::i;:::-;;;;;;;;116813:93;116916:28;116935:8;116916:18;:28::i;:::-;116732:220:::0;:::o;97419:148::-;97495:4;97534:25;97519:40;;;:11;:40;;;;97512:47;;97419:148;;;:::o;113875:247::-;113938:7;113958:13;113974:17;113983:7;113974:8;:17::i;:::-;113958:33;;114023:1;114006:19;;:5;:19;;;114002:90;;114072:7;114049:31;;;;;;;;;;;:::i;:::-;;;;;;;;114002:90;114109:5;114102:12;;;113875:247;;;:::o;103356:129::-;103426:7;103453:15;:24;103469:7;103453:24;;;;;;;;;;;;;;;;;;;;;103446:31;;103356:129;;;:::o;96316:98::-;96369:7;96396:10;96389:17;;96316:98;:::o;112107:122::-;112188:33;112197:2;112201:7;112210:4;112216;112188:8;:33::i;:::-;112107:122;;;:::o;106317:824::-;106403:7;106423:12;106438:17;106447:7;106438:8;:17::i;:::-;106423:32;;106534:1;106518:18;;:4;:18;;;106514:88;;106553:37;106570:4;106576;106582:7;106553:16;:37::i;:::-;106514:88;106665:1;106649:18;;:4;:18;;;106645:263;;106767:48;106784:1;106788:7;106805:1;106809:5;106767:8;:48::i;:::-;106880:1;106861:9;:15;106871:4;106861:15;;;;;;;;;;;;;;;;:20;;;;;;;;;;;106645:263;106938:1;106924:16;;:2;:16;;;106920:111;;107003:1;106986:9;:13;106996:2;106986:13;;;;;;;;;;;;;;;;:18;;;;;;;;;;;106920:111;107062:2;107043:7;:16;107051:7;107043:16;;;;;;;;;;;;:21;;;;;;;;;;;;;;;;;;107101:7;107097:2;107082:27;;107091:4;107082:27;;;;;;;;;;;;107129:4;107122:11;;;106317:824;;;;;:::o;115964:166::-;116035:12;:10;:12::i;:::-;116024:23;;:7;:5;:7::i;:::-;:23;;;116020:103;;116098:12;:10;:12::i;:::-;116071:40;;;;;;;;;;;:::i;:::-;;;;;;;;116020:103;115964:166::o;108175:102::-;108243:26;108253:2;108257:7;108243:26;;;;;;;;;;;;:9;:26::i;:::-;108175:102;;:::o;117112:191::-;117186:16;117205:6;;;;;;;;;;;117186:25;;117231:8;117222:6;;:17;;;;;;;;;;;;;;;;;;117286:8;117255:40;;117276:8;117255:40;;;;;;;;;;;;117175:128;117112:191;:::o;113314:318::-;113442:1;113422:22;;:8;:22;;;113418:93;;113490:8;113468:31;;;;;;;;;;;:::i;:::-;;;;;;;;113418:93;113559:8;113521:18;:25;113540:5;113521:25;;;;;;;;;;;;;;;:35;113547:8;113521:35;;;;;;;;;;;;;;;;:46;;;;;;;;;;;;;;;;;;113605:8;113583:41;;113598:5;113583:41;;;113615:8;113583:41;;;;;;:::i;:::-;;;;;;;;113314:318;;;:::o;94666:948::-;94870:1;94853:2;:14;;;:18;94849:758;;;94908:2;94892:36;;;94929:8;94939:4;94945:7;94954:4;94892:67;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;94888:708;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;95272:1;95255:6;:13;:18;95251:330;;95397:2;95361:39;;;;;;;;;;;:::i;:::-;;;;;;;;95251:330;95531:6;95525:13;95516:6;95512:2;95508:15;95501:38;94888:708;95017:41;;;95007:51;;;:6;:51;;;;95003:185;;95165:2;95129:39;;;;;;;;;;;:::i;:::-;;;;;;;;95003:185;94960:243;94849:758;94666:948;;;;;:::o;75757:650::-;75813:13;75864:14;75901:1;75881:17;75892:5;75881:10;:17::i;:::-;:21;75864:38;;75917:20;75951:6;75940:18;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;75917:41;;75973:11;76070:6;76066:2;76062:15;76054:6;76050:28;76043:35;;76107:254;76114:4;76107:254;;;76139:5;;;;;;;;76245:10;76240:2;76233:5;76229:14;76224:32;76219:3;76211:46;76303:2;76294:11;;;;;;:::i;:::-;;;;;76337:1;76328:5;:10;76107:254;76324:21;76107:254;76382:6;76375:13;;;;;75757:650;;;:::o;704:126::-;762:13;795:27;803:4;809:6;;;;;;;;;;;;;;;;;817:4;795:7;:27::i;:::-;788:34;;704:126;;;:::o;103118:117::-;103184:7;103211;:16;103219:7;103211:16;;;;;;;;;;;;;;;;;;;;;103204:23;;103118:117;;;:::o;112417:678::-;112579:9;:31;;;;112608:1;112592:18;;:4;:18;;;;112579:31;112575:471;;;112627:13;112643:22;112657:7;112643:13;:22::i;:::-;112627:38;;112812:1;112796:18;;:4;:18;;;;:35;;;;;112827:4;112818:13;;:5;:13;;;;112796:35;:69;;;;;112836:29;112853:5;112860:4;112836:16;:29::i;:::-;112835:30;112796:69;112792:144;;;112915:4;112893:27;;;;;;;;;;;:::i;:::-;;;;;;;;112792:144;112956:9;112952:83;;;113011:7;113007:2;112991:28;;113000:5;112991:28;;;;;;;;;;;;112952:83;112612:434;112575:471;113085:2;113058:15;:24;113074:7;113058:24;;;;;;;;;;;;:29;;;;;;;;;;;;;;;;;;112417:678;;;;:::o;104524:376::-;104637:38;104651:5;104658:7;104667;104637:13;:38::i;:::-;104632:261;;104713:1;104696:19;;:5;:19;;;104692:190;;104766:7;104743:31;;;;;;;;;;;:::i;:::-;;;;;;;;104692:190;104849:7;104858;104822:44;;;;;;;;;;;;:::i;:::-;;;;;;;;104632:261;104524:376;;;:::o;108504:210::-;108599:18;108605:2;108609:7;108599:5;:18::i;:::-;108628:78;108662:12;:10;:12::i;:::-;108684:1;108688:2;108692:7;108701:4;108628:33;:78::i;:::-;108504:210;;;:::o;69402:948::-;69455:7;69475:14;69492:1;69475:18;;69542:8;69533:5;:17;69529:106;;69580:8;69571:17;;;;;;:::i;:::-;;;;;69617:2;69607:12;;;;69529:106;69662:8;69653:5;:17;69649:106;;69700:8;69691:17;;;;;;:::i;:::-;;;;;69737:2;69727:12;;;;69649:106;69782:8;69773:5;:17;69769:106;;69820:8;69811:17;;;;;;:::i;:::-;;;;;69857:2;69847:12;;;;69769:106;69902:7;69893:5;:16;69889:103;;69939:7;69930:16;;;;;;:::i;:::-;;;;;69975:1;69965:11;;;;69889:103;70019:7;70010:5;:16;70006:103;;70056:7;70047:16;;;;;;:::i;:::-;;;;;70092:1;70082:11;;;;70006:103;70136:7;70127:5;:16;70123:103;;70173:7;70164:16;;;;;;:::i;:::-;;;;;70209:1;70199:11;;;;70123:103;70253:7;70244:5;:16;70240:68;;70291:1;70281:11;;;;70240:68;70336:6;70329:13;;;69402:948;;;:::o;1242:4109::-;1339:13;1591:1;1576:4;:11;:16;1572:31;;1594:9;;;;;;;;;;;;;;;;1572:31;2556:20;2579:11;:69;;2647:1;2642;2628:4;:11;2624:1;:15;;;;:::i;:::-;:19;;;;:::i;:::-;2623:25;;;;:::i;:::-;2579:69;;;2618:1;2613;2599:4;:11;:15;;;;:::i;:::-;2598:21;;;;:::i;:::-;2593:1;:27;;;;:::i;:::-;2579:69;2556:92;;2661:20;2695:12;2684:24;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;2661:47;;2860:1;2853:5;2849:13;2964:4;2956:6;2952:17;2998:4;3046;3040:11;3034:4;3030:22;3298:4;3290:6;3286:17;3341:8;3335:15;3381:4;3371:8;3364:22;3456:1286;3491:6;3482:7;3479:19;3456:1286;;;3597:1;3588:7;3584:15;3573:26;;3636:7;3630:14;4232:4;4224:5;4220:2;4216:14;4212:25;4202:8;4198:40;4192:47;4181:9;4173:67;4286:1;4275:9;4271:17;4258:30;;4378:4;4370:5;4366:2;4362:14;4358:25;4348:8;4344:40;4338:47;4327:9;4319:67;4432:1;4421:9;4417:17;4404:30;;4523:4;4515:5;4512:1;4508:13;4504:24;4494:8;4490:39;4484:46;4473:9;4465:66;4577:1;4566:9;4562:17;4549:30;;4660:4;4653:5;4649:16;4639:8;4635:31;4629:38;4618:9;4610:58;4714:1;4703:9;4699:17;4686:30;;3518:1224;3456:1286;;;4823:10;4813:8;4806:28;4853:11;4850:457;;;5038:1;5031:4;5025:11;5021:19;5063:1;5058:135;;;;5216:1;5211:81;;;;5014:278;;5058:135;5115:4;5111:1;5100:9;5096:17;5088:32;5169:4;5165:1;5154:9;5150:17;5142:32;5058:135;;5211:81;5268:4;5264:1;5253:9;5249:17;5241:32;5014:278;;4850:457;2746:2572;;;;;;5337:6;5330:13;;;;1242:4109;;;;;;:::o;103805:276::-;103908:4;103964:1;103945:21;;:7;:21;;;;:128;;;;;103993:7;103984:16;;:5;:16;;;:52;;;;104004:32;104021:5;104028:7;104004:16;:32::i;:::-;103984:52;:88;;;;104065:7;104040:32;;:21;104053:7;104040:12;:21::i;:::-;:32;;;103984:88;103945:128;103925:148;;103805:276;;;;;:::o;107477:335::-;107559:1;107545:16;;:2;:16;;;107541:89;;107615:1;107585:33;;;;;;;;;;;:::i;:::-;;;;;;;;107541:89;107640:21;107664:32;107672:2;107676:7;107693:1;107664:7;:32::i;:::-;107640:56;;107736:1;107711:27;;:13;:27;;;107707:98;;107790:1;107762:31;;;;;;;;;;;:::i;:::-;;;;;;;;107707:98;107530:282;107477:335;;:::o;7:75:1:-;40:6;73:2;67:9;57:19;;7:75;:::o;88:117::-;197:1;194;187:12;211:117;320:1;317;310:12;334:149;370:7;410:66;403:5;399:78;388:89;;334:149;;;:::o;489:120::-;561:23;578:5;561:23;:::i;:::-;554:5;551:34;541:62;;599:1;596;589:12;541:62;489:120;:::o;615:137::-;660:5;698:6;685:20;676:29;;714:32;740:5;714:32;:::i;:::-;615:137;;;;:::o;758:327::-;816:6;865:2;853:9;844:7;840:23;836:32;833:119;;;871:79;;:::i;:::-;833:119;991:1;1016:52;1060:7;1051:6;1040:9;1036:22;1016:52;:::i;:::-;1006:62;;962:116;758:327;;;;:::o;1091:90::-;1125:7;1168:5;1161:13;1154:21;1143:32;;1091:90;;;:::o;1187:109::-;1268:21;1283:5;1268:21;:::i;:::-;1263:3;1256:34;1187:109;;:::o;1302:210::-;1389:4;1427:2;1416:9;1412:18;1404:26;;1440:65;1502:1;1491:9;1487:17;1478:6;1440:65;:::i;:::-;1302:210;;;;:::o;1518:99::-;1570:6;1604:5;1598:12;1588:22;;1518:99;;;:::o;1623:169::-;1707:11;1741:6;1736:3;1729:19;1781:4;1776:3;1772:14;1757:29;;1623:169;;;;:::o;1798:139::-;1887:6;1882:3;1877;1871:23;1928:1;1919:6;1914:3;1910:16;1903:27;1798:139;;;:::o;1943:102::-;1984:6;2035:2;2031:7;2026:2;2019:5;2015:14;2011:28;2001:38;;1943:102;;;:::o;2051:377::-;2139:3;2167:39;2200:5;2167:39;:::i;:::-;2222:71;2286:6;2281:3;2222:71;:::i;:::-;2215:78;;2302:65;2360:6;2355:3;2348:4;2341:5;2337:16;2302:65;:::i;:::-;2392:29;2414:6;2392:29;:::i;:::-;2387:3;2383:39;2376:46;;2143:285;2051:377;;;;:::o;2434:313::-;2547:4;2585:2;2574:9;2570:18;2562:26;;2634:9;2628:4;2624:20;2620:1;2609:9;2605:17;2598:47;2662:78;2735:4;2726:6;2662:78;:::i;:::-;2654:86;;2434:313;;;;:::o;2753:77::-;2790:7;2819:5;2808:16;;2753:77;;;:::o;2836:122::-;2909:24;2927:5;2909:24;:::i;:::-;2902:5;2899:35;2889:63;;2948:1;2945;2938:12;2889:63;2836:122;:::o;2964:139::-;3010:5;3048:6;3035:20;3026:29;;3064:33;3091:5;3064:33;:::i;:::-;2964:139;;;;:::o;3109:329::-;3168:6;3217:2;3205:9;3196:7;3192:23;3188:32;3185:119;;;3223:79;;:::i;:::-;3185:119;3343:1;3368:53;3413:7;3404:6;3393:9;3389:22;3368:53;:::i;:::-;3358:63;;3314:117;3109:329;;;;:::o;3444:126::-;3481:7;3521:42;3514:5;3510:54;3499:65;;3444:126;;;:::o;3576:96::-;3613:7;3642:24;3660:5;3642:24;:::i;:::-;3631:35;;3576:96;;;:::o;3678:118::-;3765:24;3783:5;3765:24;:::i;:::-;3760:3;3753:37;3678:118;;:::o;3802:222::-;3895:4;3933:2;3922:9;3918:18;3910:26;;3946:71;4014:1;4003:9;3999:17;3990:6;3946:71;:::i;:::-;3802:222;;;;:::o;4030:122::-;4103:24;4121:5;4103:24;:::i;:::-;4096:5;4093:35;4083:63;;4142:1;4139;4132:12;4083:63;4030:122;:::o;4158:139::-;4204:5;4242:6;4229:20;4220:29;;4258:33;4285:5;4258:33;:::i;:::-;4158:139;;;;:::o;4303:474::-;4371:6;4379;4428:2;4416:9;4407:7;4403:23;4399:32;4396:119;;;4434:79;;:::i;:::-;4396:119;4554:1;4579:53;4624:7;4615:6;4604:9;4600:22;4579:53;:::i;:::-;4569:63;;4525:117;4681:2;4707:53;4752:7;4743:6;4732:9;4728:22;4707:53;:::i;:::-;4697:63;;4652:118;4303:474;;;;;:::o;4783:329::-;4842:6;4891:2;4879:9;4870:7;4866:23;4862:32;4859:119;;;4897:79;;:::i;:::-;4859:119;5017:1;5042:53;5087:7;5078:6;5067:9;5063:22;5042:53;:::i;:::-;5032:63;;4988:117;4783:329;;;;:::o;5118:118::-;5205:24;5223:5;5205:24;:::i;:::-;5200:3;5193:37;5118:118;;:::o;5242:222::-;5335:4;5373:2;5362:9;5358:18;5350:26;;5386:71;5454:1;5443:9;5439:17;5430:6;5386:71;:::i;:::-;5242:222;;;;:::o;5470:619::-;5547:6;5555;5563;5612:2;5600:9;5591:7;5587:23;5583:32;5580:119;;;5618:79;;:::i;:::-;5580:119;5738:1;5763:53;5808:7;5799:6;5788:9;5784:22;5763:53;:::i;:::-;5753:63;;5709:117;5865:2;5891:53;5936:7;5927:6;5916:9;5912:22;5891:53;:::i;:::-;5881:63;;5836:118;5993:2;6019:53;6064:7;6055:6;6044:9;6040:22;6019:53;:::i;:::-;6009:63;;5964:118;5470:619;;;;;:::o;6095:117::-;6204:1;6201;6194:12;6218:180;6266:77;6263:1;6256:88;6363:4;6360:1;6353:15;6387:4;6384:1;6377:15;6404:281;6487:27;6509:4;6487:27;:::i;:::-;6479:6;6475:40;6617:6;6605:10;6602:22;6581:18;6569:10;6566:34;6563:62;6560:88;;;6628:18;;:::i;:::-;6560:88;6668:10;6664:2;6657:22;6447:238;6404:281;;:::o;6691:129::-;6725:6;6752:20;;:::i;:::-;6742:30;;6781:33;6809:4;6801:6;6781:33;:::i;:::-;6691:129;;;:::o;6826:311::-;6903:4;6993:18;6985:6;6982:30;6979:56;;;7015:18;;:::i;:::-;6979:56;7065:4;7057:6;7053:17;7045:25;;7125:4;7119;7115:15;7107:23;;6826:311;;;:::o;7143:117::-;7252:1;7249;7242:12;7283:710;7379:5;7404:81;7420:64;7477:6;7420:64;:::i;:::-;7404:81;:::i;:::-;7395:90;;7505:5;7534:6;7527:5;7520:21;7568:4;7561:5;7557:16;7550:23;;7621:4;7613:6;7609:17;7601:6;7597:30;7650:3;7642:6;7639:15;7636:122;;;7669:79;;:::i;:::-;7636:122;7784:6;7767:220;7801:6;7796:3;7793:15;7767:220;;;7876:3;7905:37;7938:3;7926:10;7905:37;:::i;:::-;7900:3;7893:50;7972:4;7967:3;7963:14;7956:21;;7843:144;7827:4;7822:3;7818:14;7811:21;;7767:220;;;7771:21;7385:608;;7283:710;;;;;:::o;8016:370::-;8087:5;8136:3;8129:4;8121:6;8117:17;8113:27;8103:122;;8144:79;;:::i;:::-;8103:122;8261:6;8248:20;8286:94;8376:3;8368:6;8361:4;8353:6;8349:17;8286:94;:::i;:::-;8277:103;;8093:293;8016:370;;;;:::o;8392:311::-;8469:4;8559:18;8551:6;8548:30;8545:56;;;8581:18;;:::i;:::-;8545:56;8631:4;8623:6;8619:17;8611:25;;8691:4;8685;8681:15;8673:23;;8392:311;;;:::o;8726:710::-;8822:5;8847:81;8863:64;8920:6;8863:64;:::i;:::-;8847:81;:::i;:::-;8838:90;;8948:5;8977:6;8970:5;8963:21;9011:4;9004:5;9000:16;8993:23;;9064:4;9056:6;9052:17;9044:6;9040:30;9093:3;9085:6;9082:15;9079:122;;;9112:79;;:::i;:::-;9079:122;9227:6;9210:220;9244:6;9239:3;9236:15;9210:220;;;9319:3;9348:37;9381:3;9369:10;9348:37;:::i;:::-;9343:3;9336:50;9415:4;9410:3;9406:14;9399:21;;9286:144;9270:4;9265:3;9261:14;9254:21;;9210:220;;;9214:21;8828:608;;8726:710;;;;;:::o;9459:370::-;9530:5;9579:3;9572:4;9564:6;9560:17;9556:27;9546:122;;9587:79;;:::i;:::-;9546:122;9704:6;9691:20;9729:94;9819:3;9811:6;9804:4;9796:6;9792:17;9729:94;:::i;:::-;9720:103;;9536:293;9459:370;;;;:::o;9835:894::-;9953:6;9961;10010:2;9998:9;9989:7;9985:23;9981:32;9978:119;;;10016:79;;:::i;:::-;9978:119;10164:1;10153:9;10149:17;10136:31;10194:18;10186:6;10183:30;10180:117;;;10216:79;;:::i;:::-;10180:117;10321:78;10391:7;10382:6;10371:9;10367:22;10321:78;:::i;:::-;10311:88;;10107:302;10476:2;10465:9;10461:18;10448:32;10507:18;10499:6;10496:30;10493:117;;;10529:79;;:::i;:::-;10493:117;10634:78;10704:7;10695:6;10684:9;10680:22;10634:78;:::i;:::-;10624:88;;10419:303;9835:894;;;;;:::o;10735:116::-;10805:21;10820:5;10805:21;:::i;:::-;10798:5;10795:32;10785:60;;10841:1;10838;10831:12;10785:60;10735:116;:::o;10857:133::-;10900:5;10938:6;10925:20;10916:29;;10954:30;10978:5;10954:30;:::i;:::-;10857:133;;;;:::o;10996:468::-;11061:6;11069;11118:2;11106:9;11097:7;11093:23;11089:32;11086:119;;;11124:79;;:::i;:::-;11086:119;11244:1;11269:53;11314:7;11305:6;11294:9;11290:22;11269:53;:::i;:::-;11259:63;;11215:117;11371:2;11397:50;11439:7;11430:6;11419:9;11415:22;11397:50;:::i;:::-;11387:60;;11342:115;10996:468;;;;;:::o;11470:117::-;11579:1;11576;11569:12;11593:307;11654:4;11744:18;11736:6;11733:30;11730:56;;;11766:18;;:::i;:::-;11730:56;11804:29;11826:6;11804:29;:::i;:::-;11796:37;;11888:4;11882;11878:15;11870:23;;11593:307;;;:::o;11906:148::-;12004:6;11999:3;11994;11981:30;12045:1;12036:6;12031:3;12027:16;12020:27;11906:148;;;:::o;12060:423::-;12137:5;12162:65;12178:48;12219:6;12178:48;:::i;:::-;12162:65;:::i;:::-;12153:74;;12250:6;12243:5;12236:21;12288:4;12281:5;12277:16;12326:3;12317:6;12312:3;12308:16;12305:25;12302:112;;;12333:79;;:::i;:::-;12302:112;12423:54;12470:6;12465:3;12460;12423:54;:::i;:::-;12143:340;12060:423;;;;;:::o;12502:338::-;12557:5;12606:3;12599:4;12591:6;12587:17;12583:27;12573:122;;12614:79;;:::i;:::-;12573:122;12731:6;12718:20;12756:78;12830:3;12822:6;12815:4;12807:6;12803:17;12756:78;:::i;:::-;12747:87;;12563:277;12502:338;;;;:::o;12846:943::-;12941:6;12949;12957;12965;13014:3;13002:9;12993:7;12989:23;12985:33;12982:120;;;13021:79;;:::i;:::-;12982:120;13141:1;13166:53;13211:7;13202:6;13191:9;13187:22;13166:53;:::i;:::-;13156:63;;13112:117;13268:2;13294:53;13339:7;13330:6;13319:9;13315:22;13294:53;:::i;:::-;13284:63;;13239:118;13396:2;13422:53;13467:7;13458:6;13447:9;13443:22;13422:53;:::i;:::-;13412:63;;13367:118;13552:2;13541:9;13537:18;13524:32;13583:18;13575:6;13572:30;13569:117;;;13605:79;;:::i;:::-;13569:117;13710:62;13764:7;13755:6;13744:9;13740:22;13710:62;:::i;:::-;13700:72;;13495:287;12846:943;;;;;;;:::o;13795:474::-;13863:6;13871;13920:2;13908:9;13899:7;13895:23;13891:32;13888:119;;;13926:79;;:::i;:::-;13888:119;14046:1;14071:53;14116:7;14107:6;14096:9;14092:22;14071:53;:::i;:::-;14061:63;;14017:117;14173:2;14199:53;14244:7;14235:6;14224:9;14220:22;14199:53;:::i;:::-;14189:63;;14144:118;13795:474;;;;;:::o;14275:180::-;14323:77;14320:1;14313:88;14420:4;14417:1;14410:15;14444:4;14441:1;14434:15;14461:320;14505:6;14542:1;14536:4;14532:12;14522:22;;14589:1;14583:4;14579:12;14610:18;14600:81;;14666:4;14658:6;14654:17;14644:27;;14600:81;14728:2;14720:6;14717:14;14697:18;14694:38;14691:84;;14747:18;;:::i;:::-;14691:84;14512:269;14461:320;;;:::o;14787:180::-;14835:77;14832:1;14825:88;14932:4;14929:1;14922:15;14956:4;14953:1;14946:15;14973:194;15013:4;15033:20;15051:1;15033:20;:::i;:::-;15028:25;;15067:20;15085:1;15067:20;:::i;:::-;15062:25;;15111:1;15108;15104:9;15096:17;;15135:1;15129:4;15126:11;15123:37;;;15140:18;;:::i;:::-;15123:37;14973:194;;;;:::o;15173:442::-;15322:4;15360:2;15349:9;15345:18;15337:26;;15373:71;15441:1;15430:9;15426:17;15417:6;15373:71;:::i;:::-;15454:72;15522:2;15511:9;15507:18;15498:6;15454:72;:::i;:::-;15536;15604:2;15593:9;15589:18;15580:6;15536:72;:::i;:::-;15173:442;;;;;;:::o;15621:172::-;15761:24;15757:1;15749:6;15745:14;15738:48;15621:172;:::o;15799:366::-;15941:3;15962:67;16026:2;16021:3;15962:67;:::i;:::-;15955:74;;16038:93;16127:3;16038:93;:::i;:::-;16156:2;16151:3;16147:12;16140:19;;15799:366;;;:::o;16171:419::-;16337:4;16375:2;16364:9;16360:18;16352:26;;16424:9;16418:4;16414:20;16410:1;16399:9;16395:17;16388:47;16452:131;16578:4;16452:131;:::i;:::-;16444:139;;16171:419;;;:::o;16596:180::-;16644:77;16641:1;16634:88;16741:4;16738:1;16731:15;16765:4;16762:1;16755:15;16782:170;16922:22;16918:1;16910:6;16906:14;16899:46;16782:170;:::o;16958:366::-;17100:3;17121:67;17185:2;17180:3;17121:67;:::i;:::-;17114:74;;17197:93;17286:3;17197:93;:::i;:::-;17315:2;17310:3;17306:12;17299:19;;16958:366;;;:::o;17330:419::-;17496:4;17534:2;17523:9;17519:18;17511:26;;17583:9;17577:4;17573:20;17569:1;17558:9;17554:17;17547:47;17611:131;17737:4;17611:131;:::i;:::-;17603:139;;17330:419;;;:::o;17755:220::-;17895:34;17891:1;17883:6;17879:14;17872:58;17964:3;17959:2;17951:6;17947:15;17940:28;17755:220;:::o;17981:366::-;18123:3;18144:67;18208:2;18203:3;18144:67;:::i;:::-;18137:74;;18220:93;18309:3;18220:93;:::i;:::-;18338:2;18333:3;18329:12;18322:19;;17981:366;;;:::o;18353:419::-;18519:4;18557:2;18546:9;18542:18;18534:26;;18606:9;18600:4;18596:20;18592:1;18581:9;18577:17;18570:47;18634:131;18760:4;18634:131;:::i;:::-;18626:139;;18353:419;;;:::o;18778:165::-;18918:17;18914:1;18906:6;18902:14;18895:41;18778:165;:::o;18949:366::-;19091:3;19112:67;19176:2;19171:3;19112:67;:::i;:::-;19105:74;;19188:93;19277:3;19188:93;:::i;:::-;19306:2;19301:3;19297:12;19290:19;;18949:366;;;:::o;19321:419::-;19487:4;19525:2;19514:9;19510:18;19502:26;;19574:9;19568:4;19564:20;19560:1;19549:9;19545:17;19538:47;19602:131;19728:4;19602:131;:::i;:::-;19594:139;;19321:419;;;:::o;19746:168::-;19886:20;19882:1;19874:6;19870:14;19863:44;19746:168;:::o;19920:366::-;20062:3;20083:67;20147:2;20142:3;20083:67;:::i;:::-;20076:74;;20159:93;20248:3;20159:93;:::i;:::-;20277:2;20272:3;20268:12;20261:19;;19920:366;;;:::o;20292:419::-;20458:4;20496:2;20485:9;20481:18;20473:26;;20545:9;20539:4;20535:20;20531:1;20520:9;20516:17;20509:47;20573:131;20699:4;20573:131;:::i;:::-;20565:139;;20292:419;;;:::o;20717:179::-;20857:31;20853:1;20845:6;20841:14;20834:55;20717:179;:::o;20902:366::-;21044:3;21065:67;21129:2;21124:3;21065:67;:::i;:::-;21058:74;;21141:93;21230:3;21141:93;:::i;:::-;21259:2;21254:3;21250:12;21243:19;;20902:366;;;:::o;21274:419::-;21440:4;21478:2;21467:9;21463:18;21455:26;;21527:9;21521:4;21517:20;21513:1;21502:9;21498:17;21491:47;21555:131;21681:4;21555:131;:::i;:::-;21547:139;;21274:419;;;:::o;21699:177::-;21839:29;21835:1;21827:6;21823:14;21816:53;21699:177;:::o;21882:366::-;22024:3;22045:67;22109:2;22104:3;22045:67;:::i;:::-;22038:74;;22121:93;22210:3;22121:93;:::i;:::-;22239:2;22234:3;22230:12;22223:19;;21882:366;;;:::o;22254:419::-;22420:4;22458:2;22447:9;22443:18;22435:26;;22507:9;22501:4;22497:20;22493:1;22482:9;22478:17;22471:47;22535:131;22661:4;22535:131;:::i;:::-;22527:139;;22254:419;;;:::o;22679:221::-;22819:34;22815:1;22807:6;22803:14;22796:58;22888:4;22883:2;22875:6;22871:15;22864:29;22679:221;:::o;22906:366::-;23048:3;23069:67;23133:2;23128:3;23069:67;:::i;:::-;23062:74;;23145:93;23234:3;23145:93;:::i;:::-;23263:2;23258:3;23254:12;23247:19;;22906:366;;;:::o;23278:419::-;23444:4;23482:2;23471:9;23467:18;23459:26;;23531:9;23525:4;23521:20;23517:1;23506:9;23502:17;23495:47;23559:131;23685:4;23559:131;:::i;:::-;23551:139;;23278:419;;;:::o;23703:228::-;23843:34;23839:1;23831:6;23827:14;23820:58;23912:11;23907:2;23899:6;23895:15;23888:36;23703:228;:::o;23937:366::-;24079:3;24100:67;24164:2;24159:3;24100:67;:::i;:::-;24093:74;;24176:93;24265:3;24176:93;:::i;:::-;24294:2;24289:3;24285:12;24278:19;;23937:366;;;:::o;24309:419::-;24475:4;24513:2;24502:9;24498:18;24490:26;;24562:9;24556:4;24552:20;24548:1;24537:9;24533:17;24526:47;24590:131;24716:4;24590:131;:::i;:::-;24582:139;;24309:419;;;:::o;24734:222::-;24874:34;24870:1;24862:6;24858:14;24851:58;24943:5;24938:2;24930:6;24926:15;24919:30;24734:222;:::o;24962:366::-;25104:3;25125:67;25189:2;25184:3;25125:67;:::i;:::-;25118:74;;25201:93;25290:3;25201:93;:::i;:::-;25319:2;25314:3;25310:12;25303:19;;24962:366;;;:::o;25334:419::-;25500:4;25538:2;25527:9;25523:18;25515:26;;25587:9;25581:4;25577:20;25573:1;25562:9;25558:17;25551:47;25615:131;25741:4;25615:131;:::i;:::-;25607:139;;25334:419;;;:::o;25759:223::-;25899:34;25895:1;25887:6;25883:14;25876:58;25968:6;25963:2;25955:6;25951:15;25944:31;25759:223;:::o;25988:366::-;26130:3;26151:67;26215:2;26210:3;26151:67;:::i;:::-;26144:74;;26227:93;26316:3;26227:93;:::i;:::-;26345:2;26340:3;26336:12;26329:19;;25988:366;;;:::o;26360:419::-;26526:4;26564:2;26553:9;26549:18;26541:26;;26613:9;26607:4;26603:20;26599:1;26588:9;26584:17;26577:47;26641:131;26767:4;26641:131;:::i;:::-;26633:139;;26360:419;;;:::o;26785:233::-;26824:3;26847:24;26865:5;26847:24;:::i;:::-;26838:33;;26893:66;26886:5;26883:77;26880:103;;26963:18;;:::i;:::-;26880:103;27010:1;27003:5;26999:13;26992:20;;26785:233;;;:::o;27024:442::-;27173:4;27211:2;27200:9;27196:18;27188:26;;27224:71;27292:1;27281:9;27277:17;27268:6;27224:71;:::i;:::-;27305:72;27373:2;27362:9;27358:18;27349:6;27305:72;:::i;:::-;27387;27455:2;27444:9;27440:18;27431:6;27387:72;:::i;:::-;27024:442;;;;;;:::o;27472:172::-;27612:24;27608:1;27600:6;27596:14;27589:48;27472:172;:::o;27650:366::-;27792:3;27813:67;27877:2;27872:3;27813:67;:::i;:::-;27806:74;;27889:93;27978:3;27889:93;:::i;:::-;28007:2;28002:3;27998:12;27991:19;;27650:366;;;:::o;28022:419::-;28188:4;28226:2;28215:9;28211:18;28203:26;;28275:9;28269:4;28265:20;28261:1;28250:9;28246:17;28239:47;28303:131;28429:4;28303:131;:::i;:::-;28295:139;;28022:419;;;:::o;28447:191::-;28487:3;28506:20;28524:1;28506:20;:::i;:::-;28501:25;;28540:20;28558:1;28540:20;:::i;:::-;28535:25;;28583:1;28580;28576:9;28569:16;;28604:3;28601:1;28598:10;28595:36;;;28611:18;;:::i;:::-;28595:36;28447:191;;;;:::o;28644:332::-;28765:4;28803:2;28792:9;28788:18;28780:26;;28816:71;28884:1;28873:9;28869:17;28860:6;28816:71;:::i;:::-;28897:72;28965:2;28954:9;28950:18;28941:6;28897:72;:::i;:::-;28644:332;;;;;:::o;28982:137::-;29036:5;29067:6;29061:13;29052:22;;29083:30;29107:5;29083:30;:::i;:::-;28982:137;;;;:::o;29125:345::-;29192:6;29241:2;29229:9;29220:7;29216:23;29212:32;29209:119;;;29247:79;;:::i;:::-;29209:119;29367:1;29392:61;29445:7;29436:6;29425:9;29421:22;29392:61;:::i;:::-;29382:71;;29338:125;29125:345;;;;:::o;29476:165::-;29616:17;29612:1;29604:6;29600:14;29593:41;29476:165;:::o;29647:366::-;29789:3;29810:67;29874:2;29869:3;29810:67;:::i;:::-;29803:74;;29886:93;29975:3;29886:93;:::i;:::-;30004:2;29999:3;29995:12;29988:19;;29647:366;;;:::o;30019:419::-;30185:4;30223:2;30212:9;30208:18;30200:26;;30272:9;30266:4;30262:20;30258:1;30247:9;30243:17;30236:47;30300:131;30426:4;30300:131;:::i;:::-;30292:139;;30019:419;;;:::o;30444:170::-;30584:22;30580:1;30572:6;30568:14;30561:46;30444:170;:::o;30620:366::-;30762:3;30783:67;30847:2;30842:3;30783:67;:::i;:::-;30776:74;;30859:93;30948:3;30859:93;:::i;:::-;30977:2;30972:3;30968:12;30961:19;;30620:366;;;:::o;30992:419::-;31158:4;31196:2;31185:9;31181:18;31173:26;;31245:9;31239:4;31235:20;31231:1;31220:9;31216:17;31209:47;31273:131;31399:4;31273:131;:::i;:::-;31265:139;;30992:419;;;:::o;31417:308::-;31479:4;31569:18;31561:6;31558:30;31555:56;;;31591:18;;:::i;:::-;31555:56;31629:29;31651:6;31629:29;:::i;:::-;31621:37;;31713:4;31707;31703:15;31695:23;;31417:308;;;:::o;31731:434::-;31820:5;31845:66;31861:49;31903:6;31861:49;:::i;:::-;31845:66;:::i;:::-;31836:75;;31934:6;31927:5;31920:21;31972:4;31965:5;31961:16;32010:3;32001:6;31996:3;31992:16;31989:25;31986:112;;;32017:79;;:::i;:::-;31986:112;32107:52;32152:6;32147:3;32142;32107:52;:::i;:::-;31826:339;31731:434;;;;;:::o;32185:355::-;32252:5;32301:3;32294:4;32286:6;32282:17;32278:27;32268:122;;32309:79;;:::i;:::-;32268:122;32419:6;32413:13;32444:90;32530:3;32522:6;32515:4;32507:6;32503:17;32444:90;:::i;:::-;32435:99;;32258:282;32185:355;;;;:::o;32546:524::-;32626:6;32675:2;32663:9;32654:7;32650:23;32646:32;32643:119;;;32681:79;;:::i;:::-;32643:119;32822:1;32811:9;32807:17;32801:24;32852:18;32844:6;32841:30;32838:117;;;32874:79;;:::i;:::-;32838:117;32979:74;33045:7;33036:6;33025:9;33021:22;32979:74;:::i;:::-;32969:84;;32772:291;32546:524;;;;:::o;33076:148::-;33178:11;33215:3;33200:18;;33076:148;;;;:::o;33230:214::-;33370:66;33366:1;33358:6;33354:14;33347:90;33230:214;:::o;33450:402::-;33610:3;33631:85;33713:2;33708:3;33631:85;:::i;:::-;33624:92;;33725:93;33814:3;33725:93;:::i;:::-;33843:2;33838:3;33834:12;33827:19;;33450:402;;;:::o;33858:390::-;33964:3;33992:39;34025:5;33992:39;:::i;:::-;34047:89;34129:6;34124:3;34047:89;:::i;:::-;34040:96;;34145:65;34203:6;34198:3;34191:4;34184:5;34180:16;34145:65;:::i;:::-;34235:6;34230:3;34226:16;34219:23;;33968:280;33858:390;;;;:::o;34254:362::-;34394:66;34390:1;34382:6;34378:14;34371:90;34495:66;34490:2;34482:6;34478:15;34471:91;34596:12;34591:2;34583:6;34579:15;34572:37;34254:362;:::o;34622:402::-;34782:3;34803:85;34885:2;34880:3;34803:85;:::i;:::-;34796:92;;34897:93;34986:3;34897:93;:::i;:::-;35015:2;35010:3;35006:12;34999:19;;34622:402;;;:::o;35030:214::-;35170:66;35166:1;35158:6;35154:14;35147:90;35030:214;:::o;35250:402::-;35410:3;35431:85;35513:2;35508:3;35431:85;:::i;:::-;35424:92;;35525:93;35614:3;35525:93;:::i;:::-;35643:2;35638:3;35634:12;35627:19;;35250:402;;;:::o;35658:143::-;35794:3;35790:1;35782:6;35778:14;35771:27;35658:143;:::o;35803:384::-;35963:3;35980:84;36062:1;36057:3;35980:84;:::i;:::-;35973:91;;36069:93;36158:3;36069:93;:::i;:::-;36183:1;36178:3;36174:11;36167:18;;35803:384;;;:::o;36189:1623::-;36821:3;36839:148;36983:3;36839:148;:::i;:::-;36832:155;;37000:95;37091:3;37082:6;37000:95;:::i;:::-;36993:102;;37108:148;37252:3;37108:148;:::i;:::-;37101:155;;37269:95;37360:3;37351:6;37269:95;:::i;:::-;37262:102;;37377:148;37521:3;37377:148;:::i;:::-;37370:155;;37538:95;37629:3;37620:6;37538:95;:::i;:::-;37531:102;;37646:148;37790:3;37646:148;:::i;:::-;37639:155;;37807:3;37800:10;;36189:1623;;;;;;:::o;37814:171::-;37950:31;37946:1;37938:6;37934:14;37927:55;37814:171;:::o;37987:386::-;38147:3;38164:85;38246:2;38241:3;38164:85;:::i;:::-;38157:92;;38254:93;38343:3;38254:93;:::i;:::-;38368:2;38363:3;38359:12;38352:19;;37987:386;;;:::o;38375:525::-;38608:3;38626:148;38770:3;38626:148;:::i;:::-;38619:155;;38787:95;38878:3;38869:6;38787:95;:::i;:::-;38780:102;;38895:3;38888:10;;38375:525;;;;:::o;38902:131::-;38959:5;38986:6;38980:13;38971:22;;38998:33;39025:5;38998:33;:::i;:::-;38902:131;;;;:::o;39035:327::-;39105:6;39150:2;39138:9;39129:7;39125:23;39121:32;39118:119;;;39156:79;;:::i;:::-;39118:119;39268:1;39289:64;39345:7;39336:6;39325:9;39321:22;39289:64;:::i;:::-;39279:74;;39243:116;39035:327;;;;:::o;39364:90::-;39415:6;39445:5;39439:12;39429:22;;39364:90;;;:::o;39456:156::-;39539:11;39569:6;39564:3;39557:19;39605:4;39600:3;39596:14;39581:29;;39456:156;;;;:::o;39614:353::-;39700:3;39724:38;39756:5;39724:38;:::i;:::-;39774:70;39837:6;39832:3;39774:70;:::i;:::-;39767:77;;39849:65;39907:6;39902:3;39895:4;39888:5;39884:16;39849:65;:::i;:::-;39935:29;39957:6;39935:29;:::i;:::-;39930:3;39926:39;39919:46;;39704:263;39614:353;;;;:::o;39969:612::-;40164:4;40198:3;40187:9;40183:19;40175:27;;40208:71;40276:1;40265:9;40261:17;40252:6;40208:71;:::i;:::-;40285:72;40353:2;40342:9;40338:18;40329:6;40285:72;:::i;:::-;40363;40431:2;40420:9;40416:18;40407:6;40363:72;:::i;:::-;40478:9;40472:4;40468:20;40463:2;40452:9;40448:18;40441:48;40502:76;40573:4;40564:6;40502:76;:::i;:::-;40494:84;;39969:612;;;;;;;:::o;40583:129::-;40639:5;40666:6;40660:13;40651:22;;40678:32;40704:5;40678:32;:::i;:::-;40583:129;;;;:::o;40714:325::-;40783:6;40828:2;40816:9;40807:7;40803:23;40799:32;40796:119;;;40834:79;;:::i;:::-;40796:119;40946:1;40967:63;41022:7;41013:6;41002:9;40998:22;40967:63;:::i;:::-;40957:73;;40921:115;40714:325;;;;:::o;41041:164::-;41085:77;41082:1;41075:88;41178:4;41175:1;41168:15;41198:4;41195:1;41188:15;41207:362;41247:7;41266:20;41284:1;41266:20;:::i;:::-;41261:25;;41296:20;41314:1;41296:20;:::i;:::-;41291:25;;41347:1;41344;41340:9;41365:30;41383:11;41365:30;:::i;:::-;41354:41;;41524:1;41515:7;41511:15;41508:1;41505:22;41489:1;41482:9;41466:71;41447:119;;41546:18;;:::i;:::-;41447:119;41255:314;41207:362;;;;:::o;41571:165::-;41611:1;41624:20;41642:1;41624:20;:::i;:::-;41619:25;;41654:20;41672:1;41654:20;:::i;:::-;41649:25;;41689:1;41679:35;;41694:18;;:::i;:::-;41679:35;41732:1;41729;41725:9;41720:14;;41571:165;;;;:::o

Swarm Source

ipfs://a1a1ef1fa1e49ce5f4a630c9f7171b6a85a54389e49df2b7ef3984564cf9c58d
[ Download: CSV Export  ]
[ Download: CSV Export  ]

A token is a representation of an on-chain or off-chain asset. The token page shows information such as price, total supply, holders, transfers and social links. Learn more about this page in our Knowledge Base.