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
// Compatible with OpenZeppelin Contracts ^5.0.0
pragma solidity ^0.8.22;

import {ERC721} from  "@openzeppelin/contracts/token/ERC721/ERC721.sol";
import {ERC721Burnable} from "@openzeppelin/contracts/token/ERC721/extensions/ERC721Burnable.sol";
import {ERC721URIStorage} from "@openzeppelin/contracts/token/ERC721/extensions/ERC721URIStorage.sol";
import {Ownable} from "@openzeppelin/contracts/access/Ownable.sol";
import {ERC721Pausable} from "@openzeppelin/contracts/token/ERC721/extensions/ERC721Pausable.sol";

import "@openzeppelin/contracts/utils/cryptography/MerkleProof.sol";
import "@openzeppelin/contracts/utils/Strings.sol";

contract Army is ERC721, ERC721URIStorage, ERC721Pausable, ERC721Burnable, Ownable {

   using Strings for uint256;
    
    address public recipient; 

    string  public baseURI;
    string  public mintPhase;
    
    uint256 private nextTokenId;
    uint256 public totalMinted;
    uint256 public max_supply;
    uint256 public publicMintPrice;
    uint256 public fpAllowListPrice;
    uint256 public fpAllowListEndTime;
    uint256 public spAllowListPrice;
    uint256 public spAllowListEndTime;
    uint256 public maximumSpMint;

    bytes32 public fpAllowListRoot;
    bytes32 public spAllowListRoot;

    bool public publicMintLive;
    bool public fpAllowListMintLive;
    bool public spAllowListMintLive;
    bool private lockBaseURI;

    constructor(address initialOwner, address _recipient, string memory _baseURI)
        ERC721("Onchain Army", "Army")
        Ownable(initialOwner)
    {
        totalMinted = 0;
        max_supply = 5000;
        publicMintPrice = 0.042 ether;
        fpAllowListPrice = 0.03 ether;
        publicMintLive = false;
        fpAllowListMintLive = false;
        fpAllowListEndTime = block.timestamp + 30 minutes;
        spAllowListPrice = 0.035 ether;
        spAllowListMintLive = false;
        spAllowListEndTime = block.timestamp + 30 minutes;
        maximumSpMint = 25;
        baseURI = _baseURI;
        lockBaseURI = false;
        recipient = _recipient;
    }

    

    mapping(address => uint256) public minterTotalNfts;

    

    modifier checkTotalMinted (uint256 nftAmount) {
        require((nftAmount + totalMinted) <= max_supply, "nft mint amount execeeds supply available");
        _;
    }


    // PUBLIC MINTING 
    
    modifier isPublicPrice(uint256 amount, uint256 nftAmount) {
        require(amount >= (publicMintPrice * nftAmount), "Not enough ether");
        _;
    }

   
    
    modifier onlyPublicMintLive() {
        require(publicMintLive, "public mint not live yet");
        _;
    }

    function togglePublicMintLive () public onlyOwner{
        publicMintLive = !publicMintLive;
    }



   function publicMint (address minter, uint256 nftAmount) 
    public 
    payable 
    onlyPublicMintLive
    isPublicPrice(msg.value, nftAmount) 
    {
        minterTotalNfts[minter] += nftAmount;
        mint(minter, nftAmount);
    }

   function setPublicMintPrice (uint256 price) public  onlyOwner {
    publicMintPrice = price;
   }

//    FPWHITELIST MINTING

    modifier isFpAllowListPrice(uint256 amount, uint256 nftAmount ) {
            require(amount >= (fpAllowListPrice * nftAmount), "Not enough ether");
            _;
        }
    
   modifier checkFpAllowListEndTime() {
    require(fpAllowListEndTime >= block.timestamp, "Minting phase ended.");
    _;
   }

   modifier validateFpAllowList (bytes32[] memory proof, address minter) {
    require(verifyFpAllowList(proof, keccak256(abi.encodePacked(minter))), "Not a part of Allowlist");
    _;
   }
   modifier onlyFpAllowMintLive() {
        require(fpAllowListMintLive == true, "public mint not live yet");
        _;
    }

    function toggleFpAllowListMintLive () public onlyOwner {
        fpAllowListMintLive = !fpAllowListMintLive;
    }

   function setFpAllowListRoot(bytes32 _root) public onlyOwner {
     fpAllowListRoot = _root;
   }

   function setFpAllowListEndTime (uint256 duration) public  onlyOwner {
     fpAllowListEndTime = block.timestamp + duration;
   }

   function verifyFpAllowList (bytes32[] memory proof, bytes32 leaf) public view  returns (bool)  {
    return MerkleProof.verify(proof, fpAllowListRoot, leaf);
   }

   function fpAllowMint(address minter, uint256 nftAmount, bytes32[] memory proof)
    public 
    payable 
    isFpAllowListPrice(msg.value, nftAmount)
    checkFpAllowListEndTime
    validateFpAllowList(proof, minter)
    onlyFpAllowMintLive
    {
        minterTotalNfts[minter] += nftAmount;
        mint(minter, nftAmount);
   }

   function setFpAllowListPrice(uint256 price) public onlyOwner {
      fpAllowListPrice = price;
   }

//    SPWHITELIST MINTING

 modifier isSpAllowListPrice(uint256 amount, uint256 nftAmount) {
            require(amount >= (spAllowListPrice * nftAmount), "Not enough ether");
            _;
        }
    
   modifier checkSpAllowListEndTime() {
    require(spAllowListEndTime >= block.timestamp, "Minting phase ended.");
    _;
   }

   modifier validateSpAllowList (bytes32[] memory proof, address minter) {
    require(verifySpAllowList(proof, keccak256(abi.encodePacked(minter))), "Not a part of Allowlist");
    _;
   }
   modifier onlySpAllowMintLive() {
        require(spAllowListMintLive == true, "public mint not live yet");
        _;
    }

    function toggleSpAllowListMintLive () public onlyOwner {
        spAllowListMintLive = !spAllowListMintLive;
    }

   function setSpAllowListRoot(bytes32 _root) public onlyOwner {
     spAllowListRoot = _root;
   }

   function setSpAllowListEndTime (uint256 duration) public  onlyOwner {
     spAllowListEndTime = block.timestamp + duration;
   }

   function verifySpAllowList (bytes32[] memory proof, bytes32 leaf) public view  returns (bool)  {
    return MerkleProof.verify(proof, spAllowListRoot, leaf);
   }

   function spAllowMint(address minter, uint256 nftAmount, bytes32[] memory proof)
    public 
    payable 
    isSpAllowListPrice(msg.value, nftAmount)
    checkSpAllowListEndTime
    validateSpAllowList(proof, minter)
    onlySpAllowMintLive
    {
    require((minterTotalNfts[minter] + nftAmount) <= maximumSpMint, "maximum nft mint reached.");
       minterTotalNfts[minter] += nftAmount;
       mint(minter, nftAmount);
   }

   function setSpAllowListPrice(uint256 price) public onlyOwner {
      spAllowListPrice = price;
   }
  
  function setMaximumSpMint (uint256 amount) public onlyOwner {
    maximumSpMint = amount;
  }
    


    function mint(address to, uint256 nftAmount)
        internal
        checkTotalMinted(nftAmount)
    {
        (bool success, ) = recipient.call{value: msg.value}("");
        require(success, "Ether transfer failed");

        for(uint i; i < nftAmount; i++) {
            uint tokenId = nextTokenId++;
            totalMinted++ ;
            _safeMint(to, tokenId);
            string memory tokenIdStr = tokenId.toString();
            string memory uri = string(abi.encodePacked("/", tokenIdStr ,".json"));
            _setTokenURI(tokenId, uri);
            
        }
    }


   function _update(address to, uint256 tokenId, address auth)
        internal
        override(ERC721, ERC721Pausable)
        returns (address)
    {
        return super._update(to, tokenId, auth);
    }
    // The following functions are overrides required by Solidity.

    function tokenURI(uint256 tokenId)
        public
        view
        override(ERC721, ERC721URIStorage)
        returns (string memory)
    {
        string memory tokenURL = super.tokenURI(tokenId);
        return string.concat(baseURI, tokenURL);
    }

    function supportsInterface(bytes4 interfaceId)
        public
        view
        override(ERC721, ERC721URIStorage)
        returns (bool)
    {
        return super.supportsInterface(interfaceId);
    }

     function pause() public onlyOwner {
        _pause();
    }

    function unpause() public onlyOwner {
        _unpause();
    }

    function setBaseUri(string memory uri) public onlyOwner {
        require(!lockBaseURI, "you have locked the baseURI");
        baseURI = uri;
    }
    
    function setLockBaseURI() public onlyOwner {
        lockBaseURI = true;
    }

    function airdrop(address to, uint256 nftAmount) public  onlyOwner {
        minterTotalNfts[to] += nftAmount;
        mint(to, nftAmount); 
    }


    function setPublictMintLive() public onlyOwner{
        publicMintLive = true;
        fpAllowListMintLive = false;
        spAllowListMintLive = false;
        mintPhase = "PUBLIC";
   }

   function setFpMintLive() public onlyOwner {
        fpAllowListMintLive = true;
        fpAllowListEndTime = block.timestamp + 30 minutes;
        spAllowListMintLive = false;
        publicMintLive = false;
        mintPhase = "FIRST PHASE";
   }

   function setSpMintLive() public onlyOwner {
        spAllowListMintLive = true;
        spAllowListEndTime = block.timestamp + 30 minutes;
        fpAllowListMintLive = false;
        publicMintLive = false;
        mintPhase = "SECOND PHASE";
   }

}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)

pragma solidity ^0.8.20;

import {Context} from "../utils/Context.sol";

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

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

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

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

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

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

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

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

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

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

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

// 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.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/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) (token/ERC721/extensions/ERC721Burnable.sol)

pragma solidity ^0.8.20;

import {ERC721} from "../ERC721.sol";
import {Context} from "../../../utils/Context.sol";

/**
 * @title ERC-721 Burnable Token
 * @dev ERC-721 Token that can be burned (destroyed).
 */
abstract contract ERC721Burnable is Context, ERC721 {
    /**
     * @dev Burns `tokenId`. See {ERC721-_burn}.
     *
     * Requirements:
     *
     * - The caller must own `tokenId` or be an approved operator.
     */
    function burn(uint256 tokenId) public virtual {
        // 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.
        _update(address(0), tokenId, _msgSender());
    }
}

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

pragma solidity ^0.8.20;

import {ERC721} from "../ERC721.sol";
import {Pausable} from "../../../utils/Pausable.sol";

/**
 * @dev ERC-721 token with pausable token transfers, minting and burning.
 *
 * Useful for scenarios such as preventing trades until the end of an evaluation
 * period, or having an emergency switch for freezing all token transfers in the
 * event of a large bug.
 *
 * IMPORTANT: This contract does not include public pause and unpause functions. In
 * addition to inheriting this contract, you must define both functions, invoking the
 * {Pausable-_pause} and {Pausable-_unpause} internal functions, with appropriate
 * access control, e.g. using {AccessControl} or {Ownable}. Not doing so will
 * make the contract pause mechanism of the contract unreachable, and thus unusable.
 */
abstract contract ERC721Pausable is ERC721, Pausable {
    /**
     * @dev See {ERC721-_update}.
     *
     * Requirements:
     *
     * - the contract must not be paused.
     */
    function _update(
        address to,
        uint256 tokenId,
        address auth
    ) internal virtual override whenNotPaused returns (address) {
        return super._update(to, tokenId, auth);
    }
}

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

pragma solidity ^0.8.20;

import {ERC721} from "../ERC721.sol";
import {Strings} from "../../../utils/Strings.sol";
import {IERC4906} from "../../../interfaces/IERC4906.sol";
import {IERC165} from "../../../interfaces/IERC165.sol";

/**
 * @dev ERC-721 token with storage based token URI management.
 */
abstract contract ERC721URIStorage is IERC4906, ERC721 {
    using Strings for uint256;

    // Interface ID as defined in ERC-4906. This does not correspond to a traditional interface ID as ERC-4906 only
    // defines events and does not include any external function.
    bytes4 private constant ERC4906_INTERFACE_ID = bytes4(0x49064906);

    // Optional mapping for token URIs
    mapping(uint256 tokenId => string) private _tokenURIs;

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

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

        string memory _tokenURI = _tokenURIs[tokenId];
        string memory base = _baseURI();

        // If there is no base URI, return the token URI.
        if (bytes(base).length == 0) {
            return _tokenURI;
        }
        // If both are set, concatenate the baseURI and tokenURI (via string.concat).
        if (bytes(_tokenURI).length > 0) {
            return string.concat(base, _tokenURI);
        }

        return super.tokenURI(tokenId);
    }

    /**
     * @dev Sets `_tokenURI` as the tokenURI of `tokenId`.
     *
     * Emits {MetadataUpdate}.
     */
    function _setTokenURI(uint256 tokenId, string memory _tokenURI) internal virtual {
        _tokenURIs[tokenId] = _tokenURI;
        emit MetadataUpdate(tokenId);
    }
}

// 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.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) (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.0.0) (utils/Pausable.sol)

pragma solidity ^0.8.20;

import {Context} from "../utils/Context.sol";

/**
 * @dev Contract module which allows children to implement an emergency stop
 * mechanism that can be triggered by an authorized account.
 *
 * This module is used through inheritance. It will make available the
 * modifiers `whenNotPaused` and `whenPaused`, which can be applied to
 * the functions of your contract. Note that they will not be pausable by
 * simply including this module, only once the modifiers are put in place.
 */
abstract contract Pausable is Context {
    bool private _paused;

    /**
     * @dev Emitted when the pause is triggered by `account`.
     */
    event Paused(address account);

    /**
     * @dev Emitted when the pause is lifted by `account`.
     */
    event Unpaused(address account);

    /**
     * @dev The operation failed because the contract is paused.
     */
    error EnforcedPause();

    /**
     * @dev The operation failed because the contract is not paused.
     */
    error ExpectedPause();

    /**
     * @dev Initializes the contract in unpaused state.
     */
    constructor() {
        _paused = false;
    }

    /**
     * @dev Modifier to make a function callable only when the contract is not paused.
     *
     * Requirements:
     *
     * - The contract must not be paused.
     */
    modifier whenNotPaused() {
        _requireNotPaused();
        _;
    }

    /**
     * @dev Modifier to make a function callable only when the contract is paused.
     *
     * Requirements:
     *
     * - The contract must be paused.
     */
    modifier whenPaused() {
        _requirePaused();
        _;
    }

    /**
     * @dev Returns true if the contract is paused, and false otherwise.
     */
    function paused() public view virtual returns (bool) {
        return _paused;
    }

    /**
     * @dev Throws if the contract is paused.
     */
    function _requireNotPaused() internal view virtual {
        if (paused()) {
            revert EnforcedPause();
        }
    }

    /**
     * @dev Throws if the contract is not paused.
     */
    function _requirePaused() internal view virtual {
        if (!paused()) {
            revert ExpectedPause();
        }
    }

    /**
     * @dev Triggers stopped state.
     *
     * Requirements:
     *
     * - The contract must not be paused.
     */
    function _pause() internal virtual whenNotPaused {
        _paused = true;
        emit Paused(_msgSender());
    }

    /**
     * @dev Returns to normal state.
     *
     * Requirements:
     *
     * - The contract must be paused.
     */
    function _unpause() internal virtual whenPaused {
        _paused = false;
        emit Unpaused(_msgSender());
    }
}

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

pragma solidity ^0.8.20;

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

/// @title ERC-721 Metadata Update Extension
interface IERC4906 is IERC165, IERC721 {
    /// @dev This event emits when the metadata of a token is changed.
    /// So that the third-party platforms such as NFT market could
    /// timely update the images and related attributes of the NFT.
    event MetadataUpdate(uint256 _tokenId);

    /// @dev This event emits when the metadata of a range of tokens is changed.
    /// So that the third-party platforms such as NFT market could
    /// timely update the images and related attributes of the NFTs.
    event BatchMetadataUpdate(uint256 _fromTokenId, uint256 _toTokenId);
}

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

pragma solidity ^0.8.20;

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

// 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.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.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) (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) (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) (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/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/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/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.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);
}

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

pragma solidity ^0.8.20;

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

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

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"initialOwner","type":"address"},{"internalType":"address","name":"_recipient","type":"address"},{"internalType":"string","name":"_baseURI","type":"string"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721IncorrectOwner","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721InsufficientApproval","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC721InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC721InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721InvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC721InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC721InvalidSender","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721NonexistentToken","type":"error"},{"inputs":[],"name":"EnforcedPause","type":"error"},{"inputs":[],"name":"ExpectedPause","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"_fromTokenId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"_toTokenId","type":"uint256"}],"name":"BatchMetadataUpdate","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"_tokenId","type":"uint256"}],"name":"MetadataUpdate","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"account","type":"address"}],"name":"Paused","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"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"address","name":"account","type":"address"}],"name":"Unpaused","type":"event"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"nftAmount","type":"uint256"}],"name":"airdrop","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"baseURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"burn","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"fpAllowListEndTime","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"fpAllowListMintLive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"fpAllowListPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"fpAllowListRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"minter","type":"address"},{"internalType":"uint256","name":"nftAmount","type":"uint256"},{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"}],"name":"fpAllowMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"max_supply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maximumSpMint","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"mintPhase","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"minterTotalNfts","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"pause","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"paused","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"minter","type":"address"},{"internalType":"uint256","name":"nftAmount","type":"uint256"}],"name":"publicMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"publicMintLive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"publicMintPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"recipient","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"uri","type":"string"}],"name":"setBaseUri","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"duration","type":"uint256"}],"name":"setFpAllowListEndTime","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"price","type":"uint256"}],"name":"setFpAllowListPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_root","type":"bytes32"}],"name":"setFpAllowListRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"setFpMintLive","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"setLockBaseURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"setMaximumSpMint","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"price","type":"uint256"}],"name":"setPublicMintPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"setPublictMintLive","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"duration","type":"uint256"}],"name":"setSpAllowListEndTime","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"price","type":"uint256"}],"name":"setSpAllowListPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"_root","type":"bytes32"}],"name":"setSpAllowListRoot","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"setSpMintLive","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"spAllowListEndTime","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"spAllowListMintLive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"spAllowListPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"spAllowListRoot","outputs":[{"internalType":"bytes32","name":"","type":"bytes32"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"minter","type":"address"},{"internalType":"uint256","name":"nftAmount","type":"uint256"},{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"}],"name":"spAllowMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"toggleFpAllowListMintLive","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"togglePublicMintLive","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"toggleSpAllowListMintLive","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalMinted","outputs":[{"internalType":"uint256","name":"","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":"transferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"unpause","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"},{"internalType":"bytes32","name":"leaf","type":"bytes32"}],"name":"verifyFpAllowList","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32[]","name":"proof","type":"bytes32[]"},{"internalType":"bytes32","name":"leaf","type":"bytes32"}],"name":"verifySpAllowList","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"}]

9c4d535b0000000000000000000000000000000000000000000000000000000000000000010005abaadbc2596e73e784e3fe7f72df0e7aa96569959988bd12ad17b50237000000000000000000000000000000000000000000000000000000000000006000000000000000000000000000000000000000000000000000000000000000e0000000000000000000000000b1f7996edd0e42c2ae788bd6dc32beb302b6e85000000000000000000000000058a375108e88b3eb915f89e297891432199ee3d900000000000000000000000000000000000000000000000000000000000000600000000000000000000000000000000000000000000000000000000000000042697066733a2f2f62616679626569637269733478646d7765746a347032677176696274716179327869657435746b66346a6b727579757678786a6c356c6635627669000000000000000000000000000000000000000000000000000000000000

0x0004000000000002000b0000000000020000006004100270000004e10340019700030000003103550002000000010355000004e10040019d00000001002001900000002f0000c13d0000008004000039000000400040043f000000040030008c000000570000413d000000000201043b000000e002200270000004fa0020009c000000590000a13d000004fb0020009c000000720000213d000005110020009c000001410000a13d000005120020009c000001ad0000213d000005180020009c0000029a0000213d0000051b0020009c000003e20000613d0000051c0020009c000000570000c13d000000440030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000401100370000000000101043b000a00000001001d000004e40010009c000000570000213d137f11490000040f00000024010000390000000201100367000000000201043b0000000a01000029137f0ed40000040f0000000001000019000013800001042e0000008004000039000000400040043f0000000002000416000000000002004b000000570000c13d0000001f02300039000004e2022001970000008002200039000000400020043f0000001f0530018f000004e3063001980000008002600039000000410000613d000000000701034f000000007807043c0000000004840436000000000024004b0000003d0000c13d000000000005004b0000004e0000613d000000000161034f0000000304500210000000000502043300000000054501cf000000000545022f000000000101043b0000010004400089000000000141022f00000000014101cf000000000151019f0000000000120435000000600030008c000000570000413d000000800700043d000004e40070009c000000570000213d000000a00100043d000a00000001001d000004e40010009c000000ae0000a13d00000000010000190000138100010430000005260020009c000000810000a13d000005270020009c000000c70000a13d000005280020009c000001c90000213d0000052e0020009c000002bd0000213d000005310020009c000003e70000613d000005320020009c000000570000c13d000000240030008c000000570000413d0000000001000416000000000001004b000000570000c13d137f11490000040f00000004010000390000000201100367000000000101043b0000001302000039000000000012041b0000000001000019000013800001042e000004fc0020009c0000015f0000a13d000004fd0020009c000001d40000213d000005030020009c000002c80000213d000005060020009c000003f40000613d000005070020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000001301000039000006530000013d0000053c0020009c0000019e0000213d000005460020009c000001fd0000a13d000005470020009c000002d10000213d0000054a0020009c000004170000613d0000054b0020009c000000570000c13d000000440030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000402100370000000000202043b000a00000002001d000004e40020009c000000570000213d0000002401100370000000000101043b000900000001001d000000000010043f0000000201000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000101041a000004e405100198000006d50000c13d000000400100043d0000055602000041000000000021043500000004021000390000000903000029000004110000013d000000c00200043d000004e50020009c000000570000213d0000001f01200039000000000031004b0000000004000019000004e604008041000004e601100197000000000001004b0000000005000019000004e605004041000004e60010009c000000000504c019000000000005004b000000570000c13d00000080012000390000000001010433000004e50010009c0000036a0000a13d0000058801000041000000000010043f0000004101000039000000040010043f000004f9010000410000138100010430000005330020009c000002210000a13d000005340020009c000002e90000213d000005370020009c000004300000613d000005380020009c000000570000c13d000000240030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000401100370000000000201043b0000000701000039000000000101041a000000ff00100190000006660000c13d000a00000002001d000000000020043f0000000201000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000101041a000004e4041001970000000001000411000000000001004b000900000004001d000001220000613d000000000014004b000001220000613d000000000040043f0000000501000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b0000000002000411000000000020043f000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000101041a000000ff001001900000000904000029000001220000c13d0000000a01000029000000000010043f0000000401000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000101041a000004e4011001970000000002000411000000000021004b00000009040000290000088b0000c13d000000000004004b0000076e0000c13d0000000a01000029000000000010043f0000000201000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000201041a000004f602200197000000000021041b0000000001000414000004e10010009c000004e101008041000000c001100210000004ed011001c70000800d0200003900000004030000390000056e04000041000000090500002900000000060000190000000a070000290000073d0000013d0000051d0020009c000002340000a13d0000051e0020009c000002fc0000213d000005210020009c000004490000613d000005220020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000000701000039000000000201041a0000000803200270000004e4053001970000000003000411000000000035004b0000066a0000c13d0000055102200197000000000021041b0000000001000414000004e10010009c000004e101008041000000c001100210000004ed011001c70000800d020000390000000303000039000004ee0400004100000000060000190000073d0000013d000005080020009c000002590000a13d000005090020009c000003190000213d0000050c0020009c000004590000613d0000050d0020009c000000570000c13d0000000001030019137f0cc10000040f0000000f04000039000000000404041a000a00000001001d000900000002001d000800000003001d0000000001040019137f0d8f0000040f0000000002000416000000000012004b00000000010000390000000101008039137f0d9d0000040f0000001001000039000000000101041a000700000001001d0000800b01000039000000040300003900000000040004150000000b0440008a0000000504400210000004f102000041137f135e0000040f000000070010006b00000000010000390000000101008039137f0db10000040f0000000a010000290000006003100210000000400100043d000600000001001d0000002002100039000700000002001d000000000032043500000014020000390000000000210435137f0c990000040f000000060100002900000000020104330000000701000029137f13490000040f0000001402000039000000000202041a00000000030100190000000801000029137f115b0000040f137f0dc50000040f0000001601000039000000000101041a0000ff00001001900000000001000039000000010100c039137f0dd90000040f000005aa0000013d0000053d0020009c0000026b0000a13d0000053e0020009c0000032b0000213d000005410020009c0000047a0000613d000005420020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000000001030019137f0d100000040f0000001503000039000002f30000013d000005130020009c0000033c0000213d000005160020009c000004820000613d000005170020009c000000570000c13d000000440030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000402100370000000000202043b000a00000002001d000004e40020009c000000570000213d0000002401100370000000000201043b000000000002004b0000000001000039000000010100c039000900000002001d000000000012004b000000570000c13d0000000a0000006b000006ff0000c13d0000055c01000041000004550000013d000005290020009c000003450000213d0000052c0020009c000004ed0000613d0000052d0020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000000701000039000006240000013d000004fe0020009c000003520000213d000005010020009c000005100000613d000005020020009c000000570000c13d000000240030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000702000039000000000202041a0000000802200270000004e4032001970000000002000411000000000023004b000006610000c13d0000000401100370000000000101043b000a00000001001d000004f10100004100000000001004430000000001000414000004e10010009c000004e101008041000000c001100210000004f2011001c70000800b02000039137f137a0000040f0000000100200190000009e10000613d000000000101043b0000000a02000029000000000021001a000004740000413d00000000012100190000001002000039000000000012041b0000000001000019000013800001042e0000054c0020009c0000062b0000613d0000054d0020009c000005150000613d0000054e0020009c000000570000c13d0000000001000416000000000001004b000000570000c13d000000000200041a000000010320019000000001012002700000007f0110618f0000001f0010008c00000000040000390000000104002039000000000442013f0000000100400190000002e30000c13d000000800010043f000000000003004b000006770000613d000000000000043f000000000001004b000006750000613d000005900200004100000000040000190000000003040019000000000402041a000000a005300039000000000045043500000001022000390000002004300039000000000014004b000002180000413d0000075a0000013d000005390020009c0000063c0000613d0000053a0020009c000005210000613d0000053b0020009c000000570000c13d000000240030008c000000570000413d0000000001000416000000000001004b000000570000c13d137f11490000040f00000004010000390000000201100367000000000101043b0000001402000039000000000012041b0000000001000019000013800001042e000005230020009c000006410000613d000005240020009c000005310000613d000005250020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000000903000039000000000203041a000000010420019000000001012002700000007f0110618f0000001f0010008c00000000050000390000000105002039000000000552013f0000000100500190000002e30000c13d000000800010043f000000000004004b000006770000613d000000000030043f000000000001004b000006750000613d000005550200004100000000040000190000000003040019000000000402041a000000a005300039000000000045043500000001022000390000002004300039000000000014004b000002500000413d0000075a0000013d0000050e0020009c0000064a0000613d0000050f0020009c000005360000613d000005100020009c000000570000c13d0000000001000416000000000001004b000000570000c13d137f11490000040f0000001601000039000000000201041a0000059703200197000000ff0020019000000001033061bf000000000031041b0000000001000019000013800001042e000005430020009c0000064f0000613d000005440020009c000005430000613d000005450020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000000701000039000000000101041a0000000801100270000004e4021001970000000001000411000000000012004b0000065c0000c13d0000001601000039000000000101041a000a00000001001d000004f10100004100000000001004430000000001000414000004e10010009c000004e101008041000000c001100210000004f2011001c70000800b02000039137f137a0000040f0000000100200190000009e10000613d000000000101043b000005980010009c000004740000213d00000708011000390000001002000039000000000012041b0000000a01000029000004f40110019700000100011001bf0000001602000039000000000012041b0000000a01000039000000000101041a137f0c8a0000040f137f0d810000040f0000057101000041000005bd0000013d000005190020009c000005800000613d0000051a0020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000000103000039000000000203041a000000010420019000000001012002700000007f0110618f0000001f0010008c00000000050000390000000105002039000000000552013f0000000100500190000002e30000c13d000000800010043f000000000004004b000006770000613d000000000030043f000000000001004b000006750000613d000005640200004100000000040000190000000003040019000000000402041a000000a005300039000000000045043500000001022000390000002004300039000000000014004b000002b40000413d0000075a0000013d0000052f0020009c000005870000613d000005300020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000001601000039000000000101041a0000055800100198000006260000013d000005040020009c000005930000613d000005050020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000001001000039000006530000013d000005480020009c000005af0000613d000005490020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000000a03000039000000000203041a000000010420019000000001012002700000007f0110618f0000001f0010008c00000000050000390000000105002039000000000552013f00000001005001900000066f0000613d0000058801000041000000000010043f0000002201000039000000040010043f000004f9010000410000138100010430000005350020009c000005c10000613d000005360020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000000001030019137f0d100000040f0000001403000039000000000303041a000000000402001900000000020300190000000003040019137f115b0000040f000000000001004b0000000001000039000000010100c039000004290000013d0000051f0020009c000005cc0000613d000005200020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000000701000039000000000301041a0000000802300270000004e4022001970000000004000411000000000042004b000006570000c13d000000ff00300190000006660000c13d000005970330019700000001033001bf000000000031041b000000800020043f0000000001000414000004e10010009c000004e101008041000000c00110021000000565011001c70000800d0200003900000001030000390000056604000041000006cd0000013d0000050a0020009c000005d30000613d0000050b0020009c000000570000c13d0000000001000416000000000001004b000000570000c13d137f11490000040f0000001601000039000000000201041a0000055703200197000005580020019800000000020000190000055902006041000000000232019f000000000021041b0000000001000019000013800001042e0000053f0020009c000005f30000613d000005400020009c000000570000c13d000000240030008c000000570000413d0000000001000416000000000001004b000000570000c13d137f11490000040f00000004010000390000000201100367000000000101043b0000001102000039000000000012041b0000000001000019000013800001042e000005140020009c000005f80000613d000005150020009c000000570000c13d0000000001000416000000000001004b000000570000c13d0000001501000039000006530000013d0000052a0020009c000005fd0000613d0000052b0020009c000000570000c13d000000240030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000401100370000000000101043b137f11290000040f000004290000013d000004ff0020009c0000060a0000613d000005000020009c000000570000c13d000000240030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000401100370000000000601043b000004e40060009c000000570000213d0000000701000039000000000201041a0000000803200270000004e4053001970000000003000411000000000035004b0000066a0000c13d000000000006004b000007300000c13d000004f801000041000004550000013d0000001f0410003900000599044001970000003f044000390000059904400197000000400600043d0000000004460019000000000064004b00000000050000390000000105004039000004e50040009c000000c10000213d0000000100500190000000c10000c13d0000008003300039000000400040043f000900000006001d0000000004160436000800000004001d000000a0022000390000000004210019000000000034004b000000570000213d000000000001004b00000008060000290000038b0000613d000000000300001900000000043600190000000005230019000000000505043300000000005404350000002003300039000000000013004b000003840000413d000000090110002900000020011000390000000000010435000000400500043d000004e70050009c000000c10000213d0000004001500039000000400010043f0000000c010000390000000008150436000004e8010000410000000000180435000000400300043d000004e70030009c000000c10000213d0000004001300039000000400010043f00000004010000390000000004130436000004e90100004100000000001404350000000006050433000004e50060009c000000c10000213d000000000100041a000000010210019000000001091002700000007f0990618f0000001f0090008c00000000010000390000000101002039000000000012004b000002e30000c13d000300000008001d000400000005001d000100000004001d000600000003001d000200000007001d000500000009001d000000200090008c000700000006001d000003d00000413d000000000000043f0000000001000414000004e10010009c000004e101008041000000c001100210000004ea011001c70000801002000039137f137a0000040f0000000100200190000000570000613d00000007060000290000001f026000390000000502200270000000200060008c0000000002004019000000000301043b00000005010000290000001f01100039000000050110027000000000011300190000000002230019000000000012004b000003d00000813d000000000002041b0000000102200039000000000012004b000003cc0000413d0000001f0060008c000007ea0000a13d000000000000043f0000000001000414000004e10010009c000004e101008041000000c001100210000004ea011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000200200008a0000000702200180000000000101043b0000082a0000c13d0000002003000039000008370000013d0000000001000416000000000001004b000000570000c13d0000000d01000039000006530000013d000000240030008c000000570000413d0000000001000416000000000001004b000000570000c13d137f11490000040f00000004010000390000000201100367000000000101043b0000001502000039000000000012041b0000000001000019000013800001042e000000240030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000401100370000000000101043b000a00000001001d000000000010043f0000000201000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000101041a000004e4001001980000067d0000c13d000000400100043d0000055602000041000000000021043500000004021000390000000a030000290000000000320435000004e10010009c000004e1010080410000004001100210000004f9011001c70000138100010430000000240030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000401100370000000000101043b000a00000001001d137f11290000040f0000000a01000029000000000010043f0000000401000039000000200010043f00000040020000390000000001000019137f13490000040f000000000101041a000004e401100197000000400200043d0000000000120435000004e10020009c000004e102008041000000400120021000000568011001c7000013800001042e0000000001000416000000000001004b000000570000c13d0000000001030019137f0cfe0000040f000a00000001001d000900000002001d000800000003001d000000400100043d000700000001001d137f0ca40000040f000000070100002900000000000104350000000a0100002900000009020000290000000803000029137f0ded0000040f00000000010004110000000a02000029000000090300002900000008040000290000000705000029137f12650000040f0000000001000019000013800001042e000000240030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000401100370000000000101043b000004e40010009c000000570000213d000000000001004b000006b80000c13d0000056701000041000000800010043f000000840000043f000005500100004100001381000104300000000001000416000000000001004b000000570000c13d0000000701000039000000000101041a0000000801100270000004e4021001970000000001000411000000000012004b0000065c0000c13d0000001601000039000000000101041a000a00000001001d000004f10100004100000000001004430000000001000414000004e10010009c000004e101008041000000c001100210000004f2011001c70000800b02000039137f137a0000040f0000000100200190000009e10000613d000000000101043b000005980010009c000007420000a13d0000058801000041000000000010043f0000001101000039000000040010043f000004f90100004100001381000104300000000001000416000000000001004b000000570000c13d0000000001030019137f0cfe0000040f137f0ded0000040f0000000001000019000013800001042e000000240030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000402100370000000000502043b000004e50050009c000000570000213d0000002302500039000000000032004b000000570000813d0000000406500039000000000261034f000000000402043b000004e50040009c000000c10000213d0000001f0740003900000599077001970000003f0770003900000599077001970000055d0070009c000000c10000213d00000024055000390000008007700039000000400070043f000000800040043f0000000005540019000000000035004b000000570000213d0000002003600039000000000331034f00000599054001980000001f0640018f000000a001500039000004ac0000613d000000a007000039000000000803034f000000008908043c0000000007970436000000000017004b000004a80000c13d000000000006004b000004b90000613d000000000353034f0000000305600210000000000601043300000000065601cf000000000656022f000000000303043b0000010005500089000000000353022f00000000035301cf000000000363019f0000000000310435000000a00140003900000000000104350000000701000039000000000101041a0000000801100270000004e4031001970000000001000411000000000013004b000007a90000c13d0000001601000039000000000101041a0000055e00100198000007f70000c13d000000800300043d000004e50030009c000000c10000213d0000000901000039000000000501041a000000010050019000000001045002700000007f0440618f0000001f0040008c00000000060000390000000106002039000000000565013f0000000100500190000002e30000c13d000000200040008c000004e50000413d000000000010043f0000001f053000390000000505500270000005620550009a000000200030008c00000555050040410000001f044000390000000504400270000005620440009a000000000045004b000004e50000813d000000000005041b0000000105500039000000000045004b000004e10000413d0000001f0030008c000008bc0000a13d000000000010043f00000599043001980000091a0000c13d000000a0050000390000055502000041000009280000013d000000240030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000702000039000000000202041a0000000802200270000004e4032001970000000002000411000000000023004b000006610000c13d0000000401100370000000000101043b000a00000001001d000004f10100004100000000001004430000000001000414000004e10010009c000004e101008041000000c001100210000004f2011001c70000800b02000039137f137a0000040f0000000100200190000009e10000613d000000000101043b0000000a02000029000000000021001a000004740000413d00000000012100190000001202000039000000000012041b0000000001000019000013800001042e0000000001000416000000000001004b000000570000c13d0000000e01000039000006530000013d000000240030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000401100370000000000101043b000004e40010009c000000570000213d000000000010043f0000001701000039000006ba0000013d0000000001000416000000000001004b000000570000c13d0000000701000039000000000201041a0000000803200270000004e4033001970000000004000411000000000043004b000006570000c13d000000ff00200190000006c20000c13d0000057001000041000000800010043f0000056b0100004100001381000104300000000001000416000000000001004b000000570000c13d0000001201000039000006530000013d000000240030008c000000570000413d0000000001000416000000000001004b000000570000c13d137f11490000040f00000004010000390000000201100367000000000101043b0000000f02000039000000000012041b0000000001000019000013800001042e000000640030008c000000570000413d0000000402100370000000000202043b000900000002001d000004e40020009c000000570000213d0000004402100370000000000202043b000004e50020009c000000570000213d0000002405100370000000000505043b000800000005001d0000002305200039000000000035004b000000570000813d0000000405200039000000000551034f000000000605043b000004e50060009c000000c10000213d00000005056002100000003f0750003900000572077001970000055d0070009c000000c10000213d0000008007700039000000400070043f000000800060043f00000024022000390000000005250019000000000035004b000000570000213d000000000006004b0000056e0000613d000000000321034f000000000303043b000000200440003900000000003404350000002002200039000000000052004b000005670000413d0000001101000039000000000201041a00000008012000b9000000000002004b000005760000613d00000000022100d9000000080020006c000004740000c13d0000000002000416000000000012004b000008080000813d000000400100043d00000044021000390000058b03000041000000000032043500000024021000390000001003000039000007fd0000013d0000000001000416000000000001004b000000570000c13d0000000701000039000000000101041a0000000801100270000006460000013d0000000001000416000000000001004b000000570000c13d137f11490000040f0000001601000039000000000201041a0000059a032001970000ff000020019000000100033061bf000000000031041b0000000001000019000013800001042e000000440030008c000000570000413d0000000402100370000000000202043b000a00000002001d000004e40020009c000000570000213d0000002401100370000000000101043b000900000001001d0000001601000039000000000101041a000000ff0110018f137f0dd90000040f0000000e01000039000000000101041a0000000902000029137f0d8f0000040f0000000002000416000000000012004b00000000010000390000000101008039137f0d9d0000040f0000000a010000290000000902000029137f0ed40000040f0000000001000019000013800001042e0000000001000416000000000001004b000000570000c13d137f11490000040f0000001601000039000000000201041a000004f40220019700000001022001bf000000000021041b0000000a01000039000000000101041a137f0c8a0000040f137f0d810000040f0000058d010000410000000a02000039000000000012041b0000000001000019000013800001042e0000000001000416000000000001004b000000570000c13d137f11490000040f0000001601000039000000000201041a000004f50220019700000569022001c7000000000021041b0000000001000019000013800001042e0000000001000416000000000001004b000000570000c13d0000001601000039000000000101041a0000ff0000100190000006260000013d000000840030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000402100370000000000202043b000a00000002001d000004e40020009c000000570000213d0000002402100370000000000202043b000900000002001d000004e40020009c000000570000213d0000006402100370000000000402043b000004e50040009c000000570000213d0000002302400039000000000032004b000000570000813d0000000402400039000000000221034f000000000202043b0000004401100370000000000101043b000800000001001d0000002401400039137f0d490000040f000700000001001d0000043d0000013d0000000001000416000000000001004b000000570000c13d0000001601000039000006240000013d0000000001000416000000000001004b000000570000c13d0000000c01000039000006530000013d000000240030008c000000570000413d0000000001000416000000000001004b000000570000c13d137f11490000040f00000004010000390000000201100367000000000101043b0000000e02000039000000000012041b0000000001000019000013800001042e000000440030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000402100370000000000202043b000004e40020009c000000570000213d0000002401100370000000000101043b000a00000001001d000004e40010009c000000570000213d000000000020043f0000000501000039000000200010043f00000040020000390000000001000019137f13490000040f0000000a02000029000000000020043f000000200010043f00000000010000190000004002000039137f13490000040f000000000101041a000000ff001001900000000001000039000000010100c039000000800010043f0000055201000041000013800001042e000000240030008c000000570000413d0000000002000416000000000002004b000000570000c13d0000000401100370000000000201043b0000059100200198000000570000c13d0000000101000039000005920020009c000006ce0000213d000005950020009c000006bf0000613d000005960020009c000006bf0000613d000006d20000013d0000000001000416000000000001004b000000570000c13d0000000f01000039000006530000013d0000000001000416000000000001004b000000570000c13d0000000801000039000000000101041a000004e401100197000000800010043f0000055201000041000013800001042e0000000001000416000000000001004b000000570000c13d0000001401000039000006530000013d0000000001000416000000000001004b000000570000c13d0000001101000039000000000101041a000000800010043f0000055201000041000013800001042e0000054f01000041000000800010043f000000840040043f000005500100004100001381000104300000054f02000041000000800020043f000000840010043f000005500100004100001381000104300000054f01000041000000800010043f000000840020043f000005500100004100001381000104300000056a01000041000000800010043f0000056b0100004100001381000104300000054f01000041000000800010043f000000840030043f00000550010000410000138100010430000000800010043f000000000004004b000006770000613d000000000030043f000000000001004b000007500000c13d000000a0010000390000075b0000013d0000059702200197000000a00020043f000000000001004b000000c001000039000000a0010060390000075b0000013d0000000a01000029000000000010043f0000000601000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000201041a000000010320019000000001052002700000007f0550618f0000001f0050008c00000000040000390000000104002039000000000442013f0000000100400190000002e30000c13d000000400600043d0000000004560436000000000003004b000a00000004001d000007b30000613d000900000005001d000800000006001d000000000010043f0000000001000414000004e10010009c000004e101008041000000c001100210000004ea011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000090000006b0000000a020000290000000806000029000007b80000613d000000000101043b00000000020000190000000907000029000000000302001900000020022000390000000004620019000000000501041a00000000005404350000000101100039000000000072004b000006ad0000413d00000000016300190000004002100039000007b80000013d000000000010043f0000000301000039000000200010043f00000040020000390000000001000019137f13490000040f000000000101041a000000800010043f0000055201000041000013800001042e0000059702200197000000000021041b000000800030043f0000000001000414000004e10010009c000004e101008041000000c00110021000000565011001c70000800d0200003900000001030000390000056f040000410000073d0000013d000005930020009c000006bf0000613d000005940020009c000006bf0000613d000000800000043f0000055201000041000013800001042e0000000001000411000000000001004b000007910000613d000000000015004b000007910000613d000800000005001d000000000050043f0000000501000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b0000000002000411000000000020043f000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000101041a000000ff0010019000000008050000290000000003000411000007910000c13d000000400100043d0000058e0200004100000000002104350000000402100039000004110000013d0000000001000411000000000010043f0000000501000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b0000000a02000029000000000020043f000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000201041a00000597022001970000000903000029000000000232019f000000000021041b000000400100043d0000000000310435000004e10010009c000004e10100804100000040011002100000000002000414000004e10020009c000004e102008041000000c002200210000000000112019f000004ea011001c70000800d0200003900000003030000390000055b0400004100000000050004110000000a060000290000073d0000013d00000551022001970000000803600210000004eb03300197000000000232019f000000000021041b0000000001000414000004e10010009c000004e101008041000000c001100210000004ed011001c70000800d020000390000000303000039000004ee04000041137f13750000040f0000000100200190000000570000613d0000000001000019000013800001042e00000708011000390000001202000039000000000012041b0000000a01000029000004f40110019700000559011001c70000001602000039000000000012041b0000000a01000039000000000101041a137f0c8a0000040f137f0d810000040f0000055a01000041000005bd0000013d0000058c0200004100000000040000190000000003040019000000000402041a000000a005300039000000000045043500000001022000390000002004300039000000000014004b000007520000413d000000c001300039000000800210008a0000008001000039137f0caf0000040f0000002001000039000000400200043d000a00000002001d00000000021204360000008001000039137f0c780000040f0000000a020000290000000001210049000004e10010009c000004e1010080410000006001100210000004e10020009c000004e1020080410000004002200210000000000121019f000013800001042e0000000a01000029000000000010043f0000000401000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000201041a000004f602200197000000000021041b0000000901000029000000000010043f0000000301000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000201041a000000010220008a000000000021041b000001240000013d0000000001000414000004e10010009c000004e101008041000000c001100210000004ed011001c70000800d0200003900000004030000390000058f040000410000000a060000290000000907000029137f13750000040f0000000100200190000000570000613d0000000901000029000000000010043f0000000401000039000000200010043f00000040020000390000000001000019137f13490000040f000000000201041a000004f6022001970000000a03000029000003270000013d000000400200043d0000054f03000041000000000032043500000004032000390000000000130435000004e10020009c000004e1020080410000004001200210000004f9011001c7000013810001043000000597012001970000000000140435000000000005004b0000000002040019000000200220c03900000000016200490000001f0110003900000599021001970000000001620019000000000021004b00000000020000390000000102004039000004e50010009c000000c10000213d0000000100200190000000c10000c13d000000400010043f000005540010009c000000c10000213d0000002002100039000000400020043f00000000000104350000000903000039000000000203041a000000010420019000000001012002700000007f0110618f0000001f0010008c00000000050000390000000105002039000000000552013f0000000100500190000002e30000c13d0000000007060019000000400500043d000900000005001d000000000004004b000008a60000613d000000000030043f000000000001004b000007e70000613d00000555020000410000000903000029000000200330003900000000040000190000000005430019000000000602041a000000000065043500000001022000390000002004400039000000000014004b000007e00000413d00000020021000390000000901000029000008aa0000013d000000070000006b0000000001000019000007ef0000613d00000003010000290000000001010433000000070400002900000003024002100000059b0220027f0000059b02200167000000000121016f0000000102400210000000000121019f000008450000013d000000400100043d00000044021000390000055f03000041000000000032043500000024021000390000001b03000039000000000032043500000560020000410000000000210435000000040210003900000020030000390000000000320435000004e10010009c000004e101008041000000400110021000000561011001c700001381000104300000001201000039000000000101041a000a00000001001d000004f10100004100000000001004430000000001000414000004e10010009c000004e101008041000000c001100210000004f2011001c70000800b02000039137f137a0000040f0000000100200190000009e10000613d000000400200043d000000000101043b0000000a0010006b000008cf0000813d00000044012000390000058a03000041000000000031043500000024012000390000001403000039000000000031043500000560010000410000000000120435000000040120003900000020030000390000000000310435000004e10020009c000004e102008041000000400120021000000561011001c70000138100010430000000010320008a0000000503300270000000000431001900000020030000390000000104400039000000040600002900000000056300190000000005050433000000000051041b00000020033000390000000101100039000000000041004b000008300000c13d000000070020006c000008420000813d00000007020000290000000302200210000000f80220018f0000059b0220027f0000059b0220016700000004033000290000000003030433000000000223016f000000000021041b0000000701000029000000010110021000000001011001bf000000000010041b00000006010000290000000001010433000700000001001d000004e50010009c000000c10000213d0000000101000039000400000001001d000000000101041a000000010010019000000001021002700000007f0220618f000500000002001d0000001f0020008c00000000020000390000000102002039000000000121013f0000000100100190000002e30000c13d0000000501000029000000200010008c000008770000413d0000000101000039000000000010043f0000000001000414000004e10010009c000004e101008041000000c001100210000004ea011001c70000801002000039137f137a0000040f0000000100200190000000570000613d00000007030000290000001f023000390000000502200270000000200030008c0000000002004019000000000301043b00000005010000290000001f01100039000000050110027000000000011300190000000002230019000000000012004b000008770000813d000000000002041b0000000102200039000000000012004b000008730000413d00000007010000290000001f0010008c000008990000a13d0000000101000039000000000010043f0000000001000414000004e10010009c000004e101008041000000c001100210000004ea011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000200200008a0000000702200180000000000101043b000009370000c13d0000002003000039000009440000013d000000400100043d0000000403100039000004e10010009c000004e10200004100000000020140190000004002200210000000000004004b000008c60000c13d000005560400004100000000004104350000000a010000290000000000130435000004f9012001c70000138100010430000000070000006b00000000010000190000089e0000613d00000001010000290000000001010433000000070400002900000003024002100000059b0220027f0000059b02200167000000000121016f0000000102400210000000000121019f000009520000013d00000597032001970000000902000029000000200220003900000000003204350000000002120019000800000002001d0000000003070433000700000003001d0000000a01000029137f0c6b0000040f000000090100002900000008021000690000000702200029000000200320008a0000000000310435137f0caf0000040f0000002001000039000000400200043d000a00000002001d00000000021204360000000901000029000007630000013d000000000003004b0000000002000019000008c00000613d000000a00200043d00000003043002100000059b0440027f0000059b04400167000000000442016f0000000102300210000009330000013d0000056c0400004100000000004104350000000004000411000000000043043500000024011000390000000a0300002900000000003104350000056d012001c7000013810001043000000014010000390000000001120436000000090300002900000060033002100000000000310435000004e70020009c000000c10000213d0000004003200039000000400030043f000004e10010009c000004e10100804100000040011002100000000002020433000004e10020009c000004e1020080410000006002200210000000000112019f0000000002000414000004e10020009c000004e102008041000000c002200210000000000112019f000004ed011001c70000801002000039137f137a0000040f0000000100200190000000570000613d0000001502000039000000000202041a000700000002001d000000000101043b000000800200043d000000000002004b0000090d0000613d0000000003000019000a00000003001d0000000502300210000000a0022000390000000002020433000000000021004b000008fc0000813d000000000010043f000000200020043f0000000001000414000008ff0000013d000000000020043f000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b0000000a030000290000000103300039000000800200043d000000000023004b000008f20000413d000000070010006c000009e20000c13d0000001601000039000000000101041a0000055800100198000009e90000c13d000000400100043d00000044021000390000058903000041000000000032043500000024021000390000001803000039000007fd0000013d00000555020000410000002006000039000000010540008a0000000505500270000005630550009a000000000706001900000080066000390000000006060433000000000062041b00000020067000390000000102200039000000000052004b0000091f0000c13d000000a005700039000000000034004b000009310000813d0000000304300210000000f80440018f0000059b0440027f0000059b044001670000000005050433000000000445016f000000000042041b00000001020000390000000104300210000000000224019f000000000021041b0000000001000019000013800001042e000000010320008a0000000503300270000000000431001900000020030000390000000104400039000000060600002900000000056300190000000005050433000000000051041b00000020033000390000000101100039000000000041004b0000093d0000c13d000000070020006c0000094f0000813d00000007020000290000000302200210000000f80220018f0000059b0220027f0000059b0220016700000006033000290000000003030433000000000223016f000000000021041b0000000701000029000000010110021000000001011001bf0000000102000039000000000012041b0000000201000029000004e4061001980000095d0000c13d000000400100043d000004f802000041000000000021043500000004021000390000000000020435000004120000013d00000002010000290000000801100210000004eb011001970000000702000039000000000302041a000004ec04300197000000000114019f000000000012041b00000008013002700000000002000414000004e405100197000004e10020009c000004e102008041000000c001200210000004ed011001c70000800d020000390000000303000039000004ee04000041137f13750000040f0000000100200190000000570000613d0000000c01000039000000000001041b00001388010000390000000d02000039000000000012041b000004ef010000410000000e02000039000000000012041b000004f0010000410000000f02000039000000000012041b0000001601000039000000000101041a000700000001001d000004f10100004100000000001004430000000001000414000004e10010009c000004e101008041000000c001100210000004f2011001c70000800b02000039137f137a0000040f0000000100200190000009e10000613d000000000101043b0000059c0010009c000004740000813d00000708011000390000001002000039000000000012041b000004f3020000410000001103000039000000000023041b0000000702000029000004f4022001970000001603000039000000000023041b0000001202000039000000000012041b00000019010000390000001302000039000000000012041b00000009010000290000000001010433000700000001001d000004e50010009c000000c10000213d0000000901000039000000000101041a000000010010019000000001021002700000007f0220618f000600000002001d0000001f0020008c00000000020000390000000102002039000000000121013f0000000100100190000002e30000c13d0000000601000029000000200010008c000009cd0000413d0000000901000039000000000010043f0000000001000414000004e10010009c000004e101008041000000c001100210000004ea011001c70000801002000039137f137a0000040f0000000100200190000000570000613d00000007030000290000001f023000390000000502200270000000200030008c0000000002004019000000000301043b00000006010000290000001f01100039000000050110027000000000011300190000000002230019000000000012004b000009cd0000813d000000000002041b0000000102200039000000000012004b000009c90000413d00000007010000290000001f0010008c00000a080000a13d0000000901000039000000000010043f0000000001000414000004e10010009c000004e101008041000000c001100210000004ea011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000200200008a0000000702200180000000000101043b00000a440000c13d000000200300003900000a510000013d000000000001042f000000400100043d00000044021000390000057303000041000000000032043500000024021000390000001703000039000007fd0000013d0000000901000029000004e401100197000300000001001d000000000010043f0000001701000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000101041a000000080010002a000004740000413d00000008011000290000001302000039000000000202041a000000000021004b00000a140000a13d000000400100043d00000044021000390000058703000041000000000032043500000024021000390000001903000039000007fd0000013d000000070000006b000000000100001900000a0d0000613d00000008010000290000000001010433000000070400002900000003024002100000059b0220027f0000059b02200167000000000121016f000400010040021800000a5e0000013d0000000301000029000000000010043f0000001701000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000201041a000000080020002a000004740000413d0000000802200029000000000021041b0000000c01000039000000000101041a000000080010002a000004740000413d00000008011000290000000d02000039000000000202041a000000000021004b00000a710000a13d000000400100043d00000064021000390000058403000041000000000032043500000044021000390000058503000041000000000032043500000024021000390000002903000039000000000032043500000560020000410000000000210435000000040210003900000020030000390000000000320435000004e10010009c000004e101008041000000400110021000000586011001c70000138100010430000000010320008a0000000503300270000000000431001900000020030000390000000104400039000000090600002900000000056300190000000005050433000000000051041b00000020033000390000000101100039000000000041004b00000a4a0000c13d000000070020006c00000a5c0000813d00000007020000290000000302200210000000f80220018f0000059b0220027f0000059b0220016700000009033000290000000003030433000000000223016f000000000021041b0000000701000029000000010110021000000004011001af0000000902000039000000000012041b0000001602000039000000000102041a000004f501100197000000000012041b0000000a01000029000004e4011001970000000802000039000000000302041a000004f603300197000000000113019f000000000012041b000000200100003900000100001004430000012000000443000004f701000041000013800001042e0000000801000039000000000201041a0000000001000414000004e404200197000000040040008c00000a7a0000c13d0000000102000039000000010100003100000a8b0000013d000004e10010009c000004e101008041000000c0011002100000000002000416000000000002004b00000a820000c13d000000000204001900000a860000013d000004ed011001c7000080090200003900000000030004160000000005000019137f13750000040f00030000000103550000006001100270000104e10010019d000004e101100197000000000001004b00000aab0000c13d000000010020019000000ad40000613d000000080000006b000007400000613d000000030000006b00000adb0000c13d0000000b01000039000000000101041a000000010110003a000004740000613d0000000b02000039000000000012041b0000000c01000039000000000101041a000000010110003a000004740000613d0000000c02000039000000000012041b000000400100043d000005540010009c000000c10000213d0000002002100039000000400020043f00000000000104350000058301000041000000400200043d000000000012043500000004012000390000000000010435000007ae0000013d000004e50010009c000000c10000213d0000001f0410003900000599044001970000003f044000390000059905400197000000400400043d0000000005540019000000000045004b00000000060000390000000106004039000004e50050009c000000c10000213d0000000100600190000000c10000c13d000000400050043f000000000614043600000599031001980000001f0410018f0000000001360019000000030500036700000ac60000613d000000000705034f000000007807043c0000000006860436000000000016004b00000ac20000c13d000000000004004b00000a8d0000613d000000000335034f0000000304400210000000000501043300000000054501cf000000000545022f000000000303043b0000010004400089000000000343022f00000000034301cf000000000353019f000000000031043500000a8d0000013d000000400100043d00000044021000390000057403000041000000000032043500000024021000390000001503000039000007fd0000013d000200000000001d0000000b01000039000000000101041a000a00000001001d000000010110003a000004740000613d0000000b02000039000000000012041b0000000c01000039000000000101041a000000010110003a000004740000613d0000000c02000039000000000012041b000000400100043d000600000001001d000005540010009c000000c10000213d00000006020000290000002001200039000000400010043f00000000000204350000000701000039000000000101041a000000ff0010019000000c600000c13d0000000a01000029000000000010043f0000000201000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000101041a000704e40010019c00000b280000613d0000000a01000029000000000010043f0000000401000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000201041a000004f602200197000000000021041b0000000701000029000000000010043f0000000301000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000201041a000000010220008a000000000021041b0000000301000029000000000010043f0000000301000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000201041a0000000102200039000000000021041b0000000a01000029000000000010043f0000000201000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000000000201041a000004f6022001970000000306000029000000000262019f000000000021041b0000000001000414000004e10010009c000004e101008041000000c001100210000004ed011001c70000800d0200003900000004030000390000056e0400004100000007050000290000000a07000029137f13750000040f0000000100200190000000570000613d000000070000006b00000c680000c13d000000000100041100000009020000290000000a030000290000000604000029137f11850000040f0000000a01000029000005770010009c00000b670000413d0000000a01000029000005770210012a000000400100003900000b700000013d0000000a02000029000005790020009c000005780220212a000000000100003900000020010020390000057a0020009c00000010011081bf0000057b022081970000057a0220812a0000057c0020009c0000000801108039000004e5022081970000057c0220812a000027100020008c0000000401108039000004e102208197000027100220811a000000640020008c00000002011080390000ffff0220818f000000640220811a000000090020008c000000010110203900000599041001970000005f024000390000059905200197000000400300043d0000000002350019000000000052004b00000000050000390000000105004039000004e50020009c000000c10000213d0000000100500190000000c10000c13d000000400020043f000000010210003900000000022304360000002004400039000005990540019800000b980000613d0000000005520019000000000600003100000002066003670000000007020019000000006806043c0000000007870436000000000057004b00000b940000c13d0000001f00400190000000000113001900000021011000390000000a04000029000000090040008c0000000a5440011a0000000305500210000000010110008a00000000060104330000057d066001970000057e0550021f0000057f05500197000000000565019f000000000051043500000b9c0000213d000000400400043d00000020054000390000058001000041000100000005001d0000000000150435000500000004001d00000021044000390000000001030433000000000001004b00000bb90000613d000000000300001900000000054300190000000006230019000000000606043300000000006504350000002003300039000000000013004b00000bb20000413d000000000241001900000581030000410000000000320435000000060210003900000005030000290000000000230435000000450110003900000599021001970000000001320019000000000021004b00000000020000390000000102004039000004e50010009c000000c10000213d0000000100200190000000c10000c13d000000400010043f0000000a01000029000000000010043f0000000601000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000000101043b000600000001001d00000005010000290000000001010433000700000001001d000004e50010009c000000c10000213d0000000601000029000000000101041a000000010010019000000001021002700000007f0220618f000400000002001d0000001f0020008c00000000020000390000000102002039000000000121013f0000000100100190000002e30000c13d0000000401000029000000200010008c00000c090000413d0000000601000029000000000010043f0000000001000414000004e10010009c000004e101008041000000c001100210000004ea011001c70000801002000039137f137a0000040f0000000100200190000000570000613d00000007030000290000001f023000390000000502200270000000200030008c0000000002004019000000000301043b00000004010000290000001f01100039000000050110027000000000011300190000000002230019000000000012004b00000c090000813d000000000002041b0000000102200039000000000012004b00000c050000413d00000007010000290000001f0010008c00000c290000a13d0000000601000029000000000010043f0000000001000414000004e10010009c000004e101008041000000c001100210000004ea011001c70000801002000039137f137a0000040f0000000100200190000000570000613d000000200200008a0000000702200180000000000101043b00000c370000613d000000010320008a0000000503300270000000000331001900000001043000390000002003000039000000050600002900000000056300190000000005050433000000000051041b00000020033000390000000101100039000000000041004b00000c210000c13d00000c380000013d000000070000006b00000c2e0000613d0000000101000029000000000101043300000c2f0000013d0000000001000019000000070400002900000003024002100000059b0220027f0000059b02200167000000000121016f0000000102400210000000000121019f00000c460000013d0000002003000039000000070020006c00000c430000813d00000007020000290000000302200210000000f80220018f0000059b0220027f0000059b0220016700000005033000290000000003030433000000000223016f000000000021041b0000000701000029000000010110021000000001011001bf0000000602000029000000000012041b000000400100043d0000000a020000290000000000210435000004e10010009c000004e10100804100000040011002100000000002000414000004e10020009c000004e102008041000000c002200210000000000112019f000004ea011001c70000800d0200003900000001030000390000058204000041137f13750000040f0000000100200190000000570000613d00000002020000290000000102200039000200000002001d000000080020006c00000adc0000413d000007400000013d000000400100043d0000056a020000410000000000210435000004e10010009c000004e101008041000000400110021000000575011001c70000138100010430000000400100043d0000057602000041000009590000013d000000000003004b00000c750000613d000000000400001900000000052400190000000006140019000000000606043300000000006504350000002004400039000000000034004b00000c6e0000413d00000000012300190000000000010435000000000001042d00000000430104340000000001320436000000000003004b00000c840000613d000000000200001900000000051200190000000006240019000000000606043300000000006504350000002002200039000000000032004b00000c7d0000413d000000000213001900000000000204350000001f0230003900000599022001970000000001210019000000000001042d000000010210019000000001011002700000007f0110618f0000001f0010008c00000000030000390000000103002039000000000032004b00000c930000c13d000000000001042d0000058801000041000000000010043f0000002201000039000000040010043f000004f90100004100001381000104300000059d0010009c00000c9e0000813d0000004001100039000000400010043f000000000001042d0000058801000041000000000010043f0000004101000039000000040010043f000004f90100004100001381000104300000059e0010009c00000ca90000813d0000002001100039000000400010043f000000000001042d0000058801000041000000000010043f0000004101000039000000040010043f000004f90100004100001381000104300000001f0220003900000599022001970000000001120019000000000021004b00000000020000390000000102004039000004e50010009c00000cbb0000213d000000010020019000000cbb0000c13d000000400010043f000000000001042d0000058801000041000000000010043f0000004101000039000000040010043f000004f90100004100001381000104300000059f0010009c00000cf60000213d0000000004010019000000630010008c00000cf60000a13d00000002050003670000000401500370000000000101043b000004e40010009c00000cf60000213d0000004402500370000000000602043b000004e50060009c00000cf60000213d0000002402500370000000000202043b0000002303600039000000000043004b00000cf60000813d0000000403600039000000000335034f000000000703043b000005a00070009c00000cf80000813d00000005087002100000003f038000390000057209300197000000400300043d0000000009930019000000000039004b000000000a000039000000010a004039000004e50090009c00000cf80000213d0000000100a0019000000cf80000c13d000000400090043f000000000073043500000024066000390000000008680019000000000048004b00000cf60000213d000000000007004b00000cf50000613d0000000004030019000000000765034f000000000707043b000000200440003900000000007404350000002006600039000000000086004b00000cee0000413d000000000001042d000000000100001900001381000104300000058801000041000000000010043f0000004101000039000000040010043f000004f90100004100001381000104300000059f0010009c00000d0e0000213d000000630010008c00000d0e0000a13d00000002030003670000000401300370000000000101043b000004e40010009c00000d0e0000213d0000002402300370000000000202043b000004e40020009c00000d0e0000213d0000004403300370000000000303043b000000000001042d000000000100001900001381000104300000059f0010009c00000d410000213d000000430010008c00000d410000a13d00000002020003670000000403200370000000000403043b000004e50040009c00000d410000213d0000002303400039000000000013004b00000d410000813d0000000403400039000000000332034f000000000503043b000005a00050009c00000d430000813d00000005065002100000003f036000390000057207300197000000400300043d0000000007730019000000000037004b00000000080000390000000108004039000004e50070009c00000d430000213d000000010080019000000d430000c13d000000400070043f000000000053043500000024044000390000000006460019000000000016004b00000d410000213d000000000005004b00000d3d0000613d0000000001030019000000000542034f000000000505043b000000200110003900000000005104350000002004400039000000000064004b00000d360000413d0000002401200370000000000201043b0000000001030019000000000001042d000000000100001900001381000104300000058801000041000000000010043f0000004101000039000000040010043f000004f9010000410000138100010430000005a00020009c00000d790000813d00000000040100190000001f0120003900000599011001970000003f011000390000059905100197000000400100043d0000000005510019000000000015004b00000000070000390000000107004039000004e50050009c00000d790000213d000000010070019000000d790000c13d000000400050043f00000000052104360000000007420019000000000037004b00000d7f0000213d00000599062001980000001f0720018f0000000204400367000000000365001900000d690000613d000000000804034f0000000009050019000000008a08043c0000000009a90436000000000039004b00000d650000c13d000000000007004b00000d760000613d000000000464034f0000000306700210000000000703043300000000076701cf000000000767022f000000000404043b0000010006600089000000000464022f00000000046401cf000000000474019f000000000043043500000000022500190000000000020435000000000001042d0000058801000041000000000010043f0000004101000039000000040010043f000004f901000041000013810001043000000000010000190000138100010430000000200010008c00000d8e0000413d0000000a02000039000000000020043f0000001f01100039000000050110027200000d8e0000613d000005a10110009a0000058c02000041000000000002041b0000000102200039000000000012004b00000d8a0000413d000000000001042d000000000301001900000000011200a9000000000003004b00000d960000613d00000000033100d9000000000023004b00000d970000c13d000000000001042d0000058801000041000000000010043f0000001101000039000000040010043f000004f9010000410000138100010430000000000001004b00000da00000613d000000000001042d000000400100043d00000044021000390000058b03000041000000000032043500000024021000390000001003000039000000000032043500000560020000410000000000210435000000040210003900000020030000390000000000320435000004e10010009c000004e101008041000000400110021000000561011001c70000138100010430000000000001004b00000db40000613d000000000001042d000000400100043d00000044021000390000058a03000041000000000032043500000024021000390000001403000039000000000032043500000560020000410000000000210435000000040210003900000020030000390000000000320435000004e10010009c000004e101008041000000400110021000000561011001c70000138100010430000000000001004b00000dc80000613d000000000001042d000000400100043d00000044021000390000057303000041000000000032043500000024021000390000001703000039000000000032043500000560020000410000000000210435000000040210003900000020030000390000000000320435000004e10010009c000004e101008041000000400110021000000561011001c70000138100010430000000000001004b00000ddc0000613d000000000001042d000000400100043d00000044021000390000058903000041000000000032043500000024021000390000001803000039000000000032043500000560020000410000000000210435000000040210003900000020030000390000000000320435000004e10010009c000004e101008041000000400110021000000561011001c700001381000104300004000000000002000400000003001d000204e40020019c00000e9c0000613d000100000001001d0000000701000039000000000101041a000000ff0010019000000ea60000c13d0000000401000029000000000010043f0000000201000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f000000010020019000000e9a0000613d000000000101043b000000000101041a000004e4041001970000000001000411000000000001004b000300000004001d00000e3e0000613d000000000014004b00000e3e0000613d000000000040043f0000000501000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f000000010020019000000e9a0000613d000000000101043b0000000002000411000000000020043f000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f000000010020019000000e9a0000613d000000000101043b000000000101041a000000ff00100190000000030400002900000e3e0000c13d0000000401000029000000000010043f0000000401000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f000000010020019000000e9a0000613d000000000101043b000000000101041a000004e4011001970000000002000411000000000021004b000000030400002900000ebd0000c13d000000000004004b000000030200003900000e640000613d0000000401000029000000000010043f0000000401000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f000000010020019000000e9a0000613d000000000101043b000000000201041a000004f602200197000000000021041b0000000301000029000000000010043f0000000301000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f000000010020019000000e9a0000613d000000000101043b000000000201041a000000010220008a000000000021041b00000003020000390000000201000029000000000010043f000000200020043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f000000010020019000000e9a0000613d000000000101043b000000000201041a0000000102200039000000000021041b0000000401000029000000000010043f0000000201000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f000000010020019000000e9a0000613d000000000101043b000000000201041a000004f6022001970000000206000029000000000262019f000000000021041b0000000001000414000004e10010009c000004e101008041000000c001100210000004ed011001c70000800d0200003900000004030000390000056e0400004100000003050000290000000407000029137f13750000040f000000010020019000000e9a0000613d0000000101000029000004e4011001970000000304000029000000000014004b00000eae0000c13d000000000001042d00000000010000190000138100010430000000400100043d0000058302000041000000000021043500000004021000390000000000020435000004e10010009c000004e1010080410000004001100210000004f9011001c70000138100010430000000400100043d0000056a020000410000000000210435000004e10010009c000004e101008041000000400110021000000575011001c70000138100010430000000400200043d00000044032000390000000000430435000000240320003900000004040000290000000000430435000005a203000041000000000032043500000004032000390000000000130435000004e10020009c000004e102008041000000400120021000000561011001c70000138100010430000000400100043d0000000403100039000004e10010009c000004e10200004100000000020140190000004002200210000000000004004b00000ecb0000c13d0000055604000041000000000041043500000004010000290000000000130435000004f9012001c700001381000104300000056c040000410000000000410435000000000400041100000000004304350000002401100039000000040300002900000000003104350000056d012001c70000138100010430000a000000000002000300000002001d000200000001001d000004e401100197000800000001001d000000000010043f0000001701000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000010c50000613d000000000101043b000000000201041a000000030020002a0000110c0000413d0000000302200029000000000021041b0000000c01000039000000000201041a0000000301200029000000000021004b00000000020000390000000102004039000000010020008c0000110c0000613d0000000d02000039000000000202041a000000000021004b000010df0000213d0000000801000039000000000201041a0000000001000414000004e404200197000000040040008c00000f020000c13d00000001020000390000000101000031000000000001004b00000f140000c13d00000f3c0000013d0000000003000416000004e10010009c000004e101008041000000c001100210000000000003004b00000f0c0000613d000004ed011001c70000800902000039000000000500001900000f0d0000013d0000000002040019137f13750000040f00030000000103550000006001100270000104e10010019d000004e101100197000000000001004b00000f3c0000613d000005a00010009c000011160000813d0000001f0310003900000599033001970000003f033000390000059904300197000000400300043d0000000004430019000000000034004b00000000050000390000000105004039000004e50040009c000011160000213d0000000100500190000011160000c13d000000400040043f000000000613043600000599031001980000001f0410018f0000000001360019000000030500036700000f2f0000613d000000000705034f000000007807043c0000000006860436000000000016004b00000f2b0000c13d000000000004004b00000f3c0000613d000000000335034f0000000304400210000000000501043300000000054501cf000000000545022f000000000303043b0000010004400089000000000343022f00000000034301cf000000000353019f00000000003104350000000100200190000010f30000613d000000030000006b0000000c03000039000010c40000613d000000080000006b000011040000613d0000000b020000390000000004000019000600000004001d000000000402041a000000010140003a0000110c0000613d000000000012041b000000000103041a000000010110003a0000110c0000613d000000000013041b000000400200043d000005540020009c000011160000213d0000002001200039000000400010043f000700000002001d00000000000204350000000701000039000000000101041a000000ff00100190000010c70000c13d000a00000004001d000000000040043f0000000201000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000010c50000613d000000000101043b000000000101041a000904e40010019c00000f8c0000613d0000000a01000029000000000010043f0000000401000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000010c50000613d000000000101043b000000000201041a000004f602200197000000000021041b0000000901000029000000000010043f0000000301000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000010c50000613d000000000101043b000000000201041a000000010220008a000000000021041b000000080000006b00000f9f0000613d0000000801000029000000000010043f0000000301000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000010c50000613d000000000101043b000000000201041a0000000102200039000000000021041b0000000a01000029000000000010043f0000000201000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000010c50000613d000000000101043b000000000201041a000004f6022001970000000806000029000000000262019f000000000021041b0000000001000414000004e10010009c000004e101008041000000c001100210000004ed011001c70000800d0200003900000004030000390000056e0400004100000009050000290000000a07000029137f13750000040f0000000100200190000010c50000613d000000090000006b000010cf0000c13d000000000100041100000002020000290000000a030000290000000704000029137f11850000040f0000000a09000029000005a30090009c00000fcc0000a13d000005770290012a000000400100003900000fd60000013d000005790090009c0000000002090019000005780220212a000000000100003900000020010020390000057a0020009c00000fd60000413d00000010011001bf0000057b022001970000057a0220012a0000057c0020009c0000000801108039000004e5022081970000057c0220812a000027100020008c0000000401108039000004e102208197000027100220811a000000640020008c00000002011080390000ffff0220818f000000640220811a000000090020008c000000010110203900000599041001970000005f024000390000059905200197000000400300043d0000000002350019000000000052004b00000000050000390000000105004039000004e50020009c000011160000213d0000000100500190000011160000c13d000000400020043f000000010210003900000000022304360000002004400039000005990540019800000ffe0000613d0000000005520019000000000600003100000002066003670000000007020019000000006806043c0000000007870436000000000057004b00000ffa0000c13d0000001f00400190000000000113001900000021011000390000000004090019000000090040008c0000000a5440011a0000000305500210000000010110008a00000000060104330000057d066001970000057e0550021f0000057f05500197000000000565019f0000000000510435000010020000213d000000400700043d00000020047000390000058001000041000400000004001d000000000014043500000021047000390000000001030433000000000001004b0000101e0000613d000000000300001900000000054300190000000006230019000000000606043300000000006504350000002003300039000000000013004b000010170000413d00000000024100190000058103000041000000000032043500000006021000390000000000270435000000450110003900000599021001970000000001720019000000000021004b00000000020000390000000102004039000004e50010009c000011160000213d0000000100200190000011160000c13d000900000007001d000000400010043f000000000090043f0000000601000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000010c50000613d000000000401043b00000009010000290000000005010433000004e50050009c0000000a06000029000011160000213d000000000104041a000000010010019000000001031002700000007f0330618f0000001f0030008c00000000020000390000000102002039000000000121013f0000000100100190000010d90000c13d000000200030008c000700000004001d000500000005001d0000106d0000413d000100000003001d000000000040043f0000000001000414000004e10010009c000004e101008041000000c001100210000004ea011001c70000801002000039137f137a0000040f0000000100200190000010c50000613d00000005050000290000001f025000390000000502200270000000200050008c0000000002004019000000000301043b00000001010000290000001f01100039000000050110027000000000011300190000000002230019000000000012004b0000000a0600002900000007040000290000106d0000813d000000000002041b0000000102200039000000000012004b000010690000413d0000001f0050008c000010990000a13d000000000040043f0000000001000414000004e10010009c000004e101008041000000c001100210000004ea011001c70000801002000039137f137a0000040f0000000100200190000010c50000613d00000005080000290000059902800198000000000101043b000010be0000613d000000010320008a00000005033002700000000003310019000000010430003900000020030000390000000a06000029000000090700002900000000057300190000000005050433000000000051041b00000020033000390000000101100039000000000041004b000010840000c13d000000000082004b000010950000813d0000000302800210000000f80220018f0000059b0220027f0000059b0220016700000000037300190000000003030433000000000223016f000000000021041b000000010180021000000001011001bf0000000704000029000010a50000013d000000000005004b0000109e0000613d000000040100002900000000010104330000109f0000013d000000000100001900000003025002100000059b0220027f0000059b02200167000000000121016f0000000102500210000000000121019f000000000014041b000000400100043d0000000000610435000004e10010009c000004e10100804100000040011002100000000002000414000004e10020009c000004e102008041000000c002200210000000000112019f000004ea011001c70000800d0200003900000001030000390000058204000041137f13750000040f0000000100200190000010c50000613d00000006040000290000000104400039000000030040006c0000000c030000390000000b0200003900000f450000413d000010c40000013d00000020030000390000000a060000290000000907000029000000000082004b0000108d0000413d000010950000013d000000000001042d00000000010000190000138100010430000000400100043d0000056a020000410000000000210435000004e10010009c000004e101008041000000400110021000000575011001c70000138100010430000000400100043d0000057602000041000000000021043500000004021000390000000000020435000004e10010009c000004e1010080410000004001100210000004f9011001c700001381000104300000058801000041000000000010043f0000002201000039000000040010043f000004f9010000410000138100010430000000400100043d00000064021000390000058403000041000000000032043500000044021000390000058503000041000000000032043500000024021000390000002903000039000000000032043500000560020000410000000000210435000000040210003900000020030000390000000000320435000004e10010009c000004e101008041000000400110021000000586011001c70000138100010430000000400100043d00000044021000390000057403000041000000000032043500000024021000390000001503000039000000000032043500000560020000410000000000210435000000040210003900000020030000390000000000320435000004e10010009c000004e101008041000000400110021000000561011001c700001381000104300000000b01000039000000000201041a000000010220003a0000110c0000613d000000000021041b000000000103041a000000010110003a000011120000c13d0000058801000041000000000010043f0000001101000039000000040010043f000004f9010000410000138100010430000000000013041b000000400100043d000005540010009c0000111c0000a13d0000058801000041000000000010043f0000004101000039000000040010043f000004f90100004100001381000104300000002002100039000000400020043f00000000000104350000058301000041000000400200043d000000000012043500000004012000390000000000010435000004e10020009c000004e1020080410000004001200210000004f9011001c700001381000104300001000000000002000100000001001d000000000010043f0000000201000039000000200010043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f00000001002001900000113c0000613d000000000101043b000000000101041a000004e4011001980000113e0000613d000000000001042d00000000010000190000138100010430000000400100043d00000556020000410000000000210435000000040210003900000001030000290000000000320435000004e10010009c000004e1010080410000004001100210000004f9011001c700001381000104300000000701000039000000000101041a0000000801100270000004e4021001970000000001000411000000000012004b000011510000c13d000000000001042d000000400200043d0000054f03000041000000000032043500000004032000390000000000130435000004e10020009c000004e1020080410000004001200210000004f9011001c700001381000104300004000000000002000100000002001d000200000001001d0000000021010434000300000002001d000000000001004b0000117f0000613d0000000002000019000400000002001d000000050120021000000003011000290000000001010433000000000013004b0000116d0000813d000000000030043f000000200010043f0000000001000414000011700000013d000000000010043f000000200030043f0000000001000414000004e10010009c000004e101008041000000c00110021000000553011001c70000801002000039137f137a0000040f0000000100200190000011830000613d0000000402000029000000000301043b000000010220003900000002010000290000000001010433000000000012004b000011630000413d000000010030006c00000000010000390000000101006039000000000001042d000000000100001900001381000104300006000000000002000300000004001d000100000003001d000200000001001d000005a4010000410000000000100443000400000002001d00000004002004430000000001000414000004e10010009c000004e101008041000000c001100210000005a5011001c70000800202000039137f137a0000040f0000000100200190000012170000613d000000000101043b000000000001004b000012140000613d000000400b00043d0000006401b00039000000800800003900000000008104350000004401b0003900000001020000290000000000210435000005a60100004100000000001b04350000000201000029000004e4011001970000000402b0003900000000001204350000002401b0003900000000000104350000008403b00039000000030100002900000000210104340000000000130435000000a403b000390000000404000029000004e407400197000000000001004b000011b90000613d000000000400001900000000053400190000000006420019000000000606043300000000006504350000002004400039000000000014004b000011b20000413d000000000231001900000000000204350000000002000414000000040070008c000011c60000c13d0000000005000415000000060550008a00000005055002100000000103000031000000200030008c00000020040000390000000004034019000011ff0000013d000200000008001d0000001f011000390000059901100197000000a401100039000004e10010009c000004e1010080410000006001100210000004e100b0009c000004e10300004100000000030b40190000004003300210000000000131019f000004e10020009c000004e102008041000000c002200210000000000112019f000300000007001d000000000207001900040000000b001d137f13750000040f000000040b0000290000006003100270000004e103300197000000200030008c000000200400003900000000040340190000001f0640018f000000200740019000000000057b0019000011ea0000613d000000000801034f00000000090b0019000000008a08043c0000000009a90436000000000059004b000011e60000c13d000000000006004b000011f70000613d000000000771034f0000000306600210000000000805043300000000086801cf000000000868022f000000000707043b0000010006600089000000000767022f00000000066701cf000000000686019f0000000000650435000100000003001f00030000000103550000000005000415000000050550008a00000005055002100000000100200190000012210000613d00000003070000290000001f01400039000000600210018f0000000001b20019000000000021004b00000000020000390000000102004039000004e50010009c000012560000213d0000000100200190000012560000c13d000000400010043f0000001f0030008c000012150000a13d00000000020b04330000059100200198000012150000c13d0000000503500270000000000302001f000005a802200197000005a60020009c000012180000c13d000000000001042d00000000010000190000138100010430000000000001042f0000058302000041000000000021043500000004021000390000000000720435000004e10010009c000004e1010080410000004001100210000004f9011001c70000138100010430000000000003004b000012250000c13d00000060020000390000124c0000013d0000001f02300039000004e2022001970000003f02200039000005a704200197000000400200043d0000000004420019000000000024004b00000000050000390000000105004039000004e50040009c000012560000213d0000000100500190000012560000c13d000000400040043f0000001f0430018f0000000006320436000004e305300198000200000006001d00000000035600190000123f0000613d000000000601034f0000000207000029000000006806043c0000000007870436000000000037004b0000123b0000c13d000000000004004b0000124c0000613d000000000151034f0000000304400210000000000503043300000000054501cf000000000545022f000000000101043b0000010004400089000000000141022f00000000014101cf000000000151019f00000000001304350000000001020433000000000001004b0000125c0000c13d000000400100043d000005830200004100000000002104350000000402100039000000030300002900000000003204350000121c0000013d0000058801000041000000000010043f0000004101000039000000040010043f000004f90100004100001381000104300000000202000029000004e10020009c000004e1020080410000004002200210000004e10010009c000004e1010080410000006001100210000000000121019f00001381000104300007000000000002000400000005001d000200000004001d000100000002001d000300000001001d000005a4010000410000000000100443000500000003001d00000004003004430000000001000414000004e10010009c000004e101008041000000c001100210000005a5011001c70000800202000039137f137a0000040f0000000100200190000012fa0000613d000000000101043b000000000001004b000012f70000613d000000400b00043d0000006401b00039000000800800003900000000008104350000004401b00039000000020200002900000000002104350000000101000029000004e4011001970000002402b000390000000000120435000005a60100004100000000001b04350000000301000029000004e4011001970000000402b0003900000000001204350000008403b00039000000040100002900000000210104340000000000130435000000a403b000390000000504000029000004e407400197000000000001004b0000129c0000613d000000000400001900000000053400190000000006420019000000000606043300000000006504350000002004400039000000000014004b000012950000413d000000000231001900000000000204350000000002000414000000040070008c000012a90000c13d0000000005000415000000070550008a00000005055002100000000103000031000000200030008c00000020040000390000000004034019000012e20000013d000300000008001d0000001f011000390000059901100197000000a401100039000004e10010009c000004e1010080410000006001100210000004e100b0009c000004e10300004100000000030b40190000004003300210000000000131019f000004e10020009c000004e102008041000000c002200210000000000112019f000400000007001d000000000207001900050000000b001d137f13750000040f000000050b0000290000006003100270000004e103300197000000200030008c000000200400003900000000040340190000001f0640018f000000200740019000000000057b0019000012cd0000613d000000000801034f00000000090b0019000000008a08043c0000000009a90436000000000059004b000012c90000c13d000000000006004b000012da0000613d000000000771034f0000000306600210000000000805043300000000086801cf000000000868022f000000000707043b0000010006600089000000000767022f00000000066701cf000000000686019f0000000000650435000100000003001f00030000000103550000000005000415000000060550008a00000005055002100000000100200190000013040000613d00000004070000290000001f01400039000000600210018f0000000001b20019000000000021004b00000000020000390000000102004039000004e50010009c000013390000213d0000000100200190000013390000c13d000000400010043f0000001f0030008c000012f80000a13d00000000020b04330000059100200198000012f80000c13d0000000503500270000000000302001f000005a802200197000005a60020009c000012fb0000c13d000000000001042d00000000010000190000138100010430000000000001042f0000058302000041000000000021043500000004021000390000000000720435000004e10010009c000004e1010080410000004001100210000004f9011001c70000138100010430000000000003004b000013080000c13d00000060020000390000132f0000013d0000001f02300039000004e2022001970000003f02200039000005a704200197000000400200043d0000000004420019000000000024004b00000000050000390000000105004039000004e50040009c000013390000213d0000000100500190000013390000c13d000000400040043f0000001f0430018f0000000006320436000004e305300198000300000006001d0000000003560019000013220000613d000000000601034f0000000307000029000000006806043c0000000007870436000000000037004b0000131e0000c13d000000000004004b0000132f0000613d000000000151034f0000000304400210000000000503043300000000054501cf000000000545022f000000000101043b0000010004400089000000000141022f00000000014101cf000000000151019f00000000001304350000000001020433000000000001004b0000133f0000c13d000000400100043d00000583020000410000000000210435000000040210003900000004030000290000000000320435000012ff0000013d0000058801000041000000000010043f0000004101000039000000040010043f000004f90100004100001381000104300000000302000029000004e10020009c000004e1020080410000004002200210000004e10010009c000004e1010080410000006001100210000000000121019f0000138100010430000000000001042f000004e10010009c000004e1010080410000004001100210000004e10020009c000004e1020080410000006002200210000000000112019f0000000002000414000004e10020009c000004e102008041000000c002200210000000000112019f000004ed011001c70000801002000039137f137a0000040f00000001002001900000135c0000613d000000000101043b000000000001042d0000000001000019000013810001043000000000050100190000000000200443000000040030008c000013650000a13d000000050140027000000000010100310000000400100443000004e10030009c000004e10300804100000060013002100000000002000414000004e10020009c000004e102008041000000c002200210000000000112019f000005a9011001c70000000002050019137f137a0000040f0000000100200190000013740000613d000000000101043b000000000001042d000000000001042f00001378002104210000000102000039000000000001042d0000000002000019000000000001042d0000137d002104230000000102000039000000000001042d0000000002000019000000000001042d0000137f00000432000013800001042e00001381000104300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffff00000000000000000000000000000000000000000000000000000001ffffffe000000000000000000000000000000000000000000000000000000000ffffffe0000000000000000000000000ffffffffffffffffffffffffffffffffffffffff000000000000000000000000000000000000000000000000ffffffffffffffff8000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffbf4f6e636861696e2041726d79000000000000000000000000000000000000000041726d790000000000000000000000000000000000000000000000000000000002000000000000000000000000000000000000200000000000000000000000000000000000000000000000ffffffffffffffffffffffffffffffffffffffff00ffffffffffffffffffffff00000000000000000000000000000000000000000002000000000000000000000000000000000000000000000000000000000000008be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0000000000000000000000000000000000000000000000000009536c708910000000000000000000000000000000000000000000000000000006a94d74f430000796b89b91644bc98cd93958e4c9038275d622183e25ac5af08cc6b5d955391320200000200000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000000000000007c585087238000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffff000000ffffffffffffffffffffffffffffffffffffffffffffffffffffffff00ffffffffffffffffffffffffffffff000000000000000000000000000000000000000000000002000000000000000000000000000000400000010000000000000000001e4fbdf70000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000240000000000000000000000000000000000000000000000000000000000000000000000000000000066d003ab00000000000000000000000000000000000000000000000000000000a9c0a63000000000000000000000000000000000000000000000000000000000c87b56dc00000000000000000000000000000000000000000000000000000000dc53fd9100000000000000000000000000000000000000000000000000000000e985e9c400000000000000000000000000000000000000000000000000000000e985e9c500000000000000000000000000000000000000000000000000000000f2fde38b00000000000000000000000000000000000000000000000000000000dc53fd9200000000000000000000000000000000000000000000000000000000df43301700000000000000000000000000000000000000000000000000000000ce6df2b800000000000000000000000000000000000000000000000000000000ce6df2b900000000000000000000000000000000000000000000000000000000dba6606200000000000000000000000000000000000000000000000000000000c87b56dd00000000000000000000000000000000000000000000000000000000cb98652d00000000000000000000000000000000000000000000000000000000b18b35fa00000000000000000000000000000000000000000000000000000000b88d4fdd00000000000000000000000000000000000000000000000000000000b88d4fde00000000000000000000000000000000000000000000000000000000badc664300000000000000000000000000000000000000000000000000000000b18b35fb00000000000000000000000000000000000000000000000000000000b2159b5800000000000000000000000000000000000000000000000000000000a9c0a63100000000000000000000000000000000000000000000000000000000ae0614f100000000000000000000000000000000000000000000000000000000afe206d4000000000000000000000000000000000000000000000000000000008a333b4f00000000000000000000000000000000000000000000000000000000a0bcfc7e00000000000000000000000000000000000000000000000000000000a2309ff700000000000000000000000000000000000000000000000000000000a2309ff800000000000000000000000000000000000000000000000000000000a29e222300000000000000000000000000000000000000000000000000000000a0bcfc7f00000000000000000000000000000000000000000000000000000000a22cb465000000000000000000000000000000000000000000000000000000008da5cb5a000000000000000000000000000000000000000000000000000000008da5cb5b0000000000000000000000000000000000000000000000000000000095d89b41000000000000000000000000000000000000000000000000000000008a333b50000000000000000000000000000000000000000000000000000000008ba4cc3c0000000000000000000000000000000000000000000000000000000070a0823000000000000000000000000000000000000000000000000000000000728917d300000000000000000000000000000000000000000000000000000000728917d4000000000000000000000000000000000000000000000000000000008456cb590000000000000000000000000000000000000000000000000000000070a0823100000000000000000000000000000000000000000000000000000000715018a60000000000000000000000000000000000000000000000000000000066d003ac000000000000000000000000000000000000000000000000000000006770ec83000000000000000000000000000000000000000000000000000000006c0360eb000000000000000000000000000000000000000000000000000000003d016e58000000000000000000000000000000000000000000000000000000004a2eb4b6000000000000000000000000000000000000000000000000000000005799a60b000000000000000000000000000000000000000000000000000000005d82cf6d000000000000000000000000000000000000000000000000000000005d82cf6e000000000000000000000000000000000000000000000000000000006352211e000000000000000000000000000000000000000000000000000000005799a60c000000000000000000000000000000000000000000000000000000005c975abb000000000000000000000000000000000000000000000000000000004ee95581000000000000000000000000000000000000000000000000000000004ee95582000000000000000000000000000000000000000000000000000000005145ae2a000000000000000000000000000000000000000000000000000000004a2eb4b7000000000000000000000000000000000000000000000000000000004a7634960000000000000000000000000000000000000000000000000000000042842e0d00000000000000000000000000000000000000000000000000000000436e72cc00000000000000000000000000000000000000000000000000000000436e72cd0000000000000000000000000000000000000000000000000000000048c047220000000000000000000000000000000000000000000000000000000042842e0e0000000000000000000000000000000000000000000000000000000042966c68000000000000000000000000000000000000000000000000000000003d016e59000000000000000000000000000000000000000000000000000000003f4ba83a000000000000000000000000000000000000000000000000000000003fa9d0e400000000000000000000000000000000000000000000000000000000197348b60000000000000000000000000000000000000000000000000000000023b872dc0000000000000000000000000000000000000000000000000000000027c7dde60000000000000000000000000000000000000000000000000000000027c7dde7000000000000000000000000000000000000000000000000000000002f4f52ed0000000000000000000000000000000000000000000000000000000023b872dd000000000000000000000000000000000000000000000000000000002747fa1900000000000000000000000000000000000000000000000000000000197348b7000000000000000000000000000000000000000000000000000000001a32cf5f000000000000000000000000000000000000000000000000000000001de3039e00000000000000000000000000000000000000000000000000000000081812fb000000000000000000000000000000000000000000000000000000000fb68a73000000000000000000000000000000000000000000000000000000000fb68a740000000000000000000000000000000000000000000000000000000017881cbf00000000000000000000000000000000000000000000000000000000081812fc00000000000000000000000000000000000000000000000000000000095ea7b30000000000000000000000000000000000000000000000000000000001ffc9a7000000000000000000000000000000000000000000000000000000000608d53a0000000000000000000000000000000000000000000000000000000006fdde03118cdaa7000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000024000000800000000000000000ffffffffffffffffffffff0000000000000000000000000000000000000000ff00000000000000000000000000000000000000200000008000000000000000000200000000000000000000000000000000000040000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffffdf6e1540171b6c0c960b71a7020d9f60077f6af931a8bbf590da0223dacf75c7af7e27328900000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00ffff0000000000000000000000000000000000000000000000000000000000ff000000000000000000000000000000000000000000000000000000000000000100005345434f4e44205048415345000000000000000000000000000000000000001817307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c315b08ba1800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ffffffffffffff7f00000000000000000000000000000000000000000000000000000000ff000000796f752068617665206c6f636b6564207468652062617365555249000000000008c379a000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006400000000000000000000000091eabfe8e493f369f48e58fdf2609ff8809506ce57440a6f25fddc25308a385191eabfe8e493f369f48e58fdf2609ff8809506ce57440a6f25fddc25308a3850b10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6020000000000000000000000000000000000002000000080000000000000000062e78cea01bee320cd4e420270b5ea74000d11b0c9f74754ebdbfc544b05a25889c62b640000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000200000000000000000000000000000000000000000000000000000000000000000000000000000000001000000d93c0665000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004000000800000000000000000177e802f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000044000000000000000000000000ddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef5db9ee0a495bf2e6ff9c91a7834c1ba4fdd244a5e8aa4e537bd38aeae4b073aa8dfc202b0000000000000000000000000000000000000000000000000000000046495253542050484153450000000000000000000000000000000000000000167fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe04e6f7420612070617274206f6620416c6c6f776c6973740000000000000000004574686572207472616e73666572206661696c65640000000000000000000000000000000000000000000000000000000000000400000000000000000000000073c6ac6e000000000000000000000000000000000000000000000000000000000000000000184f03e93ff9f4daa797ed6e38ed64bf6a1f01000000000000000000000000000000000000000000000000000004ee2d6d415b85acef810000000000000000000000000000000000000000000004ee2d6d415b85acef80ffffffff000000000000000000000000000000000000000000000000002386f26fc1000000000000000000000000000000000000ffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000005f5e10000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff30313233343536373839616263646566000000000000000000000000000000007f000000000000000000000000000000000000000000000000000000000000002f000000000000000000000000000000000000000000000000000000000000002e6a736f6e000000000000000000000000000000000000000000000000000000f8e1a15aba9398e019f0b49df1a4fde98ee17ae345cb5f6b5e2c27f5033e8ce764a0ae9200000000000000000000000000000000000000000000000000000000617661696c61626c6500000000000000000000000000000000000000000000006e6674206d696e7420616d6f756e7420657865636565647320737570706c792000000000000000000000000000000000000000840000000000000000000000006d6178696d756d206e6674206d696e7420726561636865642e000000000000004e487b71000000000000000000000000000000000000000000000000000000007075626c6963206d696e74206e6f74206c6976652079657400000000000000004d696e74696e6720706861736520656e6465642e0000000000000000000000004e6f7420656e6f75676820657468657200000000000000000000000000000000c65a7bb8d6351c1cf70c95a316cc6a92839c986682d98bc35f958f4883f9d2a85055424c4943000000000000000000000000000000000000000000000000000ca9fbf51f000000000000000000000000000000000000000000000000000000008c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b925290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e56300000000ffffffffffffffffffffffffffffffffffffffffffffffffffffffff5b5e139effffffffffffffffffffffffffffffffffffffffffffffffffffffff80ac58cd000000000000000000000000000000000000000000000000000000005b5e139f0000000000000000000000000000000000000000000000000000000001ffc9a7000000000000000000000000000000000000000000000000000000004906490600000000000000000000000000000000000000000000000000000000ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8f7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe0ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff00fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8f8000000000000000000000000000000000000000000000000ffffffffffffffc0000000000000000000000000000000000000000000000000ffffffffffffffe07fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff000000000000000000000000000000000000000000000001000000000000000039a5844729cae3e308f36a5ce933956d7c6367997d26743ca06a70b77c062d5864283d7b000000000000000000000000000000000000000000000000000000000000000000184f03e93ff9f4daa797ed6e38ed64bf6a1f00ffffffffffffffff1806aa1896bbf26568e884a7374b41e002500962caba6a15023a8d90e8508b830200000200000000000000000000000000000024000000000000000000000000150b7a020000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003ffffffe0ffffffff000000000000000000000000000000000000000000000000000000000200000200000000000000000000000000000000000000000000000000000000d1516e20b11a51633344c2cb1edde32cd1fd438d9cfd7b12da2a475ffb6ce76e

000000000000000000000000b1f7996edd0e42c2ae788bd6dc32beb302b6e85000000000000000000000000058a375108e88b3eb915f89e297891432199ee3d900000000000000000000000000000000000000000000000000000000000000600000000000000000000000000000000000000000000000000000000000000042697066733a2f2f62616679626569637269733478646d7765746a347032677176696274716179327869657435746b66346a6b727579757678786a6c356c6635627669000000000000000000000000000000000000000000000000000000000000

-----Decoded View---------------
Arg [0] : initialOwner (address): 0xB1f7996edd0E42c2aE788BD6Dc32BEb302b6e850
Arg [1] : _recipient (address): 0x58a375108E88B3eb915F89E297891432199eE3D9
Arg [2] : _baseURI (string): ipfs://bafybeicris4xdmwetj4p2gqvibtqay2xiet5tkf4jkruyuvxxjl5lf5bvi

-----Encoded View---------------
7 Constructor Arguments found :
Arg [0] : 000000000000000000000000b1f7996edd0e42c2ae788bd6dc32beb302b6e850
Arg [1] : 00000000000000000000000058a375108e88b3eb915f89e297891432199ee3d9
Arg [2] : 0000000000000000000000000000000000000000000000000000000000000060
Arg [3] : 0000000000000000000000000000000000000000000000000000000000000042
Arg [4] : 697066733a2f2f62616679626569637269733478646d7765746a347032677176
Arg [5] : 696274716179327869657435746b66346a6b727579757678786a6c356c663562
Arg [6] : 7669000000000000000000000000000000000000000000000000000000000000