Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Is this a proxy?
• Similar
• Submit Audit
• Compare

// SPDX-License-Identifier: MIT
// Amended by Chun
pragma solidity ^0.8.20;
import "@openzeppelin/contracts/token/ERC721/extensions/ERC721Enumerable.sol";
import "@openzeppelin/contracts/token/ERC721/IERC721.sol";
import "@openzeppelin/contracts/token/common/ERC2981.sol";
import "@openzeppelin/contracts/utils/Base64.sol";
import "@openzeppelin/contracts/utils/Strings.sol";
import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";

contract nft_single_contract is ERC2981,ERC721Enumerable {
    string baseURI;
    mapping(address => bool) private _owners;
    address public creator;

    address private _admin = address(0x823c7F21c11df7BbBf92f4B5143B3A719778965B);

    struct TokenBaseData{
        string name;
        string description;
        string imageURI;
        uint256 mintCost;
        uint256 supply;
        uint256 edition;
        bool pause;
        bytes32 merkleRoot;
        mapping(address => uint256) claimed;
    }
    mapping(uint256 => TokenBaseData) public tokenBaseData;

    struct Token{
        uint256 num;
        uint256 edition;
    }
    mapping(uint256 => Token) public token;
    
    constructor(
        string memory _name,
        string memory _symbol,
        address _creator,
        uint96 _royalty
    ) ERC721(_name, _symbol) {
        creator = _creator;
        _owners[creator] = true;
        _owners[_admin] = true;
        _setDefaultRoyalty(creator, _royalty);
    }

    modifier onlyOwners() {
        require(_owners[msg.sender], "MultiOwnable: caller is not an owner");
        _;
    }
    modifier onlyCreator() {
        require(creator == msg.sender, "MultiOwnable: caller is not an creator");
        _;
    }
    function setOwner(address owner,bool state) external onlyOwners {
        require(owner != address(0), "MultiOwnable: new owner cannot be zero address");
        _owners[owner] = state;
    }
    function transferCreator(address _newCreator) external onlyCreator {
        require(_newCreator != address(0), "MultiOwnable: new creator cannot be zero address");
        creator = _newCreator;
    }
    
    // public  mint
    function mint(address _recipient, uint256 tokenBaseId,uint256 _mintAmount, uint256 _maxClaims,bytes32[] calldata _proof) public payable {
        if(tokenBaseData[tokenBaseId].merkleRoot != bytes32(0) && !_owners[msg.sender]){
            require(isWhitelisted(tokenBaseId,_recipient, _maxClaims, _proof), "Not whitelisted");
            require(tokenBaseData[tokenBaseId].claimed[_recipient] + _mintAmount <= _maxClaims, "Claim limit exceeded");
        }

        require(!tokenBaseData[tokenBaseId].pause,"mint: this mint is paused");
        require(tokenBaseData[tokenBaseId].edition + _mintAmount <= tokenBaseData[tokenBaseId].supply,"mint: max supply");
        if (!_owners[msg.sender]) {
            require(msg.value >= tokenBaseData[tokenBaseId].mintCost * _mintAmount,"mint: insufficient funds");
        }
        uint256 currentTokenId = totalSupply();
        for (uint256 i = 1; i <= _mintAmount; i++) {
            if(tokenBaseData[tokenBaseId].merkleRoot != bytes32(0) && !_owners[msg.sender]){
                tokenBaseData[tokenBaseId].claimed[_recipient] += 1;
            }
            tokenBaseData[tokenBaseId].edition += 1;
            token[currentTokenId + i] = Token(tokenBaseId, tokenBaseData[tokenBaseId].edition);
            _safeMint(_recipient, currentTokenId + i);
        }
    }
    // Merkle Proof
    function isWhitelisted(uint256 tokenBaseId,address _user, uint256 _maxClaims, bytes32[] calldata _proof) internal view returns (bool) {
        bytes32 leaf = keccak256(abi.encode(_user, _maxClaims));
        return MerkleProof.verify(_proof, tokenBaseData[tokenBaseId].merkleRoot, leaf);
    }

    function checdkWhiteList(address _recipient, uint256 tokenBaseId, uint256 _maxClaims,bytes32[] calldata _proof) public view returns(uint256){
        if(!isWhitelisted(tokenBaseId, _recipient, _maxClaims, _proof)){
            return 0;
        }else{
            return _maxClaims - tokenBaseData[tokenBaseId].claimed[_recipient];
        }
    }
    
    function walletOfOwner(address _owner)
        public
        view
        returns (uint256[] memory)
    {
        uint256 ownerTokenCount = balanceOf(_owner);
        uint256[] memory tokenIds = new uint256[](ownerTokenCount);
        for (uint256 i; i < ownerTokenCount; i++) {
            tokenIds[i] = tokenOfOwnerByIndex(_owner, i);
        }
        return tokenIds;
    }
    //
    function tokenURI(uint256 _tokenId)
        public
        view
        virtual
        override
        returns (string memory)
    {
        require(ownerOf(_tokenId) != address(0), "ERC721Metadata: URI query for nonexistent token");
        uint256 num = token[_tokenId].num;
        
        bytes memory b = abi.encodePacked(
            '{"name": "' , tokenBaseData[num].name , ' #' , Strings.toString(token[_tokenId].edition) ,
            '", "description": "', tokenBaseData[num].description ,'",',
            ' "image": "', tokenBaseData[num].imageURI ,'"}'
        );
        
        return string(abi.encodePacked('data:application/json;base64,', Base64.encode(b)));
    }
    //mint Pause
    function pause(uint256 tokenBaseId,bool _state) public onlyOwners {
        tokenBaseData[tokenBaseId].pause = _state;
    }
    function withdraw() public payable onlyOwners {
        require(address(this).balance > 0, "No funds");
        uint256 totalBalance = address(this).balance;
        uint256 feeAmount = (totalBalance * 5) / 100;
        uint256 creatorAmount = totalBalance - feeAmount;

        (bool successFee, ) = payable(_admin).call{value: feeAmount}("");
        require(successFee, "Fee transfer failed");
        (bool successCreator, ) = payable(creator).call{value: creatorAmount}("");
        require(successCreator, "Creator transfer failed");
    }
    //Token edit
    function setTokenBase(uint256 tokenBaseId,string memory name,string memory description,string memory imageURI,uint256 cost,uint256 supply,bool pauseflag,bytes32 _newMerkleRoot) public onlyOwners{
        if(tokenBaseData[tokenBaseId].edition == 0){
            tokenBaseData[tokenBaseId].name = name;
            tokenBaseData[tokenBaseId].description = description;
            tokenBaseData[tokenBaseId].imageURI = imageURI;
            tokenBaseData[tokenBaseId].mintCost = cost;
            tokenBaseData[tokenBaseId].supply = supply;
            tokenBaseData[tokenBaseId].pause = pauseflag;
            tokenBaseData[tokenBaseId].merkleRoot = _newMerkleRoot;
        }else{
            tokenBaseData[tokenBaseId].mintCost = cost;
            tokenBaseData[tokenBaseId].supply = supply;
            tokenBaseData[tokenBaseId].pause = pauseflag;
            tokenBaseData[tokenBaseId].merkleRoot = _newMerkleRoot;
        }
    }
    //View Token
    function getTokenBase(uint256 tokenBaseId) public view returns (string memory, string memory, string memory, uint256, uint256, uint256, bool, bytes32) {
        TokenBaseData storage data = tokenBaseData[tokenBaseId];
        return (
            data.name,
            data.description,
            data.imageURI,
            data.mintCost,
            data.supply,
            data.edition,
            data.pause,
            data.merkleRoot
        );
    }
    function supportsInterface(bytes4 interfaceId) public view virtual override(ERC721Enumerable, ERC2981) returns (bool) {
        return super.supportsInterface(interfaceId);
    }

    // set DefaultRoyalty
    function setDefaultRoyalty(address recipient, uint96 feeNumerator) external onlyOwners {
        _setDefaultRoyalty(recipient, feeNumerator);
    }

}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/IERC721.sol)

pragma solidity ^0.8.20;

import {IERC165} from "../../utils/introspection/IERC165.sol";

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

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

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.2.0) (utils/Strings.sol)

pragma solidity ^0.8.20;

import {Math} from "./math/Math.sol";
import {SafeCast} from "./math/SafeCast.sol";
import {SignedMath} from "./math/SignedMath.sol";

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

    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;

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

    /**
     * @dev 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(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                assembly ("memory-safe") {
                    mstore8(ptr, byte(mod(value, 10), HEX_DIGITS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

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

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

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

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

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

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

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

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

    /**
     * @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} 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} 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} 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} 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} 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 guaratees 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} 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} 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} 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 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(buffer, add(0x20, offset)))
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Base64.sol)

pragma solidity ^0.8.20;

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

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

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

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

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

        string memory result = new string(resultLength);

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

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

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

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

            } lt(dataPtr, endPtr) {

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

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

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

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

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

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

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

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

        return result;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/extensions/ERC721Enumerable.sol)

pragma solidity ^0.8.20;

import {ERC721} from "../ERC721.sol";
import {IERC721Enumerable} from "./IERC721Enumerable.sol";
import {IERC165} from "../../../utils/introspection/ERC165.sol";

/**
 * @dev This implements an optional extension of {ERC721} defined in the ERC that adds enumerability
 * of all the token ids in the contract as well as all token ids owned by each account.
 *
 * CAUTION: {ERC721} extensions that implement custom `balanceOf` logic, such as {ERC721Consecutive},
 * interfere with enumerability and should not be used together with {ERC721Enumerable}.
 */
abstract contract ERC721Enumerable is ERC721, IERC721Enumerable {
    mapping(address owner => mapping(uint256 index => uint256)) private _ownedTokens;
    mapping(uint256 tokenId => uint256) private _ownedTokensIndex;

    uint256[] private _allTokens;
    mapping(uint256 tokenId => uint256) private _allTokensIndex;

    /**
     * @dev An `owner`'s token query was out of bounds for `index`.
     *
     * NOTE: The owner being `address(0)` indicates a global out of bounds index.
     */
    error ERC721OutOfBoundsIndex(address owner, uint256 index);

    /**
     * @dev Batch mint is not allowed.
     */
    error ERC721EnumerableForbiddenBatchMint();

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

    /**
     * @dev See {IERC721Enumerable-tokenOfOwnerByIndex}.
     */
    function tokenOfOwnerByIndex(address owner, uint256 index) public view virtual returns (uint256) {
        if (index >= balanceOf(owner)) {
            revert ERC721OutOfBoundsIndex(owner, index);
        }
        return _ownedTokens[owner][index];
    }

    /**
     * @dev See {IERC721Enumerable-totalSupply}.
     */
    function totalSupply() public view virtual returns (uint256) {
        return _allTokens.length;
    }

    /**
     * @dev See {IERC721Enumerable-tokenByIndex}.
     */
    function tokenByIndex(uint256 index) public view virtual returns (uint256) {
        if (index >= totalSupply()) {
            revert ERC721OutOfBoundsIndex(address(0), index);
        }
        return _allTokens[index];
    }

    /**
     * @dev See {ERC721-_update}.
     */
    function _update(address to, uint256 tokenId, address auth) internal virtual override returns (address) {
        address previousOwner = super._update(to, tokenId, auth);

        if (previousOwner == address(0)) {
            _addTokenToAllTokensEnumeration(tokenId);
        } else if (previousOwner != to) {
            _removeTokenFromOwnerEnumeration(previousOwner, tokenId);
        }
        if (to == address(0)) {
            _removeTokenFromAllTokensEnumeration(tokenId);
        } else if (previousOwner != to) {
            _addTokenToOwnerEnumeration(to, tokenId);
        }

        return previousOwner;
    }

    /**
     * @dev Private function to add a token to this extension's ownership-tracking data structures.
     * @param to address representing the new owner of the given token ID
     * @param tokenId uint256 ID of the token to be added to the tokens list of the given address
     */
    function _addTokenToOwnerEnumeration(address to, uint256 tokenId) private {
        uint256 length = balanceOf(to) - 1;
        _ownedTokens[to][length] = tokenId;
        _ownedTokensIndex[tokenId] = length;
    }

    /**
     * @dev Private function to add a token to this extension's token tracking data structures.
     * @param tokenId uint256 ID of the token to be added to the tokens list
     */
    function _addTokenToAllTokensEnumeration(uint256 tokenId) private {
        _allTokensIndex[tokenId] = _allTokens.length;
        _allTokens.push(tokenId);
    }

    /**
     * @dev Private function to remove a token from this extension's ownership-tracking data structures. Note that
     * while the token is not assigned a new owner, the `_ownedTokensIndex` mapping is _not_ updated: this allows for
     * gas optimizations e.g. when performing a transfer operation (avoiding double writes).
     * This has O(1) time complexity, but alters the order of the _ownedTokens array.
     * @param from address representing the previous owner of the given token ID
     * @param tokenId uint256 ID of the token to be removed from the tokens list of the given address
     */
    function _removeTokenFromOwnerEnumeration(address from, uint256 tokenId) private {
        // To prevent a gap in from's tokens array, we store the last token in the index of the token to delete, and
        // then delete the last slot (swap and pop).

        uint256 lastTokenIndex = balanceOf(from);
        uint256 tokenIndex = _ownedTokensIndex[tokenId];

        mapping(uint256 index => uint256) storage _ownedTokensByOwner = _ownedTokens[from];

        // When the token to delete is the last token, the swap operation is unnecessary
        if (tokenIndex != lastTokenIndex) {
            uint256 lastTokenId = _ownedTokensByOwner[lastTokenIndex];

            _ownedTokensByOwner[tokenIndex] = lastTokenId; // Move the last token to the slot of the to-delete token
            _ownedTokensIndex[lastTokenId] = tokenIndex; // Update the moved token's index
        }

        // This also deletes the contents at the last position of the array
        delete _ownedTokensIndex[tokenId];
        delete _ownedTokensByOwner[lastTokenIndex];
    }

    /**
     * @dev Private function to remove a token from this extension's token tracking data structures.
     * This has O(1) time complexity, but alters the order of the _allTokens array.
     * @param tokenId uint256 ID of the token to be removed from the tokens list
     */
    function _removeTokenFromAllTokensEnumeration(uint256 tokenId) private {
        // To prevent a gap in the tokens array, we store the last token in the index of the token to delete, and
        // then delete the last slot (swap and pop).

        uint256 lastTokenIndex = _allTokens.length - 1;
        uint256 tokenIndex = _allTokensIndex[tokenId];

        // When the token to delete is the last token, the swap operation is unnecessary. However, since this occurs so
        // rarely (when the last minted token is burnt) that we still do the swap here to avoid the gas cost of adding
        // an 'if' statement (like in _removeTokenFromOwnerEnumeration)
        uint256 lastTokenId = _allTokens[lastTokenIndex];

        _allTokens[tokenIndex] = lastTokenId; // Move the last token to the slot of the to-delete token
        _allTokensIndex[lastTokenId] = tokenIndex; // Update the moved token's index

        // This also deletes the contents at the last position of the array
        delete _allTokensIndex[tokenId];
        _allTokens.pop();
    }

    /**
     * See {ERC721-_increaseBalance}. We need that to account tokens that were minted in batch
     */
    function _increaseBalance(address account, uint128 amount) internal virtual override {
        if (amount > 0) {
            revert ERC721EnumerableForbiddenBatchMint();
        }
        super._increaseBalance(account, amount);
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/common/ERC2981.sol)

pragma solidity ^0.8.20;

import {IERC2981} from "../../interfaces/IERC2981.sol";
import {IERC165, ERC165} from "../../utils/introspection/ERC165.sol";

/**
 * @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, ERC165 {
    struct RoyaltyInfo {
        address receiver;
        uint96 royaltyFraction;
    }

    RoyaltyInfo private _defaultRoyaltyInfo;
    mapping(uint256 tokenId => 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 an 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);

    /**
     * @dev See {IERC165-supportsInterface}.
     */
    function supportsInterface(bytes4 interfaceId) public view virtual override(IERC165, ERC165) returns (bool) {
        return interfaceId == type(IERC2981).interfaceId || super.supportsInterface(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];
    }
}

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

pragma solidity ^0.8.20;

import {Hashes} from "./Hashes.sol";

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/ERC165.sol)

pragma solidity ^0.8.20;

import {IERC165} from "./IERC165.sol";

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/Math.sol)

pragma solidity ^0.8.20;

import {Panic} from "../Panic.sol";
import {SafeCast} from "./SafeCast.sol";

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        uint256 mLen = m.length;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/introspection/IERC165.sol)

pragma solidity ^0.8.20;

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

// SPDX-License-Identifier: MIT
// 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))
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SignedMath.sol)

pragma solidity ^0.8.20;

import {SafeCast} from "./SafeCast.sol";

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (interfaces/IERC2981.sol)

pragma solidity ^0.8.20;

import {IERC165} from "../utils/introspection/IERC165.sol";

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/ERC721.sol)

pragma solidity ^0.8.20;

import {IERC721} from "./IERC721.sol";
import {IERC721Metadata} from "./extensions/IERC721Metadata.sol";
import {ERC721Utils} from "./utils/ERC721Utils.sol";
import {Context} from "../../utils/Context.sol";
import {Strings} from "../../utils/Strings.sol";
import {IERC165, ERC165} from "../../utils/introspection/ERC165.sol";
import {IERC721Errors} from "../../interfaces/draft-IERC6093.sol";

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

    // Token name
    string private _name;

    // Token symbol
    string private _symbol;

    mapping(uint256 tokenId => address) private _owners;

    mapping(address owner => uint256) private _balances;

    mapping(uint256 tokenId => address) private _tokenApprovals;

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

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

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

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

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

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

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

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

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

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

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

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

        return _getApproved(tokenId);
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        _owners[tokenId] = to;

        emit Transfer(from, to, tokenId);

        return from;
    }

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

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

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

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

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

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

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

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

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

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

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

        _tokenApprovals[tokenId] = to;
    }

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (token/ERC721/extensions/IERC721Enumerable.sol)

pragma solidity ^0.8.20;

import {IERC721} from "../IERC721.sol";

/**
 * @title ERC-721 Non-Fungible Token Standard, optional enumeration extension
 * @dev See https://eips.ethereum.org/EIPS/eip-721
 */
interface IERC721Enumerable is IERC721 {
    /**
     * @dev Returns the total amount of tokens stored by the contract.
     */
    function totalSupply() external view returns (uint256);

    /**
     * @dev Returns a token ID owned by `owner` at a given `index` of its token list.
     * Use along with {balanceOf} to enumerate all of ``owner``'s tokens.
     */
    function tokenOfOwnerByIndex(address owner, uint256 index) external view returns (uint256);

    /**
     * @dev Returns a token ID at a given `index` of all the tokens stored by the contract.
     * Use along with {totalSupply} to enumerate all tokens.
     */
    function tokenByIndex(uint256 index) external view returns (uint256);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (utils/cryptography/Hashes.sol)

pragma solidity ^0.8.20;

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

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

// SPDX-License-Identifier: MIT
// 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)
        }
    }
}

// SPDX-License-Identifier: MIT
// 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;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (token/ERC721/extensions/IERC721Metadata.sol)

pragma solidity ^0.8.20;

import {IERC721} from "../IERC721.sol";

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/utils/ERC721Utils.sol)

pragma solidity ^0.8.20;

import {IERC721Receiver} from "../IERC721Receiver.sol";
import {IERC721Errors} from "../../../interfaces/draft-IERC6093.sol";

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.1.0) (token/ERC721/IERC721Receiver.sol)

pragma solidity ^0.8.20;

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

{
  "evmVersion": "paris",
  "optimizer": {
    "enabled": true,
    "mode": "3"
  },
  "outputSelection": {
    "*": {
      "*": [
        "abi"
      ]
    }
  },
  "detectMissingLibraries": false,
  "forceEVMLA": false,
  "enableEraVMExtensions": false,
  "libraries": {}
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"string","name":"_name","type":"string"},{"internalType":"string","name":"_symbol","type":"string"},{"internalType":"address","name":"_creator","type":"address"},{"internalType":"uint96","name":"_royalty","type":"uint96"}],"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"},{"inputs":[],"name":"ERC721EnumerableForbiddenBatchMint","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721IncorrectOwner","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721InsufficientApproval","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC721InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC721InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721InvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC721InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC721InvalidSender","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721NonexistentToken","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"ERC721OutOfBoundsIndex","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":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":[{"internalType":"address","name":"_recipient","type":"address"},{"internalType":"uint256","name":"tokenBaseId","type":"uint256"},{"internalType":"uint256","name":"_maxClaims","type":"uint256"},{"internalType":"bytes32[]","name":"_proof","type":"bytes32[]"}],"name":"checdkWhiteList","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"creator","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenBaseId","type":"uint256"}],"name":"getTokenBase","outputs":[{"internalType":"string","name":"","type":"string"},{"internalType":"string","name":"","type":"string"},{"internalType":"string","name":"","type":"string"},{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"uint256","name":"","type":"uint256"},{"internalType":"bool","name":"","type":"bool"},{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_recipient","type":"address"},{"internalType":"uint256","name":"tokenBaseId","type":"uint256"},{"internalType":"uint256","name":"_mintAmount","type":"uint256"},{"internalType":"uint256","name":"_maxClaims","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":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenBaseId","type":"uint256"},{"internalType":"bool","name":"_state","type":"bool"}],"name":"pause","outputs":[],"stateMutability":"nonpayable","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":"address","name":"recipient","type":"address"},{"internalType":"uint96","name":"feeNumerator","type":"uint96"}],"name":"setDefaultRoyalty","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"bool","name":"state","type":"bool"}],"name":"setOwner","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenBaseId","type":"uint256"},{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"description","type":"string"},{"internalType":"string","name":"imageURI","type":"string"},{"internalType":"uint256","name":"cost","type":"uint256"},{"internalType":"uint256","name":"supply","type":"uint256"},{"internalType":"bool","name":"pauseflag","type":"bool"},{"internalType":"bytes32","name":"_newMerkleRoot","type":"bytes32"}],"name":"setTokenBase","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":"","type":"uint256"}],"name":"token","outputs":[{"internalType":"uint256","name":"num","type":"uint256"},{"internalType":"uint256","name":"edition","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"tokenBaseData","outputs":[{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"description","type":"string"},{"internalType":"string","name":"imageURI","type":"string"},{"internalType":"uint256","name":"mintCost","type":"uint256"},{"internalType":"uint256","name":"supply","type":"uint256"},{"internalType":"uint256","name":"edition","type":"uint256"},{"internalType":"bool","name":"pause","type":"bool"},{"internalType":"bytes32","name":"merkleRoot","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"index","type":"uint256"}],"name":"tokenByIndex","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"tokenOfOwnerByIndex","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"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":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_newCreator","type":"address"}],"name":"transferCreator","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_owner","type":"address"}],"name":"walletOfOwner","outputs":[{"internalType":"uint256[]","name":"","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"withdraw","outputs":[],"stateMutability":"payable","type":"function"}]

9c4d535b0000000000000000000000000000000000000000000000000000000000000000010005dd55f4083dc728d154434e7e82536a2c7ba726f0bc8dfcfc6b3917c9e500000000000000000000000000000000000000000000000000000000000000600000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000008000000000000000000000000000000000000000000000000000000000000000c0000000000000000000000000b3d1a549f61ba2f9609c49a8dc52971d5992acca000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000104252494d494e204669727374204e4654000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004424d464e00000000000000000000000000000000000000000000000000000000

0x0002000000000002000c00000000000200010000000103550000006003100270000005470030019d0000008004000039000000400040043f00000547033001970000000100200190000000220000c13d000000040030008c000000410000413d000000000201043b000000e002200270000005580020009c000000430000213d0000056e0020009c000000850000a13d0000056f0020009c000000fb0000213d000005750020009c0000036a0000213d000005780020009c000004550000613d000005790020009c000000410000c13d0000000001000416000000000001004b000000410000c13d0000000a01000039000000000101041a000000800010043f0000058901000041000015180001042e0000000002000416000000000002004b000000410000c13d0000001f0230003900000548022001970000008002200039000000400020043f0000001f0530018f00000549063001980000008002600039000000320000613d000000000701034f000000007807043c0000000004840436000000000024004b0000002e0000c13d000000000005004b0000003f0000613d000000000161034f0000000304500210000000000502043300000000054501cf000000000545022f000000000101043b0000010004400089000000000141022f00000000014101cf000000000151019f0000000000120435000000800030008c0000006c0000813d00000000010000190000151900010430000005590020009c000000a10000a13d0000055a0020009c0000010f0000213d000005600020009c000003760000213d000005630020009c000004e80000613d000005640020009c000000410000c13d0000000001000416000000000001004b000000410000c13d0000000303000039000000000203041a000000010420019000000001012002700000007f0110618f0000001f0010008c00000000050000390000000105002039000000000552013f00000001005001900000009b0000c13d000000800010043f000000000004004b000006520000613d000000000030043f000000000001004b0000062f0000613d000005a60200004100000000040000190000000003040019000000000402041a000000a005300039000000000045043500000001022000390000002004300039000000000014004b000000630000413d0000074e0000013d000000800400043d0000054a0040009c000000410000213d0000001f01400039000000000031004b00000000020000190000054b020080410000054b01100197000000000001004b00000000050000190000054b050040410000054b0010009c000000000502c019000000000005004b000000410000c13d000000800140003900000000020104330000054a0020009c000002380000a13d000005c001000041000000000010043f0000004101000039000000040010043f000005550100004100001519000104300000057a0020009c000002dd0000a13d0000057b0020009c000003340000213d0000057e0020009c000003d80000613d0000057f0020009c000000410000c13d0000000001000416000000000001004b000000410000c13d0000000203000039000000000203041a000000010420019000000001012002700000007f0110618f0000001f0010008c00000000050000390000000105002039000000000552013f0000000100500190000006290000613d000005c001000041000000000010043f0000002201000039000000040010043f00000555010000410000151900010430000005650020009c000002f70000a13d000005660020009c0000035b0000213d000005690020009c000004090000613d0000056a0020009c000000410000c13d000000a40030008c000000410000413d0000000402100370000000000202043b000b00000002001d0000054c0020009c000000410000213d0000006402100370000000000202043b000c00000002001d0000008402100370000000000202043b0000054a0020009c000000410000213d0000002304200039000000000034004b000000410000813d0000000404200039000000000441034f000000000404043b000a00000004001d0000054a0040009c000000410000213d000900240020003d0000000a0200002900000005022002100000000902200029000000000032004b000000410000213d0000002401100370000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000701100039000000000101041a000000000001004b0000093d0000613d0000000001000411000000000010043f0000000d01000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000000ff001001900000093d0000c13d00000024010000390000000101100367000000000101043b0000000b020000290000000c0300002900000009040000290000000a05000029151713a40000040f000000000001004b0000090e0000c13d000000400100043d0000004402100039000005aa03000041000000000032043500000024021000390000000f03000039000006470000013d000005700020009c0000039a0000213d000005730020009c0000050a0000613d000005740020009c000000410000c13d000000440030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000402100370000000000302043b0000054c0030009c000000410000213d0000002401100370000000000201043b00000000010300191517130d0000040f000005f70000013d0000055b0020009c000003b70000213d0000055e0020009c000005340000613d0000055f0020009c000000410000c13d000001040030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000002402100370000000000402043b0000054a0040009c000000410000213d0000002302400039000000000032004b000000410000813d0000000405400039000000000251034f000000000202043b0000054a0020009c0000007f0000213d0000001f06200039000005d2066001970000003f06600039000005d2066001970000058a0060009c0000007f0000213d00000024044000390000008006600039000000400060043f000000800020043f0000000004420019000000000034004b000000410000213d0000002004500039000000000541034f000005d2062001980000001f0720018f000000a0046000390000013f0000613d000000a008000039000000000905034f000000009a09043c0000000008a80436000000000048004b0000013b0000c13d000000000007004b0000014c0000613d000000000565034f0000000306700210000000000704043300000000076701cf000000000767022f000000000505043b0000010006600089000000000565022f00000000056501cf000000000575019f0000000000540435000000a00220003900000000000204350000004402100370000000000402043b0000054a0040009c000000410000213d0000002302400039000000000032004b000000410000813d0000000405400039000000000251034f000000000202043b0000054a0020009c0000007f0000213d0000001f06200039000005d2066001970000003f06600039000005d206600197000000400700043d0000000006670019000c00000007001d000000000076004b000000000700003900000001070040390000054a0060009c0000007f0000213d00000001007001900000007f0000c13d0000002404400039000000400060043f0000000c060000290000000006260436000b00000006001d0000000004420019000000000034004b000000410000213d0000002004500039000000000541034f000005d2062001980000001f0720018f0000000b046000290000017c0000613d000000000805034f0000000b09000029000000008a08043c0000000009a90436000000000049004b000001780000c13d000000000007004b000001890000613d000000000565034f0000000306700210000000000704043300000000076701cf000000000767022f000000000505043b0000010006600089000000000565022f00000000056501cf000000000575019f00000000005404350000000b0220002900000000000204350000006402100370000000000402043b0000054a0040009c000000410000213d0000002302400039000000000032004b000000410000813d0000000405400039000000000251034f000000000202043b0000054a0020009c0000007f0000213d0000001f06200039000005d2066001970000003f06600039000005d206600197000000400700043d0000000006670019000a00000007001d000000000076004b000000000700003900000001070040390000054a0060009c0000007f0000213d00000001007001900000007f0000c13d0000002404400039000000400060043f0000000a060000290000000006260436000900000006001d0000000004420019000000000034004b000000410000213d0000002003500039000000000431034f000005d2052001980000001f0620018f0000000903500029000001b90000613d000000000704034f0000000908000029000000007907043c0000000008980436000000000038004b000001b50000c13d000000000006004b000001c60000613d000000000454034f0000000305600210000000000603043300000000065601cf000000000656022f000000000404043b0000010005500089000000000454022f00000000045401cf000000000464019f000000000043043500000009022000290000000000020435000000c401100370000000000101043b000000000001004b0000000002000039000000010200c039000000000021004b000000410000c13d0000000001000411000000000010043f0000000d01000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000000ff00100190000005a80000613d00000004010000390000000101100367000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000800000001001d0000000501100039000000000101041a000000000001004b00000fd20000c13d000000800100043d000700000001001d0000054a0010009c0000007f0000213d0000000801000029000000000101041a000000010010019000000001021002700000007f0220618f000600000002001d0000001f0020008c00000000020000390000000102002039000000000121013f00000001001001900000009b0000c13d0000000601000029000000200010008c000002240000413d0000000801000029000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d00000007030000290000001f023000390000000502200270000000200030008c0000000002004019000000000301043b00000006010000290000001f01100039000000050110027000000000011300190000000002230019000000000012004b000002240000813d000000000002041b0000000102200039000000000012004b000002200000413d00000007010000290000001f0010008c00000e9d0000a13d0000000801000029000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d000000200200008a0000000703200180000000000101043b00000ea90000c13d000000200200003900000eb50000013d0000001f01200039000005d2011001970000003f01100039000005d201100197000000400600043d0000000005160019000000000065004b000000000100003900000001010040390000054a0050009c0000007f0000213d00000001001001900000007f0000c13d0000008001300039000000400050043f000c00000006001d0000000005260436000b00000005001d000000a0044000390000000005420019000000000015004b000000410000213d000000000002004b0000000b08000029000002590000613d000000000500001900000000065800190000000007450019000000000707043300000000007604350000002005500039000000000025004b000002520000413d0000000c0220002900000020022000390000000000020435000000a00400043d0000054a0040009c000000410000213d0000001f02400039000000000032004b00000000030000190000054b030080410000054b02200197000000000002004b00000000050000190000054b050040410000054b0020009c000000000503c019000000000005004b000000410000c13d000000800240003900000000020204330000054a0020009c0000007f0000213d0000001f03200039000005d2033001970000003f03300039000005d203300197000000400600043d0000000003360019000000000063004b000000000500003900000001050040390000054a0030009c0000007f0000213d00000001005001900000007f0000c13d000000400030043f000a00000006001d0000000003260436000900000003001d000000a0034000390000000004320019000000000014004b000000410000213d000000000002004b00000009060000290000028f0000613d000000000100001900000000041600190000000005310019000000000505043300000000005404350000002001100039000000000021004b000002880000413d0000000a0120002900000020011000390000000000010435000000c00100043d000800000001001d0000054c0010009c000000410000213d000000e00100043d000700000001001d0000054d0010009c000000410000213d0000000c010000290000000001010433000600000001001d0000054a0010009c0000007f0000213d0000000201000039000000000101041a000000010210019000000001011002700000007f0110618f000500000001001d0000001f0010008c00000000010000390000000101002039000000000012004b0000009b0000c13d0000000501000029000000200010008c000002c90000413d0000000201000039000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d00000006030000290000001f023000390000000502200270000000200030008c0000000002004019000000000301043b00000005010000290000001f01100039000000050110027000000000011300190000000002230019000000000012004b000002c90000813d000000000002041b0000000102200039000000000012004b000002c50000413d00000006010000290000001f0010008c000008f10000a13d0000000201000039000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d000000200200008a0000000602200180000000000101043b00000a210000c13d000000200300003900000a2e0000013d000005800020009c000005fe0000613d000005810020009c000005dd0000613d000005820020009c000000410000c13d000000240030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000101043b000000000010043f0000001101000039000000200010043f00000040020000390000000001000019151714f80000040f0000000102100039000000000202041a000000000101041a000000800010043f000000a00020043f000005cc01000041000015180001042e0000056b0020009c000006170000613d0000056c0020009c000005e60000613d0000056d0020009c000000410000c13d000000240030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000101043b000000000010043f0000001001000039000000200010043f00000040020000390000000001000019151714f80000040f0000000002010019000c00000001001d0000000301100039000000000101041a000b00000001001d0000000401200039000000000101041a000a00000001001d0000000501200039000000000101041a000900000001001d0000000701200039000000000101041a000800000001001d0000000601200039000000000101041a000700000001001d0000000001020019151710310000040f000600000001001d0000000c010000290000000101100039151710310000040f0000000c020000290000000202200039000c00000001001d0000000001020019151710310000040f0000000702000029000000ff0820018f0000000004010019000000400100043d000700000001001d00000006020000290000000c030000290000000b050000290000000a06000029000000090700002900000008090000291517107e0000040f0000000702000029000007590000013d0000057c0020009c000004390000613d0000057d0020009c000000410000c13d000000440030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000402100370000000000202043b000c00000002001d0000054c0020009c000000410000213d0000002401100370000000000101043b000b00000001001d000000000010043f0000000401000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a0000054c05100198000006e60000c13d000000400100043d000005a202000041000000000021043500000004021000390000000b03000029000005510000013d000005670020009c0000044c0000613d000005680020009c000000410000c13d000000240030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000101043b0000054c0010009c000000410000213d151713670000040f000005f70000013d000005760020009c000005570000613d000005770020009c000000410000c13d0000000001000416000000000001004b000000410000c13d0000000001030019151710c80000040f151711340000040f0000000001000019000015180001042e000005610020009c000005810000613d000005620020009c000000410000c13d000000840030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000402100370000000000202043b000c00000002001d0000054c0020009c000000410000213d0000002402100370000000000202043b000b00000002001d0000054c0020009c000000410000213d0000006402100370000000000402043b0000054a0040009c000000410000213d0000002302400039000000000032004b000000410000813d0000000402400039000000000221034f000000000202043b0000004401100370000000000101043b000a00000001001d0000002401400039151710e50000040f000900000001001d000003ab0000013d000005710020009c000005970000613d000005720020009c000000410000c13d0000000001000416000000000001004b000000410000c13d0000000001030019151710c80000040f000c00000001001d000b00000002001d000a00000003001d000000400100043d000900000001001d151710140000040f000000090100002900000000000104350000000c010000290000000b020000290000000a03000029151711340000040f00000000010004110000000c020000290000000b030000290000000a0400002900000009050000291517142c0000040f0000000001000019000015180001042e0000055c0020009c000005bc0000613d0000055d0020009c000000410000c13d000000240030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000101043b0000054c0010009c000000410000213d0000000e02000039000000000302041a0000054c043001970000000005000411000000000054004b000006910000c13d000000000001004b000007840000c13d0000058301000041000000800010043f0000002001000039000000840010043f0000003001000039000000a40010043f0000058701000041000000c40010043f0000058801000041000000e40010043f00000586010000410000151900010430000000440030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000402100370000000000202043b000c00000002001d0000054c0020009c000000410000213d0000002401100370000000000101043b000b00000001001d0000054d0010009c000000410000213d0000000001000411000000000010043f0000000d01000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000000ff00100190000005a80000613d0000000b010000290000054d02100197000000400100043d000027110020008c000007a10000413d0000002403100039000027100400003900000000004304350000055603000041000000000031043500000004031000390000000000230435000005470010009c0000054701008041000000400110021000000557011001c70000151900010430000000440030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000402100370000000000202043b000c00000002001d0000054c0020009c000000410000213d0000002401100370000000000201043b000000000002004b0000000001000039000000010100c039000b00000002001d000000000012004b000000410000c13d0000000001000411000000000010043f0000000d01000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000000ff00100190000005a80000613d0000000c01000029000000000001004b000007a80000c13d000000400100043d0000006402100039000005ba0300004100000000003204350000004402100039000005bb03000041000000000032043500000024021000390000002e03000039000005b10000013d000000240030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000101043b000c00000001001d151713840000040f0000000c01000029000000000010043f0000000601000039000000200010043f00000040020000390000000001000019151714f80000040f000000000101041a0000054c01100197000005f70000013d000000240030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000101043b151713840000040f000005f70000013d000000840030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000402100370000000000202043b000900000002001d0000054c0020009c000000410000213d0000006402100370000000000202043b0000054a0020009c000000410000213d0000002304200039000000000034004b000000410000813d000800040020003d0000000804100360000000000404043b000c00000004001d0000054a0040009c000000410000213d00000024022000390000000c040000290000000504400210000600000002001d000b00000004001d000700000024001d000000070030006b000000410000213d0000002402100370000000000202043b000500000002001d0000004401100370000000000201043b0000000901000029000000a00010043f000400000002001d000000c00020043f0000004001000039000000800010043f000000e001000039000000400010043f0000000001000414000005470010009c0000054701008041000000c001100210000005c6011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000300000001001d0000000501000029000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000b020000290000003f02200039000005bf02200197000000400300043d0000000002230019000b00000003001d000000000032004b000000000300003900000001030040390000054a0020009c0000007f0000213d00000001003001900000007f0000c13d0000000701100039000000000101041a000200000001001d000000400020043f0000000b010000290000000c020000290000000001210436000a00000001001d0000000702000029000000000020007c000000410000213d0000000c0000006b000004c40000613d0000000801000029000000200110003900000001011003670000000b02000029000000060400002900000007050000290000002002200039000000001301043c00000000003204350000002004400039000000000054004b000004ba0000413d0000000b010000290000000001010433000000000001004b000009d00000c13d0000000302000029000000020020006c0000000001000019000005f70000c13d0000000501000029000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000902000029000000000020043f0000000801100039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000000040110006b000005f70000813d00000deb0000013d000000440030008c000000410000413d0000000001000416000000000001004b000000410000c13d151710da0000040f0000000002000411000000000020043f0000000d02000039000000200020043f000c00000001001d00000040020000390000000001000019151714f80000040f000000000101041a000000ff0110018f1517111d0000040f00000004010000390000000101100367000000000101043b000000000010043f0000001001000039000000200010043f00000000010000190000004002000039151714f80000040f0000000601100039000000000301041a000005d3023001970000000c0000006b000000010220c1bf000000000021041b0000000001000019000015180001042e000000440030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000101043b000000000010043f0000000101000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000201041a0000054c01200198000005230000c13d000000000200041a0000054c01200197000c00000001001d00000024010000390000000101100367000000000101043b000000a002200270151712ff0000040f000027100110011a000000400200043d000000200320003900000000001304350000000c010000290000000000120435000005470020009c00000547020080410000004001200210000005c5011001c7000015180001042e000000240030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000101043b000c00000001001d000000000010043f0000000401000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a0000054c001001980000065e0000c13d000000400100043d000005a202000041000000000021043500000004021000390000000c030000290000000000320435000005470010009c0000054701008041000000400110021000000555011001c70000151900010430000000240030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000101043b000000000010043f0000001001000039000000200010043f00000040020000390000000001000019151714f80000040f000c00000001001d151710310000040f000b00000001001d0000000c010000290000000101100039151710310000040f000a00000001001d0000000c010000290000000201100039151710310000040f0000000c0500002900000006025000390000000703500039000000050450003900000004065000390000000305500039000000000505041a000000000606041a000000000704041a000000000903041a000000000202041a0000000004010019000000400100043d000c00000001001d000000ff0820018f0000000b020000290000000a030000291517107e0000040f000007580000013d000000440030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000402100370000000000202043b000c00000002001d0000054c0020009c000000410000213d0000002401100370000000000201043b000000000002004b0000000001000039000000010100c039000b00000002001d000000000012004b000000410000c13d0000000c0000006b000007100000c13d000005a401000041000006250000013d0000000001000411000000000010043f0000000d01000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000000ff00100190000006310000c13d000000400100043d0000006402100039000005ca0300004100000000003204350000004402100039000005cb03000041000000000032043500000024021000390000002403000039000000000032043500000583020000410000000000210435000000040210003900000020030000390000000000320435000005470010009c00000547010080410000004001100210000005bc011001c70000151900010430000000440030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000402100370000000000202043b0000054c0020009c000000410000213d0000002401100370000000000101043b000c00000001001d0000054c0010009c000000410000213d000000000020043f0000000701000039000000200010043f00000040020000390000000001000019151714f80000040f0000000c02000029000000000020043f000000200010043f00000000010000190000004002000039151714f80000040f000000000101041a000000ff001001900000000001000039000000010100c039000000800010043f0000058901000041000015180001042e0000000001000416000000000001004b000000410000c13d0000000e01000039000000000101041a0000054c01100197000000800010043f0000058901000041000015180001042e000000240030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000101043b0000000a02000039000000000202041a000000000021004b000006580000813d151713590000040f0000000302200210000000000101041a000000000121022f000000ff0020008c0000000001002019000000400200043d0000000000120435000005470020009c00000547020080410000004001200210000005a7011001c7000015180001042e000000240030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000201043b000005b600200198000000410000c13d0000000101000039000005cd0020009c000006130000613d000005ce0020009c000006130000613d000005cf0020009c000006130000613d000005d00020009c00000000010000390000000101006039000005d10020009c00000001011061bf000000010110018f000000800010043f0000058901000041000015180001042e000000240030008c000000410000413d0000000002000416000000000002004b000000410000c13d0000000401100370000000000101043b000b00000001001d0000054c0010009c000000410000213d0000000b01000029000000000001004b0000069d0000c13d000005b001000041000000800010043f000000840000043f000005a5010000410000151900010430000000800010043f000000000004004b000006520000613d000000000030043f000000000001004b000007440000c13d000000a0010000390000074f0000013d000005c1010000410000000000100443000000000100041000000004001004430000000001000414000005470010009c0000054701008041000000c001100210000005b3011001c70000800a02000039151715120000040f000000010020019000000d830000613d000000000101043b000000000001004b000007620000c13d000000400100043d0000004402100039000005c403000041000000000032043500000024021000390000000803000039000000000032043500000583020000410000000000210435000000040210003900000020030000390000000000320435000005470010009c00000547010080410000004001100210000005a9011001c70000151900010430000005d302200197000000a00020043f000000000001004b000000c001000039000000a0010060390000074f0000013d000005bd02000041000000800020043f000000840000043f000000a40010043f000005be0100004100001519000104300000000c01000029000000000010043f0000001101000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000b00000001001d000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000a00000001001d0000000c01000029000000000010043f0000001101000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000101100039000000000101041a0000058b0010009c000007f60000413d00000040020000390000058b0310012a000007ff0000013d0000058301000041000000800010043f0000002001000039000000840010043f0000002601000039000000a40010043f0000058401000041000000c40010043f0000058501000041000000e40010043f00000586010000410000151900010430000000000010043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000701041a0000054a0070009c0000007f0000213d00000005017002100000003f02100039000005bf02200197000000400300043d0000000002230019000a00000003001d000000000032004b000000000300003900000001030040390000054a0020009c0000007f0000213d00000001003001900000007f0000c13d000000400020043f0000000a0200002900000000067204360000001f0210018f000000000001004b000006c80000613d0000000001160019000000000300003100000001033003670000000004060019000000003503043c0000000004540436000000000014004b000006c40000c13d000000000002004b000900000006001d000800000007001d000000000007004b000008750000c13d000000400100043d000000200200003900000000022104360000000a03000029000000000303043300000000003204350000004002100039000000000003004b000006dd0000613d00000000040000190000000906000029000000006506043400000000025204360000000104400039000000000034004b000006d80000413d0000000002120049000005470020009c00000547020080410000006002200210000005470010009c00000547010080410000004001100210000000000112019f000015180001042e0000000001000411000000000001004b000007890000613d000000000015004b000007890000613d000a00000005001d000000000050043f0000000701000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000002000411000000000020043f000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000000ff001001900000000a050000290000000003000411000007890000c13d000000400100043d000005c70200004100000000002104350000000402100039000005510000013d0000000001000411000000000010043f0000000701000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000c02000029000000000020043f000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000201041a000005d3022001970000000b03000029000000000232019f000000000021041b000000400100043d0000000000310435000005470010009c000005470100804100000040011002100000000002000414000005470020009c0000054702008041000000c002200210000000000112019f0000054e011001c70000800d020000390000000303000039000005a30400004100000000050004110000000c060000291517150d0000040f0000000100200190000008c20000c13d000000410000013d000005c90200004100000000040000190000000003040019000000000402041a000000a005300039000000000045043500000001022000390000002004300039000000000014004b000007460000413d000000c001300039000000800210008a00000080010000391517101f0000040f0000002001000039000000400200043d000c00000002001d0000000002120436000000800100003915170ff70000040f0000000c020000290000000001210049000005470010009c00000547010080410000006001100210000005470020009c00000547020080410000004002200210000000000121019f000015180001042e000005c1010000410000000000100443000000000100041000000004001004430000000001000414000005470010009c0000054701008041000000c001100210000005b3011001c70000800a02000039151715120000040f000000010020019000000d830000613d000000000301043b00000005023000c9000000000003004b000007760000613d00000000013200d9000000050010008c00000deb0000c13d000c00000003001d000000640320011a0000000f01000039000000000101041a0000054c041001970000000001000414000005470010009c0000054701008041000000c001100210000000630020008c000b00000003001d000007b50000213d0000000002040019000007b80000013d0000054f03300197000000000113019f000000000012041b0000000001000019000015180001042e0000000001000414000005470010009c0000054701008041000000c001100210000005ad011001c70000800d020000390000000403000039000005c8040000410000000c060000290000000b070000291517150d0000040f0000000100200190000000410000613d0000000b01000029000000000010043f0000000601000039000000200010043f00000040020000390000000001000019151714f80000040f000000000201041a0000054f022001970000000c03000029000007b10000013d0000000c0000006b000008b00000c13d0000055402000041000000000021043500000004021000390000000000020435000005520000013d000000000010043f0000000d01000039000000200010043f00000040020000390000000001000019151714f80000040f000000000201041a000005d3022001970000000b03000029000000000232019f000000000021041b0000000001000019000015180001042e000005ad011001c7000080090200003900000000050000191517150d0000040f00000060031002700000054703300198000007e10000613d0000001f0430003900000548044001970000003f04400039000005b504400197000000400500043d0000000004450019000000000054004b000000000600003900000001060040390000054a0040009c0000007f0000213d00000001006001900000007f0000c13d000000400040043f0000001f0430018f000000000635043600000549053001980000000003560019000007d40000613d000000000701034f000000007807043c0000000006860436000000000036004b000007d00000c13d000000000004004b000007e10000613d000000000151034f0000000304400210000000000503043300000000054501cf000000000545022f000000000101043b0000010004400089000000000141022f00000000014101cf000000000151019f00000000001304350000000100200190000007ef0000613d0000000e01000039000000000101041a0000054c041001970000000001000414000005470010009c0000054701008041000000c0011002100000000b030000290000000c0030006b000008b70000c13d0000000002040019000008bc0000013d000000400100043d0000004402100039000005c203000041000000000032043500000024021000390000001303000039000006470000013d0000058d0010009c00000000030100190000058c0330212a000000000200003900000020020020390000058e0030009c00000010022081bf0000058f033081970000058e0330812a000005900030009c00000008022080390000054a03308197000005900330812a000027100030008c00000004022080390000054703308197000027100330811a000000640030008c00000002022080390000ffff0330818f000000640330811a000000090030008c0000000102202039000005d2032001970000005f04300039000005d205400197000000400700043d0000000004750019000000000054004b000000000500003900000001050040390000054a0040009c0000007f0000213d00000001005001900000007f0000c13d000000400040043f0000000104200039000c00000007001d00000000084704360000002003300039000005d2043001980000001f0330018f000008290000613d0000000004480019000000000500003100000001055003670000000006080019000000005705043c0000000006760436000000000046004b000008250000c13d000900000008001d000000000003004b0000000c022000290000002102200039000000090010008c0000000a3110011a0000000303300210000000010220008a00000000040204330000059104400197000005920330021f0000059303300197000000000343019f00000000003204350000082d0000213d0000000b01000029000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000800000001001d000000400100043d000b00000001001d0000002001100039000005940200004100000000002104350000000a01000029000000000101041a000000010210019000000001031002700000007f0330618f000700000003001d0000001f0030008c00000000030000390000000103002039000000000331013f00000001003001900000009b0000c13d0000000b030000290006002a0030003d000000000002004b0000098d0000613d0000000a01000029000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d0000000705000029000000000005004b0000000606000029000009910000613d000000000101043b00000000020000190000000003620019000000000401041a000000000043043500000001011000390000002002200039000000000052004b0000086d0000413d000009910000013d000c00000000001d0000000b01000029000000000010043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a0000000c0010006c000008fe0000a13d0000000b01000029000000000010043f0000000801000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000c02000029000000000020043f000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d0000000a0200002900000000020204330000000c04000029000000000042004b000009080000a13d00000005024002100000000902200029000000000101043b000000000101041a00000000001204350000000104400039000c00000004001d000000080040006c000008760000413d000006cd0000013d151710090000040f0000000b01000029000000a0011002100000000c011001af000000000010041b0000000001000019000015180001042e0000000b030000290000000c03300069000005ad011001c7000080090200003900000000050000191517150d0000040f00000060031002700000054703300198000008c40000c13d0000000100200190000008ea0000613d0000000001000019000015180001042e0000001f0430003900000548044001970000003f04400039000005b504400197000000400500043d0000000004450019000000000054004b000000000600003900000001060040390000054a0040009c0000007f0000213d00000001006001900000007f0000c13d000000400040043f0000001f0430018f000000000635043600000549053001980000000003560019000008dc0000613d000000000701034f000000007807043c0000000006860436000000000036004b000008d80000c13d000000000004004b000008c00000613d000000000151034f0000000304400210000000000503043300000000054501cf000000000545022f000000000101043b0000010004400089000000000141022f00000000014101cf000000000151019f0000000000130435000008c00000013d000000400100043d0000004402100039000005c303000041000000000032043500000024021000390000001703000039000006470000013d000000060000006b0000000001000019000008f60000613d0000000b01000029000000000101043300000006040000290000000302400210000005d40220027f000005d402200167000000000121016f0000000102400210000000000121019f00000a3c0000013d000000400100043d00000024021000390000000c030000290000000000320435000005bd02000041000000000021043500000004021000390000000b030000290000000000320435000004040000013d000005c001000041000000000010043f0000003201000039000000040010043f0000055501000041000015190001043000000024010000390000000101100367000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000b02000029000000000020043f0000000801100039000000200010043f00000044010000390000000101100367000000000101043b000a00000001001d0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a0000000a0010002a00000deb0000413d0000000a011000290000000c0010006c0000093d0000a13d000000400100043d0000004402100039000005a803000041000000000032043500000024021000390000001403000039000006470000013d00000024010000390000000101100367000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000601100039000000000101041a000000ff00100190000009860000c13d00000001010003670000002402100370000000000202043b000000000020043f0000001002000039000000200020043f0000004401100370000000000101043b000c00000001001d0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000501100039000000000201041a000a00000002001d0000000c0020002a00000deb0000413d00000024010000390000000101100367000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d0000000a030000290000000c02300029000000000101043b0000000401100039000000000101041a000000000012004b00000a820000a13d000000400100043d0000004402100039000005b903000041000000000032043500000024021000390000001003000039000006470000013d000000400100043d0000004402100039000005ab03000041000000000032043500000024021000390000001903000039000006470000013d000005d30110019700000006060000290000000000160435000000070500002900000000016500190000059502000041000000000021043500000002031000390000000c020000290000000002020433000000000002004b0000000907000029000009a20000613d000000000400001900000000053400190000000006740019000000000606043300000000006504350000002004400039000000000024004b0000099b0000413d00000000033200190000000000030435000000000312001900000002013000390000059602000041000000000021043500000008010000290000000101100039000000000201041a000000010420019000000001052002700000007f0550618f000c00000005001d0000001f0050008c00000000050000390000000105002039000000000552013f00000001005001900000009b0000c13d000a00150030003d000000000004004b000009ef0000613d000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d0000000c05000029000000000005004b0000000a06000029000009f30000613d000000000101043b00000000020000190000000003620019000000000401041a000000000043043500000001011000390000002002200039000000000052004b000009c80000413d000009f30000013d00000000030000190000000302000029000c00000003001d00000005013002100000000a011000290000000001010433000000000012004b000009dc0000813d000000000020043f000000200010043f0000000001000414000009df0000013d000000000010043f000000200020043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000201043b0000000c0300002900000001033000390000000b010000290000000001010433000000000013004b000009d20000413d000004c50000013d000005d3012001970000000a0600002900000000001604350000000c0500002900000000016500190000059702000041000000000021043500000002021000390000059803000041000000000032043500000008020000290000000202200039000000000302041a000000010430019000000001053002700000007f0550618f000c00000005001d0000001f0050008c00000000050000390000000105002039000000000553013f00000001005001900000009b0000c13d000a000d0010003d000000000004004b00000ac50000613d000000000020043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d0000000c05000029000000000005004b0000000a0600002900000ac90000613d000000000101043b00000000020000190000000003620019000000000401041a000000000043043500000001011000390000002002200039000000000052004b00000a190000413d00000ac90000013d000000010320008a00000005033002700000000004310019000000200300003900000001044000390000000c0600002900000000056300190000000005050433000000000051041b00000020033000390000000101100039000000000041004b00000a270000c13d000000060020006c00000a390000813d00000006020000290000000302200210000000f80220018f000005d40220027f000005d4022001670000000c033000290000000003030433000000000223016f000000000021041b0000000601000029000000010110021000000001011001bf0000000202000039000000000012041b0000000a010000290000000001010433000c00000001001d0000054a0010009c0000007f0000213d0000000301000039000000000101041a000000010010019000000001021002700000007f0220618f000b00000002001d0000001f0020008c00000000020000390000000102002039000000000121013f00000001001001900000009b0000c13d0000000b01000029000000200010008c00000a6e0000413d0000000301000039000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d0000000c030000290000001f023000390000000502200270000000200030008c0000000002004019000000000301043b0000000b010000290000001f01100039000000050110027000000000011300190000000002230019000000000012004b00000a6e0000813d000000000002041b0000000102200039000000000012004b00000a6a0000413d0000000c010000290000001f0010008c00000ab80000a13d0000000301000039000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d000000200200008a0000000c02200180000000000101043b00000d840000c13d000000200300003900000d910000013d0000000001000411000000000010043f0000000d01000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000000ff0010019000000b0a0000c13d00000001010003670000002402100370000000000202043b000000000020043f0000001002000039000000200020043f0000004401100370000000000101043b000c00000001001d0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000301100039000000000201041a0000000c012000b9000000000002004b00000aae0000613d00000000022100d90000000c0020006c00000deb0000c13d0000000002000416000000000012004b00000b0a0000813d000000400100043d0000004402100039000005b803000041000000000032043500000024021000390000001803000039000006470000013d0000000c0000006b000000000100001900000abd0000613d000000090100002900000000010104330000000c040000290000000302400210000005d40220027f000005d402200167000000000121016f0000000102400210000000000121019f00000d9f0000013d000005d3013001970000000a0600002900000000001604350000000c050000290000000001650019000005990200004100000000002104350000000b0300002900000000013100490000001e0210008a00000000002304350000002101100039000005d2011001970000000003310019000000000013004b000000000100003900000001010040390000054a0030009c0000007f0000213d00000001001001900000007f0000c13d000000400030043f0000059a0030009c0000007f0000213d0000006001300039000000400010043f00000040013000390000059b02000041000000000021043500000020013000390000059c020000410000000000210435000000400100003900000000001304350000000b010000290000000001010433000000000001004b00000de90000c13d000000400300043d000005a00030009c0000007f0000213d0000002001300039000000400010043f000000000400001900000000020300190000000000430435000000400500043d000c00000005001d0000002003500039000005a10400004100000000004304350000000003020433000b00000003001d0000003d0250003915170fea0000040f0000000b030000290000001d023000390000000c0100002900000000002104350000003d023000391517101f0000040f0000002001000039000000400200043d000b00000002001d00000000021204360000000c0100002915170ff70000040f0000000b02000029000007590000013d0000000a01000039000000000101041a000800000001001d00000001010003670000004402100370000000000202043b000000000002004b000008c20000613d000900010000003d0000000b0000006b00000000020000390000000102006039000a00000002001d000100800000003d0000002401100370000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000701100039000000000101041a000000000001004b00000b5e0000613d0000000001000411000000000010043f0000000d01000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000000ff0010019000000b5e0000c13d00000024010000390000000101100367000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000b02000029000000000020043f0000000801100039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000201041a000000010220003a00000deb0000613d000000000021041b00000024010000390000000101100367000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000501100039000000000201041a000000010220003a00000deb0000613d000000000021041b00000024010000390000000101100367000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000400300043d000005520030009c0000007f0000213d000000000101043b0000000501100039000000000101041a0000004002300039000000400020043f00000024020000390000000102200367000000000202043b000700000003001d0000000002230436000600000002001d00000000001204350000000902000029000000080020002a00000deb0000413d00000009020000290000000801200029000c00000001001d000000000010043f0000001101000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d00000007020000290000000002020433000000000101043b000000000021041b000000010110003900000006020000290000000002020433000000000021041b000000400200043d000005a00020009c0000007f0000213d0000002001200039000700000001001d000000400010043f000600000002001d00000000000204350000000a0000006b00000e550000c13d0000000c01000029000000000010043f0000000401000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000a054c0010019c00000be80000613d0000000c01000029000000000010043f0000000601000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000201041a0000054f02200197000000000021041b0000000a01000029000000000010043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000201041a000000010220008a000000000021041b0000000b0000006b00000bfb0000613d0000000b01000029000000000010043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000201041a0000000102200039000000000021041b0000000c01000029000000000010043f0000000401000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000201041a0000054f022001970000000b06000029000000000262019f000000000021041b0000000001000414000005470010009c0000054701008041000000c001100210000005ad011001c70000800d020000390000000403000039000005ae040000410000000a050000290000000c070000291517150d0000040f0000000100200190000000410000613d0000000a03000029000000000003004b00000c9e0000613d0000000b01000029000000000013004b00000cbc0000613d000000000030043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000500000001001d0000000c01000029000000000010043f0000000901000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000400000001001d0000000a01000029000000000010043f0000000801000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000300000001001d0000000402000029000000050020006c00000c7f0000613d0000000501000029000000000010043f0000000301000029000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000200000001001d0000000401000029000000000010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000202000029000000000021041b000000000020043f0000000901000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000402000029000000000021041b0000000c01000029000000000010043f0000000901000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000001041b0000000501000029000000000010043f0000000301000029000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000200001900000cb90000013d0000000a01000039000000000101041a000500000001001d0000000c01000029000000000010043f0000000b01000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000503000029000000000031041b0000054a0030009c0000007f0000213d00000001013000390000000a02000039000000000012041b000000000020043f000005af0130009a0000000c020000290000000a03000029000000000021041b0000000b01000029000000000013004b00000d010000613d000000000001004b00000e690000613d000000000010043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000101041a000500000001001d000000000001004b00000deb0000613d0000000b01000029000000000010043f0000000801000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000502000029000000010220008a000500000002001d000000000020043f000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000c02000029000000000021041b000000000020043f0000000901000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000502000029000000000021041b0000000b010000290000000a03000029000000000003004b00000e580000c13d000005b202000041000000000020044300000004001004430000000001000414000005470010009c0000054701008041000000c001100210000005b3011001c70000800202000039151715120000040f000000010020019000000d830000613d000000000101043b000000000001004b000000070600002900000d770000613d000000400700043d00000064017000390000008002000039000000000021043500000044017000390000000c020000290000000000210435000005b4010000410000000000170435000000040170003900000000020004110000000000210435000000240170003900000000000104350000000601000029000000000101043300000084027000390000000000120435000000a402700039000000000001004b00000d300000613d000000000300001900000000042300190000000005630019000000000505043300000000005404350000002003300039000000000013004b00000d290000413d0000001f03100039000005d20330019700000000012100190000000000010435000000a401300039000005470010009c00000547010080410000006001100210000005470070009c000005470200004100000000020740190000004002200210000000000121019f0000000002000414000005470020009c0000054702008041000000c002200210000000000112019f0000000b02000029000c00000007001d1517150d0000040f0000000c0a00002900000060031002700000054703300197000000200030008c00000020040000390000000004034019000000200640019000000000056a001900000d540000613d000000000701034f00000000080a0019000000007907043c0000000008980436000000000058004b00000d500000c13d0000001f0740019000000d610000613d000000000661034f0000000307700210000000000805043300000000087801cf000000000878022f000000000606043b0000010007700089000000000676022f00000000067601cf000000000686019f0000000000650435000000010020019000000e5b0000613d0000001f01400039000000600210018f0000000001a20019000000000021004b000000000200003900000001020040390000054a0010009c0000007f0000213d00000001002001900000007f0000c13d000000400010043f000000200030008c000000410000413d0000000c020000290000000002020433000005b600200198000000410000c13d000005b702200197000005b40020009c00000e620000c13d0000000901000029000000010010003a00000deb0000413d0000000904000029000900010040003d00000001010003670000004403100370000000000303043b000000000034004b000a00000000001d00000b180000413d000008c20000013d000000000001042f000000010320008a00000005033002700000000004310019000000200300003900000001044000390000000a0600002900000000056300190000000005050433000000000051041b00000020033000390000000101100039000000000041004b00000d8a0000c13d0000000c0020006c00000d9c0000813d0000000c020000290000000302200210000000f80220018f000005d40220027f000005d4022001670000000a033000290000000003030433000000000223016f000000000021041b0000000c01000029000000010110021000000001011001bf00000008020000290000054c022001970000000303000039000000000013041b0000000f03000039000000000103041a0000054f0110019700000550011001c7000000000013041b0000000e03000039000000000103041a0000054f01100197000000000121019f000000000013041b000000000020043f0000000d01000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000000000201041a000005d30220019700000001022001bf000000000021041b0000000f01000039000000000101041a0000054c01100197000000000010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d00000007020000290000054d02200197000000000101043b000000000301041a000005d30330019700000001033001bf000000000031041b000000400100043d000027100020008c000003fd0000213d0000000e03000039000000000303041a0000054c03300198000007a30000613d000005520010009c0000007f0000213d0000004004100039000000400040043f0000002004100039000000000024043500000000003104350000000701000029000000a001100210000000000113019f000000000010041b0000002001000039000001000010044300000120000004430000055301000041000015180001042e0000059d0010009c00000df10000a13d000005c001000041000000000010043f0000001101000039000000040010043f000005550100004100001519000104300000059e0010009c0000007f0000213d0000000201100039000000030110011a00000002011002100000001f02100039000005d2042001970000003f02400039000005d205200197000000400200043d0000000005520019000000000025004b000000000600003900000001060040390000054a0050009c0000007f0000213d00000001006001900000007f0000c13d000000400050043f0000000001120436000000000004004b00000e0f0000613d0000000004410019000000000500003100000001055003670000000006010019000000005705043c0000000006760436000000000046004b00000e0b0000c13d0000000b0800002900000000040804330000000007840019000000200570003900000000060504330000000000050435000000000087004b000000000401001900000e460000a13d00000001033000390000000b08000029000000000401001900000003088000390000000009080433000000120a9002700000003f0aa0018f000000000a3a0019000000000a0a0433000000f80aa00210000000000b040433000005910bb00197000000000aab019f0000000000a404350000000c0a9002700000003f0aa0018f000000000a3a0019000000000a0a0433000000f80aa00210000000010b400039000000000c0b0433000005910cc00197000000000aac019f0000000000ab0435000000060a9002700000003f0aa0018f000000000a3a0019000000000a0a0433000000f80aa00210000000020b400039000000000c0b0433000005910cc00197000000000aac019f0000000000ab04350000003f0990018f00000000093900190000000009090433000000f809900210000000030a400039000000000b0a0433000005910bb0019700000000099b019f00000000009a04350000000404400039000000000078004b00000e1b0000413d00000000006504350000000b030000290000000003030433000000033030011a000000020030008c00000e640000613d000000010030008c00000af30000c13d000000010340008a000000000503043300000591055001970000059f055001c70000000000530435000000020340008a00000e650000013d000000400100043d000005ac02000041000007a40000013d000000400100043d000005b102000041000007a40000013d000000000003004b00000e6c0000c13d00000060020000390000000001020433000000000001004b00000e940000c13d000000400100043d000005ac02000041000003570000013d000000010340008a000000000403043300000591044001970000059f044001c700000af20000013d000000400100043d000005b002000041000007a40000013d0000001f0230003900000548022001970000003f02200039000005b504200197000000400200043d0000000004420019000000000024004b000000000500003900000001050040390000054a0040009c0000007f0000213d00000001005001900000007f0000c13d000000400040043f0000001f0430018f00000000063204360000054905300198000100000006001d000000000356001900000e860000613d000000000601034f0000000107000029000000006806043c0000000007870436000000000037004b00000e820000c13d000000000004004b00000e5e0000613d000000000151034f0000000304400210000000000503043300000000054501cf000000000545022f000000000101043b0000010004400089000000000141022f00000000014101cf000000000151019f000000000013043500000e5e0000013d0000000102000029000005470020009c00000547020080410000004002200210000005470010009c00000547010080410000006001100210000000000121019f0000151900010430000000070000006b000000000100001900000ea10000613d000000a00100043d00000007040000290000000302400210000005d40220027f000005d402200167000000000121016f0000000102400210000000000121019f00000ec30000013d000000010230008a000000050220027000000000042100190000002002000039000000010440003900000080052000390000000005050433000000000051041b00000020022000390000000101100039000000000041004b00000eae0000c13d000000070030006c00000ec00000813d00000007030000290000000303300210000000f80330018f000005d40330027f000005d40330016700000080022000390000000002020433000000000232016f000000000021041b0000000701000029000000010110021000000001011001bf0000000802000029000000000012041b00000004010000390000000101100367000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000c020000290000000002020433000800000002001d0000054a0020009c0000007f0000213d0000000101100039000700000001001d000000000101041a000000010010019000000001021002700000007f0220618f000600000002001d0000001f0020008c00000000020000390000000102002039000000000121013f00000001001001900000009b0000c13d0000000601000029000000200010008c00000f060000413d0000000701000029000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d00000008030000290000001f023000390000000502200270000000200030008c0000000002004019000000000301043b00000006010000290000001f01100039000000050110027000000000011300190000000002230019000000000012004b00000f060000813d000000000002041b0000000102200039000000000012004b00000f020000413d00000008010000290000001f0010008c00000f1a0000a13d0000000701000029000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d000000200200008a0000000803200180000000000101043b00000f270000c13d000000200200003900000f330000013d000000080000006b000000000100001900000f1f0000613d0000000b01000029000000000101043300000008040000290000000302400210000005d40220027f000005d402200167000000000121016f0000000102400210000000000121019f00000f410000013d000000010230008a00000005022002700000000004210019000000200200003900000001044000390000000c052000290000000005050433000000000051041b00000020022000390000000101100039000000000041004b00000f2c0000c13d000000080030006c00000f3e0000813d00000008030000290000000303300210000000f80330018f000005d40330027f000005d4033001670000000c022000290000000002020433000000000232016f000000000021041b0000000801000029000000010110021000000001011001bf0000000702000029000000000012041b00000004010000390000000101100367000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b0000000a020000290000000002020433000c00000002001d0000054a0020009c0000007f0000213d0000000201100039000b00000001001d000000000101041a000000010010019000000001021002700000007f0220618f000800000002001d0000001f0020008c00000000020000390000000102002039000000000121013f00000001001001900000009b0000c13d0000000801000029000000200010008c00000f840000413d0000000b01000029000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d0000000c030000290000001f023000390000000502200270000000200030008c0000000002004019000000000301043b00000008010000290000001f01100039000000050110027000000000011300190000000002230019000000000012004b00000f840000813d000000000002041b0000000102200039000000000012004b00000f800000413d0000000c010000290000001f0010008c00000f980000a13d0000000b01000029000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f0000000100200190000000410000613d000000200200008a0000000c02200180000000000101043b00000fa50000c13d000000200300003900000fb10000013d0000000c0000006b000000000100001900000f9d0000613d000000090100002900000000010104330000000c040000290000000302400210000005d40220027f000005d402200167000000000121016f0000000102400210000000000121019f00000fbf0000013d000000010320008a00000005033002700000000004310019000000200300003900000001044000390000000a053000290000000005050433000000000051041b00000020033000390000000101100039000000000041004b00000faa0000c13d0000000c0020006c00000fbc0000813d0000000c020000290000000302200210000000f80220018f000005d40220027f000005d4022001670000000a033000290000000003030433000000000223016f000000000021041b0000000c01000029000000010110021000000001011001bf0000000b02000029000000000012041b00000004010000390000000101100367000000000101043b000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000000410000613d000000000101043b000800000001001d00000001010003670000008402100370000000000202043b00000008050000290000000303500039000000000023041b000000a402100370000000000202043b0000000403500039000000000023041b0000000602500039000000000302041a000005d303300197000000c404100370000000000404043b000000000004004b000000010330c1bf000000000032041b0000000702500039000000e401100370000000000101043b000000000012041b0000000001000019000015180001042e000000000003004b00000ff40000613d000000000400001900000000052400190000000006140019000000000606043300000000006504350000002004400039000000000034004b00000fed0000413d00000000012300190000000000010435000000000001042d00000000430104340000000001320436000000000003004b000010030000613d000000000200001900000000051200190000000006240019000000000606043300000000006504350000002002200039000000000032004b00000ffc0000413d000000000213001900000000000204350000001f02300039000005d2022001970000000001210019000000000001042d000005d50010009c0000100e0000813d0000004001100039000000400010043f000000000001042d000005c001000041000000000010043f0000004101000039000000040010043f00000555010000410000151900010430000005d60010009c000010190000813d0000002001100039000000400010043f000000000001042d000005c001000041000000000010043f0000004101000039000000040010043f000005550100004100001519000104300000001f02200039000005d2022001970000000001120019000000000021004b000000000200003900000001020040390000054a0010009c0000102b0000213d00000001002001900000102b0000c13d000000400010043f000000000001042d000005c001000041000000000010043f0000004101000039000000040010043f000005550100004100001519000104300003000000000002000000000201041a000000010320019000000001062002700000007f0660618f0000001f0060008c00000000040000390000000104002039000000000043004b000010700000c13d000000400500043d0000000004650436000000000003004b0000105b0000613d000100000004001d000300000006001d000200000005001d000000000010043f0000000001000414000005470010009c0000054701008041000000c0011002100000054e011001c70000801002000039151715120000040f00000001002001900000107c0000613d0000000306000029000000000006004b000010610000613d000000000201043b0000000001000019000000020500002900000001070000290000000003170019000000000402041a000000000043043500000001022000390000002001100039000000000061004b000010530000413d000010630000013d000005d3012001970000000000140435000000000006004b00000020010000390000000001006039000010630000013d000000000100001900000002050000290000003f01100039000005d2021001970000000001520019000000000021004b000000000200003900000001020040390000054a0010009c000010760000213d0000000100200190000010760000c13d000000400010043f0000000001050019000000000001042d000005c001000041000000000010043f0000002201000039000000040010043f00000555010000410000151900010430000005c001000041000000000010043f0000004101000039000000040010043f0000055501000041000015190001043000000000010000190000151900010430000001000a000039000000000aa10436000001000b10003900000000c202043400000000002b0435000001200b100039000000000002004b0000108e0000613d000000000d000019000000000ebd0019000000000fdc0019000000000f0f04330000000000fe0435000000200dd0003900000000002d004b000010870000413d000000000cb2001900000000000c04350000001f0c200039000005d20cc00197000000000cbc0019000000000b1c00490000000000ba043500000000ba0304340000000003ac043600000000000a004b000010a10000613d000000000c000019000000000d3c0019000000000ecb0019000000000e0e04330000000000ed0435000000200cc000390000000000ac004b0000109a0000413d000000000b3a001900000000000b04350000001f0aa00039000005d20aa0019700000000033a0019000000000a130049000000400b1000390000000000ab043500000000a40404340000000003430436000000000004004b000010b50000613d000000000b000019000000000c3b0019000000000dba0019000000000d0d04330000000000dc0435000000200bb0003900000000004b004b000010ae0000413d000000000a34001900000000000a0435000000e00a10003900000000009a0435000000000008004b0000000008000039000000010800c039000000c0091000390000000000890435000000a008100039000000000078043500000080071000390000000000670435000000600110003900000000005104350000001f01400039000005d2011001970000000001310019000000000001042d000005d70010009c000010d80000213d000000630010008c000010d80000a13d00000001030003670000000401300370000000000101043b0000054c0010009c000010d80000213d0000002402300370000000000202043b0000054c0020009c000010d80000213d0000004403300370000000000303043b000000000001042d0000000001000019000015190001043000000024010000390000000101100367000000000101043b000000000001004b0000000002000039000000010200c039000000000021004b000010e30000c13d000000000001042d00000000010000190000151900010430000005d80020009c000011150000813d00000000040100190000001f01200039000005d2011001970000003f01100039000005d205100197000000400100043d0000000005510019000000000015004b000000000700003900000001070040390000054a0050009c000011150000213d0000000100700190000011150000c13d000000400050043f00000000052104360000000007420019000000000037004b0000111b0000213d000005d2062001980000001f0720018f00000001044003670000000003650019000011050000613d000000000804034f0000000009050019000000008a08043c0000000009a90436000000000039004b000011010000c13d000000000007004b000011120000613d000000000464034f0000000306700210000000000703043300000000076701cf000000000767022f000000000404043b0000010006600089000000000464022f00000000046401cf000000000474019f000000000043043500000000022500190000000000020435000000000001042d000005c001000041000000000010043f0000004101000039000000040010043f0000055501000041000015190001043000000000010000190000151900010430000000000001004b000011200000613d000000000001042d000000400100043d0000006402100039000005ca0300004100000000003204350000004402100039000005cb03000041000000000032043500000024021000390000002403000039000000000032043500000583020000410000000000210435000000040210003900000020030000390000000000320435000005470010009c00000547010080410000004001100210000005bc011001c700001519000104300008000000000002000500000001001d0006054c0020019c000012c30000613d000800000003001d000000000030043f0000000401000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000101041a0000054c041001970000000001000411000000000001004b000700000004001d000011800000613d000000000014004b000011800000613d000000000040043f0000000701000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b0000000002000411000000000020043f000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000101041a000000ff001001900000000704000029000011800000c13d0000000801000029000000000010043f0000000601000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000101041a0000054c011001970000000002000411000000000021004b0000000704000029000012e70000c13d000000000004004b000011a40000613d0000000801000029000000000010043f0000000601000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000201041a0000054f02200197000000000021041b0000000701000029000000000010043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000201041a000000010220008a000000000021041b0000000601000029000000000010043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000201041a0000000102200039000000000021041b0000000801000029000000000010043f0000000401000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000201041a0000054f022001970000000606000029000000000262019f000000000021041b0000000001000414000005470010009c0000054701008041000000c001100210000005ad011001c70000800d020000390000000403000039000005ae04000041000000070500002900000008070000291517150d0000040f0000000100200190000012c10000613d0000000705000029000000000005004b0000125a0000613d0000000603000029000000000035004b0000000804000029000012790000613d000000000050043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000101041a000400000001001d0000000801000029000000000010043f0000000901000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000101041a000300000001001d0000000701000029000000000010043f0000000801000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000200000001001d0000000302000029000000040020006c0000123a0000613d0000000401000029000000000010043f0000000201000029000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000101041a000100000001001d0000000301000029000000000010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b0000000102000029000000000021041b000000000020043f0000000901000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b0000000302000029000000000021041b0000000801000029000000000010043f0000000901000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000001041b0000000401000029000000000010043f0000000201000029000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b00000000020000190000000804000029000012760000013d0000000a01000039000000000101041a000400000001001d0000000801000029000000000010043f0000000b01000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b0000000402000029000000000021041b000005d80020009c000012e10000813d00000001012000390000000a03000039000000000013041b000000000030043f000005af0120009a000000080400002900000000020400190000000603000029000000000021041b0000000705000029000000000035004b000012bc0000613d000000000030043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b000000000101041a000400000001001d000000000001004b000012db0000613d0000000601000029000000000010043f0000000801000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d0000000402000029000000010220008a000000000101043b000600000002001d000000000020043f000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b0000000802000029000000000021041b000000000020043f0000000901000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000012c10000613d000000000101043b0000000602000029000000000021041b0000000804000029000000070500002900000005010000290000054c01100197000000000015004b000012cd0000c13d000000000001042d00000000010000190000151900010430000000400100043d000005ac02000041000000000021043500000004021000390000000000020435000005470010009c0000054701008041000000400110021000000555011001c70000151900010430000000400200043d0000004403200039000000000053043500000024032000390000000000430435000005da03000041000000000032043500000004032000390000000000130435000005470020009c00000547020080410000004001200210000005a9011001c70000151900010430000005c001000041000000000010043f0000001101000039000000040010043f00000555010000410000151900010430000005c001000041000000000010043f0000004101000039000000040010043f00000555010000410000151900010430000000400100043d0000000403100039000005470010009c000005470200004100000000020140190000004002200210000000000004004b000012f50000c13d000005a20400004100000000004104350000000801000029000000000013043500000555012001c70000151900010430000005d904000041000000000041043500000000040004110000054c04400197000000000043043500000024011000390000000803000029000000000031043500000557012001c70000151900010430000000000301001900000000011200a9000000000003004b000013060000613d00000000033100d9000000000023004b000013070000c13d000000000001042d000005c001000041000000000010043f0000001101000039000000040010043f000005550100004100001519000104300002000000000002000200000002001d0000054c01100198000013410000613d000100000001001d000000000010043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f00000001002001900000133f0000613d000000000101043b000000000101041a000000020010006c0000134b0000a13d0000000101000029000000000010043f0000000801000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f00000001002001900000133f0000613d000000000101043b0000000202000029000000000020043f000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f00000001002001900000133f0000613d000000000101043b000000000101041a000000000001042d00000000010000190000151900010430000000400100043d000005b002000041000000000021043500000004021000390000000000020435000005470010009c0000054701008041000000400110021000000555011001c70000151900010430000000400100043d000000240210003900000002030000290000000000320435000005bd020000410000000000210435000000040210003900000001030000290000000000320435000005470010009c0000054701008041000000400110021000000557011001c700001519000104300000000a02000039000000000302041a000000000013004b000013610000a13d000000000020043f000005af0110009a0000000002000019000000000001042d000005c001000041000000000010043f0000003201000039000000040010043f000005550100004100001519000104300000054c01100198000013780000613d000000000010043f0000000501000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000013820000613d000000000101043b000000000101041a000000000001042d000000400100043d000005b002000041000000000021043500000004021000390000000000020435000005470010009c0000054701008041000000400110021000000555011001c70000151900010430000000000100001900001519000104300001000000000002000100000001001d000000000010043f0000000401000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000013970000613d000000000101043b000000000101041a0000054c01100198000013990000613d000000000001042d00000000010000190000151900010430000000400100043d000005a2020000410000000000210435000000040210003900000001030000290000000000320435000005470010009c0000054701008041000000400110021000000555011001c700001519000104300006000000000002000500000001001d000000400100043d00000040061000390000000000360435000000400300003900000000033104360000054c022001970000000000230435000005db0010009c000014260000813d000300000005001d000600000004001d0000006002100039000000400020043f000005470030009c000005470300804100000040023002100000000001010433000005470010009c00000547010080410000006001100210000000000121019f0000000002000414000005470020009c0000054702008041000000c002200210000000000112019f000005ad011001c70000801002000039151715120000040f0000000100200190000014240000613d000000000101043b000200000001001d0000000501000029000000000010043f0000001001000039000000200010043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000014240000613d000000000101043b00000003060000290000054a0060009c0000000605000029000014260000213d00000005026002100000003f03200039000005bf03300197000000400400043d0000000003340019000500000004001d000000000043004b000000000400003900000001040040390000054a0030009c000014260000213d0000000100400190000014260000c13d0000000701100039000000000101041a000100000001001d000000400030043f00000005010000290000000001610436000400000001001d0000000001520019000000000010007c000014240000213d0000000605000029000000000051004b0000000302000029000013fe0000a13d000000010250036700000005030000290000002003300039000000002402043c00000000004304350000002005500039000000000015004b000013f60000413d00000005010000290000000002010433000000000002004b0000141f0000613d00000000030000190000000202000029000600000003001d000000050130021000000004011000290000000001010433000000000012004b0000140c0000813d000000000020043f000000200010043f00000000010004140000140f0000013d000000000010043f000000200020043f0000000001000414000005470010009c0000054701008041000000c00110021000000551011001c70000801002000039151715120000040f0000000100200190000014240000613d0000000603000029000000000201043b000000010330003900000005010000290000000001010433000000000013004b000014020000413d000014200000013d0000000202000029000000010020006c00000000010000390000000101006039000000000001042d00000000010000190000151900010430000005c001000041000000000010043f0000004101000039000000040010043f000005550100004100001519000104300006000000000002000500000005001d000300000004001d000200000002001d000400000001001d000005b2010000410000000000100443000600000003001d00000004003004430000000001000414000005470010009c0000054701008041000000c001100210000005b3011001c70000800202000039151715120000040f0000000100200190000014ae0000613d000000000101043b000000000001004b000014ab0000613d000000400800043d00000064018000390000008002000039000100000002001d000000000021043500000044018000390000000302000029000000000021043500000002010000290000054c0110019700000024028000390000000000120435000005b401000041000000000018043500000004010000290000054c01100197000000040280003900000000001204350000008402800039000000050100002900000000310104340000000000120435000000a40780003900000006020000290000054c02200197000000000001004b000014640000613d000000000400001900000000057400190000000006430019000000000606043300000000006504350000002004400039000000000014004b0000145d0000413d0000001f03100039000005d20330019700000000017100190000000000010435000000a401300039000005470010009c00000547010080410000006001100210000005470080009c000005470300004100000000030840190000004003300210000000000131019f0000000003000414000005470030009c0000054703008041000000c003300210000000000113019f000500000002001d000600000008001d1517150d0000040f000000060b00002900000060031002700000054703300197000000200030008c000000200400003900000000040340190000001f0640018f000000200740019000000000057b0019000014890000613d000000000801034f00000000090b0019000000008a08043c0000000009a90436000000000059004b000014850000c13d000000000006004b000014960000613d000000000771034f0000000306600210000000000805043300000000086801cf000000000868022f000000000707043b0000010006600089000000000767022f00000000066701cf000000000686019f00000000006504350000000100200190000014af0000613d0000001f01400039000000600210018f0000000001b20019000000000021004b000000000200003900000001020040390000054a0010009c000014e80000213d0000000100200190000014e80000c13d000000400010043f0000001f0030008c000014ac0000a13d00000000020b0433000005b600200198000014ac0000c13d000005b702200197000005b40020009c000014de0000c13d000000000001042d00000000010000190000151900010430000000000001042f000000000003004b000014b30000c13d0000006002000039000014da0000013d0000001f0230003900000548022001970000003f02200039000005b504200197000000400200043d0000000004420019000000000024004b000000000500003900000001050040390000054a0040009c000014e80000213d0000000100500190000014e80000c13d000000400040043f0000001f0430018f00000000063204360000054905300198000100000006001d0000000003560019000014cd0000613d000000000601034f0000000107000029000000006806043c0000000007870436000000000037004b000014c90000c13d000000000004004b000014da0000613d000000000151034f0000000304400210000000000503043300000000054501cf000000000545022f000000000101043b0000010004400089000000000141022f00000000014101cf000000000151019f00000000001304350000000001020433000000000001004b000014ee0000c13d000000400100043d000005ac020000410000000000210435000000040210003900000005030000290000000000320435000005470010009c0000054701008041000000400110021000000555011001c70000151900010430000005c001000041000000000010043f0000004101000039000000040010043f000005550100004100001519000104300000000102000029000005470020009c00000547020080410000004002200210000005470010009c00000547010080410000006001100210000000000121019f0000151900010430000000000001042f000005470010009c00000547010080410000004001100210000005470020009c00000547020080410000006002200210000000000112019f0000000002000414000005470020009c0000054702008041000000c002200210000000000112019f000005ad011001c70000801002000039151715120000040f00000001002001900000150b0000613d000000000101043b000000000001042d0000000001000019000015190001043000001510002104210000000102000039000000000001042d0000000002000019000000000001042d00001515002104230000000102000039000000000001042d0000000002000019000000000001042d0000151700000432000015180001042e00001519000104300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffff00000000000000000000000000000000000000000000000000000001ffffffe000000000000000000000000000000000000000000000000000000000ffffffe0000000000000000000000000000000000000000000000000ffffffffffffffff8000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000ffffffffffffffffffffffff0200000000000000000000000000000000000020000000000000000000000000ffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000823c7f21c11df7bbbf92f4b5143b3a719778965b0200000000000000000000000000000000000040000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffbf0000000200000000000000000000000000000040000001000000000000000000b6d9900a0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000240000000000000000000000006f483d0900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004400000000000000000000000000000000000000000000000000000000000000000000000000000000438b62ff0000000000000000000000000000000000000000000000000000000093578b0300000000000000000000000000000000000000000000000000000000c87b56dc00000000000000000000000000000000000000000000000000000000e985e9c400000000000000000000000000000000000000000000000000000000e985e9c500000000000000000000000000000000000000000000000000000000fa3fa19600000000000000000000000000000000000000000000000000000000c87b56dd00000000000000000000000000000000000000000000000000000000cb006d5900000000000000000000000000000000000000000000000000000000a22cb46400000000000000000000000000000000000000000000000000000000a22cb46500000000000000000000000000000000000000000000000000000000b88d4fde0000000000000000000000000000000000000000000000000000000093578b040000000000000000000000000000000000000000000000000000000095d89b4100000000000000000000000000000000000000000000000000000000516c731b000000000000000000000000000000000000000000000000000000006352211d000000000000000000000000000000000000000000000000000000006352211e0000000000000000000000000000000000000000000000000000000070a0823100000000000000000000000000000000000000000000000000000000516c731c00000000000000000000000000000000000000000000000000000000531a015500000000000000000000000000000000000000000000000000000000438b6300000000000000000000000000000000000000000000000000000000004f6ccce70000000000000000000000000000000000000000000000000000000050e2dc4c0000000000000000000000000000000000000000000000000000000016200592000000000000000000000000000000000000000000000000000000002a552059000000000000000000000000000000000000000000000000000000003ccfd60a000000000000000000000000000000000000000000000000000000003ccfd60b0000000000000000000000000000000000000000000000000000000042842e0e000000000000000000000000000000000000000000000000000000002a55205a000000000000000000000000000000000000000000000000000000002f745c590000000000000000000000000000000000000000000000000000000020adc6550000000000000000000000000000000000000000000000000000000020adc6560000000000000000000000000000000000000000000000000000000023b872dd00000000000000000000000000000000000000000000000000000000162005930000000000000000000000000000000000000000000000000000000018160ddd0000000000000000000000000000000000000000000000000000000004634d8c00000000000000000000000000000000000000000000000000000000081812fb00000000000000000000000000000000000000000000000000000000081812fc00000000000000000000000000000000000000000000000000000000095ea7b30000000000000000000000000000000000000000000000000000000004634d8d0000000000000000000000000000000000000000000000000000000006fdde030000000000000000000000000000000000000000000000000000000001ffc9a70000000000000000000000000000000000000000000000000000000002d05d3f00000000000000000000000000000000000000000000000000000000044215c608c379a0000000000000000000000000000000000000000000000000000000004d756c74694f776e61626c653a2063616c6c6572206973206e6f7420616e2063726561746f72000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000840000008000000000000000004d756c74694f776e61626c653a206e65772063726561746f722063616e6e6f74206265207a65726f2061646472657373000000000000000000000000000000000000000000000000000000000000000000000020000000800000000000000000000000000000000000000000000000000000000000000000ffffffffffffff7f0000000000184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000000000000000000000000000000000000000004ee2d6d415b85acef810000000000000000000000000000000000000000000004ee2d6d415b85acef80ffffffff000000000000000000000000000000000000000000000000002386f26fc1000000000000000000000000000000000000ffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000005f5e10000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff30313233343536373839616263646566000000000000000000000000000000007f000000000000000000000000000000000000000000000000000000000000007b226e616d65223a2022000000000000000000000000000000000000000000002023000000000000000000000000000000000000000000000000000000000000222c20226465736372697074696f6e223a202200000000000000000000000000222c0000000000000000000000000000000000000000000000000000000000002022696d616765223a2022000000000000000000000000000000000000000000227d000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffff9f6768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2f4142434445464748494a4b4c4d4e4f505152535455565758595a616263646566bffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffd000000000000000000000000000000000000000000000000bffffffffffffffd3d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffdf646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c0000007e2732890000000000000000000000000000000000000000000000000000000017307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c315b08ba18000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000024000000800000000000000000c2575a0e9e593c00f959f8c92f12db2869c3395a3b0502d05e2516446f71f85b0000000000000000000000000000000000000020000000000000000000000000436c61696d206c696d697420657863656564656400000000000000000000000000000000000000000000000000000000000000640000000000000000000000004e6f742077686974656c697374656400000000000000000000000000000000006d696e743a2074686973206d696e74206973207061757365640000000000000064a0ae92000000000000000000000000000000000000000000000000000000000200000000000000000000000000000000000000000000000000000000000000ddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef39a5844729cae3e308f36a5ce933956d7c6367997d26743ca06a70b77c062d5889c62b640000000000000000000000000000000000000000000000000000000073c6ac6e000000000000000000000000000000000000000000000000000000001806aa1896bbf26568e884a7374b41e002500962caba6a15023a8d90e8508b830200000200000000000000000000000000000024000000000000000000000000150b7a020000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003ffffffe000000000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff000000000000000000000000000000000000000000000000000000006d696e743a20696e73756666696369656e742066756e647300000000000000006d696e743a206d617820737570706c790000000000000000000000000000000065207a65726f20616464726573730000000000000000000000000000000000004d756c74694f776e61626c653a206e6577206f776e65722063616e6e6f7420620000000000000000000000000000000000000084000000000000000000000000a57d13dc0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000440000008000000000000000007fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe04e487b71000000000000000000000000000000000000000000000000000000009cc7f708afc65944829bd487b90b72536b1951864fbfc14e125fc972a6507f39466565207472616e73666572206661696c65640000000000000000000000000043726561746f72207472616e73666572206661696c65640000000000000000004e6f2066756e647300000000000000000000000000000000000000000000000000000000000000000000000000000000000000400000000000000000000000000200000000000000000000000000000000000040000000a00000000000000000a9fbf51f000000000000000000000000000000000000000000000000000000008c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925405787fa12a823e0f2b7631cc41b3ba8828b3321ca811111fa75cd3aa3bb5ace776e6572000000000000000000000000000000000000000000000000000000004d756c74694f776e61626c653a2063616c6c6572206973206e6f7420616e206f00000000000000000000000000000000000000400000008000000000000000005b5e139f0000000000000000000000000000000000000000000000000000000080ac58cd00000000000000000000000000000000000000000000000000000000780e9d630000000000000000000000000000000000000000000000000000000001ffc9a7000000000000000000000000000000000000000000000000000000002a55205a00000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff000000000000000000000000000000000000000000000000ffffffffffffffc0000000000000000000000000000000000000000000000000ffffffffffffffe07fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000010000000000000000177e802f0000000000000000000000000000000000000000000000000000000064283d7b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffa007375627693e3141fe01a477ee89cc2b899a3f173db2af7950ab38963af01766

000000000000000000000000000000000000000000000000000000000000008000000000000000000000000000000000000000000000000000000000000000c0000000000000000000000000b3d1a549f61ba2f9609c49a8dc52971d5992acca000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000104252494d494e204669727374204e4654000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004424d464e00000000000000000000000000000000000000000000000000000000

-----Decoded View---------------
Arg [0] : _name (string): BRIMIN First NFT
Arg [1] : _symbol (string): BMFN
Arg [2] : _creator (address): 0xb3d1a549f61Ba2F9609C49A8DC52971D5992accA
Arg [3] : _royalty (uint96): 0

-----Encoded View---------------
8 Constructor Arguments found :
Arg [0] : 0000000000000000000000000000000000000000000000000000000000000080
Arg [1] : 00000000000000000000000000000000000000000000000000000000000000c0
Arg [2] : 000000000000000000000000b3d1a549f61ba2f9609c49a8dc52971d5992acca
Arg [3] : 0000000000000000000000000000000000000000000000000000000000000000
Arg [4] : 0000000000000000000000000000000000000000000000000000000000000010
Arg [5] : 4252494d494e204669727374204e465400000000000000000000000000000000
Arg [6] : 0000000000000000000000000000000000000000000000000000000000000004
Arg [7] : 424d464e00000000000000000000000000000000000000000000000000000000