/**
 *Submitted for verification at apescan.io on 2025-08-27
*/

// SPDX-License-Identifier: MIT
// File: contracts/Address.sol


// OpenZeppelin Contracts (last updated v4.9.0) (utils/Address.sol)

pragma solidity ^0.8.1;

/**
 * @dev Collection of functions related to the address type
 */
library Address {
    /**
     * @dev Returns true if `account` is a contract.
     *
     * [IMPORTANT]
     * ====
     * It is unsafe to assume that an address for which this function returns
     * false is an externally-owned account (EOA) and not a contract.
     *
     * Among others, `isContract` will return false for the following
     * types of addresses:
     *
     *  - an externally-owned account
     *  - a contract in construction
     *  - an address where a contract will be created
     *  - an address where a contract lived, but was destroyed
     *
     * Furthermore, `isContract` will also return true if the target contract within
     * the same transaction is already scheduled for destruction by `SELFDESTRUCT`,
     * which only has an effect at the end of a transaction.
     * ====
     *
     * [IMPORTANT]
     * ====
     * You shouldn't rely on `isContract` to protect against flash loan attacks!
     *
     * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets
     * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract
     * constructor.
     * ====
     */
    function isContract(address account) internal view returns (bool) {
        // This method relies on extcodesize/address.code.length, which returns 0
        // for contracts in construction, since the code is only stored at the end
        // of the constructor execution.

        return account.code.length > 0;
    }

    /**
     * @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.0/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
     */
    function sendValue(address payable recipient, uint256 amount) internal {
        require(address(this).balance >= amount, "Address: insufficient balance");

        (bool success, ) = recipient.call{value: amount}("");
        require(success, "Address: unable to send value, recipient may have reverted");
    }

    /**
     * @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, it is bubbled up by this
     * function (like regular Solidity function calls).
     *
     * 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.
     *
     * _Available since v3.1._
     */
    function functionCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, "Address: low-level call failed");
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with
     * `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCall(
        address target,
        bytes memory data,
        string memory errorMessage
    ) internal returns (bytes memory) {
        return functionCallWithValue(target, data, 0, errorMessage);
    }

    /**
     * @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`.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {
        return functionCallWithValue(target, data, value, "Address: low-level call with value failed");
    }

    /**
     * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but
     * with `errorMessage` as a fallback revert reason when `target` reverts.
     *
     * _Available since v3.1._
     */
    function functionCallWithValue(
        address target,
        bytes memory data,
        uint256 value,
        string memory errorMessage
    ) internal returns (bytes memory) {
        require(address(this).balance >= value, "Address: insufficient balance for call");
        (bool success, bytes memory returndata) = target.call{value: value}(data);
        return verifyCallResultFromTarget(target, success, returndata, errorMessage);
    }

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a static call.
     *
     * _Available since v3.3._
     */
    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
        return functionStaticCall(target, data, "Address: low-level static call failed");
    }

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

    /**
     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
     * but performing a delegate call.
     *
     * _Available since v3.4._
     */
    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
        return functionDelegateCall(target, data, "Address: low-level delegate call failed");
    }

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

    /**
     * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling
     * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.
     *
     * _Available since v4.8._
     */
    function verifyCallResultFromTarget(
        address target,
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal view returns (bytes memory) {
        if (success) {
            if (returndata.length == 0) {
                // only check isContract if the call was successful and the return data is empty
                // otherwise we already know that it was a contract
                require(isContract(target), "Address: call to non-contract");
            }
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    /**
     * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the
     * revert reason or using the provided one.
     *
     * _Available since v4.3._
     */
    function verifyCallResult(
        bool success,
        bytes memory returndata,
        string memory errorMessage
    ) internal pure returns (bytes memory) {
        if (success) {
            return returndata;
        } else {
            _revert(returndata, errorMessage);
        }
    }

    function _revert(bytes memory returndata, string memory errorMessage) 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
            /// @solidity memory-safe-assembly
            assembly {
                let returndata_size := mload(returndata)
                revert(add(32, returndata), returndata_size)
            }
        } else {
            revert(errorMessage);
        }
    }
}

// File: contracts/MerkleProof.sol


// OpenZeppelin Contracts (last updated v4.9.2) (utils/cryptography/MerkleProof.sol)

pragma solidity ^0.8.0;

/**
 * @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.
 */
library MerkleProof {
    /**
     * @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.
     */
    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
        return processProof(proof, leaf) == root;
    }

    /**
     * @dev Calldata version of {verify}
     *
     * _Available since v4.7._
     */
    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 leafs & pre-images are assumed to be sorted.
     *
     * _Available since v4.4._
     */
    function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(computedHash, proof[i]);
        }
        return computedHash;
    }

    /**
     * @dev Calldata version of {processProof}
     *
     * _Available since v4.7._
     */
    function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
        bytes32 computedHash = leaf;
        for (uint256 i = 0; i < proof.length; i++) {
            computedHash = _hashPair(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}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    function multiProofVerify(
        bytes32[] memory proof,
        bool[] memory proofFlags,
        bytes32 root,
        bytes32[] memory leaves
    ) internal pure returns (bool) {
        return processMultiProof(proof, proofFlags, leaves) == root;
    }

    /**
     * @dev Calldata version of {multiProofVerify}
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    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.
     *
     * 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).
     *
     * _Available since v4.7._
     */
    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 proofLen = proof.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proofLen - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // 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[](totalHashes);
        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 < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            require(proofPos == proofLen, "MerkleProof: invalid multiproof");
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    /**
     * @dev Calldata version of {processMultiProof}.
     *
     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.
     *
     * _Available since v4.7._
     */
    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 proofLen = proof.length;
        uint256 totalHashes = proofFlags.length;

        // Check proof validity.
        require(leavesLen + proofLen - 1 == totalHashes, "MerkleProof: invalid multiproof");

        // 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[](totalHashes);
        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 < totalHashes; i++) {
            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
            bytes32 b = proofFlags[i]
                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                : proof[proofPos++];
            hashes[i] = _hashPair(a, b);
        }

        if (totalHashes > 0) {
            require(proofPos == proofLen, "MerkleProof: invalid multiproof");
            unchecked {
                return hashes[totalHashes - 1];
            }
        } else if (leavesLen > 0) {
            return leaves[0];
        } else {
            return proof[0];
        }
    }

    function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {
        return a < b ? _efficientHash(a, b) : _efficientHash(b, a);
    }

    function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
        /// @solidity memory-safe-assembly
        assembly {
            mstore(0x00, a)
            mstore(0x20, b)
            value := keccak256(0x00, 0x40)
        }
    }
}

// File: contracts/IERC721Receiver.sol


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

pragma solidity >=0.5.0;

/**
 * @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: contracts/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: contracts/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: contracts/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: contracts/math/Math.sol


// OpenZeppelin Contracts (last updated v5.3.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 Return the 512-bit addition of two uint256.
     *
     * The result is stored in two 256 variables such that sum = high * 2²⁵⁶ + low.
     */
    function add512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
        assembly ("memory-safe") {
            low := add(a, b)
            high := lt(low, a)
        }
    }

    /**
     * @dev Return the 512-bit multiplication of two uint256.
     *
     * The result is stored in two 256 variables such that product = high * 2²⁵⁶ + low.
     */
    function mul512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
        // 512-bit multiply [high low] = 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 = high * 2²⁵⁶ + low.
        assembly ("memory-safe") {
            let mm := mulmod(a, b, not(0))
            low := mul(a, b)
            high := sub(sub(mm, low), lt(mm, low))
        }
    }

    /**
     * @dev Returns the addition of two unsigned integers, with a success flag (no overflow).
     */
    function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a + b;
            success = c >= a;
            result = c * SafeCast.toUint(success);
        }
    }

    /**
     * @dev Returns the subtraction of two unsigned integers, with a success flag (no overflow).
     */
    function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a - b;
            success = c <= a;
            result = c * SafeCast.toUint(success);
        }
    }

    /**
     * @dev Returns the multiplication of two unsigned integers, with a success flag (no overflow).
     */
    function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            uint256 c = a * b;
            assembly ("memory-safe") {
                // Only true when the multiplication doesn't overflow
                // (c / a == b) || (a == 0)
                success := or(eq(div(c, a), b), iszero(a))
            }
            // equivalent to: success ? c : 0
            result = c * SafeCast.toUint(success);
        }
    }

    /**
     * @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 {
            success = b > 0;
            assembly ("memory-safe") {
                // The `DIV` opcode returns zero when the denominator is 0.
                result := div(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 {
            success = b > 0;
            assembly ("memory-safe") {
                // The `MOD` opcode returns zero when the denominator is 0.
                result := mod(a, b)
            }
        }
    }

    /**
     * @dev Unsigned saturating addition, bounds to `2²⁵⁶ - 1` instead of overflowing.
     */
    function saturatingAdd(uint256 a, uint256 b) internal pure returns (uint256) {
        (bool success, uint256 result) = tryAdd(a, b);
        return ternary(success, result, type(uint256).max);
    }

    /**
     * @dev Unsigned saturating subtraction, bounds to zero instead of overflowing.
     */
    function saturatingSub(uint256 a, uint256 b) internal pure returns (uint256) {
        (, uint256 result) = trySub(a, b);
        return result;
    }

    /**
     * @dev Unsigned saturating multiplication, bounds to `2²⁵⁶ - 1` instead of overflowing.
     */
    function saturatingMul(uint256 a, uint256 b) internal pure returns (uint256) {
        (bool success, uint256 result) = tryMul(a, b);
        return ternary(success, result, type(uint256).max);
    }

    /**
     * @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 {
            (uint256 high, uint256 low) = mul512(x, y);

            // Handle non-overflow cases, 256 by 256 division.
            if (high == 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 low / denominator;
            }

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

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

            // Make division exact by subtracting the remainder from [high low].
            uint256 remainder;
            assembly ("memory-safe") {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

                // Subtract 256 bit number from 512 bit number.
                high := sub(high, gt(remainder, low))
                low := sub(low, 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 ("memory-safe") {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

                // Divide [high low] by twos.
                low := div(low, 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 high into low.
            low |= high * 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 high
            // is no longer required.
            result = low * 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 Calculates floor(x * y >> n) with full precision. Throws if result overflows a uint256.
     */
    function mulShr(uint256 x, uint256 y, uint8 n) internal pure returns (uint256 result) {
        unchecked {
            (uint256 high, uint256 low) = mul512(x, y);
            if (high >= 1 << n) {
                Panic.panic(Panic.UNDER_OVERFLOW);
            }
            return (high << (256 - n)) | (low >> n);
        }
    }

    /**
     * @dev Calculates x * y >> n with full precision, following the selected rounding direction.
     */
    function mulShr(uint256 x, uint256 y, uint8 n, Rounding rounding) internal pure returns (uint256) {
        return mulShr(x, y, n) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, 1 << n) > 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 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // If upper 8 bits of 16-bit half set, add 8 to result
        r |= SafeCast.toUint((x >> r) > 0xff) << 3;
        // If upper 4 bits of 8-bit half set, add 4 to result
        r |= SafeCast.toUint((x >> r) > 0xf) << 2;

        // Shifts value right by the current result and use it as an index into this lookup table:
        //
        // | x (4 bits) |  index  | table[index] = MSB position |
        // |------------|---------|-----------------------------|
        // |    0000    |    0    |        table[0] = 0         |
        // |    0001    |    1    |        table[1] = 0         |
        // |    0010    |    2    |        table[2] = 1         |
        // |    0011    |    3    |        table[3] = 1         |
        // |    0100    |    4    |        table[4] = 2         |
        // |    0101    |    5    |        table[5] = 2         |
        // |    0110    |    6    |        table[6] = 2         |
        // |    0111    |    7    |        table[7] = 2         |
        // |    1000    |    8    |        table[8] = 3         |
        // |    1001    |    9    |        table[9] = 3         |
        // |    1010    |   10    |        table[10] = 3        |
        // |    1011    |   11    |        table[11] = 3        |
        // |    1100    |   12    |        table[12] = 3        |
        // |    1101    |   13    |        table[13] = 3        |
        // |    1110    |   14    |        table[14] = 3        |
        // |    1111    |   15    |        table[15] = 3        |
        //
        // The lookup table is represented as a 32-byte value with the MSB positions for 0-15 in the last 16 bytes.
        assembly ("memory-safe") {
            r := or(r, byte(shr(r, x), 0x0000010102020202030303030303030300000000000000000000000000000000))
        }
    }

    /**
     * @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 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // Add 1 if upper 8 bits of 16-bit half set, and divide accumulated result by 8
        return (r >> 3) | SafeCast.toUint((x >> r) > 0xff);
    }

    /**
     * @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;
    }

    /**
     * @dev Counts the number of leading zero bits in a uint256.
     */
    function clz(uint256 x) internal pure returns (uint256) {
        return ternary(x == 0, 256, 255 - log2(x));
    }
}

// File: contracts/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: contracts/Bytes.sol


// OpenZeppelin Contracts (last updated v5.4.0) (utils/Bytes.sol)

pragma solidity ^0.8.24;


/**
 * @dev Bytes operations.
 */
library Bytes {
    /**
     * @dev Forward search for `s` in `buffer`
     * * If `s` is present in the buffer, returns the index of the first instance
     * * If `s` is not present in the buffer, returns type(uint256).max
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf[Javascript's `Array.indexOf`]
     */
    function indexOf(bytes memory buffer, bytes1 s) internal pure returns (uint256) {
        return indexOf(buffer, s, 0);
    }

    /**
     * @dev Forward search for `s` in `buffer` starting at position `pos`
     * * If `s` is present in the buffer (at or after `pos`), returns the index of the next instance
     * * If `s` is not present in the buffer (at or after `pos`), returns type(uint256).max
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf[Javascript's `Array.indexOf`]
     */
    function indexOf(bytes memory buffer, bytes1 s, uint256 pos) internal pure returns (uint256) {
        uint256 length = buffer.length;
        for (uint256 i = pos; i < length; ++i) {
            if (bytes1(_unsafeReadBytesOffset(buffer, i)) == s) {
                return i;
            }
        }
        return type(uint256).max;
    }

    /**
     * @dev Backward search for `s` in `buffer`
     * * If `s` is present in the buffer, returns the index of the last instance
     * * If `s` is not present in the buffer, returns type(uint256).max
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf[Javascript's `Array.lastIndexOf`]
     */
    function lastIndexOf(bytes memory buffer, bytes1 s) internal pure returns (uint256) {
        return lastIndexOf(buffer, s, type(uint256).max);
    }

    /**
     * @dev Backward search for `s` in `buffer` starting at position `pos`
     * * If `s` is present in the buffer (at or before `pos`), returns the index of the previous instance
     * * If `s` is not present in the buffer (at or before `pos`), returns type(uint256).max
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf[Javascript's `Array.lastIndexOf`]
     */
    function lastIndexOf(bytes memory buffer, bytes1 s, uint256 pos) internal pure returns (uint256) {
        unchecked {
            uint256 length = buffer.length;
            for (uint256 i = Math.min(Math.saturatingAdd(pos, 1), length); i > 0; --i) {
                if (bytes1(_unsafeReadBytesOffset(buffer, i - 1)) == s) {
                    return i - 1;
                }
            }
            return type(uint256).max;
        }
    }

    /**
     * @dev Copies the content of `buffer`, from `start` (included) to the end of `buffer` into a new bytes object in
     * memory.
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]
     */
    function slice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {
        return slice(buffer, start, buffer.length);
    }

    /**
     * @dev Copies the content of `buffer`, from `start` (included) to `end` (excluded) into a new bytes object in
     * memory. The `end` argument is truncated to the length of the `buffer`.
     *
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice[Javascript's `Array.slice`]
     */
    function slice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {
        // sanitize
        uint256 length = buffer.length;
        end = Math.min(end, length);
        start = Math.min(start, end);

        // allocate and copy
        bytes memory result = new bytes(end - start);
        assembly ("memory-safe") {
            mcopy(add(result, 0x20), add(add(buffer, 0x20), start), sub(end, start))
        }

        return result;
    }

    /**
     * @dev Moves the content of `buffer`, from `start` (included) to the end of `buffer` to the start of that buffer.
     *
     * NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead
     */
    function splice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {
        return splice(buffer, start, buffer.length);
    }

    /**
     * @dev Moves the content of `buffer`, from `start` (included) to end (excluded) to the start of that buffer. The
     * `end` argument is truncated to the length of the `buffer`.
     *
     * NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead
     */
    function splice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {
        // sanitize
        uint256 length = buffer.length;
        end = Math.min(end, length);
        start = Math.min(start, end);

        // allocate and copy
        assembly ("memory-safe") {
            mcopy(add(buffer, 0x20), add(add(buffer, 0x20), start), sub(end, start))
            mstore(buffer, sub(end, start))
        }

        return buffer;
    }

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

    /**
     * @dev Reverses the byte order of a bytes32 value, converting between little-endian and big-endian.
     * Inspired in https://graphics.stanford.edu/~seander/bithacks.html#ReverseParallel[Reverse Parallel]
     */
    function reverseBytes32(bytes32 value) internal pure returns (bytes32) {
        value = // swap bytes
            ((value >> 8) & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) |
            ((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF00FF) << 8);
        value = // swap 2-byte long pairs
            ((value >> 16) & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) |
            ((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF0000FFFF) << 16);
        value = // swap 4-byte long pairs
            ((value >> 32) & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) |
            ((value & 0x00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF00000000FFFFFFFF) << 32);
        value = // swap 8-byte long pairs
            ((value >> 64) & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) |
            ((value & 0x0000000000000000FFFFFFFFFFFFFFFF0000000000000000FFFFFFFFFFFFFFFF) << 64);
        return (value >> 128) | (value << 128); // swap 16-byte long pairs
    }

    /// @dev Same as {reverseBytes32} but optimized for 128-bit values.
    function reverseBytes16(bytes16 value) internal pure returns (bytes16) {
        value = // swap bytes
            ((value & 0xFF00FF00FF00FF00FF00FF00FF00FF00) >> 8) |
            ((value & 0x00FF00FF00FF00FF00FF00FF00FF00FF) << 8);
        value = // swap 2-byte long pairs
            ((value & 0xFFFF0000FFFF0000FFFF0000FFFF0000) >> 16) |
            ((value & 0x0000FFFF0000FFFF0000FFFF0000FFFF) << 16);
        value = // swap 4-byte long pairs
            ((value & 0xFFFFFFFF00000000FFFFFFFF00000000) >> 32) |
            ((value & 0x00000000FFFFFFFF00000000FFFFFFFF) << 32);
        return (value >> 64) | (value << 64); // swap 8-byte long pairs
    }

    /// @dev Same as {reverseBytes32} but optimized for 64-bit values.
    function reverseBytes8(bytes8 value) internal pure returns (bytes8) {
        value = ((value & 0xFF00FF00FF00FF00) >> 8) | ((value & 0x00FF00FF00FF00FF) << 8); // swap bytes
        value = ((value & 0xFFFF0000FFFF0000) >> 16) | ((value & 0x0000FFFF0000FFFF) << 16); // swap 2-byte long pairs
        return (value >> 32) | (value << 32); // swap 4-byte long pairs
    }

    /// @dev Same as {reverseBytes32} but optimized for 32-bit values.
    function reverseBytes4(bytes4 value) internal pure returns (bytes4) {
        value = ((value & 0xFF00FF00) >> 8) | ((value & 0x00FF00FF) << 8); // swap bytes
        return (value >> 16) | (value << 16); // swap 2-byte long pairs
    }

    /// @dev Same as {reverseBytes32} but optimized for 16-bit values.
    function reverseBytes2(bytes2 value) internal pure returns (bytes2) {
        return (value >> 8) | (value << 8);
    }

    /**
     * @dev Counts the number of leading zero bits a bytes array. Returns `8 * buffer.length`
     * if the buffer is all zeros.
     */
    function clz(bytes memory buffer) internal pure returns (uint256) {
        for (uint256 i = 0; i < buffer.length; i += 32) {
            bytes32 chunk = _unsafeReadBytesOffset(buffer, i);
            if (chunk != bytes32(0)) {
                return Math.min(8 * i + Math.clz(uint256(chunk)), 8 * buffer.length);
            }
        }
        return 8 * buffer.length;
    }

    /**
     * @dev Reads a bytes32 from a bytes array without bounds checking.
     *
     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the
     * assembly block as such would prevent some optimizations.
     */
    function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {
        // This is not memory safe in the general case, but all calls to this private function are within bounds.
        assembly ("memory-safe") {
            value := mload(add(add(buffer, 0x20), offset))
        }
    }
}

// File: contracts/Strings.sol


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

pragma solidity ^0.8.24;





/**
 * @dev String operations.
 */
library Strings {
    using SafeCast for *;

    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;
    uint256 private constant SPECIAL_CHARS_LOOKUP =
        (1 << 0x08) | // backspace
            (1 << 0x09) | // tab
            (1 << 0x0a) | // newline
            (1 << 0x0c) | // form feed
            (1 << 0x0d) | // carriage return
            (1 << 0x22) | // double quote
            (1 << 0x5c); // backslash

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

    /**
     * @dev The string being parsed contains characters that are not in scope of the given base.
     */
    error StringsInvalidChar();

    /**
     * @dev The string being parsed is not a properly formatted address.
     */
    error StringsInvalidAddressFormat();

    /**
     * @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(add(buffer, 0x20), 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 Converts a `bytes` buffer to its ASCII `string` hexadecimal representation.
     */
    function toHexString(bytes memory input) internal pure returns (string memory) {
        unchecked {
            bytes memory buffer = new bytes(2 * input.length + 2);
            buffer[0] = "0";
            buffer[1] = "x";
            for (uint256 i = 0; i < input.length; ++i) {
                uint8 v = uint8(input[i]);
                buffer[2 * i + 2] = HEX_DIGITS[v >> 4];
                buffer[2 * i + 3] = HEX_DIGITS[v & 0xf];
            }
            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.equal(bytes(a), bytes(b));
    }

    /**
     * @dev Parse a decimal string and returns the value as a `uint256`.
     *
     * Requirements:
     * - The string must be formatted as `[0-9]*`
     * - The result must fit into an `uint256` type
     */
    function parseUint(string memory input) internal pure returns (uint256) {
        return parseUint(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseUint-string} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `[0-9]*`
     * - The result must fit into an `uint256` type
     */
    function parseUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
        (bool success, uint256 value) = tryParseUint(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseUint-string} that returns false if the parsing fails because of an invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseUint(string memory input) internal pure returns (bool success, uint256 value) {
        return _tryParseUintUncheckedBounds(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseUint-string-uint256-uint256} that returns false if the parsing fails because of an invalid
     * character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseUint(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, uint256 value) {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseUintUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseUint-string-uint256-uint256} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseUintUncheckedBounds(
        string memory input,
        uint256 begin,
        uint256 end
    ) private pure returns (bool success, uint256 value) {
        bytes memory buffer = bytes(input);

        uint256 result = 0;
        for (uint256 i = begin; i < end; ++i) {
            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
            if (chr > 9) return (false, 0);
            result *= 10;
            result += chr;
        }
        return (true, result);
    }

    /**
     * @dev Parse a decimal string and returns the value as a `int256`.
     *
     * Requirements:
     * - The string must be formatted as `[-+]?[0-9]*`
     * - The result must fit in an `int256` type.
     */
    function parseInt(string memory input) internal pure returns (int256) {
        return parseInt(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseInt-string} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `[-+]?[0-9]*`
     * - The result must fit in an `int256` type.
     */
    function parseInt(string memory input, uint256 begin, uint256 end) internal pure returns (int256) {
        (bool success, int256 value) = tryParseInt(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseInt-string} that returns false if the parsing fails because of an invalid character or if
     * the result does not fit in a `int256`.
     *
     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
     */
    function tryParseInt(string memory input) internal pure returns (bool success, int256 value) {
        return _tryParseIntUncheckedBounds(input, 0, bytes(input).length);
    }

    uint256 private constant ABS_MIN_INT256 = 2 ** 255;

    /**
     * @dev Variant of {parseInt-string-uint256-uint256} that returns false if the parsing fails because of an invalid
     * character or if the result does not fit in a `int256`.
     *
     * NOTE: This function will revert if the absolute value of the result does not fit in a `uint256`.
     */
    function tryParseInt(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, int256 value) {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseIntUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseInt-string-uint256-uint256} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseIntUncheckedBounds(
        string memory input,
        uint256 begin,
        uint256 end
    ) private pure returns (bool success, int256 value) {
        bytes memory buffer = bytes(input);

        // Check presence of a negative sign.
        bytes1 sign = begin == end ? bytes1(0) : bytes1(_unsafeReadBytesOffset(buffer, begin)); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        bool positiveSign = sign == bytes1("+");
        bool negativeSign = sign == bytes1("-");
        uint256 offset = (positiveSign || negativeSign).toUint();

        (bool absSuccess, uint256 absValue) = tryParseUint(input, begin + offset, end);

        if (absSuccess && absValue < ABS_MIN_INT256) {
            return (true, negativeSign ? -int256(absValue) : int256(absValue));
        } else if (absSuccess && negativeSign && absValue == ABS_MIN_INT256) {
            return (true, type(int256).min);
        } else return (false, 0);
    }

    /**
     * @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as a `uint256`.
     *
     * Requirements:
     * - The string must be formatted as `(0x)?[0-9a-fA-F]*`
     * - The result must fit in an `uint256` type.
     */
    function parseHexUint(string memory input) internal pure returns (uint256) {
        return parseHexUint(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseHexUint-string} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `(0x)?[0-9a-fA-F]*`
     * - The result must fit in an `uint256` type.
     */
    function parseHexUint(string memory input, uint256 begin, uint256 end) internal pure returns (uint256) {
        (bool success, uint256 value) = tryParseHexUint(input, begin, end);
        if (!success) revert StringsInvalidChar();
        return value;
    }

    /**
     * @dev Variant of {parseHexUint-string} that returns false if the parsing fails because of an invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseHexUint(string memory input) internal pure returns (bool success, uint256 value) {
        return _tryParseHexUintUncheckedBounds(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseHexUint-string-uint256-uint256} that returns false if the parsing fails because of an
     * invalid character.
     *
     * NOTE: This function will revert if the result does not fit in a `uint256`.
     */
    function tryParseHexUint(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, uint256 value) {
        if (end > bytes(input).length || begin > end) return (false, 0);
        return _tryParseHexUintUncheckedBounds(input, begin, end);
    }

    /**
     * @dev Implementation of {tryParseHexUint-string-uint256-uint256} that does not check bounds. Caller should make sure that
     * `begin <= end <= input.length`. Other inputs would result in undefined behavior.
     */
    function _tryParseHexUintUncheckedBounds(
        string memory input,
        uint256 begin,
        uint256 end
    ) private pure returns (bool success, uint256 value) {
        bytes memory buffer = bytes(input);

        // skip 0x prefix if present
        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(buffer, begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        uint256 offset = hasPrefix.toUint() * 2;

        uint256 result = 0;
        for (uint256 i = begin + offset; i < end; ++i) {
            uint8 chr = _tryParseChr(bytes1(_unsafeReadBytesOffset(buffer, i)));
            if (chr > 15) return (false, 0);
            result *= 16;
            unchecked {
                // Multiplying by 16 is equivalent to a shift of 4 bits (with additional overflow check).
                // This guarantees that adding a value < 16 will not cause an overflow, hence the unchecked.
                result += chr;
            }
        }
        return (true, result);
    }

    /**
     * @dev Parse a hexadecimal string (with or without "0x" prefix), and returns the value as an `address`.
     *
     * Requirements:
     * - The string must be formatted as `(0x)?[0-9a-fA-F]{40}`
     */
    function parseAddress(string memory input) internal pure returns (address) {
        return parseAddress(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseAddress-string} that parses a substring of `input` located between position `begin` (included) and
     * `end` (excluded).
     *
     * Requirements:
     * - The substring must be formatted as `(0x)?[0-9a-fA-F]{40}`
     */
    function parseAddress(string memory input, uint256 begin, uint256 end) internal pure returns (address) {
        (bool success, address value) = tryParseAddress(input, begin, end);
        if (!success) revert StringsInvalidAddressFormat();
        return value;
    }

    /**
     * @dev Variant of {parseAddress-string} that returns false if the parsing fails because the input is not a properly
     * formatted address. See {parseAddress-string} requirements.
     */
    function tryParseAddress(string memory input) internal pure returns (bool success, address value) {
        return tryParseAddress(input, 0, bytes(input).length);
    }

    /**
     * @dev Variant of {parseAddress-string-uint256-uint256} that returns false if the parsing fails because input is not a properly
     * formatted address. See {parseAddress-string-uint256-uint256} requirements.
     */
    function tryParseAddress(
        string memory input,
        uint256 begin,
        uint256 end
    ) internal pure returns (bool success, address value) {
        if (end > bytes(input).length || begin > end) return (false, address(0));

        bool hasPrefix = (end > begin + 1) && bytes2(_unsafeReadBytesOffset(bytes(input), begin)) == bytes2("0x"); // don't do out-of-bound (possibly unsafe) read if sub-string is empty
        uint256 expectedLength = 40 + hasPrefix.toUint() * 2;

        // check that input is the correct length
        if (end - begin == expectedLength) {
            // length guarantees that this does not overflow, and value is at most type(uint160).max
            (bool s, uint256 v) = _tryParseHexUintUncheckedBounds(input, begin, end);
            return (s, address(uint160(v)));
        } else {
            return (false, address(0));
        }
    }

    function _tryParseChr(bytes1 chr) private pure returns (uint8) {
        uint8 value = uint8(chr);

        // Try to parse `chr`:
        // - Case 1: [0-9]
        // - Case 2: [a-f]
        // - Case 3: [A-F]
        // - otherwise not supported
        unchecked {
            if (value > 47 && value < 58) value -= 48;
            else if (value > 96 && value < 103) value -= 87;
            else if (value > 64 && value < 71) value -= 55;
            else return type(uint8).max;
        }

        return value;
    }

    /**
     * @dev Escape special characters in JSON strings. This can be useful to prevent JSON injection in NFT metadata.
     *
     * WARNING: This function should only be used in double quoted JSON strings. Single quotes are not escaped.
     *
     * NOTE: This function escapes all unicode characters, and not just the ones in ranges defined in section 2.5 of
     * RFC-4627 (U+0000 to U+001F, U+0022 and U+005C). ECMAScript's `JSON.parse` does recover escaped unicode
     * characters that are not in this range, but other tooling may provide different results.
     */
    function escapeJSON(string memory input) internal pure returns (string memory) {
        bytes memory buffer = bytes(input);
        bytes memory output = new bytes(2 * buffer.length); // worst case scenario
        uint256 outputLength = 0;

        for (uint256 i; i < buffer.length; ++i) {
            bytes1 char = bytes1(_unsafeReadBytesOffset(buffer, i));
            if (((SPECIAL_CHARS_LOOKUP & (1 << uint8(char))) != 0)) {
                output[outputLength++] = "\\";
                if (char == 0x08) output[outputLength++] = "b";
                else if (char == 0x09) output[outputLength++] = "t";
                else if (char == 0x0a) output[outputLength++] = "n";
                else if (char == 0x0c) output[outputLength++] = "f";
                else if (char == 0x0d) output[outputLength++] = "r";
                else if (char == 0x5c) output[outputLength++] = "\\";
                else if (char == 0x22) {
                    // solhint-disable-next-line quotes
                    output[outputLength++] = '"';
                }
            } else {
                output[outputLength++] = char;
            }
        }
        // write the actual length and deallocate unused memory
        assembly ("memory-safe") {
            mstore(output, outputLength)
            mstore(0x40, add(output, shl(5, shr(5, add(outputLength, 63)))))
        }

        return string(output);
    }

    /**
     * @dev Reads a bytes32 from a bytes array without bounds checking.
     *
     * NOTE: making this function internal would mean it could be used with memory unsafe offset, and marking the
     * assembly block as such would prevent some optimizations.
     */
    function _unsafeReadBytesOffset(bytes memory buffer, uint256 offset) private pure returns (bytes32 value) {
        // This is not memory safe in the general case, but all calls to this private function are within bounds.
        assembly ("memory-safe") {
            value := mload(add(add(buffer, 0x20), offset))
        }
    }
}

// File: contracts/introspection/IERC165.sol


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

pragma solidity >=0.4.16;

/**
 * @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: contracts/IERC2981.sol


// OpenZeppelin Contracts (last updated v5.4.0) (interfaces/IERC2981.sol)

pragma solidity >=0.6.2;


/**
 * @dev Interface for the NFT Royalty Standard.
 *
 * A standardized way to retrieve royalty payment information for non-fungible tokens (NFTs) to enable universal
 * support for royalty payments across all NFT marketplaces and ecosystem participants.
 */
interface IERC2981 is IERC165 {
    /**
     * @dev Returns how much royalty is owed and to whom, based on a sale price that may be denominated in any unit of
     * exchange. The royalty amount is denominated and should be paid in that same unit of exchange.
     *
     * NOTE: ERC-2981 allows setting the royalty to 100% of the price. In that case all the price would be sent to the
     * royalty receiver and 0 tokens to the seller. Contracts dealing with royalty should consider empty transfers.
     */
    function royaltyInfo(
        uint256 tokenId,
        uint256 salePrice
    ) external view returns (address receiver, uint256 royaltyAmount);
}

// File: contracts/ERC2981.sol


// OpenZeppelin Contracts (last updated v5.4.0) (token/common/ERC2981.sol)

pragma solidity ^0.8.20;


/**
 * @dev Implementation of the NFT Royalty Standard, a standardized way to retrieve royalty payment information.
 *
 * Royalty information can be specified globally for all token ids via {_setDefaultRoyalty}, and/or individually for
 * specific token ids via {_setTokenRoyalty}. The latter takes precedence over the first.
 *
 * Royalty is specified as a fraction of sale price. {_feeDenominator} is overridable but defaults to 10000, meaning the
 * fee is specified in basis points by default.
 *
 * IMPORTANT: ERC-2981 only specifies a way to signal royalty information and does not enforce its payment. See
 * https://eips.ethereum.org/EIPS/eip-2981#optional-royalty-payments[Rationale] in the ERC. Marketplaces are expected to
 * voluntarily pay royalties together with sales, but note that this standard is not yet widely supported.
 */
abstract contract ERC2981 is IERC2981 {
    struct RoyaltyInfo {
        address receiver;
        uint96 royaltyFraction;
    }
    RoyaltyInfo private _defaultRoyaltyInfo;
    mapping(uint256 => RoyaltyInfo) private _tokenRoyaltyInfo;

    /**
     * @dev The default royalty set is invalid (eg. (numerator / denominator) >= 1).
     */
    error ERC2981InvalidDefaultRoyalty(uint256 numerator, uint256 denominator);

    /**
     * @dev The default royalty receiver is invalid.
     */
    error ERC2981InvalidDefaultRoyaltyReceiver(address receiver);

    /**
     * @dev The royalty set for a specific `tokenId` is invalid (eg. (numerator / denominator) >= 1).
     */
    error ERC2981InvalidTokenRoyalty(uint256 tokenId, uint256 numerator, uint256 denominator);

    /**
     * @dev The royalty receiver for `tokenId` is invalid.
     */
    error ERC2981InvalidTokenRoyaltyReceiver(uint256 tokenId, address receiver);

    /// @inheritdoc IERC165
    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return interfaceId == type(IERC2981).interfaceId || interfaceId == type(IERC165).interfaceId;
    }

    /// @inheritdoc IERC2981
    function royaltyInfo(
        uint256 tokenId,
        uint256 salePrice
    ) public view virtual returns (address receiver, uint256 amount) {
        RoyaltyInfo storage _royaltyInfo = _tokenRoyaltyInfo[tokenId];
        address royaltyReceiver = _royaltyInfo.receiver;
        uint96 royaltyFraction = _royaltyInfo.royaltyFraction;

        if (royaltyReceiver == address(0)) {
            royaltyReceiver = _defaultRoyaltyInfo.receiver;
            royaltyFraction = _defaultRoyaltyInfo.royaltyFraction;
        }

        uint256 royaltyAmount = (salePrice * royaltyFraction) / _feeDenominator();

        return (royaltyReceiver, royaltyAmount);
    }

    /**
     * @dev The denominator with which to interpret the fee set in {_setTokenRoyalty} and {_setDefaultRoyalty} as a
     * fraction of the sale price. Defaults to 10000 so fees are expressed in basis points, but may be customized by an
     * override.
     */
    function _feeDenominator() internal pure virtual returns (uint96) {
        return 10000;
    }

    /**
     * @dev Sets the royalty information that all ids in this contract will default to.
     *
     * Requirements:
     *
     * - `receiver` cannot be the zero address.
     * - `feeNumerator` cannot be greater than the fee denominator.
     */
    function _setDefaultRoyalty(address receiver, uint96 feeNumerator) internal virtual {
        uint256 denominator = _feeDenominator();
        if (feeNumerator > denominator) {
            // Royalty fee will exceed the sale price
            revert ERC2981InvalidDefaultRoyalty(feeNumerator, denominator);
        }
        if (receiver == address(0)) {
            revert ERC2981InvalidDefaultRoyaltyReceiver(address(0));
        }

        _defaultRoyaltyInfo = RoyaltyInfo(receiver, feeNumerator);
    }

    /**
     * @dev Removes default royalty information.
     */
    function _deleteDefaultRoyalty() internal virtual {
        delete _defaultRoyaltyInfo;
    }

    /**
     * @dev Sets the royalty information for a specific token id, overriding the global default.
     *
     * Requirements:
     *
     * - `receiver` cannot be the zero address.
     * - `feeNumerator` cannot be greater than the fee denominator.
     */
    function _setTokenRoyalty(uint256 tokenId, address receiver, uint96 feeNumerator) internal virtual {
        uint256 denominator = _feeDenominator();
        if (feeNumerator > denominator) {
            // Royalty fee will exceed the sale price
            revert ERC2981InvalidTokenRoyalty(tokenId, feeNumerator, denominator);
        }
        if (receiver == address(0)) {
            revert ERC2981InvalidTokenRoyaltyReceiver(tokenId, address(0));
        }

        _tokenRoyaltyInfo[tokenId] = RoyaltyInfo(receiver, feeNumerator);
    }

    /**
     * @dev Resets royalty information for the token id back to the global default.
     */
    function _resetTokenRoyalty(uint256 tokenId) internal virtual {
        delete _tokenRoyaltyInfo[tokenId];
    }
}

// File: contracts/TradingEnabler.sol


pragma solidity 0.8.28;

abstract contract TradingEnabler {
    bool public tradingEnabled;
    
    event TradingEnabled(uint256 timestamp);
    event TradingDisabled(uint256 timestamp);
    
    constructor() {
        tradingEnabled = false;
    }
    
    modifier tradingEnabledOnly() {
        require(tradingEnabled, "Trading not enabled yet");
        _;
    }
    
    function _enableTrading() internal {
        require(!tradingEnabled, "Trading already enabled");
        tradingEnabled = true;
        emit TradingEnabled(block.timestamp);
    }
    
    function _disableTrading() internal {
        require(tradingEnabled, "Trading already disabled");
        tradingEnabled = false;
        emit TradingDisabled(block.timestamp);
    }
    
    function isTradingEnabled() external view returns (bool) {
        return tradingEnabled;
    }
}
// File: contracts/ReentrancyGuard.sol


// OpenZeppelin Contracts (last updated v4.9.0) (security/ReentrancyGuard.sol)

pragma solidity ^0.8.0;

/**
 * @dev Contract module that helps prevent reentrant calls to a function.
 *
 * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier
 * available, which can be applied to functions to make sure there are no nested
 * (reentrant) calls to them.
 *
 * Note that because there is a single `nonReentrant` guard, functions marked as
 * `nonReentrant` may not call one another. This can be worked around by making
 * those functions `private`, and then adding `external` `nonReentrant` entry
 * points to them.
 *
 * TIP: If you would like to learn more about reentrancy and alternative ways
 * to protect against it, check out our blog post
 * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].
 */
abstract contract ReentrancyGuard {
    // Booleans are more expensive than uint256 or any type that takes up a full
    // word because each write operation emits an extra SLOAD to first read the
    // slot's contents, replace the bits taken up by the boolean, and then write
    // back. This is the compiler's defense against contract upgrades and
    // pointer aliasing, and it cannot be disabled.

    // The values being non-zero value makes deployment a bit more expensive,
    // but in exchange the refund on every call to nonReentrant will be lower in
    // amount. Since refunds are capped to a percentage of the total
    // transaction's gas, it is best to keep them low in cases like this one, to
    // increase the likelihood of the full refund coming into effect.
    uint256 private constant _NOT_ENTERED = 1;
    uint256 private constant _ENTERED = 2;

    uint256 private _status;

    constructor() {
        _status = _NOT_ENTERED;
    }

    /**
     * @dev Prevents a contract from calling itself, directly or indirectly.
     * Calling a `nonReentrant` function from another `nonReentrant`
     * function is not supported. It is possible to prevent this from happening
     * by making the `nonReentrant` function external, and making it call a
     * `private` function that does the actual work.
     */
    modifier nonReentrant() {
        _nonReentrantBefore();
        _;
        _nonReentrantAfter();
    }

    function _nonReentrantBefore() private {
        // On the first call to nonReentrant, _status will be _NOT_ENTERED
        require(_status != _ENTERED, "ReentrancyGuard: reentrant call");

        // Any calls to nonReentrant after this point will fail
        _status = _ENTERED;
    }

    function _nonReentrantAfter() private {
        // By storing the original value once again, a refund is triggered (see
        // https://eips.ethereum.org/EIPS/eip-2200)
        _status = _NOT_ENTERED;
    }

    /**
     * @dev Returns true if the reentrancy guard is currently set to "entered", which indicates there is a
     * `nonReentrant` function in the call stack.
     */
    function _reentrancyGuardEntered() internal view returns (bool) {
        return _status == _ENTERED;
    }
}

// File: contracts/ApeWaveStandalone.sol


pragma solidity 0.8.28;









contract ApeWaveStandalone is Context, ERC2981, TradingEnabler, ReentrancyGuard {
    using Strings for uint256;

    enum Phase { Closed, Whitelist1, Whitelist2, Whitelist3, Public }
    
    struct PhaseConfig {
        uint64 startTime;
        uint64 endTime;
        uint256 price;
        bytes32 merkleRoot;
        uint256 maxMints;
        uint256 minted;
        bool active;
    }
    
    mapping(Phase => PhaseConfig) public phases;

    string private _name;
    string private _symbol;
    mapping(uint256 => address) private _owners;
    mapping(address => uint256) private _balances;
    mapping(uint256 => address) private _tokenApprovals;
    mapping(address => mapping(address => bool)) private _operatorApprovals;

    string public baseURI;
    string public baseExtension = ".json";
    bool public useUniqueMetadata;
    uint256 public immutable maxSupply;
    uint256 public immutable maxPerWallet;
    uint256 public totalMinted;
    address public owner;
    bool public paused;
    
    mapping(address => uint256) public walletMints;

    event Transfer(address indexed from, address indexed to, uint256 indexed tokenId);
    event Approval(address indexed owner, address indexed approved, uint256 indexed tokenId);
    event ApprovalForAll(address indexed owner, address indexed operator, bool approved);
    event PhaseUpdated(Phase phase, uint64 start, uint64 end, uint256 price);
    event Minted(address to, uint256 amount, Phase phase);
    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);

    modifier onlyOwner() {
        require(_msgSender() == owner, "Not owner");
        _;
    }

    modifier notPaused() {
        require(!paused, "Contract paused");
        _;
    }

    constructor(
        string memory name_,
        string memory symbol_,
        string memory baseURI_,
        uint256 maxSupply_,
        uint256 maxPerWallet_,
        address owner_
    ) TradingEnabler() {
        require(maxSupply_ > 0, "Invalid supply");
        require(maxPerWallet_ > 0, "Invalid wallet limit");
        require(owner_ != address(0), "Invalid owner");
        
        _name = name_;
        _symbol = symbol_;
        baseURI = baseURI_;
        maxSupply = maxSupply_;
        maxPerWallet = maxPerWallet_;
        owner = owner_;
        
        _setDefaultRoyalty(owner_, 500);
    }

    function mint(uint256 amount, bytes32[] calldata proof) 
        external 
        payable 
        notPaused 
        nonReentrant 
    {
        require(amount > 0 && amount <= 10, "Invalid amount");
        require(totalMinted + amount <= maxSupply, "Exceeds supply");
        require(walletMints[_msgSender()] + amount <= maxPerWallet, "Exceeds wallet limit");

        Phase currentPhase = getCurrentPhase();
        require(currentPhase != Phase.Closed, "No active phase");

        PhaseConfig storage phaseConfig = phases[currentPhase];
        uint256 requiredPayment = phaseConfig.price * amount;
        require(msg.value >= requiredPayment, "Insufficient payment");
        
        if (phaseConfig.maxMints > 0) {
            require(phaseConfig.minted + amount <= phaseConfig.maxMints, "Phase limit exceeded");
        }

        if (currentPhase != Phase.Public && phaseConfig.merkleRoot != bytes32(0)) {
            require(
                MerkleProof.verify(proof, phaseConfig.merkleRoot, keccak256(abi.encodePacked(_msgSender()))),
                "Not whitelisted"
            );
        }

        uint256 startTokenId = totalMinted + 1;
        walletMints[_msgSender()] += amount;
        phaseConfig.minted += amount;
        totalMinted += amount;
        
        for (uint256 i = 0; i < amount; i++) {
            _mint(_msgSender(), startTokenId + i);
        }

        if (_msgSender().code.length > 0) {
            require(
                IERC721Receiver(_msgSender()).onERC721Received(_msgSender(), address(0), startTokenId, "") == IERC721Receiver.onERC721Received.selector,
                "Transfer to non ERC721Receiver"
            );
        }

        if (msg.value > requiredPayment) {
            Address.sendValue(payable(_msgSender()), msg.value - requiredPayment);
        }

        emit Minted(_msgSender(), amount, currentPhase);
    }

    function ownerMint(address to, uint256 amount) external onlyOwner nonReentrant {
        require(amount > 0 && amount <= 10, "Invalid amount");
        require(totalMinted + amount <= maxSupply, "Exceeds supply");
        
        uint256 startTokenId = totalMinted + 1;
        totalMinted += amount;
        
        for (uint256 i = 0; i < amount; i++) {
            _mint(to, startTokenId + i);
        }

        if (to.code.length > 0) {
            require(
                IERC721Receiver(to).onERC721Received(_msgSender(), address(0), startTokenId, "") == IERC721Receiver.onERC721Received.selector,
                "Transfer to non ERC721Receiver"
            );
        }
        
        emit Minted(to, amount, Phase.Closed);
    }

    function setPhase(
        Phase phase,
        uint64 startTime,
        uint64 endTime,
        uint256 price,
        bytes32 merkleRoot,
        uint256 maxMints
    ) external onlyOwner {
        require(phase != Phase.Closed, "Cannot set closed phase");
        require(endTime == 0 || endTime > startTime, "Invalid time range");
        
        phases[phase] = PhaseConfig({
            startTime: startTime,
            endTime: endTime,
            price: price,
            merkleRoot: merkleRoot,
            maxMints: maxMints,
            minted: phases[phase].minted,
            active: true
        });
        
        emit PhaseUpdated(phase, startTime, endTime, price);
    }

    function getCurrentPhase() public view returns (Phase) {
        uint64 now_ = uint64(block.timestamp);
        
        if (_isPhaseActive(Phase.Whitelist1, now_)) return Phase.Whitelist1;
        if (_isPhaseActive(Phase.Whitelist2, now_)) return Phase.Whitelist2;
        if (_isPhaseActive(Phase.Whitelist3, now_)) return Phase.Whitelist3;
        if (_isPhaseActive(Phase.Public, now_)) return Phase.Public;
        
        return Phase.Closed;
    }

    function _isPhaseActive(Phase phase, uint64 timestamp) private view returns (bool) {
        PhaseConfig memory config = phases[phase];
        if (!config.active) return false;
        
        bool afterStart = config.startTime == 0 || timestamp >= config.startTime;
        bool beforeEnd = config.endTime == 0 || timestamp <= config.endTime;
        bool hasAllocation = config.maxMints == 0 || config.minted < config.maxMints;
        
        return afterStart && beforeEnd && hasAllocation;
    }

    function verifyMerkleProof(
        bytes32[] memory proof,
        bytes32 root,
        address addr
    ) public pure returns (bool) {
        return MerkleProof.verify(proof, root, keccak256(abi.encodePacked(addr)));
    }

    function enableTrading() external onlyOwner {
        _enableTrading();
    }

    function disableTrading() external onlyOwner {
        _disableTrading();
    }

    function setBaseURI(string calldata newBaseURI) external onlyOwner {
        baseURI = newBaseURI;
    }

    function setPaused(bool paused_) external onlyOwner {
        paused = paused_;
    }

    function setDefaultRoyalty(address receiver, uint96 feeNumerator) external onlyOwner {
        require(feeNumerator <= 1000, "Max 10% royalty");
        _setDefaultRoyalty(receiver, feeNumerator);
    }

    function transferOwnership(address newOwner) external onlyOwner {
        require(newOwner != address(0), "Invalid owner");
        address oldOwner = owner;
        owner = newOwner;
        emit OwnershipTransferred(oldOwner, newOwner);
    }

    function withdraw() external onlyOwner {
        uint256 balance = address(this).balance;
        require(balance > 0, "No balance");
        Address.sendValue(payable(owner), balance);
    }

    function isPhaseCurrentlyActive(Phase phase) external view returns (bool) {
        return _isPhaseActive(phase, uint64(block.timestamp));
    }

    function getPhaseInfoEnhanced(Phase phase) external view returns (
        uint64 startTime,
        uint64 endTime,
        uint256 price,
        uint256 maxMints,
        uint256 minted,
        bool configured,
        bool currentlyActive
    ) {
        PhaseConfig memory config = phases[phase];
        return (
            config.startTime,
            config.endTime,
            config.price,
            config.maxMints,
            config.minted,
            config.active,
            _isPhaseActive(phase, uint64(block.timestamp))
        );
    }

    function getPhaseInfo(Phase phase) external view returns (
        uint64 startTime,
        uint64 endTime,
        uint256 price,
        uint256 maxMints,
        uint256 minted,
        bool active
    ) {
        PhaseConfig memory config = phases[phase];
        return (
            config.startTime,
            config.endTime,
            config.price,
            config.maxMints,
            config.minted,
            config.active
        );
    }

    function name() public view returns (string memory) {
        return _name;
    }

    function symbol() public view returns (string memory) {
        return _symbol;
    }

    function tokenURI(uint256 tokenId) public view returns (string memory) {
        require(_exists(tokenId), "Token does not exist");
        if (!useUniqueMetadata) {
            return baseURI;
        }
        return string.concat(baseURI, tokenId.toString(), baseExtension);
    }
    
    function setUniqueMetadata(bool useUnique) external onlyOwner {
        useUniqueMetadata = useUnique;
    }

    function setBaseExtension(string calldata newExtension) external onlyOwner {
        baseExtension = newExtension;
    }
    
    function balanceOf(address owner_) public view returns (uint256) {
        require(owner_ != address(0), "Zero address query");
        return _balances[owner_];
    }

    function ownerOf(uint256 tokenId) public view returns (address) {
        return _ownerOf(tokenId);
    }

    function _ownerOf(uint256 tokenId) internal view returns (address) {
        return _owners[tokenId];
    }

    function _exists(uint256 tokenId) internal view returns (bool) {
        return _owners[tokenId] != address(0);
    }

    function approve(address to, uint256 tokenId) public tradingEnabledOnly {
        address owner_ = ownerOf(tokenId);
        require(to != owner_, "Approval to current owner");
        require(_msgSender() == owner_ || isApprovedForAll(owner_, _msgSender()),
            "Not owner nor approved");

        _approve(to, tokenId);
    }

    function getApproved(uint256 tokenId) public view returns (address) {
        require(_exists(tokenId), "Token does not exist");
        return _tokenApprovals[tokenId];
    }

    function setApprovalForAll(address operator, bool approved) public tradingEnabledOnly {
        require(operator != _msgSender(), "Approve to caller");
        _operatorApprovals[_msgSender()][operator] = approved;
        emit ApprovalForAll(_msgSender(), operator, approved);
    }

    function isApprovedForAll(address owner_, address operator) public view returns (bool) {
        return _operatorApprovals[owner_][operator];
    }

    function transferFrom(address from, address to, uint256 tokenId) public tradingEnabledOnly {
        require(_isApprovedOrOwner(_msgSender(), tokenId), "Not approved");
        _transfer(from, to, tokenId);
    }

    function safeTransferFrom(address from, address to, uint256 tokenId) public tradingEnabledOnly {
        safeTransferFrom(from, to, tokenId, "");
    }

    function safeTransferFrom(address from, address to, uint256 tokenId, bytes memory data) public tradingEnabledOnly {
        require(_isApprovedOrOwner(_msgSender(), tokenId), "Not approved");
        _safeTransfer(from, to, tokenId, data);
    }

    function _safeTransfer(address from, address to, uint256 tokenId, bytes memory data) internal {
        _transfer(from, to, tokenId);
        require(_checkOnERC721Received(from, to, tokenId, data), "Transfer to non ERC721Receiver");
    }

    function _isApprovedOrOwner(address spender, uint256 tokenId) internal view returns (bool) {
        require(_exists(tokenId), "Token does not exist");
        address owner_ = ownerOf(tokenId);
        return (spender == owner_ || getApproved(tokenId) == spender || isApprovedForAll(owner_, spender));
    }

    function _mint(address to, uint256 tokenId) internal {
        require(to != address(0), "Mint to zero address");
        require(!_exists(tokenId), "Token already minted");

        _balances[to] += 1;
        _owners[tokenId] = to;

        emit Transfer(address(0), to, tokenId);
    }

    function _transfer(address from, address to, uint256 tokenId) internal {
        require(ownerOf(tokenId) == from, "Transfer from incorrect owner");
        require(to != address(0), "Transfer to zero address");

        _approve(address(0), tokenId);

        _balances[from] -= 1;
        _balances[to] += 1;
        _owners[tokenId] = to;

        emit Transfer(from, to, tokenId);
    }

    function _approve(address to, uint256 tokenId) internal {
        _tokenApprovals[tokenId] = to;
        emit Approval(ownerOf(tokenId), to, tokenId);
    }

    function _checkOnERC721Received(address from, address to, uint256 tokenId, bytes memory data) private returns (bool) {
        if (to.code.length > 0) {
            try IERC721Receiver(to).onERC721Received(_msgSender(), from, tokenId, data) returns (bytes4 retval) {
                return retval == IERC721Receiver.onERC721Received.selector;
            } catch (bytes memory reason) {
                if (reason.length == 0) {
                    revert("Transfer to non ERC721Receiver");
                } else {
                    assembly {
                        revert(add(32, reason), mload(reason))
                    }
                }
            }
        } else {
            return true;
        }
    }

    function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
        return
            interfaceId == 0x80ac58cd || // ERC721
            interfaceId == 0x5b5e139f || // ERC721Metadata
            interfaceId == 0x01ffc9a7 || // ERC165
            super.supportsInterface(interfaceId);
    }

    receive() external payable {}
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"string","name":"name_","type":"string"},{"internalType":"string","name":"symbol_","type":"string"},{"internalType":"string","name":"baseURI_","type":"string"},{"internalType":"uint256","name":"maxSupply_","type":"uint256"},{"internalType":"uint256","name":"maxPerWallet_","type":"uint256"},{"internalType":"address","name":"owner_","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"uint256","name":"numerator","type":"uint256"},{"internalType":"uint256","name":"denominator","type":"uint256"}],"name":"ERC2981InvalidDefaultRoyalty","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC2981InvalidDefaultRoyaltyReceiver","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"uint256","name":"numerator","type":"uint256"},{"internalType":"uint256","name":"denominator","type":"uint256"}],"name":"ERC2981InvalidTokenRoyalty","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC2981InvalidTokenRoyaltyReceiver","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":[{"indexed":false,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"},{"indexed":false,"internalType":"enum ApeWaveStandalone.Phase","name":"phase","type":"uint8"}],"name":"Minted","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":false,"internalType":"enum ApeWaveStandalone.Phase","name":"phase","type":"uint8"},{"indexed":false,"internalType":"uint64","name":"start","type":"uint64"},{"indexed":false,"internalType":"uint64","name":"end","type":"uint64"},{"indexed":false,"internalType":"uint256","name":"price","type":"uint256"}],"name":"PhaseUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"timestamp","type":"uint256"}],"name":"TradingDisabled","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"timestamp","type":"uint256"}],"name":"TradingEnabled","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":[{"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":[],"name":"baseExtension","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"baseURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"disableTrading","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"enableTrading","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getCurrentPhase","outputs":[{"internalType":"enum ApeWaveStandalone.Phase","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"enum ApeWaveStandalone.Phase","name":"phase","type":"uint8"}],"name":"getPhaseInfo","outputs":[{"internalType":"uint64","name":"startTime","type":"uint64"},{"internalType":"uint64","name":"endTime","type":"uint64"},{"internalType":"uint256","name":"price","type":"uint256"},{"internalType":"uint256","name":"maxMints","type":"uint256"},{"internalType":"uint256","name":"minted","type":"uint256"},{"internalType":"bool","name":"active","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"enum ApeWaveStandalone.Phase","name":"phase","type":"uint8"}],"name":"getPhaseInfoEnhanced","outputs":[{"internalType":"uint64","name":"startTime","type":"uint64"},{"internalType":"uint64","name":"endTime","type":"uint64"},{"internalType":"uint256","name":"price","type":"uint256"},{"internalType":"uint256","name":"maxMints","type":"uint256"},{"internalType":"uint256","name":"minted","type":"uint256"},{"internalType":"bool","name":"configured","type":"bool"},{"internalType":"bool","name":"currentlyActive","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":"enum ApeWaveStandalone.Phase","name":"phase","type":"uint8"}],"name":"isPhaseCurrentlyActive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isTradingEnabled","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxPerWallet","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"},{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"}],"name":"mint","outputs":[],"stateMutability":"payable","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":"address","name":"to","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"ownerMint","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"paused","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"enum ApeWaveStandalone.Phase","name":"","type":"uint8"}],"name":"phases","outputs":[{"internalType":"uint64","name":"startTime","type":"uint64"},{"internalType":"uint64","name":"endTime","type":"uint64"},{"internalType":"uint256","name":"price","type":"uint256"},{"internalType":"bytes32","name":"merkleRoot","type":"bytes32"},{"internalType":"uint256","name":"maxMints","type":"uint256"},{"internalType":"uint256","name":"minted","type":"uint256"},{"internalType":"bool","name":"active","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"uint256","name":"salePrice","type":"uint256"}],"name":"royaltyInfo","outputs":[{"internalType":"address","name":"receiver","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"stateMutability":"view","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":"string","name":"newExtension","type":"string"}],"name":"setBaseExtension","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"newBaseURI","type":"string"}],"name":"setBaseURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"},{"internalType":"uint96","name":"feeNumerator","type":"uint96"}],"name":"setDefaultRoyalty","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"paused_","type":"bool"}],"name":"setPaused","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"enum ApeWaveStandalone.Phase","name":"phase","type":"uint8"},{"internalType":"uint64","name":"startTime","type":"uint64"},{"internalType":"uint64","name":"endTime","type":"uint64"},{"internalType":"uint256","name":"price","type":"uint256"},{"internalType":"bytes32","name":"merkleRoot","type":"bytes32"},{"internalType":"uint256","name":"maxMints","type":"uint256"}],"name":"setPhase","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"useUnique","type":"bool"}],"name":"setUniqueMetadata","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":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalMinted","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"tradingEnabled","outputs":[{"internalType":"bool","name":"","type":"bool"}],"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":[],"name":"useUniqueMetadata","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"},{"internalType":"bytes32","name":"root","type":"bytes32"},{"internalType":"address","name":"addr","type":"address"}],"name":"verifyMerkleProof","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"pure","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"walletMints","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"withdraw","outputs":[],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]

0x610100604052600560c090815264173539b7b760d91b60e052600c9061002590826102d3565b50348015610031575f5ffd5b506040516141ea3803806141ea83398101604081905261005091610416565b6002805460ff191690556001600355826100a25760405162461bcd60e51b815260206004820152600e60248201526d496e76616c696420737570706c7960901b60448201526064015b60405180910390fd5b5f82116100f15760405162461bcd60e51b815260206004820152601460248201527f496e76616c69642077616c6c6574206c696d69740000000000000000000000006044820152606401610099565b6001600160a01b0381166101375760405162461bcd60e51b815260206004820152600d60248201526c24b73b30b634b21037bbb732b960991b6044820152606401610099565b600561014387826102d3565b50600661015086826102d3565b50600b61015d85826102d3565b50608083905260a0829052600f80546001600160a01b0319166001600160a01b03831617905561018f816101f461019a565b5050505050506104d9565b6127106001600160601b0382168110156101d957604051636f483d0960e01b81526001600160601b038316600482015260248101829052604401610099565b6001600160a01b03831661020257604051635b6cc80560e11b81525f6004820152602401610099565b50604080518082019091526001600160a01b039092168083526001600160601b039091166020909201829052600160a01b909102175f55565b634e487b7160e01b5f52604160045260245ffd5b600181811c9082168061026357607f821691505b60208210810361028157634e487b7160e01b5f52602260045260245ffd5b50919050565b601f8211156102ce57805f5260205f20601f840160051c810160208510156102ac5750805b601f840160051c820191505b818110156102cb575f81556001016102b8565b50505b505050565b81516001600160401b038111156102ec576102ec61023b565b610300816102fa845461024f565b84610287565b6020601f821160018114610332575f831561031b5750848201515b5f19600385901b1c1916600184901b1784556102cb565b5f84815260208120601f198516915b828110156103615787850151825560209485019460019092019101610341565b508482101561037e57868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b5f82601f83011261039c575f5ffd5b81516001600160401b038111156103b5576103b561023b565b604051601f8201601f19908116603f011681016001600160401b03811182821017156103e3576103e361023b565b6040528181528382016020018510156103fa575f5ffd5b8160208501602083015e5f918101602001919091529392505050565b5f5f5f5f5f5f60c0878903121561042b575f5ffd5b86516001600160401b03811115610440575f5ffd5b61044c89828a0161038d565b602089015190975090506001600160401b03811115610469575f5ffd5b61047589828a0161038d565b604089015190965090506001600160401b03811115610492575f5ffd5b61049e89828a0161038d565b606089015160808a015160a08b0151929750909550935090506001600160a01b03811681146104cb575f5ffd5b809150509295509295509295565b60805160a051613cdb61050f5f395f81816104cf0152611e4601525f81816108af015281816114810152611dba0152613cdb5ff3fe6080604052600436106102cf575f3560e01c806369eee0051161017b578063b20d346a116100d1578063cd8c800011610087578063e985e9c511610062578063e985e9c5146108f0578063f0293fd314610937578063f2fde38b14610962575f5ffd5b8063cd8c80001461087f578063d5abeb011461089e578063da3ef23f146108d1575f5ffd5b8063ba41b0c6116100b7578063ba41b0c614610839578063c66828621461084c578063c87b56dd14610860575f5ffd5b8063b20d346a146107b6578063b88d4fde1461081a575f5ffd5b80638a8c523c11610131578063a22cb4651161010c578063a22cb46514610761578063a2309ff814610780578063a3a40ea514610795575f5ffd5b80638a8c523c1461071a5780638da5cb5b1461072e57806395d89b411461074d575f5ffd5b80636e361c59116101615780636e361c59146106c357806370a08231146106e25780637c6c357414610701575f5ffd5b806369eee005146106005780636c0360eb146106af575f5ffd5b80632a55205a11610230578063484b973c116101e65780635bdb68d0116101c15780635bdb68d0146105565780635c975abb146105b05780636352211e146105e1575f5ffd5b8063484b973c146104ff5780634ada218b1461051e57806355f804b314610537575f5ffd5b80634188446f116102165780634188446f1461048057806342842e0e1461049f578063453c2310146104be575f5ffd5b80632a55205a1461042e5780633ccfd60b1461046c575f5ffd5b8063081812fc1161028557806316c38b3c1161026b57806316c38b3c146103dc57806317700f01146103fb57806323b872dd1461040f575f5ffd5b8063081812fc14610386578063095ea7b3146103bd575f5ffd5b806304634d8d116102b557806304634d8d1461032d578063064a59d01461034e57806306fdde0314610365575f5ffd5b806301ffc9a7146102da578063020d77971461030e575f5ffd5b366102d657005b5f5ffd5b3480156102e5575f5ffd5b506102f96102f436600461341c565b610981565b60405190151581526020015b60405180910390f35b348015610319575f5ffd5b506102f961032836600461344a565b610a74565b348015610338575f5ffd5b5061034c610347366004613479565b610a7f565b005b348015610359575f5ffd5b5060025460ff166102f9565b348015610370575f5ffd5b50610379610b41565b60405161030591906134ec565b348015610391575f5ffd5b506103a56103a03660046134fe565b610bd1565b6040516001600160a01b039091168152602001610305565b3480156103c8575f5ffd5b5061034c6103d7366004613515565b610c4f565b3480156103e7575f5ffd5b5061034c6103f636600461354c565b610da2565b348015610406575f5ffd5b5061034c610e3b565b34801561041a575f5ffd5b5061034c610429366004613565565b610e94565b348015610439575f5ffd5b5061044d61044836600461359f565b610f47565b604080516001600160a01b039093168352602083019190915201610305565b348015610477575f5ffd5b5061034c610ffa565b34801561048b575f5ffd5b5061034c61049a3660046135d6565b6110b0565b3480156104aa575f5ffd5b5061034c6104b9366004613565565b611360565b3480156104c9575f5ffd5b506104f17f000000000000000000000000000000000000000000000000000000000000000081565b604051908152602001610305565b34801561050a575f5ffd5b5061034c610519366004613515565b6113cc565b348015610529575f5ffd5b506002546102f99060ff1681565b348015610542575f5ffd5b5061034c610551366004613631565b6116db565b348015610561575f5ffd5b5061057561057036600461344a565b611737565b6040805167ffffffffffffffff97881681529690951660208701529385019290925260608401526080830152151560a082015260c001610305565b3480156105bb575f5ffd5b50600f546102f99074010000000000000000000000000000000000000000900460ff1681565b3480156105ec575f5ffd5b506103a56105fb3660046134fe565b6117f8565b34801561060b575f5ffd5b5061066c61061a36600461344a565b600460208190525f918252604090912080546001820154600283015460038401549484015460059094015467ffffffffffffffff80851696680100000000000000009095041694929391929060ff1687565b6040805167ffffffffffffffff9889168152979096166020880152948601939093526060850191909152608084015260a0830152151560c082015260e001610305565b3480156106ba575f5ffd5b50610379611814565b3480156106ce575f5ffd5b5061034c6106dd36600461354c565b6118a0565b3480156106ed575f5ffd5b506104f16106fc36600461369f565b611902565b34801561070c575f5ffd5b50600d546102f99060ff1681565b348015610725575f5ffd5b5061034c611974565b348015610739575f5ffd5b50600f546103a5906001600160a01b031681565b348015610758575f5ffd5b506103796119cb565b34801561076c575f5ffd5b5061034c61077b3660046136b8565b6119da565b34801561078b575f5ffd5b506104f1600e5481565b3480156107a0575f5ffd5b506107a9611aef565b604051610305919061371d565b3480156107c1575f5ffd5b506107d56107d036600461344a565b611b58565b6040805167ffffffffffffffff98891681529790961660208801529486019390935260608501919091526080840152151560a0830152151560c082015260e001610305565b348015610825575f5ffd5b5061034c610834366004613770565b611c2f565b61034c61084736600461382e565b611ce9565b348015610857575f5ffd5b5061037961235e565b34801561086b575f5ffd5b5061037961087a3660046134fe565b61236b565b34801561088a575f5ffd5b506102f96108993660046138a8565b6124a0565b3480156108a9575f5ffd5b506104f17f000000000000000000000000000000000000000000000000000000000000000081565b3480156108dc575f5ffd5b5061034c6108eb366004613631565b6124e9565b3480156108fb575f5ffd5b506102f961090a36600461396e565b6001600160a01b039182165f908152600a6020908152604080832093909416825291909152205460ff1690565b348015610942575f5ffd5b506104f161095136600461369f565b60106020525f908152604090205481565b34801561096d575f5ffd5b5061034c61097c36600461369f565b612545565b5f7f80ac58cd000000000000000000000000000000000000000000000000000000007fffffffff0000000000000000000000000000000000000000000000000000000083161480610a1357507f5b5e139f000000000000000000000000000000000000000000000000000000007fffffffff000000000000000000000000000000000000000000000000000000008316145b80610a5f57507f01ffc9a7000000000000000000000000000000000000000000000000000000007fffffffff000000000000000000000000000000000000000000000000000000008316145b80610a6e5750610a6e82612653565b92915050565b5f610a6e82426126ea565b600f546001600160a01b0316336001600160a01b031614610ad35760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b60448201526064015b60405180910390fd5b6103e8816bffffffffffffffffffffffff161115610b335760405162461bcd60e51b815260206004820152600f60248201527f4d61782031302520726f79616c747900000000000000000000000000000000006044820152606401610aca565b610b3d828261283f565b5050565b606060058054610b5090613996565b80601f0160208091040260200160405190810160405280929190818152602001828054610b7c90613996565b8015610bc75780601f10610b9e57610100808354040283529160200191610bc7565b820191905f5260205f20905b815481529060010190602001808311610baa57829003601f168201915b5050505050905090565b5f818152600760205260408120546001600160a01b0316610c345760405162461bcd60e51b815260206004820152601460248201527f546f6b656e20646f6573206e6f742065786973740000000000000000000000006044820152606401610aca565b505f908152600960205260409020546001600160a01b031690565b60025460ff16610ca15760405162461bcd60e51b815260206004820152601760248201527f54726164696e67206e6f7420656e61626c6564207965740000000000000000006044820152606401610aca565b5f610cab826117f8565b9050806001600160a01b0316836001600160a01b031603610d0e5760405162461bcd60e51b815260206004820152601960248201527f417070726f76616c20746f2063757272656e74206f776e6572000000000000006044820152606401610aca565b336001600160a01b0382161480610d4757506001600160a01b0381165f908152600a6020908152604080832033845290915290205460ff165b610d935760405162461bcd60e51b815260206004820152601660248201527f4e6f74206f776e6572206e6f7220617070726f766564000000000000000000006044820152606401610aca565b610d9d8383612932565b505050565b600f546001600160a01b0316336001600160a01b031614610df15760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b600f805491151574010000000000000000000000000000000000000000027fffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffff909216919091179055565b600f546001600160a01b0316336001600160a01b031614610e8a5760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b610e926129b7565b565b60025460ff16610ee65760405162461bcd60e51b815260206004820152601760248201527f54726164696e67206e6f7420656e61626c6564207965740000000000000000006044820152606401610aca565b610ef03382612a49565b610f3c5760405162461bcd60e51b815260206004820152600c60248201527f4e6f7420617070726f76656400000000000000000000000000000000000000006044820152606401610aca565b610d9d838383612b24565b5f82815260016020526040812080548291906001600160a01b038116907401000000000000000000000000000000000000000090046bffffffffffffffffffffffff1681610fc55750505f546001600160a01b038116907401000000000000000000000000000000000000000090046bffffffffffffffffffffffff165b5f612710610fe16bffffffffffffffffffffffff8416896139e2565b610feb91906139f9565b92989297509195505050505050565b600f546001600160a01b0316336001600160a01b0316146110495760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b47806110975760405162461bcd60e51b815260206004820152600a60248201527f4e6f2062616c616e6365000000000000000000000000000000000000000000006044820152606401610aca565b600f546110ad906001600160a01b031682612cba565b50565b600f546001600160a01b0316336001600160a01b0316146110ff5760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b5f866004811115611112576111126136e9565b0361115f5760405162461bcd60e51b815260206004820152601760248201527f43616e6e6f742073657420636c6f7365642070686173650000000000000000006044820152606401610aca565b67ffffffffffffffff8416158061118957508467ffffffffffffffff168467ffffffffffffffff16115b6111d55760405162461bcd60e51b815260206004820152601260248201527f496e76616c69642074696d652072616e676500000000000000000000000000006044820152606401610aca565b6040518060e001604052808667ffffffffffffffff1681526020018567ffffffffffffffff16815260200184815260200183815260200182815260200160045f896004811115611227576112276136e9565b6004811115611238576112386136e9565b81526020019081526020015f206004015481526020016001151581525060045f88600481111561126a5761126a6136e9565b600481111561127b5761127b6136e9565b815260208082019290925260409081015f20835181549385015167ffffffffffffffff90811668010000000000000000027fffffffffffffffffffffffffffffffff00000000000000000000000000000000909516911617929092178255828101516001830155606083015160028301556080830151600383015560a0830151600483015560c0909201516005909101805491151560ff19909216919091179055517f0bcee2beaf589a3dac2dcd3260b29f94054184acbab475bc5ce3a2f3134895c090611350908890889088908890613a18565b60405180910390a1505050505050565b60025460ff166113b25760405162461bcd60e51b815260206004820152601760248201527f54726164696e67206e6f7420656e61626c6564207965740000000000000000006044820152606401610aca565b610d9d83838360405180602001604052805f815250611c2f565b600f546001600160a01b0316336001600160a01b03161461141b5760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b611423612dcf565b5f811180156114335750600a8111155b61147f5760405162461bcd60e51b815260206004820152600e60248201527f496e76616c696420616d6f756e740000000000000000000000000000000000006044820152606401610aca565b7f000000000000000000000000000000000000000000000000000000000000000081600e546114ae9190613a55565b11156114fc5760405162461bcd60e51b815260206004820152600e60248201527f4578636565647320737570706c790000000000000000000000000000000000006044820152606401610aca565b5f600e54600161150c9190613a55565b905081600e5f82825461151f9190613a55565b909155505f90505b8281101561154a576115428461153d8385613a55565b612e28565b600101611527565b506001600160a01b0383163b15611695577f150b7a02000000000000000000000000000000000000000000000000000000006001600160a01b03841663150b7a02336040517fffffffff0000000000000000000000000000000000000000000000000000000060e084901b1681526001600160a01b0390911660048201525f602482018190526044820186905260806064830152608482015260a4016020604051808303815f875af1158015611602573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906116269190613a68565b7fffffffff0000000000000000000000000000000000000000000000000000000016146116955760405162461bcd60e51b815260206004820152601e60248201527f5472616e7366657220746f206e6f6e20455243373231526563656976657200006044820152606401610aca565b7fdcb23284f3935b5557998e99dcc286e29744c5000723d99eecd5d6f5694f6e1183835f6040516116c893929190613a83565b60405180910390a150610b3d6001600355565b600f546001600160a01b0316336001600160a01b03161461172a5760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b600b610d9d828483613af2565b5f5f5f5f5f5f5f60045f896004811115611753576117536136e9565b6004811115611764576117646136e9565b815260208082019290925260409081015f20815160e081018352815467ffffffffffffffff8082168084526801000000000000000090920416948201859052600183015493820184905260028301546060830152600383015460808301819052600484015460a0840181905260059094015460ff16151560c0909301839052909d949c50929a509198509650945092505050565b5f818152600760205260408120546001600160a01b0316610a6e565b600b805461182190613996565b80601f016020809104026020016040519081016040528092919081815260200182805461184d90613996565b80156118985780601f1061186f57610100808354040283529160200191611898565b820191905f5260205f20905b81548152906001019060200180831161187b57829003601f168201915b505050505081565b600f546001600160a01b0316336001600160a01b0316146118ef5760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b600d805460ff1916911515919091179055565b5f6001600160a01b0382166119595760405162461bcd60e51b815260206004820152601260248201527f5a65726f206164647265737320717565727900000000000000000000000000006044820152606401610aca565b506001600160a01b03165f9081526008602052604090205490565b600f546001600160a01b0316336001600160a01b0316146119c35760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b610e92612f7f565b606060068054610b5090613996565b60025460ff16611a2c5760405162461bcd60e51b815260206004820152601760248201527f54726164696e67206e6f7420656e61626c6564207965740000000000000000006044820152606401610aca565b336001600160a01b03831603611a845760405162461bcd60e51b815260206004820152601160248201527f417070726f766520746f2063616c6c65720000000000000000000000000000006044820152606401610aca565b335f818152600a602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b5f42611afc6001826126ea565b15611b0957600191505090565b611b146002826126ea565b15611b2157600291505090565b611b2c6003826126ea565b15611b3957600391505090565b611b446004826126ea565b15611b5157600491505090565b5f91505090565b5f5f5f5f5f5f5f5f60045f8a6004811115611b7557611b756136e9565b6004811115611b8657611b866136e9565b815260208082019290925260409081015f20815160e081018352815467ffffffffffffffff8082168084526801000000000000000090920416948201859052600183015493820184905260028301546060830152600383015460808301819052600484015460a0840181905260059094015460ff16151560c08401819052929650909493929091611c178f426126ea565b959f949e50929c50909a509850965090945092505050565b60025460ff16611c815760405162461bcd60e51b815260206004820152601760248201527f54726164696e67206e6f7420656e61626c6564207965740000000000000000006044820152606401610aca565b611c8b3383612a49565b611cd75760405162461bcd60e51b815260206004820152600c60248201527f4e6f7420617070726f76656400000000000000000000000000000000000000006044820152606401610aca565b611ce384848484613011565b50505050565b600f5474010000000000000000000000000000000000000000900460ff1615611d545760405162461bcd60e51b815260206004820152600f60248201527f436f6e74726163742070617573656400000000000000000000000000000000006044820152606401610aca565b611d5c612dcf565b5f83118015611d6c5750600a8311155b611db85760405162461bcd60e51b815260206004820152600e60248201527f496e76616c696420616d6f756e740000000000000000000000000000000000006044820152606401610aca565b7f000000000000000000000000000000000000000000000000000000000000000083600e54611de79190613a55565b1115611e355760405162461bcd60e51b815260206004820152600e60248201527f4578636565647320737570706c790000000000000000000000000000000000006044820152606401610aca565b335f908152601060205260409020547f000000000000000000000000000000000000000000000000000000000000000090611e71908590613a55565b1115611ebf5760405162461bcd60e51b815260206004820152601460248201527f457863656564732077616c6c6574206c696d69740000000000000000000000006044820152606401610aca565b5f611ec8611aef565b90505f816004811115611edd57611edd6136e9565b03611f2a5760405162461bcd60e51b815260206004820152600f60248201527f4e6f2061637469766520706861736500000000000000000000000000000000006044820152606401610aca565b5f60045f836004811115611f4057611f406136e9565b6004811115611f5157611f516136e9565b81526020019081526020015f2090505f858260010154611f7191906139e2565b905080341015611fc35760405162461bcd60e51b815260206004820152601460248201527f496e73756666696369656e74207061796d656e740000000000000000000000006044820152606401610aca565b600382015415612030578160030154868360040154611fe29190613a55565b11156120305760405162461bcd60e51b815260206004820152601460248201527f5068617365206c696d69742065786365656465640000000000000000000000006044820152606401610aca565b6004836004811115612044576120446136e9565b141580156120555750600282015415155b1561212d576120e18585808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525050505060028401546040517fffffffffffffffffffffffffffffffffffffffff0000000000000000000000003360601b1660208201526034015b60405160208183030381529060405280519060200120613074565b61212d5760405162461bcd60e51b815260206004820152600f60248201527f4e6f742077686974656c697374656400000000000000000000000000000000006044820152606401610aca565b5f600e54600161213d9190613a55565b335f90815260106020526040812080549293508992909190612160908490613a55565b9250508190555086836004015f82825461217a9190613a55565b9250508190555086600e5f8282546121929190613a55565b909155505f90505b878110156121b8576121b03361153d8385613a55565b60010161219a565b50333b156122fa577f150b7a0200000000000000000000000000000000000000000000000000000000336001600160a01b031663150b7a02336040517fffffffff0000000000000000000000000000000000000000000000000000000060e084901b1681526001600160a01b0390911660048201525f602482018190526044820186905260806064830152608482015260a4016020604051808303815f875af1158015612267573d5f5f3e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061228b9190613a68565b7fffffffff0000000000000000000000000000000000000000000000000000000016146122fa5760405162461bcd60e51b815260206004820152601e60248201527f5472616e7366657220746f206e6f6e20455243373231526563656976657200006044820152606401610aca565b8134111561231557612315336123108434613bac565b612cba565b7fdcb23284f3935b5557998e99dcc286e29744c5000723d99eecd5d6f5694f6e1133888660405161234893929190613a83565b60405180910390a150505050610d9d6001600355565b600c805461182190613996565b5f818152600760205260409020546060906001600160a01b03166123d15760405162461bcd60e51b815260206004820152601460248201527f546f6b656e20646f6573206e6f742065786973740000000000000000000000006044820152606401610aca565b600d5460ff1661246b57600b80546123e890613996565b80601f016020809104026020016040519081016040528092919081815260200182805461241490613996565b801561245f5780601f106124365761010080835404028352916020019161245f565b820191905f5260205f20905b81548152906001019060200180831161244257829003601f168201915b50505050509050919050565b600b61247683613089565b600c60405160200161248a93929190613c2d565b6040516020818303038152906040529050919050565b6040517fffffffffffffffffffffffffffffffffffffffff000000000000000000000000606083901b1660208201525f906124e190859085906034016120c6565b949350505050565b600f546001600160a01b0316336001600160a01b0316146125385760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b600c610d9d828483613af2565b600f546001600160a01b0316336001600160a01b0316146125945760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b6001600160a01b0381166125ea5760405162461bcd60e51b815260206004820152600d60248201527f496e76616c6964206f776e6572000000000000000000000000000000000000006044820152606401610aca565b600f80546001600160a01b038381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b5f7fffffffff0000000000000000000000000000000000000000000000000000000082167f2a55205a000000000000000000000000000000000000000000000000000000001480610a6e57507fffffffff0000000000000000000000000000000000000000000000000000000082167f01ffc9a7000000000000000000000000000000000000000000000000000000001492915050565b5f5f60045f856004811115612701576127016136e9565b6004811115612712576127126136e9565b815260208082019290925260409081015f20815160e081018352815467ffffffffffffffff80821683526801000000000000000090910416938101939093526001810154918301919091526002810154606083015260038101546080830152600481015460a08301526005015460ff16151560c0820181905290915061279b575f915050610a6e565b80515f9067ffffffffffffffff1615806127cc5750815f015167ffffffffffffffff168467ffffffffffffffff1610155b90505f826020015167ffffffffffffffff165f14806128035750826020015167ffffffffffffffff168567ffffffffffffffff1611155b90505f83608001515f148061281f575083608001518460a00151105b905082801561282b5750815b80156128345750805b979650505050505050565b6127106bffffffffffffffffffffffff82168110156128a1576040517f6f483d090000000000000000000000000000000000000000000000000000000081526bffffffffffffffffffffffff8316600482015260248101829052604401610aca565b6001600160a01b0383166128e3576040517fb6d9900a0000000000000000000000000000000000000000000000000000000081525f6004820152602401610aca565b50604080518082019091526001600160a01b039092168083526bffffffffffffffffffffffff909116602090920182905274010000000000000000000000000000000000000000909102175f55565b5f81815260096020526040902080547fffffffffffffffffffffffff0000000000000000000000000000000000000000166001600160a01b038416908117909155819061297e826117f8565b6001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45050565b60025460ff16612a095760405162461bcd60e51b815260206004820152601860248201527f54726164696e6720616c72656164792064697361626c656400000000000000006044820152606401610aca565b6002805460ff191690556040514281527f599377ff57724b4ddc4c3b527c958db52019985d806214ead5d9820d84413f96906020015b60405180910390a1565b5f818152600760205260408120546001600160a01b0316612aac5760405162461bcd60e51b815260206004820152601460248201527f546f6b656e20646f6573206e6f742065786973740000000000000000000000006044820152606401610aca565b5f612ab6836117f8565b9050806001600160a01b0316846001600160a01b03161480612af15750836001600160a01b0316612ae684610bd1565b6001600160a01b0316145b806124e157506001600160a01b038082165f908152600a602090815260408083209388168352929052205460ff166124e1565b826001600160a01b0316612b37826117f8565b6001600160a01b031614612b8d5760405162461bcd60e51b815260206004820152601d60248201527f5472616e736665722066726f6d20696e636f7272656374206f776e65720000006044820152606401610aca565b6001600160a01b038216612be35760405162461bcd60e51b815260206004820152601860248201527f5472616e7366657220746f207a65726f206164647265737300000000000000006044820152606401610aca565b612bed5f82612932565b6001600160a01b0383165f908152600860205260408120805460019290612c15908490613bac565b90915550506001600160a01b0382165f908152600860205260408120805460019290612c42908490613a55565b90915550505f8181526007602052604080822080547fffffffffffffffffffffffff0000000000000000000000000000000000000000166001600160a01b0386811691821790925591518493918716917fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef91a4505050565b80471015612d0a5760405162461bcd60e51b815260206004820152601d60248201527f416464726573733a20696e73756666696369656e742062616c616e63650000006044820152606401610aca565b5f826001600160a01b0316826040515f6040518083038185875af1925050503d805f8114612d53576040519150601f19603f3d011682016040523d82523d5f602084013e612d58565b606091505b5050905080610d9d5760405162461bcd60e51b815260206004820152603a60248201527f416464726573733a20756e61626c6520746f2073656e642076616c75652c207260448201527f6563697069656e74206d617920686176652072657665727465640000000000006064820152608401610aca565b600260035403612e215760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152606401610aca565b6002600355565b6001600160a01b038216612e7e5760405162461bcd60e51b815260206004820152601460248201527f4d696e7420746f207a65726f20616464726573730000000000000000000000006044820152606401610aca565b5f818152600760205260409020546001600160a01b031615612ee25760405162461bcd60e51b815260206004820152601460248201527f546f6b656e20616c7265616479206d696e7465640000000000000000000000006044820152606401610aca565b6001600160a01b0382165f908152600860205260408120805460019290612f0a908490613a55565b90915550505f8181526007602052604080822080547fffffffffffffffffffffffff0000000000000000000000000000000000000000166001600160a01b03861690811790915590518392907fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef908290a45050565b60025460ff1615612fd25760405162461bcd60e51b815260206004820152601760248201527f54726164696e6720616c726561647920656e61626c65640000000000000000006044820152606401610aca565b6002805460ff191660011790556040517fb3da2db3dfc3778f99852546c6e9ab39ec253f9de7b0847afec61bd27878e92390612a3f9042815260200190565b61301c848484612b24565b61302884848484613126565b611ce35760405162461bcd60e51b815260206004820152601e60248201527f5472616e7366657220746f206e6f6e20455243373231526563656976657200006044820152606401610aca565b5f82613080858461329d565b14949350505050565b60605f613095836132df565b60010190505f8167ffffffffffffffff8111156130b4576130b461372b565b6040519080825280601f01601f1916602001820160405280156130de576020820181803683370190505b5090508181016020015b5f19017f3031323334353637383961626364656600000000000000000000000000000000600a86061a8153600a85049450846130e857509392505050565b5f6001600160a01b0384163b15613292576040517f150b7a020000000000000000000000000000000000000000000000000000000081526001600160a01b0385169063150b7a0290613182903390899088908890600401613c5b565b6020604051808303815f875af19250505080156131bc575060408051601f3d908101601f191682019092526131b991810190613a68565b60015b613247573d8080156131e9576040519150601f19603f3d011682016040523d82523d5f602084013e6131ee565b606091505b5080515f0361323f5760405162461bcd60e51b815260206004820152601e60248201527f5472616e7366657220746f206e6f6e20455243373231526563656976657200006044820152606401610aca565b805181602001fd5b7fffffffff00000000000000000000000000000000000000000000000000000000167f150b7a02000000000000000000000000000000000000000000000000000000001490506124e1565b506001949350505050565b5f81815b84518110156132d7576132cd828683815181106132c0576132c0613c91565b60200260200101516133c0565b91506001016132a1565b509392505050565b5f807a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008310613327577a184f03e93ff9f4daa797ed6e38ed64bf6a1f010000000000000000830492506040015b6d04ee2d6d415b85acef81000000008310613353576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc10000831061337157662386f26fc10000830492506010015b6305f5e1008310613389576305f5e100830492506008015b612710831061339d57612710830492506004015b606483106133af576064830492506002015b600a8310610a6e5760010192915050565b5f8183106133da575f8281526020849052604090206133e8565b5f8381526020839052604090205b9392505050565b7fffffffff00000000000000000000000000000000000000000000000000000000811681146110ad575f5ffd5b5f6020828403121561342c575f5ffd5b81356133e8816133ef565b803560058110613445575f5ffd5b919050565b5f6020828403121561345a575f5ffd5b6133e882613437565b80356001600160a01b0381168114613445575f5ffd5b5f5f6040838503121561348a575f5ffd5b61349383613463565b915060208301356bffffffffffffffffffffffff811681146134b3575f5ffd5b809150509250929050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f6133e860208301846134be565b5f6020828403121561350e575f5ffd5b5035919050565b5f5f60408385031215613526575f5ffd5b61352f83613463565b946020939093013593505050565b80358015158114613445575f5ffd5b5f6020828403121561355c575f5ffd5b6133e88261353d565b5f5f5f60608486031215613577575f5ffd5b61358084613463565b925061358e60208501613463565b929592945050506040919091013590565b5f5f604083850312156135b0575f5ffd5b50508035926020909101359150565b803567ffffffffffffffff81168114613445575f5ffd5b5f5f5f5f5f5f60c087890312156135eb575f5ffd5b6135f487613437565b9550613602602088016135bf565b9450613610604088016135bf565b959894975094956060810135955060808101359460a0909101359350915050565b5f5f60208385031215613642575f5ffd5b823567ffffffffffffffff811115613658575f5ffd5b8301601f81018513613668575f5ffd5b803567ffffffffffffffff81111561367e575f5ffd5b85602082840101111561368f575f5ffd5b6020919091019590945092505050565b5f602082840312156136af575f5ffd5b6133e882613463565b5f5f604083850312156136c9575f5ffd5b6136d283613463565b91506136e06020840161353d565b90509250929050565b634e487b7160e01b5f52602160045260245ffd5b6005811061371957634e487b7160e01b5f52602160045260245ffd5b9052565b60208101610a6e82846136fd565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f1916810167ffffffffffffffff811182821017156137685761376861372b565b604052919050565b5f5f5f5f60808587031215613783575f5ffd5b61378c85613463565b935061379a60208601613463565b925060408501359150606085013567ffffffffffffffff8111156137bc575f5ffd5b8501601f810187136137cc575f5ffd5b803567ffffffffffffffff8111156137e6576137e661372b565b6137f96020601f19601f8401160161373f565b81815288602083850101111561380d575f5ffd5b816020840160208301375f6020838301015280935050505092959194509250565b5f5f5f60408486031215613840575f5ffd5b83359250602084013567ffffffffffffffff81111561385d575f5ffd5b8401601f8101861361386d575f5ffd5b803567ffffffffffffffff811115613883575f5ffd5b8660208260051b8401011115613897575f5ffd5b939660209190910195509293505050565b5f5f5f606084860312156138ba575f5ffd5b833567ffffffffffffffff8111156138d0575f5ffd5b8401601f810186136138e0575f5ffd5b803567ffffffffffffffff8111156138fa576138fa61372b565b8060051b61390a6020820161373f565b91825260208184018101929081019089841115613925575f5ffd5b6020850194505b8385101561394b5784358083526020958601959093509091019061392c565b965050505060208501359250613965905060408501613463565b90509250925092565b5f5f6040838503121561397f575f5ffd5b61398883613463565b91506136e060208401613463565b600181811c908216806139aa57607f821691505b6020821081036139c857634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b8082028115828204841417610a6e57610a6e6139ce565b5f82613a1357634e487b7160e01b5f52601260045260245ffd5b500490565b60808101613a2682876136fd565b67ffffffffffffffff8516602083015267ffffffffffffffff8416604083015282606083015295945050505050565b80820180821115610a6e57610a6e6139ce565b5f60208284031215613a78575f5ffd5b81516133e8816133ef565b6001600160a01b038416815260208101839052606081016124e160408301846136fd565b601f821115610d9d57805f5260205f20601f840160051c81016020851015613acc5750805b601f840160051c820191505b81811015613aeb575f8155600101613ad8565b5050505050565b67ffffffffffffffff831115613b0a57613b0a61372b565b613b1e83613b188354613996565b83613aa7565b5f601f841160018114613b4f575f8515613b385750838201355b5f19600387901b1c1916600186901b178355613aeb565b5f83815260208120601f198716915b82811015613b7e5786850135825560209485019460019092019101613b5e565b5086821015613b9a575f1960f88860031b161c19848701351681555b505060018560011b0183555050505050565b81810381811115610a6e57610a6e6139ce565b5f8154613bcb81613996565b600182168015613be25760018114613bf757613c24565b60ff1983168652811515820286019350613c24565b845f5260205f205f5b83811015613c1c57815488820152600190910190602001613c00565b505081860193505b50505092915050565b5f613c388286613bbf565b84518060208701835e5f9101908152613c518185613bbf565b9695505050505050565b6001600160a01b03851681526001600160a01b0384166020820152826040820152608060608201525f613c5160808301846134be565b634e487b7160e01b5f52603260045260245ffdfea26469706673582212201c430e5dc3290e0fe01703cbfd480045b788f2c3a5956b07cc22ab7ac79fc07b64736f6c634300081c003300000000000000000000000000000000000000000000000000000000000000c00000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000014000000000000000000000000000000000000000000000000000000000000001bc00000000000000000000000000000000000000000000000000000000000000010000000000000000000000007e2ae350d68ae2194bce9c0a244f97d593a061b5000000000000000000000000000000000000000000000000000000000000000c417065776176652050617373000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000034157500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005268747470733a2f2f697066732e696f2f2f697066732f6261667962656962336d7566346465756f6636377368346f6d6d7672327466736c6a33686c70706f70726d747a6b353672737a6661666d6b3479752f0000000000000000000000000000

0x6080604052600436106102cf575f3560e01c806369eee0051161017b578063b20d346a116100d1578063cd8c800011610087578063e985e9c511610062578063e985e9c5146108f0578063f0293fd314610937578063f2fde38b14610962575f5ffd5b8063cd8c80001461087f578063d5abeb011461089e578063da3ef23f146108d1575f5ffd5b8063ba41b0c6116100b7578063ba41b0c614610839578063c66828621461084c578063c87b56dd14610860575f5ffd5b8063b20d346a146107b6578063b88d4fde1461081a575f5ffd5b80638a8c523c11610131578063a22cb4651161010c578063a22cb46514610761578063a2309ff814610780578063a3a40ea514610795575f5ffd5b80638a8c523c1461071a5780638da5cb5b1461072e57806395d89b411461074d575f5ffd5b80636e361c59116101615780636e361c59146106c357806370a08231146106e25780637c6c357414610701575f5ffd5b806369eee005146106005780636c0360eb146106af575f5ffd5b80632a55205a11610230578063484b973c116101e65780635bdb68d0116101c15780635bdb68d0146105565780635c975abb146105b05780636352211e146105e1575f5ffd5b8063484b973c146104ff5780634ada218b1461051e57806355f804b314610537575f5ffd5b80634188446f116102165780634188446f1461048057806342842e0e1461049f578063453c2310146104be575f5ffd5b80632a55205a1461042e5780633ccfd60b1461046c575f5ffd5b8063081812fc1161028557806316c38b3c1161026b57806316c38b3c146103dc57806317700f01146103fb57806323b872dd1461040f575f5ffd5b8063081812fc14610386578063095ea7b3146103bd575f5ffd5b806304634d8d116102b557806304634d8d1461032d578063064a59d01461034e57806306fdde0314610365575f5ffd5b806301ffc9a7146102da578063020d77971461030e575f5ffd5b366102d657005b5f5ffd5b3480156102e5575f5ffd5b506102f96102f436600461341c565b610981565b60405190151581526020015b60405180910390f35b348015610319575f5ffd5b506102f961032836600461344a565b610a74565b348015610338575f5ffd5b5061034c610347366004613479565b610a7f565b005b348015610359575f5ffd5b5060025460ff166102f9565b348015610370575f5ffd5b50610379610b41565b60405161030591906134ec565b348015610391575f5ffd5b506103a56103a03660046134fe565b610bd1565b6040516001600160a01b039091168152602001610305565b3480156103c8575f5ffd5b5061034c6103d7366004613515565b610c4f565b3480156103e7575f5ffd5b5061034c6103f636600461354c565b610da2565b348015610406575f5ffd5b5061034c610e3b565b34801561041a575f5ffd5b5061034c610429366004613565565b610e94565b348015610439575f5ffd5b5061044d61044836600461359f565b610f47565b604080516001600160a01b039093168352602083019190915201610305565b348015610477575f5ffd5b5061034c610ffa565b34801561048b575f5ffd5b5061034c61049a3660046135d6565b6110b0565b3480156104aa575f5ffd5b5061034c6104b9366004613565565b611360565b3480156104c9575f5ffd5b506104f17f000000000000000000000000000000000000000000000000000000000000000181565b604051908152602001610305565b34801561050a575f5ffd5b5061034c610519366004613515565b6113cc565b348015610529575f5ffd5b506002546102f99060ff1681565b348015610542575f5ffd5b5061034c610551366004613631565b6116db565b348015610561575f5ffd5b5061057561057036600461344a565b611737565b6040805167ffffffffffffffff97881681529690951660208701529385019290925260608401526080830152151560a082015260c001610305565b3480156105bb575f5ffd5b50600f546102f99074010000000000000000000000000000000000000000900460ff1681565b3480156105ec575f5ffd5b506103a56105fb3660046134fe565b6117f8565b34801561060b575f5ffd5b5061066c61061a36600461344a565b600460208190525f918252604090912080546001820154600283015460038401549484015460059094015467ffffffffffffffff80851696680100000000000000009095041694929391929060ff1687565b6040805167ffffffffffffffff9889168152979096166020880152948601939093526060850191909152608084015260a0830152151560c082015260e001610305565b3480156106ba575f5ffd5b50610379611814565b3480156106ce575f5ffd5b5061034c6106dd36600461354c565b6118a0565b3480156106ed575f5ffd5b506104f16106fc36600461369f565b611902565b34801561070c575f5ffd5b50600d546102f99060ff1681565b348015610725575f5ffd5b5061034c611974565b348015610739575f5ffd5b50600f546103a5906001600160a01b031681565b348015610758575f5ffd5b506103796119cb565b34801561076c575f5ffd5b5061034c61077b3660046136b8565b6119da565b34801561078b575f5ffd5b506104f1600e5481565b3480156107a0575f5ffd5b506107a9611aef565b604051610305919061371d565b3480156107c1575f5ffd5b506107d56107d036600461344a565b611b58565b6040805167ffffffffffffffff98891681529790961660208801529486019390935260608501919091526080840152151560a0830152151560c082015260e001610305565b348015610825575f5ffd5b5061034c610834366004613770565b611c2f565b61034c61084736600461382e565b611ce9565b348015610857575f5ffd5b5061037961235e565b34801561086b575f5ffd5b5061037961087a3660046134fe565b61236b565b34801561088a575f5ffd5b506102f96108993660046138a8565b6124a0565b3480156108a9575f5ffd5b506104f17f00000000000000000000000000000000000000000000000000000000000001bc81565b3480156108dc575f5ffd5b5061034c6108eb366004613631565b6124e9565b3480156108fb575f5ffd5b506102f961090a36600461396e565b6001600160a01b039182165f908152600a6020908152604080832093909416825291909152205460ff1690565b348015610942575f5ffd5b506104f161095136600461369f565b60106020525f908152604090205481565b34801561096d575f5ffd5b5061034c61097c36600461369f565b612545565b5f7f80ac58cd000000000000000000000000000000000000000000000000000000007fffffffff0000000000000000000000000000000000000000000000000000000083161480610a1357507f5b5e139f000000000000000000000000000000000000000000000000000000007fffffffff000000000000000000000000000000000000000000000000000000008316145b80610a5f57507f01ffc9a7000000000000000000000000000000000000000000000000000000007fffffffff000000000000000000000000000000000000000000000000000000008316145b80610a6e5750610a6e82612653565b92915050565b5f610a6e82426126ea565b600f546001600160a01b0316336001600160a01b031614610ad35760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b60448201526064015b60405180910390fd5b6103e8816bffffffffffffffffffffffff161115610b335760405162461bcd60e51b815260206004820152600f60248201527f4d61782031302520726f79616c747900000000000000000000000000000000006044820152606401610aca565b610b3d828261283f565b5050565b606060058054610b5090613996565b80601f0160208091040260200160405190810160405280929190818152602001828054610b7c90613996565b8015610bc75780601f10610b9e57610100808354040283529160200191610bc7565b820191905f5260205f20905b815481529060010190602001808311610baa57829003601f168201915b5050505050905090565b5f818152600760205260408120546001600160a01b0316610c345760405162461bcd60e51b815260206004820152601460248201527f546f6b656e20646f6573206e6f742065786973740000000000000000000000006044820152606401610aca565b505f908152600960205260409020546001600160a01b031690565b60025460ff16610ca15760405162461bcd60e51b815260206004820152601760248201527f54726164696e67206e6f7420656e61626c6564207965740000000000000000006044820152606401610aca565b5f610cab826117f8565b9050806001600160a01b0316836001600160a01b031603610d0e5760405162461bcd60e51b815260206004820152601960248201527f417070726f76616c20746f2063757272656e74206f776e6572000000000000006044820152606401610aca565b336001600160a01b0382161480610d4757506001600160a01b0381165f908152600a6020908152604080832033845290915290205460ff165b610d935760405162461bcd60e51b815260206004820152601660248201527f4e6f74206f776e6572206e6f7220617070726f766564000000000000000000006044820152606401610aca565b610d9d8383612932565b505050565b600f546001600160a01b0316336001600160a01b031614610df15760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b600f805491151574010000000000000000000000000000000000000000027fffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffff909216919091179055565b600f546001600160a01b0316336001600160a01b031614610e8a5760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b610e926129b7565b565b60025460ff16610ee65760405162461bcd60e51b815260206004820152601760248201527f54726164696e67206e6f7420656e61626c6564207965740000000000000000006044820152606401610aca565b610ef03382612a49565b610f3c5760405162461bcd60e51b815260206004820152600c60248201527f4e6f7420617070726f76656400000000000000000000000000000000000000006044820152606401610aca565b610d9d838383612b24565b5f82815260016020526040812080548291906001600160a01b038116907401000000000000000000000000000000000000000090046bffffffffffffffffffffffff1681610fc55750505f546001600160a01b038116907401000000000000000000000000000000000000000090046bffffffffffffffffffffffff165b5f612710610fe16bffffffffffffffffffffffff8416896139e2565b610feb91906139f9565b92989297509195505050505050565b600f546001600160a01b0316336001600160a01b0316146110495760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b47806110975760405162461bcd60e51b815260206004820152600a60248201527f4e6f2062616c616e6365000000000000000000000000000000000000000000006044820152606401610aca565b600f546110ad906001600160a01b031682612cba565b50565b600f546001600160a01b0316336001600160a01b0316146110ff5760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b5f866004811115611112576111126136e9565b0361115f5760405162461bcd60e51b815260206004820152601760248201527f43616e6e6f742073657420636c6f7365642070686173650000000000000000006044820152606401610aca565b67ffffffffffffffff8416158061118957508467ffffffffffffffff168467ffffffffffffffff16115b6111d55760405162461bcd60e51b815260206004820152601260248201527f496e76616c69642074696d652072616e676500000000000000000000000000006044820152606401610aca565b6040518060e001604052808667ffffffffffffffff1681526020018567ffffffffffffffff16815260200184815260200183815260200182815260200160045f896004811115611227576112276136e9565b6004811115611238576112386136e9565b81526020019081526020015f206004015481526020016001151581525060045f88600481111561126a5761126a6136e9565b600481111561127b5761127b6136e9565b815260208082019290925260409081015f20835181549385015167ffffffffffffffff90811668010000000000000000027fffffffffffffffffffffffffffffffff00000000000000000000000000000000909516911617929092178255828101516001830155606083015160028301556080830151600383015560a0830151600483015560c0909201516005909101805491151560ff19909216919091179055517f0bcee2beaf589a3dac2dcd3260b29f94054184acbab475bc5ce3a2f3134895c090611350908890889088908890613a18565b60405180910390a1505050505050565b60025460ff166113b25760405162461bcd60e51b815260206004820152601760248201527f54726164696e67206e6f7420656e61626c6564207965740000000000000000006044820152606401610aca565b610d9d83838360405180602001604052805f815250611c2f565b600f546001600160a01b0316336001600160a01b03161461141b5760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b611423612dcf565b5f811180156114335750600a8111155b61147f5760405162461bcd60e51b815260206004820152600e60248201527f496e76616c696420616d6f756e740000000000000000000000000000000000006044820152606401610aca565b7f00000000000000000000000000000000000000000000000000000000000001bc81600e546114ae9190613a55565b11156114fc5760405162461bcd60e51b815260206004820152600e60248201527f4578636565647320737570706c790000000000000000000000000000000000006044820152606401610aca565b5f600e54600161150c9190613a55565b905081600e5f82825461151f9190613a55565b909155505f90505b8281101561154a576115428461153d8385613a55565b612e28565b600101611527565b506001600160a01b0383163b15611695577f150b7a02000000000000000000000000000000000000000000000000000000006001600160a01b03841663150b7a02336040517fffffffff0000000000000000000000000000000000000000000000000000000060e084901b1681526001600160a01b0390911660048201525f602482018190526044820186905260806064830152608482015260a4016020604051808303815f875af1158015611602573d5f5f3e3d5ffd5b505050506040513d601f19601f820116820180604052508101906116269190613a68565b7fffffffff0000000000000000000000000000000000000000000000000000000016146116955760405162461bcd60e51b815260206004820152601e60248201527f5472616e7366657220746f206e6f6e20455243373231526563656976657200006044820152606401610aca565b7fdcb23284f3935b5557998e99dcc286e29744c5000723d99eecd5d6f5694f6e1183835f6040516116c893929190613a83565b60405180910390a150610b3d6001600355565b600f546001600160a01b0316336001600160a01b03161461172a5760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b600b610d9d828483613af2565b5f5f5f5f5f5f5f60045f896004811115611753576117536136e9565b6004811115611764576117646136e9565b815260208082019290925260409081015f20815160e081018352815467ffffffffffffffff8082168084526801000000000000000090920416948201859052600183015493820184905260028301546060830152600383015460808301819052600484015460a0840181905260059094015460ff16151560c0909301839052909d949c50929a509198509650945092505050565b5f818152600760205260408120546001600160a01b0316610a6e565b600b805461182190613996565b80601f016020809104026020016040519081016040528092919081815260200182805461184d90613996565b80156118985780601f1061186f57610100808354040283529160200191611898565b820191905f5260205f20905b81548152906001019060200180831161187b57829003601f168201915b505050505081565b600f546001600160a01b0316336001600160a01b0316146118ef5760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b600d805460ff1916911515919091179055565b5f6001600160a01b0382166119595760405162461bcd60e51b815260206004820152601260248201527f5a65726f206164647265737320717565727900000000000000000000000000006044820152606401610aca565b506001600160a01b03165f9081526008602052604090205490565b600f546001600160a01b0316336001600160a01b0316146119c35760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b610e92612f7f565b606060068054610b5090613996565b60025460ff16611a2c5760405162461bcd60e51b815260206004820152601760248201527f54726164696e67206e6f7420656e61626c6564207965740000000000000000006044820152606401610aca565b336001600160a01b03831603611a845760405162461bcd60e51b815260206004820152601160248201527f417070726f766520746f2063616c6c65720000000000000000000000000000006044820152606401610aca565b335f818152600a602090815260408083206001600160a01b03871680855290835292819020805460ff191686151590811790915590519081529192917f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a35050565b5f42611afc6001826126ea565b15611b0957600191505090565b611b146002826126ea565b15611b2157600291505090565b611b2c6003826126ea565b15611b3957600391505090565b611b446004826126ea565b15611b5157600491505090565b5f91505090565b5f5f5f5f5f5f5f5f60045f8a6004811115611b7557611b756136e9565b6004811115611b8657611b866136e9565b815260208082019290925260409081015f20815160e081018352815467ffffffffffffffff8082168084526801000000000000000090920416948201859052600183015493820184905260028301546060830152600383015460808301819052600484015460a0840181905260059094015460ff16151560c08401819052929650909493929091611c178f426126ea565b959f949e50929c50909a509850965090945092505050565b60025460ff16611c815760405162461bcd60e51b815260206004820152601760248201527f54726164696e67206e6f7420656e61626c6564207965740000000000000000006044820152606401610aca565b611c8b3383612a49565b611cd75760405162461bcd60e51b815260206004820152600c60248201527f4e6f7420617070726f76656400000000000000000000000000000000000000006044820152606401610aca565b611ce384848484613011565b50505050565b600f5474010000000000000000000000000000000000000000900460ff1615611d545760405162461bcd60e51b815260206004820152600f60248201527f436f6e74726163742070617573656400000000000000000000000000000000006044820152606401610aca565b611d5c612dcf565b5f83118015611d6c5750600a8311155b611db85760405162461bcd60e51b815260206004820152600e60248201527f496e76616c696420616d6f756e740000000000000000000000000000000000006044820152606401610aca565b7f00000000000000000000000000000000000000000000000000000000000001bc83600e54611de79190613a55565b1115611e355760405162461bcd60e51b815260206004820152600e60248201527f4578636565647320737570706c790000000000000000000000000000000000006044820152606401610aca565b335f908152601060205260409020547f000000000000000000000000000000000000000000000000000000000000000190611e71908590613a55565b1115611ebf5760405162461bcd60e51b815260206004820152601460248201527f457863656564732077616c6c6574206c696d69740000000000000000000000006044820152606401610aca565b5f611ec8611aef565b90505f816004811115611edd57611edd6136e9565b03611f2a5760405162461bcd60e51b815260206004820152600f60248201527f4e6f2061637469766520706861736500000000000000000000000000000000006044820152606401610aca565b5f60045f836004811115611f4057611f406136e9565b6004811115611f5157611f516136e9565b81526020019081526020015f2090505f858260010154611f7191906139e2565b905080341015611fc35760405162461bcd60e51b815260206004820152601460248201527f496e73756666696369656e74207061796d656e740000000000000000000000006044820152606401610aca565b600382015415612030578160030154868360040154611fe29190613a55565b11156120305760405162461bcd60e51b815260206004820152601460248201527f5068617365206c696d69742065786365656465640000000000000000000000006044820152606401610aca565b6004836004811115612044576120446136e9565b141580156120555750600282015415155b1561212d576120e18585808060200260200160405190810160405280939291908181526020018383602002808284375f9201919091525050505060028401546040517fffffffffffffffffffffffffffffffffffffffff0000000000000000000000003360601b1660208201526034015b60405160208183030381529060405280519060200120613074565b61212d5760405162461bcd60e51b815260206004820152600f60248201527f4e6f742077686974656c697374656400000000000000000000000000000000006044820152606401610aca565b5f600e54600161213d9190613a55565b335f90815260106020526040812080549293508992909190612160908490613a55565b9250508190555086836004015f82825461217a9190613a55565b9250508190555086600e5f8282546121929190613a55565b909155505f90505b878110156121b8576121b03361153d8385613a55565b60010161219a565b50333b156122fa577f150b7a0200000000000000000000000000000000000000000000000000000000336001600160a01b031663150b7a02336040517fffffffff0000000000000000000000000000000000000000000000000000000060e084901b1681526001600160a01b0390911660048201525f602482018190526044820186905260806064830152608482015260a4016020604051808303815f875af1158015612267573d5f5f3e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061228b9190613a68565b7fffffffff0000000000000000000000000000000000000000000000000000000016146122fa5760405162461bcd60e51b815260206004820152601e60248201527f5472616e7366657220746f206e6f6e20455243373231526563656976657200006044820152606401610aca565b8134111561231557612315336123108434613bac565b612cba565b7fdcb23284f3935b5557998e99dcc286e29744c5000723d99eecd5d6f5694f6e1133888660405161234893929190613a83565b60405180910390a150505050610d9d6001600355565b600c805461182190613996565b5f818152600760205260409020546060906001600160a01b03166123d15760405162461bcd60e51b815260206004820152601460248201527f546f6b656e20646f6573206e6f742065786973740000000000000000000000006044820152606401610aca565b600d5460ff1661246b57600b80546123e890613996565b80601f016020809104026020016040519081016040528092919081815260200182805461241490613996565b801561245f5780601f106124365761010080835404028352916020019161245f565b820191905f5260205f20905b81548152906001019060200180831161244257829003601f168201915b50505050509050919050565b600b61247683613089565b600c60405160200161248a93929190613c2d565b6040516020818303038152906040529050919050565b6040517fffffffffffffffffffffffffffffffffffffffff000000000000000000000000606083901b1660208201525f906124e190859085906034016120c6565b949350505050565b600f546001600160a01b0316336001600160a01b0316146125385760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b600c610d9d828483613af2565b600f546001600160a01b0316336001600160a01b0316146125945760405162461bcd60e51b81526020600482015260096024820152682737ba1037bbb732b960b91b6044820152606401610aca565b6001600160a01b0381166125ea5760405162461bcd60e51b815260206004820152600d60248201527f496e76616c6964206f776e6572000000000000000000000000000000000000006044820152606401610aca565b600f80546001600160a01b038381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b5f7fffffffff0000000000000000000000000000000000000000000000000000000082167f2a55205a000000000000000000000000000000000000000000000000000000001480610a6e57507fffffffff0000000000000000000000000000000000000000000000000000000082167f01ffc9a7000000000000000000000000000000000000000000000000000000001492915050565b5f5f60045f856004811115612701576127016136e9565b6004811115612712576127126136e9565b815260208082019290925260409081015f20815160e081018352815467ffffffffffffffff80821683526801000000000000000090910416938101939093526001810154918301919091526002810154606083015260038101546080830152600481015460a08301526005015460ff16151560c0820181905290915061279b575f915050610a6e565b80515f9067ffffffffffffffff1615806127cc5750815f015167ffffffffffffffff168467ffffffffffffffff1610155b90505f826020015167ffffffffffffffff165f14806128035750826020015167ffffffffffffffff168567ffffffffffffffff1611155b90505f83608001515f148061281f575083608001518460a00151105b905082801561282b5750815b80156128345750805b979650505050505050565b6127106bffffffffffffffffffffffff82168110156128a1576040517f6f483d090000000000000000000000000000000000000000000000000000000081526bffffffffffffffffffffffff8316600482015260248101829052604401610aca565b6001600160a01b0383166128e3576040517fb6d9900a0000000000000000000000000000000000000000000000000000000081525f6004820152602401610aca565b50604080518082019091526001600160a01b039092168083526bffffffffffffffffffffffff909116602090920182905274010000000000000000000000000000000000000000909102175f55565b5f81815260096020526040902080547fffffffffffffffffffffffff0000000000000000000000000000000000000000166001600160a01b038416908117909155819061297e826117f8565b6001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45050565b60025460ff16612a095760405162461bcd60e51b815260206004820152601860248201527f54726164696e6720616c72656164792064697361626c656400000000000000006044820152606401610aca565b6002805460ff191690556040514281527f599377ff57724b4ddc4c3b527c958db52019985d806214ead5d9820d84413f96906020015b60405180910390a1565b5f818152600760205260408120546001600160a01b0316612aac5760405162461bcd60e51b815260206004820152601460248201527f546f6b656e20646f6573206e6f742065786973740000000000000000000000006044820152606401610aca565b5f612ab6836117f8565b9050806001600160a01b0316846001600160a01b03161480612af15750836001600160a01b0316612ae684610bd1565b6001600160a01b0316145b806124e157506001600160a01b038082165f908152600a602090815260408083209388168352929052205460ff166124e1565b826001600160a01b0316612b37826117f8565b6001600160a01b031614612b8d5760405162461bcd60e51b815260206004820152601d60248201527f5472616e736665722066726f6d20696e636f7272656374206f776e65720000006044820152606401610aca565b6001600160a01b038216612be35760405162461bcd60e51b815260206004820152601860248201527f5472616e7366657220746f207a65726f206164647265737300000000000000006044820152606401610aca565b612bed5f82612932565b6001600160a01b0383165f908152600860205260408120805460019290612c15908490613bac565b90915550506001600160a01b0382165f908152600860205260408120805460019290612c42908490613a55565b90915550505f8181526007602052604080822080547fffffffffffffffffffffffff0000000000000000000000000000000000000000166001600160a01b0386811691821790925591518493918716917fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef91a4505050565b80471015612d0a5760405162461bcd60e51b815260206004820152601d60248201527f416464726573733a20696e73756666696369656e742062616c616e63650000006044820152606401610aca565b5f826001600160a01b0316826040515f6040518083038185875af1925050503d805f8114612d53576040519150601f19603f3d011682016040523d82523d5f602084013e612d58565b606091505b5050905080610d9d5760405162461bcd60e51b815260206004820152603a60248201527f416464726573733a20756e61626c6520746f2073656e642076616c75652c207260448201527f6563697069656e74206d617920686176652072657665727465640000000000006064820152608401610aca565b600260035403612e215760405162461bcd60e51b815260206004820152601f60248201527f5265656e7472616e637947756172643a207265656e7472616e742063616c6c006044820152606401610aca565b6002600355565b6001600160a01b038216612e7e5760405162461bcd60e51b815260206004820152601460248201527f4d696e7420746f207a65726f20616464726573730000000000000000000000006044820152606401610aca565b5f818152600760205260409020546001600160a01b031615612ee25760405162461bcd60e51b815260206004820152601460248201527f546f6b656e20616c7265616479206d696e7465640000000000000000000000006044820152606401610aca565b6001600160a01b0382165f908152600860205260408120805460019290612f0a908490613a55565b90915550505f8181526007602052604080822080547fffffffffffffffffffffffff0000000000000000000000000000000000000000166001600160a01b03861690811790915590518392907fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef908290a45050565b60025460ff1615612fd25760405162461bcd60e51b815260206004820152601760248201527f54726164696e6720616c726561647920656e61626c65640000000000000000006044820152606401610aca565b6002805460ff191660011790556040517fb3da2db3dfc3778f99852546c6e9ab39ec253f9de7b0847afec61bd27878e92390612a3f9042815260200190565b61301c848484612b24565b61302884848484613126565b611ce35760405162461bcd60e51b815260206004820152601e60248201527f5472616e7366657220746f206e6f6e20455243373231526563656976657200006044820152606401610aca565b5f82613080858461329d565b14949350505050565b60605f613095836132df565b60010190505f8167ffffffffffffffff8111156130b4576130b461372b565b6040519080825280601f01601f1916602001820160405280156130de576020820181803683370190505b5090508181016020015b5f19017f3031323334353637383961626364656600000000000000000000000000000000600a86061a8153600a85049450846130e857509392505050565b5f6001600160a01b0384163b15613292576040517f150b7a020000000000000000000000000000000000000000000000000000000081526001600160a01b0385169063150b7a0290613182903390899088908890600401613c5b565b6020604051808303815f875af19250505080156131bc575060408051601f3d908101601f191682019092526131b991810190613a68565b60015b613247573d8080156131e9576040519150601f19603f3d011682016040523d82523d5f602084013e6131ee565b606091505b5080515f0361323f5760405162461bcd60e51b815260206004820152601e60248201527f5472616e7366657220746f206e6f6e20455243373231526563656976657200006044820152606401610aca565b805181602001fd5b7fffffffff00000000000000000000000000000000000000000000000000000000167f150b7a02000000000000000000000000000000000000000000000000000000001490506124e1565b506001949350505050565b5f81815b84518110156132d7576132cd828683815181106132c0576132c0613c91565b60200260200101516133c0565b91506001016132a1565b509392505050565b5f807a184f03e93ff9f4daa797ed6e38ed64bf6a1f0100000000000000008310613327577a184f03e93ff9f4daa797ed6e38ed64bf6a1f010000000000000000830492506040015b6d04ee2d6d415b85acef81000000008310613353576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc10000831061337157662386f26fc10000830492506010015b6305f5e1008310613389576305f5e100830492506008015b612710831061339d57612710830492506004015b606483106133af576064830492506002015b600a8310610a6e5760010192915050565b5f8183106133da575f8281526020849052604090206133e8565b5f8381526020839052604090205b9392505050565b7fffffffff00000000000000000000000000000000000000000000000000000000811681146110ad575f5ffd5b5f6020828403121561342c575f5ffd5b81356133e8816133ef565b803560058110613445575f5ffd5b919050565b5f6020828403121561345a575f5ffd5b6133e882613437565b80356001600160a01b0381168114613445575f5ffd5b5f5f6040838503121561348a575f5ffd5b61349383613463565b915060208301356bffffffffffffffffffffffff811681146134b3575f5ffd5b809150509250929050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f6133e860208301846134be565b5f6020828403121561350e575f5ffd5b5035919050565b5f5f60408385031215613526575f5ffd5b61352f83613463565b946020939093013593505050565b80358015158114613445575f5ffd5b5f6020828403121561355c575f5ffd5b6133e88261353d565b5f5f5f60608486031215613577575f5ffd5b61358084613463565b925061358e60208501613463565b929592945050506040919091013590565b5f5f604083850312156135b0575f5ffd5b50508035926020909101359150565b803567ffffffffffffffff81168114613445575f5ffd5b5f5f5f5f5f5f60c087890312156135eb575f5ffd5b6135f487613437565b9550613602602088016135bf565b9450613610604088016135bf565b959894975094956060810135955060808101359460a0909101359350915050565b5f5f60208385031215613642575f5ffd5b823567ffffffffffffffff811115613658575f5ffd5b8301601f81018513613668575f5ffd5b803567ffffffffffffffff81111561367e575f5ffd5b85602082840101111561368f575f5ffd5b6020919091019590945092505050565b5f602082840312156136af575f5ffd5b6133e882613463565b5f5f604083850312156136c9575f5ffd5b6136d283613463565b91506136e06020840161353d565b90509250929050565b634e487b7160e01b5f52602160045260245ffd5b6005811061371957634e487b7160e01b5f52602160045260245ffd5b9052565b60208101610a6e82846136fd565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f1916810167ffffffffffffffff811182821017156137685761376861372b565b604052919050565b5f5f5f5f60808587031215613783575f5ffd5b61378c85613463565b935061379a60208601613463565b925060408501359150606085013567ffffffffffffffff8111156137bc575f5ffd5b8501601f810187136137cc575f5ffd5b803567ffffffffffffffff8111156137e6576137e661372b565b6137f96020601f19601f8401160161373f565b81815288602083850101111561380d575f5ffd5b816020840160208301375f6020838301015280935050505092959194509250565b5f5f5f60408486031215613840575f5ffd5b83359250602084013567ffffffffffffffff81111561385d575f5ffd5b8401601f8101861361386d575f5ffd5b803567ffffffffffffffff811115613883575f5ffd5b8660208260051b8401011115613897575f5ffd5b939660209190910195509293505050565b5f5f5f606084860312156138ba575f5ffd5b833567ffffffffffffffff8111156138d0575f5ffd5b8401601f810186136138e0575f5ffd5b803567ffffffffffffffff8111156138fa576138fa61372b565b8060051b61390a6020820161373f565b91825260208184018101929081019089841115613925575f5ffd5b6020850194505b8385101561394b5784358083526020958601959093509091019061392c565b965050505060208501359250613965905060408501613463565b90509250925092565b5f5f6040838503121561397f575f5ffd5b61398883613463565b91506136e060208401613463565b600181811c908216806139aa57607f821691505b6020821081036139c857634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b8082028115828204841417610a6e57610a6e6139ce565b5f82613a1357634e487b7160e01b5f52601260045260245ffd5b500490565b60808101613a2682876136fd565b67ffffffffffffffff8516602083015267ffffffffffffffff8416604083015282606083015295945050505050565b80820180821115610a6e57610a6e6139ce565b5f60208284031215613a78575f5ffd5b81516133e8816133ef565b6001600160a01b038416815260208101839052606081016124e160408301846136fd565b601f821115610d9d57805f5260205f20601f840160051c81016020851015613acc5750805b601f840160051c820191505b81811015613aeb575f8155600101613ad8565b5050505050565b67ffffffffffffffff831115613b0a57613b0a61372b565b613b1e83613b188354613996565b83613aa7565b5f601f841160018114613b4f575f8515613b385750838201355b5f19600387901b1c1916600186901b178355613aeb565b5f83815260208120601f198716915b82811015613b7e5786850135825560209485019460019092019101613b5e565b5086821015613b9a575f1960f88860031b161c19848701351681555b505060018560011b0183555050505050565b81810381811115610a6e57610a6e6139ce565b5f8154613bcb81613996565b600182168015613be25760018114613bf757613c24565b60ff1983168652811515820286019350613c24565b845f5260205f205f5b83811015613c1c57815488820152600190910190602001613c00565b505081860193505b50505092915050565b5f613c388286613bbf565b84518060208701835e5f9101908152613c518185613bbf565b9695505050505050565b6001600160a01b03851681526001600160a01b0384166020820152826040820152608060608201525f613c5160808301846134be565b634e487b7160e01b5f52603260045260245ffdfea26469706673582212201c430e5dc3290e0fe01703cbfd480045b788f2c3a5956b07cc22ab7ac79fc07b64736f6c634300081c0033

137308:14872:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;151810:330;;;;;;;;;;-1:-1:-1;151810:330:0;;;;;:::i;:::-;;:::i;:::-;;;611:14:1;;604:22;586:41;;574:2;559:18;151810:330:0;;;;;;;;145483:146;;;;;;;;;;-1:-1:-1;145483:146:0;;;;;:::i;:::-;;:::i;144810:205::-;;;;;;;;;;-1:-1:-1;144810:205:0;;;;;:::i;:::-;;:::i;:::-;;133900:97;;;;;;;;;;-1:-1:-1;133975:14:0;;;;133900:97;;146711:83;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;148337:178::-;;;;;;;;;;-1:-1:-1;148337:178:0;;;;;:::i;:::-;;:::i;:::-;;;-1:-1:-1;;;;;2538:55:1;;;2520:74;;2508:2;2493:18;148337:178:0;2374:226:1;147987:342:0;;;;;;;;;;-1:-1:-1;147987:342:0;;;;;:::i;:::-;;:::i;144715:87::-;;;;;;;;;;-1:-1:-1;144715:87:0;;;;;:::i;:::-;;:::i;144512:81::-;;;;;;;;;;;;;:::i;148975:215::-;;;;;;;;;;-1:-1:-1;148975:215:0;;;;;:::i;:::-;;:::i;129989:673::-;;;;;;;;;;-1:-1:-1;129989:673:0;;;;;:::i;:::-;;:::i;:::-;;;;-1:-1:-1;;;;;4182:55:1;;;4164:74;;4269:2;4254:18;;4247:34;;;;4137:18;129989:673:0;3990:297:1;145280:195:0;;;;;;;;;;;;;:::i;142467:717::-;;;;;;;;;;-1:-1:-1;142467:717:0;;;;;:::i;:::-;;:::i;149198:153::-;;;;;;;;;;-1:-1:-1;149198:153:0;;;;;:::i;:::-;;:::i;138221:37::-;;;;;;;;;;;;;;;;;;5319:25:1;;;5307:2;5292:18;138221:37:0;5173:177:1;141697:762:0;;;;;;;;;;-1:-1:-1;141697:762:0;;;;;:::i;:::-;;:::i;133177:26::-;;;;;;;;;;-1:-1:-1;133177:26:0;;;;;;;;144601:106;;;;;;;;;;-1:-1:-1;144601:106:0;;;;;:::i;:::-;;:::i;146226:477::-;;;;;;;;;;-1:-1:-1;146226:477:0;;;;;:::i;:::-;;:::i;:::-;;;;6254:18:1;6242:31;;;6224:50;;6310:31;;;;6305:2;6290:18;;6283:59;6358:18;;;6351:34;;;;6416:2;6401:18;;6394:34;6459:3;6444:19;;6437:35;6516:14;6509:22;6503:3;6488:19;;6481:51;6211:3;6196:19;146226:477:0;5947:591:1;138325:18:0;;;;;;;;;;-1:-1:-1;138325:18:0;;;;;;;;;;;147628:107;;;;;;;;;;-1:-1:-1;147628:107:0;;;;;:::i;:::-;;:::i;137724:43::-;;;;;;;;;;-1:-1:-1;137724:43:0;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;6878:18:1;6866:31;;;6848:50;;6934:31;;;;6929:2;6914:18;;6907:59;6982:18;;;6975:34;;;;7040:2;7025:18;;7018:34;;;;7083:3;7068:19;;7061:35;7127:3;7112:19;;7105:35;7184:14;7177:22;7171:3;7156:19;;7149:51;6835:3;6820:19;137724:43:0;6543:663:1;138072:21:0;;;;;;;;;;;;;:::i;147198:110::-;;;;;;;;;;-1:-1:-1;147198:110:0;;;;;:::i;:::-;;:::i;147450:170::-;;;;;;;;;;-1:-1:-1;147450:170:0;;;;;:::i;:::-;;:::i;138144:29::-;;;;;;;;;;-1:-1:-1;138144:29:0;;;;;;;;144425:79;;;;;;;;;;;;;:::i;138298:20::-;;;;;;;;;;-1:-1:-1;138298:20:0;;;;-1:-1:-1;;;;;138298:20:0;;;146802:87;;;;;;;;;;;;;:::i;148523:287::-;;;;;;;;;;-1:-1:-1;148523:287:0;;;;;:::i;:::-;;:::i;138265:26::-;;;;;;;;;;;;;;;;143192:465;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;145637:581::-;;;;;;;;;;-1:-1:-1;145637:581:0;;;;;:::i;:::-;;:::i;:::-;;;;8679:18:1;8667:31;;;8649:50;;8735:31;;;;8730:2;8715:18;;8708:59;8783:18;;;8776:34;;;;8841:2;8826:18;;8819:34;;;;8884:3;8869:19;;8862:35;8941:14;8934:22;8928:3;8913:19;;8906:51;9001:14;8994:22;8988:3;8973:19;;8966:51;8636:3;8621:19;145637:581:0;8350:673:1;149359:248:0;;;;;;;;;;-1:-1:-1;149359:248:0;;;;;:::i;:::-;;:::i;139757:1932::-;;;;;;:::i;:::-;;:::i;138100:37::-;;;;;;;;;;;;;:::i;146897:289::-;;;;;;;;;;-1:-1:-1;146897:289:0;;;;;:::i;:::-;;:::i;144185:232::-;;;;;;;;;;-1:-1:-1;144185:232:0;;;;;:::i;:::-;;:::i;138180:34::-;;;;;;;;;;;;;;;147316:122;;;;;;;;;;-1:-1:-1;147316:122:0;;;;;:::i;:::-;;:::i;148818:149::-;;;;;;;;;;-1:-1:-1;148818:149:0;;;;;:::i;:::-;-1:-1:-1;;;;;148923:26:0;;;148899:4;148923:26;;;:18;:26;;;;;;;;:36;;;;;;;;;;;;;;;148818:149;138356:46;;;;;;;;;;-1:-1:-1;138356:46:0;;;;;:::i;:::-;;;;;;;;;;;;;;145023:249;;;;;;;;;;-1:-1:-1;145023:249:0;;;;;:::i;:::-;;:::i;151810:330::-;151895:4;151932:25;;;;;;:77;;-1:-1:-1;151984:25:0;;;;;151932:77;:137;;;-1:-1:-1;152044:25:0;;;;;151932:137;:200;;;;152096:36;152120:11;152096:23;:36::i;:::-;151912:220;151810:330;-1:-1:-1;;151810:330:0:o;145483:146::-;145551:4;145575:46;145590:5;145604:15;145575:14;:46::i;144810:205::-;138972:5;;-1:-1:-1;;;;;138972:5:0;21297:10;-1:-1:-1;;;;;138956:21:0;;138948:43;;;;-1:-1:-1;;;138948:43:0;;13047:2:1;138948:43:0;;;13029:21:1;13086:1;13066:18;;;13059:29;-1:-1:-1;;;13104:18:1;;;13097:39;13153:18;;138948:43:0;;;;;;;;;144930:4:::1;144914:12;:20;;;;144906:48;;;::::0;-1:-1:-1;;;144906:48:0;;13384:2:1;144906:48:0::1;::::0;::::1;13366:21:1::0;13423:2;13403:18;;;13396:30;13462:17;13442:18;;;13435:45;13497:18;;144906:48:0::1;13182:339:1::0;144906:48:0::1;144965:42;144984:8;144994:12;144965:18;:42::i;:::-;144810:205:::0;;:::o;146711:83::-;146748:13;146781:5;146774:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;146711:83;:::o;148337:178::-;148396:7;147941:16;;;:7;:16;;;;;;-1:-1:-1;;;;;147941:16:0;148416:49;;;;-1:-1:-1;;;148416:49:0;;14170:2:1;148416:49:0;;;14152:21:1;14209:2;14189:18;;;14182:30;14248:22;14228:18;;;14221:50;14288:18;;148416:49:0;13968:344:1;148416:49:0;-1:-1:-1;148483:24:0;;;;:15;:24;;;;;;-1:-1:-1;;;;;148483:24:0;;148337:178::o;147987:342::-;133431:14;;;;133423:50;;;;-1:-1:-1;;;133423:50:0;;14519:2:1;133423:50:0;;;14501:21:1;14558:2;14538:18;;;14531:30;14597:25;14577:18;;;14570:53;14640:18;;133423:50:0;14317:347:1;133423:50:0;148070:14:::1;148087:16;148095:7;148087;:16::i;:::-;148070:33;;148128:6;-1:-1:-1::0;;;;;148122:12:0::1;:2;-1:-1:-1::0;;;;;148122:12:0::1;::::0;148114:50:::1;;;::::0;-1:-1:-1;;;148114:50:0;;14871:2:1;148114:50:0::1;::::0;::::1;14853:21:1::0;14910:2;14890:18;;;14883:30;14949:27;14929:18;;;14922:55;14994:18;;148114:50:0::1;14669:349:1::0;148114:50:0::1;21297:10:::0;-1:-1:-1;;;;;148183:22:0;::::1;;::::0;:64:::1;;-1:-1:-1::0;;;;;;148923:26:0;;148899:4;148923:26;;;:18;:26;;;;;;;;21297:10;148923:36;;;;;;;;;;148209:38:::1;148175:112;;;::::0;-1:-1:-1;;;148175:112:0;;15225:2:1;148175:112:0::1;::::0;::::1;15207:21:1::0;15264:2;15244:18;;;15237:30;15303:24;15283:18;;;15276:52;15345:18;;148175:112:0::1;15023:346:1::0;148175:112:0::1;148300:21;148309:2;148313:7;148300:8;:21::i;:::-;148059:270;147987:342:::0;;:::o;144715:87::-;138972:5;;-1:-1:-1;;;;;138972:5:0;21297:10;-1:-1:-1;;;;;138956:21:0;;138948:43;;;;-1:-1:-1;;;138948:43:0;;13047:2:1;138948:43:0;;;13029:21:1;13086:1;13066:18;;;13059:29;-1:-1:-1;;;13104:18:1;;;13097:39;13153:18;;138948:43:0;12845:332:1;138948:43:0;144778:6:::1;:16:::0;;;::::1;;::::0;::::1;::::0;;;::::1;::::0;;;::::1;::::0;;144715:87::o;144512:81::-;138972:5;;-1:-1:-1;;;;;138972:5:0;21297:10;-1:-1:-1;;;;;138956:21:0;;138948:43;;;;-1:-1:-1;;;138948:43:0;;13047:2:1;138948:43:0;;;13029:21:1;13086:1;13066:18;;;13059:29;-1:-1:-1;;;13104:18:1;;;13097:39;13153:18;;138948:43:0;12845:332:1;138948:43:0;144568:17:::1;:15;:17::i;:::-;144512:81::o:0;148975:215::-;133431:14;;;;133423:50;;;;-1:-1:-1;;;133423:50:0;;14519:2:1;133423:50:0;;;14501:21:1;14558:2;14538:18;;;14531:30;14597:25;14577:18;;;14570:53;14640:18;;133423:50:0;14317:347:1;133423:50:0;149085:41:::1;21297:10:::0;149118:7:::1;149085:18;:41::i;:::-;149077:66;;;::::0;-1:-1:-1;;;149077:66:0;;15576:2:1;149077:66:0::1;::::0;::::1;15558:21:1::0;15615:2;15595:18;;;15588:30;15654:14;15634:18;;;15627:42;15686:18;;149077:66:0::1;15374:336:1::0;149077:66:0::1;149154:28;149164:4;149170:2;149174:7;149154:9;:28::i;129989:673::-:0;130100:16;130180:26;;;:17;:26;;;;;130243:21;;130100:16;;130180:26;-1:-1:-1;;;;;130243:21:0;;;130300:28;;;;;130243:21;130341:176;;-1:-1:-1;;130409:19:0;:28;-1:-1:-1;;;;;130409:28:0;;;130470:35;;;;;130341:176;130529:21;131028:5;130554:27;130553:49;130554:27;;:9;:27;:::i;:::-;130553:49;;;;:::i;:::-;130623:15;;;;-1:-1:-1;129989:673:0;;-1:-1:-1;;;;;;129989:673:0:o;145280:195::-;138972:5;;-1:-1:-1;;;;;138972:5:0;21297:10;-1:-1:-1;;;;;138956:21:0;;138948:43;;;;-1:-1:-1;;;138948:43:0;;13047:2:1;138948:43:0;;;13029:21:1;13086:1;13066:18;;;13059:29;-1:-1:-1;;;13104:18:1;;;13097:39;13153:18;;138948:43:0;12845:332:1;138948:43:0;145348:21:::1;145388:11:::0;145380:34:::1;;;::::0;-1:-1:-1;;;145380:34:0;;16747:2:1;145380:34:0::1;::::0;::::1;16729:21:1::0;16786:2;16766:18;;;16759:30;16825:12;16805:18;;;16798:40;16855:18;;145380:34:0::1;16545:334:1::0;145380:34:0::1;145451:5;::::0;145425:42:::1;::::0;-1:-1:-1;;;;;145451:5:0::1;145459:7:::0;145425:17:::1;:42::i;:::-;145319:156;145280:195::o:0;142467:717::-;138972:5;;-1:-1:-1;;;;;138972:5:0;21297:10;-1:-1:-1;;;;;138956:21:0;;138948:43;;;;-1:-1:-1;;;138948:43:0;;13047:2:1;138948:43:0;;;13029:21:1;13086:1;13066:18;;;13059:29;-1:-1:-1;;;13104:18:1;;;13097:39;13153:18;;138948:43:0;12845:332:1;138948:43:0;142693:12:::1;142684:5;:21;;;;;;;;:::i;:::-;::::0;142676:57:::1;;;::::0;-1:-1:-1;;;142676:57:0;;17086:2:1;142676:57:0::1;::::0;::::1;17068:21:1::0;17125:2;17105:18;;;17098:30;17164:25;17144:18;;;17137:53;17207:18;;142676:57:0::1;16884:347:1::0;142676:57:0::1;142752:12;::::0;::::1;::::0;;:35:::1;;;142778:9;142768:19;;:7;:19;;;142752:35;142744:66;;;::::0;-1:-1:-1;;;142744:66:0;;17438:2:1;142744:66:0::1;::::0;::::1;17420:21:1::0;17477:2;17457:18;;;17450:30;17516:20;17496:18;;;17489:48;17554:18;;142744:66:0::1;17236:342:1::0;142744:66:0::1;142847:257;;;;;;;;142885:9;142847:257;;;;;;142918:7;142847:257;;;;;;142947:5;142847:257;;;;142979:10;142847:257;;;;143014:8;142847:257;;;;143045:6;:13;143052:5;143045:13;;;;;;;;:::i;:::-;;;;;;;;;:::i;:::-;;;;;;;;;;;;:20;;;142847:257;;;;143088:4;142847:257;;;;::::0;142831:6:::1;:13;142838:5;142831:13;;;;;;;;:::i;:::-;;;;;;;;;:::i;:::-;::::0;;::::1;::::0;;::::1;::::0;;;;;;;;-1:-1:-1;142831:13:0;:273;;;;;;::::1;::::0;::::1;::::0;;::::1;::::0;::::1;::::0;;;;;::::1;::::0;;;;::::1;::::0;;;;::::1;::::0;;;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;::::1;::::0;;::::1;::::0;::::1;::::0;;::::1;::::0;;;::::1;;-1:-1:-1::0;;142831:273:0;;::::1;::::0;;;::::1;::::0;;143130:46;::::1;::::0;::::1;::::0;143143:5;;143150:9;;143161:7;;143170:5;;143130:46:::1;:::i;:::-;;;;;;;;142467:717:::0;;;;;;:::o;149198:153::-;133431:14;;;;133423:50;;;;-1:-1:-1;;;133423:50:0;;14519:2:1;133423:50:0;;;14501:21:1;14558:2;14538:18;;;14531:30;14597:25;14577:18;;;14570:53;14640:18;;133423:50:0;14317:347:1;133423:50:0;149304:39:::1;149321:4;149327:2;149331:7;149304:39;;;;;;;;;;;::::0;:16:::1;:39::i;141697:762::-:0;138972:5;;-1:-1:-1;;;;;138972:5:0;21297:10;-1:-1:-1;;;;;138956:21:0;;138948:43;;;;-1:-1:-1;;;138948:43:0;;13047:2:1;138948:43:0;;;13029:21:1;13086:1;13066:18;;;13059:29;-1:-1:-1;;;13104:18:1;;;13097:39;13153:18;;138948:43:0;12845:332:1;138948:43:0;136324:21:::1;:19;:21::i;:::-;141804:1:::2;141795:6;:10;:26;;;;;141819:2;141809:6;:12;;141795:26;141787:53;;;::::0;-1:-1:-1;;;141787:53:0;;18250:2:1;141787:53:0::2;::::0;::::2;18232:21:1::0;18289:2;18269:18;;;18262:30;18328:16;18308:18;;;18301:44;18362:18;;141787:53:0::2;18048:338:1::0;141787:53:0::2;141883:9;141873:6;141859:11;;:20;;;;:::i;:::-;:33;;141851:60;;;::::0;-1:-1:-1;;;141851:60:0;;18723:2:1;141851:60:0::2;::::0;::::2;18705:21:1::0;18762:2;18742:18;;;18735:30;18801:16;18781:18;;;18774:44;18835:18;;141851:60:0::2;18521:338:1::0;141851:60:0::2;141932:20;141955:11;;141969:1;141955:15;;;;:::i;:::-;141932:38;;141996:6;141981:11;;:21;;;;;;;:::i;:::-;::::0;;;-1:-1:-1;142028:9:0::2;::::0;-1:-1:-1;142023:91:0::2;142047:6;142043:1;:10;142023:91;;;142075:27;142081:2:::0;142085:16:::2;142100:1:::0;142085:12;:16:::2;:::i;:::-;142075:5;:27::i;:::-;142055:3;;142023:91;;;-1:-1:-1::0;;;;;;142130:14:0;::::2;;:18:::0;142126:268:::2;;142275:41:::0;-1:-1:-1;;;;;142191:36:0;::::2;142275:41;21297:10:::0;142191:80:::2;::::0;;::::2;::::0;;;;;;-1:-1:-1;;;;;19149:55:1;;;142191:80:0::2;::::0;::::2;19131:74:1::0;142250:1:0::2;19221:18:1::0;;;19214:83;;;19313:18;;;19306:34;;;19376:3;19356:18;;;19349:31;19396:19;;;19389:30;19436:19;;142191:80:0::2;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;:125:::0;::::2;;142165:217;;;::::0;-1:-1:-1;;;142165:217:0;;19922:2:1;142165:217:0::2;::::0;::::2;19904:21:1::0;19961:2;19941:18;;;19934:30;20000:32;19980:18;;;19973:60;20050:18;;142165:217:0::2;19720:354:1::0;142165:217:0::2;142419:32;142426:2;142430:6;142438:12;142419:32;;;;;;;;:::i;:::-;;;;;;;;141776:683;136368:20:::1;135762:1:::0;136888:7;:22;136705:213;144601:106;138972:5;;-1:-1:-1;;;;;138972:5:0;21297:10;-1:-1:-1;;;;;138956:21:0;;138948:43;;;;-1:-1:-1;;;138948:43:0;;13047:2:1;138948:43:0;;;13029:21:1;13086:1;13066:18;;;13059:29;-1:-1:-1;;;13104:18:1;;;13097:39;13153:18;;138948:43:0;12845:332:1;138948:43:0;144679:7:::1;:20;144689:10:::0;;144679:7;:20:::1;:::i;146226:477::-:0;146294:16;146321:14;146346:13;146370:16;146397:14;146422:11;146452:25;146480:6;:13;146487:5;146480:13;;;;;;;;:::i;:::-;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;-1:-1:-1;146480:13:0;146452:41;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;146452:41:0;;-1:-1:-1;146452:41:0;;-1:-1:-1;146452:41:0;-1:-1:-1;146452:41:0;-1:-1:-1;146226:477:0;-1:-1:-1;;;146226:477:0:o;147628:107::-;147683:7;147828:16;;;:7;:16;;;;;;-1:-1:-1;;;;;147828:16:0;147710:17;147743:109;138072:21;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::o;147198:110::-;138972:5;;-1:-1:-1;;;;;138972:5:0;21297:10;-1:-1:-1;;;;;138956:21:0;;138948:43;;;;-1:-1:-1;;;138948:43:0;;13047:2:1;138948:43:0;;;13029:21:1;13086:1;13066:18;;;13059:29;-1:-1:-1;;;13104:18:1;;;13097:39;13153:18;;138948:43:0;12845:332:1;138948:43:0;147271:17:::1;:29:::0;;-1:-1:-1;;147271:29:0::1;::::0;::::1;;::::0;;;::::1;::::0;;147198:110::o;147450:170::-;147506:7;-1:-1:-1;;;;;147534:20:0;;147526:51;;;;-1:-1:-1;;;147526:51:0;;22879:2:1;147526:51:0;;;22861:21:1;22918:2;22898:18;;;22891:30;22957:20;22937:18;;;22930:48;22995:18;;147526:51:0;22677:342:1;147526:51:0;-1:-1:-1;;;;;;147595:17:0;;;;;:9;:17;;;;;;;147450:170::o;144425:79::-;138972:5;;-1:-1:-1;;;;;138972:5:0;21297:10;-1:-1:-1;;;;;138956:21:0;;138948:43;;;;-1:-1:-1;;;138948:43:0;;13047:2:1;138948:43:0;;;13029:21:1;13086:1;13066:18;;;13059:29;-1:-1:-1;;;13104:18:1;;;13097:39;13153:18;;138948:43:0;12845:332:1;138948:43:0;144480:16:::1;:14;:16::i;146802:87::-:0;146841:13;146874:7;146867:14;;;;;:::i;148523:287::-;133431:14;;;;133423:50;;;;-1:-1:-1;;;133423:50:0;;14519:2:1;133423:50:0;;;14501:21:1;14558:2;14538:18;;;14531:30;14597:25;14577:18;;;14570:53;14640:18;;133423:50:0;14317:347:1;133423:50:0;21297:10;-1:-1:-1;;;;;148628:24:0;::::1;::::0;148620:54:::1;;;::::0;-1:-1:-1;;;148620:54:0;;23226:2:1;148620:54:0::1;::::0;::::1;23208:21:1::0;23265:2;23245:18;;;23238:30;23304:19;23284:18;;;23277:47;23341:18;;148620:54:0::1;23024:341:1::0;148620:54:0::1;21297:10:::0;148685:32:::1;::::0;;;:18:::1;:32;::::0;;;;;;;-1:-1:-1;;;;;148685:42:0;::::1;::::0;;;;;;;;;;:53;;-1:-1:-1;;148685:53:0::1;::::0;::::1;;::::0;;::::1;::::0;;;148754:48;;586:41:1;;;148685:42:0;;21297:10;148754:48:::1;::::0;559:18:1;148754:48:0::1;;;;;;;148523:287:::0;;:::o;143192:465::-;143240:5;143279:15;143320:38;143335:16;143279:15;143320:14;:38::i;:::-;143316:67;;;143367:16;143360:23;;;143192:465;:::o;143316:67::-;143398:38;143413:16;143431:4;143398:14;:38::i;:::-;143394:67;;;143445:16;143438:23;;;143192:465;:::o;143394:67::-;143476:38;143491:16;143509:4;143476:14;:38::i;:::-;143472:67;;;143523:16;143516:23;;;143192:465;:::o;143472:67::-;143554:34;143569:12;143583:4;143554:14;:34::i;:::-;143550:59;;;143597:12;143590:19;;;143192:465;:::o;143550:59::-;143637:12;143630:19;;;143192:465;:::o;145637:581::-;145713:16;145740:14;145765:13;145789:16;145816:14;145841:15;145867:20;145906:25;145934:6;:13;145941:5;145934:13;;;;;;;;:::i;:::-;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;-1:-1:-1;145934:13:0;145906:41;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;145906:41:0;;;;;;146153:46;146168:5;146182:15;146153:14;:46::i;:::-;145958:252;;;;-1:-1:-1;145958:252:0;;-1:-1:-1;145958:252:0;;-1:-1:-1;145958:252:0;-1:-1:-1;145958:252:0;-1:-1:-1;145958:252:0;;-1:-1:-1;145637:581:0;-1:-1:-1;;;145637:581:0:o;149359:248::-;133431:14;;;;133423:50;;;;-1:-1:-1;;;133423:50:0;;14519:2:1;133423:50:0;;;14501:21:1;14558:2;14538:18;;;14531:30;14597:25;14577:18;;;14570:53;14640:18;;133423:50:0;14317:347:1;133423:50:0;149492:41:::1;21297:10:::0;149525:7:::1;149492:18;:41::i;:::-;149484:66;;;::::0;-1:-1:-1;;;149484:66:0;;15576:2:1;149484:66:0::1;::::0;::::1;15558:21:1::0;15615:2;15595:18;;;15588:30;15654:14;15634:18;;;15627:42;15686:18;;149484:66:0::1;15374:336:1::0;149484:66:0::1;149561:38;149575:4;149581:2;149585:7;149594:4;149561:13;:38::i;:::-;149359:248:::0;;;;:::o;139757:1932::-;139060:6;;;;;;;139059:7;139051:35;;;;-1:-1:-1;;;139051:35:0;;23572:2:1;139051:35:0;;;23554:21:1;23611:2;23591:18;;;23584:30;23650:17;23630:18;;;23623:45;23685:18;;139051:35:0;23370:339:1;139051:35:0;136324:21:::1;:19;:21::i;:::-;139927:1:::2;139918:6;:10;:26;;;;;139942:2;139932:6;:12;;139918:26;139910:53;;;::::0;-1:-1:-1;;;139910:53:0;;18250:2:1;139910:53:0::2;::::0;::::2;18232:21:1::0;18289:2;18269:18;;;18262:30;18328:16;18308:18;;;18301:44;18362:18;;139910:53:0::2;18048:338:1::0;139910:53:0::2;140006:9;139996:6;139982:11;;:20;;;;:::i;:::-;:33;;139974:60;;;::::0;-1:-1:-1;;;139974:60:0;;18723:2:1;139974:60:0::2;::::0;::::2;18705:21:1::0;18762:2;18742:18;;;18735:30;18801:16;18781:18;;;18774:44;18835:18;;139974:60:0::2;18521:338:1::0;139974:60:0::2;21297:10:::0;140053:25:::2;::::0;;;:11:::2;:25;::::0;;;;;140091:12:::2;::::0;140053:34:::2;::::0;140081:6;;140053:34:::2;:::i;:::-;:50;;140045:83;;;::::0;-1:-1:-1;;;140045:83:0;;23916:2:1;140045:83:0::2;::::0;::::2;23898:21:1::0;23955:2;23935:18;;;23928:30;23994:22;23974:18;;;23967:50;24034:18;;140045:83:0::2;23714:344:1::0;140045:83:0::2;140141:18;140162:17;:15;:17::i;:::-;140141:38:::0;-1:-1:-1;140214:12:0::2;140198;:28;;;;;;;;:::i;:::-;::::0;140190:56:::2;;;::::0;-1:-1:-1;;;140190:56:0;;24265:2:1;140190:56:0::2;::::0;::::2;24247:21:1::0;24304:2;24284:18;;;24277:30;24343:17;24323:18;;;24316:45;24378:18;;140190:56:0::2;24063:339:1::0;140190:56:0::2;140259:31;140293:6;:20;140300:12;140293:20;;;;;;;;:::i;:::-;;;;;;;;;:::i;:::-;;;;;;;;;;;;140259:54;;140324:23;140370:6;140350:11;:17;;;:26;;;;:::i;:::-;140324:52;;140408:15;140395:9;:28;;140387:61;;;::::0;-1:-1:-1;;;140387:61:0;;24609:2:1;140387:61:0::2;::::0;::::2;24591:21:1::0;24648:2;24628:18;;;24621:30;24687:22;24667:18;;;24660:50;24727:18;;140387:61:0::2;24407:344:1::0;140387:61:0::2;140473:20;::::0;::::2;::::0;:24;140469:141:::2;;140553:11;:20;;;140543:6;140522:11;:18;;;:27;;;;:::i;:::-;:51;;140514:84;;;::::0;-1:-1:-1;;;140514:84:0;;24958:2:1;140514:84:0::2;::::0;::::2;24940:21:1::0;24997:2;24977:18;;;24970:30;25036:22;25016:18;;;25009:50;25076:18;;140514:84:0::2;24756:344:1::0;140514:84:0::2;140642:12;140626;:28;;;;;;;;:::i;:::-;;;:68;;;;-1:-1:-1::0;140658:22:0::2;::::0;::::2;::::0;:36;::::2;140626:68;140622:270;;;140737:92;140756:5;;140737:92;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;::::0;::::2;::::0;;;;-1:-1:-1;;;;140763:22:0::2;::::0;::::2;::::0;140797:30:::2;::::0;25267:66:1;21297:10:0;25254:2:1;25250:15;25246:88;140797:30:0::2;::::0;::::2;25234:101:1::0;25351:12;;140797:30:0::2;;;;;;;;;;;;;140787:41;;;;;;140737:18;:92::i;:::-;140711:169;;;::::0;-1:-1:-1;;;140711:169:0;;25576:2:1;140711:169:0::2;::::0;::::2;25558:21:1::0;25615:2;25595:18;;;25588:30;25654:17;25634:18;;;25627:45;25689:18;;140711:169:0::2;25374:339:1::0;140711:169:0::2;140904:20;140927:11;;140941:1;140927:15;;;;:::i;:::-;21297:10:::0;140953:25:::2;::::0;;;:11:::2;:25;::::0;;;;:35;;140904:38;;-1:-1:-1;140982:6:0;;140953:25;;;:35:::2;::::0;140982:6;;140953:35:::2;:::i;:::-;;;;;;;;141021:6;140999:11;:18;;;:28;;;;;;;:::i;:::-;;;;;;;;141053:6;141038:11;;:21;;;;;;;:::i;:::-;::::0;;;-1:-1:-1;141085:9:0::2;::::0;-1:-1:-1;141080:101:0::2;141104:6;141100:1;:10;141080:101;;;141132:37;21297:10:::0;141152:16:::2;141167:1:::0;141152:12;:16:::2;:::i;141132:37::-;141112:3;;141080:101;;;-1:-1:-1::0;21297:10:0;141197:24:::2;:28:::0;141193:288:::2;;141362:41:::0;21297:10;-1:-1:-1;;;;;141268:46:0::2;;21297:10:::0;141268:90:::2;::::0;;::::2;::::0;;;;;;-1:-1:-1;;;;;19149:55:1;;;141268:90:0::2;::::0;::::2;19131:74:1::0;141337:1:0::2;19221:18:1::0;;;19214:83;;;19313:18;;;19306:34;;;19376:3;19356:18;;;19349:31;19396:19;;;19389:30;19436:19;;141268:90:0::2;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;:135:::0;::::2;;141242:227;;;::::0;-1:-1:-1;;;141242:227:0;;19922:2:1;141242:227:0::2;::::0;::::2;19904:21:1::0;19961:2;19941:18;;;19934:30;20000:32;19980:18;;;19973:60;20050:18;;141242:227:0::2;19720:354:1::0;141242:227:0::2;141509:15;141497:9;:27;141493:129;;;141541:69;21297:10:::0;141582:27:::2;141594:15:::0;141582:9:::2;:27;:::i;:::-;141541:17;:69::i;:::-;141639:42;21297:10:::0;141660:6:::2;141668:12;141639:42;;;;;;;;:::i;:::-;;;;;;;;139899:1790;;;;136368:20:::1;135762:1:::0;136888:7;:22;136705:213;138100:37;;;;;;;:::i;146897:289::-;147917:4;147941:16;;;:7;:16;;;;;;146953:13;;-1:-1:-1;;;;;147941:16:0;146979:49;;;;-1:-1:-1;;;146979:49:0;;14170:2:1;146979:49:0;;;14152:21:1;14209:2;14189:18;;;14182:30;14248:22;14228:18;;;14221:50;14288:18;;146979:49:0;13968:344:1;146979:49:0;147044:17;;;;147039:65;;147085:7;147078:14;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;146897:289;;;:::o;147039:65::-;147135:7;147144:18;:7;:16;:18::i;:::-;147164:13;147121:57;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;147114:64;;146897:289;;;:::o;144185:232::-;144385:22;;25267:66:1;25254:2;25250:15;;;25246:88;144385:22:0;;;25234:101:1;144319:4:0;;144343:66;;144362:5;;144369:4;;25351:12:1;;144385:22:0;25105:264:1;144343:66:0;144336:73;144185:232;-1:-1:-1;;;;144185:232:0:o;147316:122::-;138972:5;;-1:-1:-1;;;;;138972:5:0;21297:10;-1:-1:-1;;;;;138956:21:0;;138948:43;;;;-1:-1:-1;;;138948:43:0;;13047:2:1;138948:43:0;;;13029:21:1;13086:1;13066:18;;;13059:29;-1:-1:-1;;;13104:18:1;;;13097:39;13153:18;;138948:43:0;12845:332:1;138948:43:0;147402:13:::1;:28;147418:12:::0;;147402:13;:28:::1;:::i;145023:249::-:0;138972:5;;-1:-1:-1;;;;;138972:5:0;21297:10;-1:-1:-1;;;;;138956:21:0;;138948:43;;;;-1:-1:-1;;;138948:43:0;;13047:2:1;138948:43:0;;;13029:21:1;13086:1;13066:18;;;13059:29;-1:-1:-1;;;13104:18:1;;;13097:39;13153:18;;138948:43:0;12845:332:1;138948:43:0;-1:-1:-1;;;;;145106:22:0;::::1;145098:48;;;::::0;-1:-1:-1;;;145098:48:0;;27281:2:1;145098:48:0::1;::::0;::::1;27263:21:1::0;27320:2;27300:18;;;27293:30;27359:15;27339:18;;;27332:43;27392:18;;145098:48:0::1;27079:337:1::0;145098:48:0::1;145176:5;::::0;;-1:-1:-1;;;;;145192:16:0;;::::1;::::0;;::::1;::::0;::::1;::::0;;;145224:40:::1;::::0;145176:5;::::1;::::0;145192:16;145176:5;;145224:40:::1;::::0;145157:16:::1;::::0;145224:40:::1;145087:185;145023:249:::0;:::o;129749:202::-;129834:4;129858:41;;;129873:26;129858:41;;:85;;-1:-1:-1;129903:40:0;;;129918:25;129903:40;129851:92;129749:202;-1:-1:-1;;129749:202:0:o;143665:512::-;143742:4;143759:25;143787:6;:13;143794:5;143787:13;;;;;;;;:::i;:::-;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;-1:-1:-1;143787:13:0;143759:41;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;143811:32:0;;143838:5;143831:12;;;;;143811:32;143882:16;;143864:15;;143882:21;;;;:54;;;143920:6;:16;;;143907:29;;:9;:29;;;;143882:54;143864:72;;143947:14;143964:6;:14;;;:19;;143982:1;143964:19;:50;;;;144000:6;:14;;;143987:27;;:9;:27;;;;143964:50;143947:67;;144025:18;144046:6;:15;;;144065:1;144046:20;:55;;;;144086:6;:15;;;144070:6;:13;;;:31;144046:55;144025:76;;144129:10;:23;;;;;144143:9;144129:23;:40;;;;;144156:13;144129:40;144122:47;143665:512;-1:-1:-1;;;;;;;143665:512:0:o;131312:518::-;131028:5;131407:39;131461:26;;;-1:-1:-1;131457:176:0;;;131566:55;;;;;27624:26:1;27612:39;;131566:55:0;;;27594:58:1;27668:18;;;27661:34;;;27567:18;;131566:55:0;27421:280:1;131457:176:0;-1:-1:-1;;;;;131647:22:0;;131643:110;;131693:48;;;;;131738:1;131693:48;;;2520:74:1;2493:18;;131693:48:0;2374:226:1;131643:110:0;-1:-1:-1;131787:35:0;;;;;;;;;-1:-1:-1;;;;;131787:35:0;;;;;;;;;;;;;;;;;131765:57;;;;;-1:-1:-1;131765:57:0;131312:518::o;150898:159::-;150965:24;;;;:15;:24;;;;;:29;;;;-1:-1:-1;;;;;150965:29:0;;;;;;;;:24;;151019:16;150965:24;151019:7;:16::i;:::-;-1:-1:-1;;;;;151010:39:0;;;;;;;;;;;150898:159;;:::o;133701:187::-;133756:14;;;;133748:51;;;;-1:-1:-1;;;133748:51:0;;27908:2:1;133748:51:0;;;27890:21:1;27947:2;27927:18;;;27920:30;27986:26;27966:18;;;27959:54;28030:18;;133748:51:0;27706:348:1;133748:51:0;133810:14;:22;;-1:-1:-1;;133810:22:0;;;133848:32;;133864:15;5319:25:1;;133848:32:0;;5307:2:1;5292:18;133848:32:0;;;;;;;;133701:187::o;149865:312::-;149950:4;147941:16;;;:7;:16;;;;;;-1:-1:-1;;;;;147941:16:0;149967:49;;;;-1:-1:-1;;;149967:49:0;;14170:2:1;149967:49:0;;;14152:21:1;14209:2;14189:18;;;14182:30;14248:22;14228:18;;;14221:50;14288:18;;149967:49:0;13968:344:1;149967:49:0;150027:14;150044:16;150052:7;150044;:16::i;:::-;150027:33;;150090:6;-1:-1:-1;;;;;150079:17:0;:7;-1:-1:-1;;;;;150079:17:0;;:52;;;;150124:7;-1:-1:-1;;;;;150100:31:0;:20;150112:7;150100:11;:20::i;:::-;-1:-1:-1;;;;;150100:31:0;;150079:52;:89;;;-1:-1:-1;;;;;;148923:26:0;;;148899:4;148923:26;;;:18;:26;;;;;;;;:36;;;;;;;;;;;;150135:33;148818:149;150489:401;150599:4;-1:-1:-1;;;;;150579:24:0;:16;150587:7;150579;:16::i;:::-;-1:-1:-1;;;;;150579:24:0;;150571:66;;;;-1:-1:-1;;;150571:66:0;;28261:2:1;150571:66:0;;;28243:21:1;28300:2;28280:18;;;28273:30;28339:31;28319:18;;;28312:59;28388:18;;150571:66:0;28059:353:1;150571:66:0;-1:-1:-1;;;;;150656:16:0;;150648:53;;;;-1:-1:-1;;;150648:53:0;;28619:2:1;150648:53:0;;;28601:21:1;28658:2;28638:18;;;28631:30;28697:26;28677:18;;;28670:54;28741:18;;150648:53:0;28417:348:1;150648:53:0;150714:29;150731:1;150735:7;150714:8;:29::i;:::-;-1:-1:-1;;;;;150756:15:0;;;;;;:9;:15;;;;;:20;;150775:1;;150756:15;:20;;150775:1;;150756:20;:::i;:::-;;;;-1:-1:-1;;;;;;;150787:13:0;;;;;;:9;:13;;;;;:18;;150804:1;;150787:13;:18;;150804:1;;150787:18;:::i;:::-;;;;-1:-1:-1;;150816:16:0;;;;:7;:16;;;;;;:21;;;;-1:-1:-1;;;;;150816:21:0;;;;;;;;;150855:27;;150816:16;;150855:27;;;;;;;150489:401;;;:::o;2746:317::-;2861:6;2836:21;:31;;2828:73;;;;-1:-1:-1;;;2828:73:0;;28972:2:1;2828:73:0;;;28954:21:1;29011:2;28991:18;;;28984:30;29050:31;29030:18;;;29023:59;29099:18;;2828:73:0;28770:353:1;2828:73:0;2915:12;2933:9;-1:-1:-1;;;;;2933:14:0;2955:6;2933:33;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;2914:52;;;2985:7;2977:78;;;;-1:-1:-1;;;2977:78:0;;29540:2:1;2977:78:0;;;29522:21:1;29579:2;29559:18;;;29552:30;29618:34;29598:18;;;29591:62;29689:28;29669:18;;;29662:56;29735:19;;2977:78:0;29338:422:1;136404:293:0;135806:1;136538:7;;:19;136530:63;;;;-1:-1:-1;;;136530:63:0;;29967:2:1;136530:63:0;;;29949:21:1;30006:2;29986:18;;;29979:30;30045:33;30025:18;;;30018:61;30096:18;;136530:63:0;29765:355:1;136530:63:0;135806:1;136671:7;:18;136404:293::o;150185:296::-;-1:-1:-1;;;;;150257:16:0;;150249:49;;;;-1:-1:-1;;;150249:49:0;;30327:2:1;150249:49:0;;;30309:21:1;30366:2;30346:18;;;30339:30;30405:22;30385:18;;;30378:50;30445:18;;150249:49:0;30125:344:1;150249:49:0;147917:4;147941:16;;;:7;:16;;;;;;-1:-1:-1;;;;;147941:16:0;:30;150309:50;;;;-1:-1:-1;;;150309:50:0;;30676:2:1;150309:50:0;;;30658:21:1;30715:2;30695:18;;;30688:30;30754:22;30734:18;;;30727:50;30794:18;;150309:50:0;30474:344:1;150309:50:0;-1:-1:-1;;;;;150372:13:0;;;;;;:9;:13;;;;;:18;;150389:1;;150372:13;:18;;150389:1;;150372:18;:::i;:::-;;;;-1:-1:-1;;150401:16:0;;;;:7;:16;;;;;;:21;;;;-1:-1:-1;;;;;150401:21:0;;;;;;;;150440:33;;150401:16;;;150440:33;;150401:16;;150440:33;150185:296;;:::o;133505:184::-;133560:14;;;;133559:15;133551:51;;;;-1:-1:-1;;;133551:51:0;;31025:2:1;133551:51:0;;;31007:21:1;31064:2;31044:18;;;31037:30;31103:25;31083:18;;;31076:53;31146:18;;133551:51:0;30823:347:1;133551:51:0;133613:14;:21;;-1:-1:-1;;133613:21:0;133630:4;133613:21;;;133650:31;;;;;;133665:15;5319:25:1;;5307:2;5292:18;;5173:177;149615:242:0;149720:28;149730:4;149736:2;149740:7;149720:9;:28::i;:::-;149767:47;149790:4;149796:2;149800:7;149809:4;149767:22;:47::i;:::-;149759:90;;;;-1:-1:-1;;;149759:90:0;;19922:2:1;149759:90:0;;;19904:21:1;19961:2;19941:18;;;19934:30;20000:32;19980:18;;;19973:60;20050:18;;149759:90:0;19720:354:1;10835:156:0;10926:4;10979;10950:25;10963:5;10970:4;10950:12;:25::i;:::-;:33;;10835:156;-1:-1:-1;;;;10835:156:0:o;106758:652::-;106814:13;106865:14;106882:17;106893:5;106882:10;:17::i;:::-;106902:1;106882:21;106865:38;;106918:20;106952:6;106941:18;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;106941:18:0;-1:-1:-1;106918:41:0;-1:-1:-1;107051:30:0;;;107067:4;107051:30;107110:254;-1:-1:-1;;107142:5:0;107248:10;107243:2;107232:14;;107227:32;107142:5;107214:46;107306:2;107297:11;;;-1:-1:-1;107327:21:0;107110:254;107327:21;-1:-1:-1;107385:6:0;106758:652;-1:-1:-1;;;106758:652:0:o;151065:737::-;151176:4;-1:-1:-1;;;;;151197:14:0;;;:18;151193:602;;151236:71;;;;;-1:-1:-1;;;;;151236:36:0;;;;;:71;;21297:10;;151287:4;;151293:7;;151302:4;;151236:71;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;-1:-1:-1;151236:71:0;;;;;;;;-1:-1:-1;;151236:71:0;;;;;;;;;;;;:::i;:::-;;;151232:508;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;151477:6;:13;151494:1;151477:18;151473:252;;151520:40;;-1:-1:-1;;;151520:40:0;;19922:2:1;151520:40:0;;;19904:21:1;19961:2;19941:18;;;19934:30;20000:32;19980:18;;;19973:60;20050:18;;151520:40:0;19720:354:1;151473:252:0;151675:6;151669:13;151660:6;151656:2;151652:15;151645:38;151232:508;151358:51;;151368:41;151358:51;;-1:-1:-1;151351:58:0;;151193:602;-1:-1:-1;151779:4:0;151065:737;;;;;;:::o;11634:296::-;11717:7;11760:4;11717:7;11775:118;11799:5;:12;11795:1;:16;11775:118;;;11848:33;11858:12;11872:5;11878:1;11872:8;;;;;;;;:::i;:::-;;;;;;;11848:9;:33::i;:::-;11833:48;-1:-1:-1;11813:3:0;;11775:118;;;-1:-1:-1;11910:12:0;11634:296;-1:-1:-1;;;11634:296:0:o;89436:948::-;89489:7;;89576:8;89567:17;;89563:106;;89614:8;89605:17;;;-1:-1:-1;89651:2:0;89641:12;89563:106;89696:8;89687:5;:17;89683:106;;89734:8;89725:17;;;-1:-1:-1;89771:2:0;89761:12;89683:106;89816:8;89807:5;:17;89803:106;;89854:8;89845:17;;;-1:-1:-1;89891:2:0;89881:12;89803:106;89936:7;89927:5;:16;89923:103;;89973:7;89964:16;;;-1:-1:-1;90009:1:0;89999:11;89923:103;90053:7;90044:5;:16;90040:103;;90090:7;90081:16;;;-1:-1:-1;90126:1:0;90116:11;90040:103;90170:7;90161:5;:16;90157:103;;90207:7;90198:16;;;-1:-1:-1;90243:1:0;90233:11;90157:103;90287:7;90278:5;:16;90274:68;;90325:1;90315:11;90370:6;89436:948;-1:-1:-1;;89436:948:0:o;19072:149::-;19135:7;19166:1;19162;:5;:51;;19297:13;19391:15;;;19427:4;19420:15;;;19474:4;19458:21;;19162:51;;;19297:13;19391:15;;;19427:4;19420:15;;;19474:4;19458:21;;19170:20;19155:58;19072:149;-1:-1:-1;;;19072:149:0:o;14:177:1:-;99:66;92:5;88:78;81:5;78:89;68:117;;181:1;178;171:12;196:245;254:6;307:2;295:9;286:7;282:23;278:32;275:52;;;323:1;320;313:12;275:52;362:9;349:23;381:30;405:5;381:30;:::i;638:146::-;709:20;;758:1;748:12;;738:40;;774:1;771;764:12;738:40;638:146;;;:::o;789:199::-;858:6;911:2;899:9;890:7;886:23;882:32;879:52;;;927:1;924;917:12;879:52;950:32;972:9;950:32;:::i;993:196::-;1061:20;;-1:-1:-1;;;;;1110:54:1;;1100:65;;1090:93;;1179:1;1176;1169:12;1194:366;1261:6;1269;1322:2;1310:9;1301:7;1297:23;1293:32;1290:52;;;1338:1;1335;1328:12;1290:52;1361:29;1380:9;1361:29;:::i;:::-;1351:39;;1440:2;1429:9;1425:18;1412:32;1484:26;1477:5;1473:38;1466:5;1463:49;1453:77;;1526:1;1523;1516:12;1453:77;1549:5;1539:15;;;1194:366;;;;;:::o;1565:348::-;1607:3;1645:5;1639:12;1672:6;1667:3;1660:19;1728:6;1721:4;1714:5;1710:16;1703:4;1698:3;1694:14;1688:47;1780:1;1773:4;1764:6;1759:3;1755:16;1751:27;1744:38;1902:4;-1:-1:-1;;1827:2:1;1819:6;1815:15;1811:88;1806:3;1802:98;1798:109;1791:116;;;1565:348;;;;:::o;1918:220::-;2067:2;2056:9;2049:21;2030:4;2087:45;2128:2;2117:9;2113:18;2105:6;2087:45;:::i;2143:226::-;2202:6;2255:2;2243:9;2234:7;2230:23;2226:32;2223:52;;;2271:1;2268;2261:12;2223:52;-1:-1:-1;2316:23:1;;2143:226;-1:-1:-1;2143:226:1:o;2605:300::-;2673:6;2681;2734:2;2722:9;2713:7;2709:23;2705:32;2702:52;;;2750:1;2747;2740:12;2702:52;2773:29;2792:9;2773:29;:::i;:::-;2763:39;2871:2;2856:18;;;;2843:32;;-1:-1:-1;;;2605:300:1:o;2910:160::-;2975:20;;3031:13;;3024:21;3014:32;;3004:60;;3060:1;3057;3050:12;3075:180;3131:6;3184:2;3172:9;3163:7;3159:23;3155:32;3152:52;;;3200:1;3197;3190:12;3152:52;3223:26;3239:9;3223:26;:::i;3260:374::-;3337:6;3345;3353;3406:2;3394:9;3385:7;3381:23;3377:32;3374:52;;;3422:1;3419;3412:12;3374:52;3445:29;3464:9;3445:29;:::i;:::-;3435:39;;3493:38;3527:2;3516:9;3512:18;3493:38;:::i;:::-;3260:374;;3483:48;;-1:-1:-1;;;3600:2:1;3585:18;;;;3572:32;;3260:374::o;3639:346::-;3707:6;3715;3768:2;3756:9;3747:7;3743:23;3739:32;3736:52;;;3784:1;3781;3774:12;3736:52;-1:-1:-1;;3829:23:1;;;3949:2;3934:18;;;3921:32;;-1:-1:-1;3639:346:1:o;4292:171::-;4359:20;;4419:18;4408:30;;4398:41;;4388:69;;4453:1;4450;4443:12;4468:700;4580:6;4588;4596;4604;4612;4620;4673:3;4661:9;4652:7;4648:23;4644:33;4641:53;;;4690:1;4687;4680:12;4641:53;4713:32;4735:9;4713:32;:::i;:::-;4703:42;;4764:37;4797:2;4786:9;4782:18;4764:37;:::i;:::-;4754:47;;4820:37;4853:2;4842:9;4838:18;4820:37;:::i;:::-;4468:700;;;;-1:-1:-1;4810:47:1;;4926:2;4911:18;;4898:32;;-1:-1:-1;5027:3:1;5012:19;;4999:33;;5131:3;5116:19;;;5103:33;;-1:-1:-1;4468:700:1;-1:-1:-1;;4468:700:1:o;5355:587::-;5426:6;5434;5487:2;5475:9;5466:7;5462:23;5458:32;5455:52;;;5503:1;5500;5493:12;5455:52;5543:9;5530:23;5576:18;5568:6;5565:30;5562:50;;;5608:1;5605;5598:12;5562:50;5631:22;;5684:4;5676:13;;5672:27;-1:-1:-1;5662:55:1;;5713:1;5710;5703:12;5662:55;5753:2;5740:16;5779:18;5771:6;5768:30;5765:50;;;5811:1;5808;5801:12;5765:50;5856:7;5851:2;5842:6;5838:2;5834:15;5830:24;5827:37;5824:57;;;5877:1;5874;5867:12;5824:57;5908:2;5900:11;;;;;5930:6;;-1:-1:-1;5355:587:1;-1:-1:-1;;;5355:587:1:o;7211:186::-;7270:6;7323:2;7311:9;7302:7;7298:23;7294:32;7291:52;;;7339:1;7336;7329:12;7291:52;7362:29;7381:9;7362:29;:::i;7402:254::-;7467:6;7475;7528:2;7516:9;7507:7;7503:23;7499:32;7496:52;;;7544:1;7541;7534:12;7496:52;7567:29;7586:9;7567:29;:::i;:::-;7557:39;;7615:35;7646:2;7635:9;7631:18;7615:35;:::i;:::-;7605:45;;7402:254;;;;;:::o;7661:184::-;-1:-1:-1;;;7710:1:1;7703:88;7810:4;7807:1;7800:15;7834:4;7831:1;7824:15;7850:290;7927:1;7920:5;7917:12;7907:200;;-1:-1:-1;;;7960:1:1;7953:88;8064:4;8061:1;8054:15;8092:4;8089:1;8082:15;7907:200;8116:18;;7850:290::o;8145:200::-;8287:2;8272:18;;8299:40;8276:9;8321:6;8299:40;:::i;9028:184::-;-1:-1:-1;;;9077:1:1;9070:88;9177:4;9174:1;9167:15;9201:4;9198:1;9191:15;9217:334;9288:2;9282:9;9344:2;9334:13;;-1:-1:-1;;9330:86:1;9318:99;;9447:18;9432:34;;9468:22;;;9429:62;9426:88;;;9494:18;;:::i;:::-;9530:2;9523:22;9217:334;;-1:-1:-1;9217:334:1:o;9556:1087::-;9651:6;9659;9667;9675;9728:3;9716:9;9707:7;9703:23;9699:33;9696:53;;;9745:1;9742;9735:12;9696:53;9768:29;9787:9;9768:29;:::i;:::-;9758:39;;9816:38;9850:2;9839:9;9835:18;9816:38;:::i;:::-;9806:48;-1:-1:-1;9923:2:1;9908:18;;9895:32;;-1:-1:-1;10002:2:1;9987:18;;9974:32;10029:18;10018:30;;10015:50;;;10061:1;10058;10051:12;10015:50;10084:22;;10137:4;10129:13;;10125:27;-1:-1:-1;10115:55:1;;10166:1;10163;10156:12;10115:55;10206:2;10193:16;10232:18;10224:6;10221:30;10218:56;;;10254:18;;:::i;:::-;10296:116;10408:2;-1:-1:-1;;10332:4:1;10324:6;10320:17;10316:90;10312:99;10296:116;:::i;:::-;10435:6;10428:5;10421:21;10483:7;10478:2;10469:6;10465:2;10461:15;10457:24;10454:37;10451:57;;;10504:1;10501;10494:12;10451:57;10559:6;10554:2;10550;10546:11;10541:2;10534:5;10530:14;10517:49;10611:1;10606:2;10597:6;10590:5;10586:18;10582:27;10575:38;10632:5;10622:15;;;;;9556:1087;;;;;;;:::o;10648:724::-;10743:6;10751;10759;10812:2;10800:9;10791:7;10787:23;10783:32;10780:52;;;10828:1;10825;10818:12;10780:52;10873:23;;;-1:-1:-1;10971:2:1;10956:18;;10943:32;10998:18;10987:30;;10984:50;;;11030:1;11027;11020:12;10984:50;11053:22;;11106:4;11098:13;;11094:27;-1:-1:-1;11084:55:1;;11135:1;11132;11125:12;11084:55;11175:2;11162:16;11201:18;11193:6;11190:30;11187:50;;;11233:1;11230;11223:12;11187:50;11286:7;11281:2;11271:6;11268:1;11264:14;11260:2;11256:23;11252:32;11249:45;11246:65;;;11307:1;11304;11297:12;11246:65;10648:724;;11338:2;11330:11;;;;;-1:-1:-1;11360:6:1;;-1:-1:-1;;;10648:724:1:o;11377:1198::-;11479:6;11487;11495;11548:2;11536:9;11527:7;11523:23;11519:32;11516:52;;;11564:1;11561;11554:12;11516:52;11604:9;11591:23;11637:18;11629:6;11626:30;11623:50;;;11669:1;11666;11659:12;11623:50;11692:22;;11745:4;11737:13;;11733:27;-1:-1:-1;11723:55:1;;11774:1;11771;11764:12;11723:55;11814:2;11801:16;11840:18;11832:6;11829:30;11826:56;;;11862:18;;:::i;:::-;11908:6;11905:1;11901:14;11935:30;11959:4;11955:2;11951:13;11935:30;:::i;:::-;11999:19;;;12043:4;12075:11;;;12071:22;;;12034:14;;;;12105:19;;;12102:39;;;12137:1;12134;12127:12;12102:39;12169:4;12165:2;12161:13;12150:24;;12183:200;12199:6;12194:3;12191:15;12183:200;;;12291:17;;12321:18;;;12368:4;12216:14;;;;12291:17;;-1:-1:-1;12359:14:1;;;;12183:200;;;12402:5;-1:-1:-1;;;;12480:4:1;12465:20;;12452:34;;-1:-1:-1;12531:38:1;;-1:-1:-1;12565:2:1;12550:18;;12531:38;:::i;:::-;12521:48;;11377:1198;;;;;:::o;12580:260::-;12648:6;12656;12709:2;12697:9;12688:7;12684:23;12680:32;12677:52;;;12725:1;12722;12715:12;12677:52;12748:29;12767:9;12748:29;:::i;:::-;12738:39;;12796:38;12830:2;12819:9;12815:18;12796:38;:::i;13526:437::-;13605:1;13601:12;;;;13648;;;13669:61;;13723:4;13715:6;13711:17;13701:27;;13669:61;13776:2;13768:6;13765:14;13745:18;13742:38;13739:218;;-1:-1:-1;;;13810:1:1;13803:88;13914:4;13911:1;13904:15;13942:4;13939:1;13932:15;13739:218;;13526:437;;;:::o;15715:184::-;-1:-1:-1;;;15764:1:1;15757:88;15864:4;15861:1;15854:15;15888:4;15885:1;15878:15;15904:168;15977:9;;;16008;;16025:15;;;16019:22;;16005:37;15995:71;;16046:18;;:::i;16266:274::-;16306:1;16332;16322:189;;-1:-1:-1;;;16364:1:1;16357:88;16468:4;16465:1;16458:15;16496:4;16493:1;16486:15;16322:189;-1:-1:-1;16525:9:1;;16266:274::o;17583:460::-;17805:3;17790:19;;17818:40;17794:9;17840:6;17818:40;:::i;:::-;17906:18;17898:6;17894:31;17889:2;17878:9;17874:18;17867:59;17974:18;17966:6;17962:31;17957:2;17946:9;17942:18;17935:59;18030:6;18025:2;18014:9;18010:18;18003:34;17583:460;;;;;;;:::o;18391:125::-;18456:9;;;18477:10;;;18474:36;;;18490:18;;:::i;19466:249::-;19535:6;19588:2;19576:9;19567:7;19563:23;19559:32;19556:52;;;19604:1;19601;19594:12;19556:52;19636:9;19630:16;19655:30;19679:5;19655:30;:::i;20079:391::-;-1:-1:-1;;;;;20307:55:1;;20289:74;;20394:2;20379:18;;20372:34;;;20277:2;20262:18;;20415:49;20460:2;20445:18;;20437:6;20415:49;:::i;20601:518::-;20703:2;20698:3;20695:11;20692:421;;;20739:5;20736:1;20729:16;20783:4;20780:1;20770:18;20853:2;20841:10;20837:19;20834:1;20830:27;20824:4;20820:38;20889:4;20877:10;20874:20;20871:47;;;-1:-1:-1;20912:4:1;20871:47;20967:2;20962:3;20958:12;20955:1;20951:20;20945:4;20941:31;20931:41;;21022:81;21040:2;21033:5;21030:13;21022:81;;;21099:1;21085:16;;21066:1;21055:13;21022:81;;;21026:3;;20601:518;;;:::o;21355:1317::-;21479:18;21474:3;21471:27;21468:53;;;21501:18;;:::i;:::-;21530:94;21620:3;21580:38;21612:4;21606:11;21580:38;:::i;:::-;21574:4;21530:94;:::i;:::-;21650:1;21675:2;21670:3;21667:11;21692:1;21687:727;;;;22458:1;22475:3;22472:93;;;-1:-1:-1;22531:19:1;;;22518:33;22472:93;-1:-1:-1;;21252:1:1;21248:11;;;21244:84;21240:89;21230:100;21336:1;21332:11;;;21227:117;22578:78;;21660:1006;;21687:727;20548:1;20541:14;;;20585:4;20572:18;;-1:-1:-1;;21723:76:1;;;21897:229;21911:7;21908:1;21905:14;21897:229;;;22000:19;;;21987:33;21972:49;;22107:4;22092:20;;;;22060:1;22048:14;;;;21927:12;21897:229;;;21901:3;22154;22145:7;22142:16;22139:219;;;-1:-1:-1;;22268:3:1;22262;22259:1;22255:11;22251:21;22247:94;22243:99;22230:9;22225:3;22221:19;22208:33;22204:139;22196:6;22189:155;22139:219;;;22401:1;22395:3;22392:1;22388:11;22384:19;22378:4;22371:33;21660:1006;;21355:1317;;;:::o;25718:128::-;25785:9;;;25806:11;;;25803:37;;;25820:18;;:::i;25851:735::-;25901:3;25942:5;25936:12;25971:36;25997:9;25971:36;:::i;:::-;26038:1;26023:17;;26049:191;;;;26254:1;26249:331;;;;26016:564;;26049:191;-1:-1:-1;;26086:9:1;26082:82;26077:3;26070:95;26220:6;26213:14;26206:22;26198:6;26194:35;26189:3;26185:45;26178:52;;26049:191;;26249:331;26280:5;26277:1;26270:16;26327:4;26324:1;26314:18;26354:1;26368:166;26382:6;26379:1;26376:13;26368:166;;;26462:14;;26449:11;;;26442:35;26518:1;26505:15;;;;26404:4;26397:12;26368:166;;;26372:3;;26563:6;26558:3;26554:16;26547:23;;26016:564;;;;25851:735;;;;:::o;26591:483::-;26812:3;26840:38;26874:3;26866:6;26840:38;:::i;:::-;26907:6;26901:13;26952:6;26945:4;26937:6;26933:17;26929:2;26923:36;27013:1;26978:15;;27002:13;;;27031:37;26978:15;27057:6;27031:37;:::i;:::-;27024:44;26591:483;-1:-1:-1;;;;;;26591:483:1:o;31175:531::-;-1:-1:-1;;;;;31410:6:1;31406:55;31395:9;31388:74;-1:-1:-1;;;;;31502:6:1;31498:55;31493:2;31482:9;31478:18;31471:83;31590:6;31585:2;31574:9;31570:18;31563:34;31633:3;31628:2;31617:9;31613:18;31606:31;31369:4;31654:46;31695:3;31684:9;31680:19;31672:6;31654:46;:::i;31711:184::-;-1:-1:-1;;;31760:1:1;31753:88;31860:4;31857:1;31850:15;31884:4;31881:1;31874:15

ipfs://1c430e5dc3290e0fe01703cbfd480045b788f2c3a5956b07cc22ab7ac79fc07b