Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Similar
• Submit Audit
• Compare

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.24;

import "@openzeppelin/contracts/token/ERC721/ERC721.sol";
import "@openzeppelin/contracts/token/ERC721/extensions/ERC721URIStorage.sol";
import "@openzeppelin/contracts/token/ERC721/extensions/ERC721Enumerable.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/utils/ReentrancyGuard.sol";

/**
 * @title KhugaXMaicihSkin
 * @dev ERC-721 NFT contract for Khuga Bash game skins with gacha-style random minting
 * @notice Deployed on Abstract chain (zkSync-based L2)
 * @notice Uses commit-reveal scheme for secure randomness
 */
contract KhugaXMaicihSkin is ERC721, ERC721URIStorage, ERC721Enumerable, Ownable, ReentrancyGuard {
    // ============ Structs ============

    /// @dev Represents a skin type with its metadata and drop probability
    struct SkinType {
        string metadataURI; // IPFS URI for this skin type
        uint256 weight; // Relative weight for probability calculation
        bool active; // Whether this skin can be minted
    }

    /// @dev Represents a user's mint commitment for commit-reveal scheme
    struct MintCommitment {
        bytes32 commitHash; // keccak256(secret)
        uint256 blockNumber; // Block when commitment was made
        uint256 quantity; // Number of NFTs to mint
        uint256 payment; // Actual payment amount in wei
        bool revealed; // Whether already revealed
    }

    // ============ State Variables ============

    /// @dev Counter for auto-incrementing token IDs
    uint256 private _nextTokenId;

    /// @dev Maximum total supply of NFTs (0 means unlimited)
    uint256 private _maxTotalSupply;

    /// @dev Base URI for token metadata
    string private _baseTokenURI;

    /// @dev Mint price in wei (per NFT)
    uint256 private _mintPrice;

    /// @dev Mapping of skin type ID to skin configuration
    mapping(uint256 => SkinType) private _skinTypes;

    /// @dev Total number of skin types ever created (including inactive)
    uint256 private _skinTypeCount;

    /// @dev Sum of all active skin weights for probability calculation
    uint256 private _totalWeight;

    /// @dev Mapping of user address to their mint commitment
    mapping(address => MintCommitment) private _commitments;

    /// @dev Mapping of token ID to its skin type
    mapping(uint256 => uint256) private _tokenSkinType;

    /// @dev Minimum blocks to wait between commit and reveal
    uint256 public constant MIN_REVEAL_DELAY = 1;

    /// @dev Maximum blocks before commitment expires
    uint256 public constant MAX_REVEAL_DELAY = 256;

    /// @dev Whether minting is currently enabled (affects both user and owner minting)
    bool private _mintingEnabled;

    /// @dev Mapping to track which tokens have been upgraded to special skin
    mapping(uint256 => bool) private _tokenUpgraded;

    /// @dev The skin type ID used for special upgrades
    uint256 private _specialSkinTypeId;

    // ============ Events ============

    /// @notice Emitted when a new NFT is minted via gacha
    event GachaMinted(address indexed to, uint256 indexed tokenId, uint256 indexed skinTypeId, string tokenURI);

    /// @notice Emitted when a new NFT is minted by owner
    event NFTMinted(address indexed to, uint256 indexed tokenId, uint256 indexed skinTypeId, string tokenURI);

    /// @notice Emitted when base URI is updated
    event BaseURIUpdated(string newBaseURI);

    /// @notice Emitted when mint price is updated
    event MintPriceUpdated(uint256 oldPrice, uint256 newPrice);

    /// @notice Emitted when funds are withdrawn
    event FundsWithdrawn(address indexed to, uint256 amount);

    /// @notice Emitted when a new skin type is added
    event SkinTypeAdded(uint256 indexed skinTypeId, string metadataURI, uint256 weight);

    /// @notice Emitted when a skin type is updated
    event SkinTypeUpdated(uint256 indexed skinTypeId, string metadataURI, uint256 weight, bool active);

    /// @notice Emitted when a user commits to mint
    event MintCommitted(address indexed user, bytes32 commitHash, uint256 quantity, uint256 blockNumber);

    /// @notice Emitted when a user reveals and receives NFT
    event MintRevealed(address indexed user, uint256[] tokenIds);

    /// @notice Emitted when a commitment is cancelled
    event CommitmentCancelled(address indexed user, uint256 refundAmount);

    /// @notice Emitted when maximum total supply is updated
    event MaxTotalSupplyUpdated(uint256 newMaxSupply);

    /// @notice Emitted when minting phase is toggled
    event MintingPhaseToggled(bool enabled);

    /// @notice Emitted when a token's metadata URI is updated
    event TokenURIUpdated(uint256 indexed tokenId, string newURI);

    /// @notice Emitted when a token is upgraded to special skin
    event TokenUpgraded(uint256 indexed tokenId, uint256 oldSkinTypeId, uint256 newSkinTypeId, string newURI);

    /// @notice Emitted when special skin type ID is set
    event SpecialSkinTypeSet(uint256 indexed specialSkinTypeId);

    // ============ Errors ============

    /// @dev Error when insufficient payment is sent
    error InsufficientPayment(uint256 required, uint256 sent);

    /// @dev Error when withdrawal fails
    error WithdrawalFailed();

    /// @dev Error when no funds to withdraw
    error NoFundsToWithdraw();

    /// @dev Error when no skin types are available
    error NoActiveSkinTypes();

    /// @dev Error when skin type doesn't exist
    error SkinTypeNotFound(uint256 skinTypeId);

    /// @dev Error when skin type is not active
    error SkinTypeNotActive(uint256 skinTypeId);

    /// @dev Error when user already has pending commitment
    error CommitmentAlreadyExists();

    /// @dev Error when no commitment found for user
    error NoCommitmentFound();

    /// @dev Error when commitment already revealed
    error CommitmentAlreadyRevealed();

    /// @dev Error when reveal is too early
    error RevealTooEarly(uint256 currentBlock, uint256 requiredBlock);

    /// @dev Error when commitment has expired
    error CommitmentExpired();

    /// @dev Error when reveal hash doesn't match commitment
    error InvalidRevealSecret();

    /// @dev Error when quantity is zero
    error InvalidQuantity();

    /// @dev Error when maximum supply would be exceeded
    error MaxSupplyExceeded(uint256 currentSupply, uint256 maxSupply, uint256 requested);

    /// @dev Error when minting is disabled
    error MintingDisabled();

    /// @dev Error when special skin type is not set
    error SpecialSkinTypeNotSet();

    /// @dev Error when attempting to set same skin type as special
    error SameSkinTypeAsSpecial();

    /// @dev Error when not enough eligible tokens to upgrade
    error NotEnoughTokensToUpgrade(uint256 available, uint256 requested);

    // ============ Constructor ============

    /**
     * @dev Constructor initializes the NFT collection
     * @param initialOwner Address of the initial contract owner
     * @param initialMintPrice Initial price for minting in wei
     */
    constructor(address initialOwner, uint256 initialMintPrice) ERC721("Khuga X Maicih", "KHGM") Ownable(initialOwner) {
        _mintPrice = initialMintPrice;
    }

    // ============ Gacha Minting (Commit-Reveal) ============

    /**
     * @notice Step 1: Commit to mint NFTs
     * @dev User pays upfront and commits a hash. Must wait at least MIN_REVEAL_DELAY blocks before reveal.
     * @param commitHash keccak256(abi.encodePacked(secret, msg.sender)) where secret is a random bytes32
     * @param quantity Number of NFTs to mint (1 or more)
     */
    function commitMint(bytes32 commitHash, uint256 quantity) external payable nonReentrant {
        if (!_mintingEnabled) revert MintingDisabled();
        if (quantity == 0) revert InvalidQuantity();
        if (_totalWeight == 0) revert NoActiveSkinTypes();

        uint256 totalCost = _mintPrice * quantity;
        if (msg.value < totalCost) {
            revert InsufficientPayment(totalCost, msg.value);
        }

        // Check if user already has a pending commitment
        MintCommitment storage existing = _commitments[msg.sender];
        if (existing.commitHash != bytes32(0) && !existing.revealed) {
            // Check if existing commitment has expired
            if (block.number <= existing.blockNumber + MAX_REVEAL_DELAY) {
                revert CommitmentAlreadyExists();
            }
            // Expired commitment - allow new one (old payment is forfeited)
        }

        _commitments[msg.sender] = MintCommitment({
            commitHash: commitHash, blockNumber: block.number, quantity: quantity, payment: msg.value, revealed: false
        });

        emit MintCommitted(msg.sender, commitHash, quantity, block.number);
    }

    /**
     * @notice Step 2: Reveal secret and receive random NFTs
     * @dev Must be called after MIN_REVEAL_DELAY blocks and before MAX_REVEAL_DELAY blocks
     * @param secret The secret used to create the commit hash
     * @return tokenIds Array of minted token IDs
     */
    function revealMint(bytes32 secret) external nonReentrant returns (uint256[] memory) {
        MintCommitment storage commitment = _commitments[msg.sender];

        if (commitment.commitHash == bytes32(0)) revert NoCommitmentFound();
        if (commitment.revealed) revert CommitmentAlreadyRevealed();

        uint256 revealBlock = commitment.blockNumber + MIN_REVEAL_DELAY;
        if (block.number < revealBlock) {
            revert RevealTooEarly(block.number, revealBlock);
        }

        if (block.number > commitment.blockNumber + MAX_REVEAL_DELAY) {
            revert CommitmentExpired();
        }

        // Verify the secret matches the commitment
        bytes32 expectedHash = keccak256(abi.encodePacked(secret, msg.sender));
        if (expectedHash != commitment.commitHash) {
            revert InvalidRevealSecret();
        }

        commitment.revealed = true;

        // Check max supply before minting
        _checkMaxSupply(commitment.quantity);

        // Generate randomness from secret and blockhash
        bytes32 randomSeed =
            keccak256(abi.encodePacked(secret, blockhash(commitment.blockNumber), msg.sender, block.timestamp));

        uint256[] memory tokenIds = new uint256[](commitment.quantity);

        for (uint256 i = 0; i < commitment.quantity; i++) {
            // Generate unique random for each NFT
            uint256 randomValue = uint256(keccak256(abi.encodePacked(randomSeed, i)));
            uint256 skinTypeId = _selectSkinType(randomValue);

            uint256 tokenId = _nextTokenId++;
            _safeMint(msg.sender, tokenId);
            _setTokenURI(tokenId, _skinTypes[skinTypeId].metadataURI);
            _tokenSkinType[tokenId] = skinTypeId;

            tokenIds[i] = tokenId;

            emit GachaMinted(msg.sender, tokenId, skinTypeId, _skinTypes[skinTypeId].metadataURI);
        }

        emit MintRevealed(msg.sender, tokenIds);
        return tokenIds;
    }

    /**
     * @dev Internal function to check if minting would exceed max supply
     */
    function _checkMaxSupply(uint256 quantity) internal view {
        if (_maxTotalSupply > 0) {
            uint256 currentSupply = totalSupply();
            if (currentSupply + quantity > _maxTotalSupply) {
                revert MaxSupplyExceeded(currentSupply, _maxTotalSupply, quantity);
            }
        }
    }

    /**
     * @notice Cancel a pending commitment and get a refund
     * @dev Can only cancel if not yet revealed and commitment exists
     */
    function cancelCommitment() external nonReentrant {
        MintCommitment storage commitment = _commitments[msg.sender];

        if (commitment.commitHash == bytes32(0)) revert NoCommitmentFound();
        if (commitment.revealed) revert CommitmentAlreadyRevealed();

        // Refund the exact amount that was paid
        uint256 refundAmount = commitment.payment;

        // Clear the commitment
        delete _commitments[msg.sender];

        // Refund the user
        (bool success,) = payable(msg.sender).call{value: refundAmount}("");
        if (!success) revert WithdrawalFailed();

        emit CommitmentCancelled(msg.sender, refundAmount);
    }

    /**
     * @notice Get user's current commitment status
     * @param user Address to check
     * @return commitHash The commitment hash
     * @return blockNumber Block when committed
     * @return quantity Number of NFTs to mint
     * @return payment Amount paid in wei
     * @return revealed Whether already revealed
     * @return canReveal Whether user can reveal now
     * @return expired Whether commitment has expired
     */
    function getCommitment(address user)
        external
        view
        returns (
            bytes32 commitHash,
            uint256 blockNumber,
            uint256 quantity,
            uint256 payment,
            bool revealed,
            bool canReveal,
            bool expired
        )
    {
        MintCommitment storage c = _commitments[user];
        commitHash = c.commitHash;
        blockNumber = c.blockNumber;
        quantity = c.quantity;
        payment = c.payment;
        revealed = c.revealed;

        if (c.commitHash != bytes32(0) && !c.revealed) {
            canReveal =
                block.number >= c.blockNumber + MIN_REVEAL_DELAY && block.number <= c.blockNumber + MAX_REVEAL_DELAY;
            expired = block.number > c.blockNumber + MAX_REVEAL_DELAY;
        }
    }

    // ============ Skin Type Management (Owner Only) ============

    /**
     * @notice Add a new skin type
     * @dev Only callable by the contract owner
     * @param metadataURI IPFS URI for the skin metadata
     * @param weight Relative weight for drop probability (higher = more common)
     * @return skinTypeId The ID of the newly created skin type
     */
    function addSkinType(string memory metadataURI, uint256 weight) external onlyOwner returns (uint256) {
        uint256 skinTypeId = _skinTypeCount++;

        _skinTypes[skinTypeId] = SkinType({metadataURI: metadataURI, weight: weight, active: true});

        _totalWeight += weight;

        emit SkinTypeAdded(skinTypeId, metadataURI, weight);
        return skinTypeId;
    }

    /**
     * @notice Update an existing skin type
     * @dev Only callable by the contract owner
     * @param skinTypeId ID of the skin type to update
     * @param metadataURI New IPFS URI for the skin metadata
     * @param weight New relative weight for drop probability
     * @param active Whether this skin type should be active
     */
    function updateSkinType(uint256 skinTypeId, string memory metadataURI, uint256 weight, bool active)
        external
        onlyOwner
    {
        if (skinTypeId >= _skinTypeCount) revert SkinTypeNotFound(skinTypeId);

        SkinType storage skin = _skinTypes[skinTypeId];

        // Update total weight
        if (skin.active) {
            _totalWeight -= skin.weight;
        }
        if (active) {
            _totalWeight += weight;
        }

        skin.metadataURI = metadataURI;
        skin.weight = weight;
        skin.active = active;

        emit SkinTypeUpdated(skinTypeId, metadataURI, weight, active);
    }

    /**
     * @notice Deactivate a skin type (soft delete)
     * @dev Only callable by the contract owner
     * @param skinTypeId ID of the skin type to deactivate
     */
    function deactivateSkinType(uint256 skinTypeId) external onlyOwner {
        if (skinTypeId >= _skinTypeCount) revert SkinTypeNotFound(skinTypeId);

        SkinType storage skin = _skinTypes[skinTypeId];
        if (!skin.active) revert SkinTypeNotActive(skinTypeId);

        _totalWeight -= skin.weight;
        skin.active = false;

        emit SkinTypeUpdated(skinTypeId, skin.metadataURI, skin.weight, false);
    }

    /**
     * @notice Get skin type details
     * @param skinTypeId ID of the skin type
     * @return metadataURI The metadata URI
     * @return weight The drop weight
     * @return active Whether the skin is active
     * @return dropChance The percentage chance (in basis points, 10000 = 100%)
     */
    function getSkinType(uint256 skinTypeId)
        external
        view
        returns (string memory metadataURI, uint256 weight, bool active, uint256 dropChance)
    {
        if (skinTypeId >= _skinTypeCount) revert SkinTypeNotFound(skinTypeId);

        SkinType storage skin = _skinTypes[skinTypeId];
        metadataURI = skin.metadataURI;
        weight = skin.weight;
        active = skin.active;

        if (_totalWeight > 0 && skin.active) {
            dropChance = (skin.weight * 10000) / _totalWeight;
        }
    }

    /**
     * @notice Get all skin types
     * @return ids Array of skin type IDs
     * @return metadataURIs Array of metadata URIs
     * @return weights Array of weights
     * @return actives Array of active statuses
     * @return dropChances Array of drop chances (basis points)
     */
    function getAllSkinTypes()
        external
        view
        returns (
            uint256[] memory ids,
            string[] memory metadataURIs,
            uint256[] memory weights,
            bool[] memory actives,
            uint256[] memory dropChances
        )
    {
        ids = new uint256[](_skinTypeCount);
        metadataURIs = new string[](_skinTypeCount);
        weights = new uint256[](_skinTypeCount);
        actives = new bool[](_skinTypeCount);
        dropChances = new uint256[](_skinTypeCount);

        for (uint256 i = 0; i < _skinTypeCount; i++) {
            SkinType storage skin = _skinTypes[i];
            ids[i] = i;
            metadataURIs[i] = skin.metadataURI;
            weights[i] = skin.weight;
            actives[i] = skin.active;

            if (_totalWeight > 0 && skin.active) {
                dropChances[i] = (skin.weight * 10000) / _totalWeight;
            }
        }
    }

    /**
     * @notice Get the total number of skin types
     * @return Total count of skin types (including inactive)
     */
    function getSkinTypeCount() external view returns (uint256) {
        return _skinTypeCount;
    }

    /**
     * @notice Get the total weight of all active skin types
     * @return Total weight
     */
    function getTotalWeight() external view returns (uint256) {
        return _totalWeight;
    }

    /**
     * @notice Get the skin type of a specific token
     * @param tokenId The token ID to query
     * @return skinTypeId The skin type ID of the token
     */
    function getTokenSkinType(uint256 tokenId) external view returns (uint256) {
        _requireOwned(tokenId);
        return _tokenSkinType[tokenId];
    }

    // ============ Owner Minting (Free, Direct) ============

    /**
     * @notice Mint a specific skin type to an address (owner only, free)
     * @dev Only callable by the contract owner, no payment required
     * @param to Address to receive the NFT
     * @param skinTypeId ID of the skin type to mint
     * @return tokenId The ID of the newly minted token
     */
    function safeMint(address to, uint256 skinTypeId) public onlyOwner returns (uint256) {
        if (!_mintingEnabled) revert MintingDisabled();
        if (skinTypeId >= _skinTypeCount) revert SkinTypeNotFound(skinTypeId);
        if (!_skinTypes[skinTypeId].active) revert SkinTypeNotActive(skinTypeId);

        // Check max supply before minting
        _checkMaxSupply(1);

        uint256 tokenId = _nextTokenId++;
        _safeMint(to, tokenId);
        _setTokenURI(tokenId, _skinTypes[skinTypeId].metadataURI);
        _tokenSkinType[tokenId] = skinTypeId;

        emit NFTMinted(to, tokenId, skinTypeId, _skinTypes[skinTypeId].metadataURI);
        return tokenId;
    }

    /**
     * @notice Batch mint specific skin types to an address (owner only, free)
     * @dev Only callable by the contract owner
     * @param to Address to receive the NFTs
     * @param skinTypeIds Array of skin type IDs to mint
     * @return tokenIds Array of newly minted token IDs
     */
    function batchMint(address to, uint256[] memory skinTypeIds) public onlyOwner returns (uint256[] memory) {
        if (!_mintingEnabled) revert MintingDisabled();
        uint256[] memory tokenIds = new uint256[](skinTypeIds.length);

        for (uint256 i = 0; i < skinTypeIds.length; i++) {
            tokenIds[i] = safeMint(to, skinTypeIds[i]);
        }

        return tokenIds;
    }

    /**
     * @notice Enable or disable minting phase (affects both user and owner minting)
     * @dev Only callable by the contract owner
     * @param enabled Whether minting should be enabled
     */
    function setMintingEnabled(bool enabled) external onlyOwner {
        _mintingEnabled = enabled;
        emit MintingPhaseToggled(enabled);
    }

    // ============ Price & Withdrawal ============

    /**
     * @notice Set the mint price
     * @dev Only callable by the contract owner
     * @param newPrice New mint price in wei
     */
    function setMintPrice(uint256 newPrice) external onlyOwner {
        uint256 oldPrice = _mintPrice;
        _mintPrice = newPrice;
        emit MintPriceUpdated(oldPrice, newPrice);
    }

    /**
     * @notice Get the current mint price
     * @return Current mint price in wei
     */
    function getMintPrice() external view returns (uint256) {
        return _mintPrice;
    }

    /**
     * @notice Withdraw all contract funds to the owner
     * @dev Only callable by the contract owner
     */
    function withdraw() external onlyOwner nonReentrant {
        uint256 balance = address(this).balance;
        if (balance == 0) {
            revert NoFundsToWithdraw();
        }

        (bool success,) = payable(owner()).call{value: balance}("");
        if (!success) {
            revert WithdrawalFailed();
        }

        emit FundsWithdrawn(owner(), balance);
    }

    /**
     * @notice Withdraw funds to a specific address
     * @dev Only callable by the contract owner
     * @param to Address to receive the funds
     */
    function withdrawTo(address payable to) external onlyOwner nonReentrant {
        require(to != address(0), "KhugaXMaicihSkin: withdraw to zero address");

        uint256 balance = address(this).balance;
        if (balance == 0) {
            revert NoFundsToWithdraw();
        }

        (bool success,) = to.call{value: balance}("");
        if (!success) {
            revert WithdrawalFailed();
        }

        emit FundsWithdrawn(to, balance);
    }

    /**
     * @notice Get the contract balance
     * @return Contract balance in wei
     */
    function getContractBalance() external view returns (uint256) {
        return address(this).balance;
    }

    // ============ Query Functions ============

    /**
     * @notice Check if an address owns any NFTs and return the count
     * @dev This is the custom function requested for ownership verification
     * @param owner Address to check for NFT ownership
     * @return hasToken Boolean indicating if the address owns any NFTs
     * @return balance Number of NFTs owned by the address
     */
    function checkOwnership(address owner) external view returns (bool hasToken, uint256 balance) {
        require(owner != address(0), "KhugaXMaicihSkin: address zero is not valid");
        balance = balanceOf(owner);
        hasToken = balance > 0;
    }

    /**
     * @notice Get all token IDs owned by an address
     * @dev Uses ERC721Enumerable to iterate through owned tokens
     * @param owner Address to get tokens for
     * @return tokenIds Array of token IDs owned by the address
     */
    function tokensOfOwner(address owner) external view returns (uint256[] memory) {
        uint256 tokenCount = balanceOf(owner);
        uint256[] memory tokenIds = new uint256[](tokenCount);

        for (uint256 i = 0; i < tokenCount; i++) {
            tokenIds[i] = tokenOfOwnerByIndex(owner, i);
        }

        return tokenIds;
    }

    /**
     * @notice Set the base URI for all token metadata
     * @dev Only callable by the contract owner
     * @param baseURI New base URI string
     */
    function setBaseURI(string memory baseURI) external onlyOwner {
        _baseTokenURI = baseURI;
        emit BaseURIUpdated(baseURI);
    }

    /**
     * @notice Update the metadata URI for a specific token
     * @dev Only callable by the contract owner
     * @param tokenId The token ID to update
     * @param newURI The new metadata URI for the token
     */
    function updateTokenURI(uint256 tokenId, string memory newURI) external onlyOwner {
        _requireOwned(tokenId);
        _setTokenURI(tokenId, newURI);
        emit TokenURIUpdated(tokenId, newURI);
    }

    /**
     * @notice Get the current token counter (next token ID to be minted)
     * @return Current value of the token counter
     */
    function getCurrentTokenId() external view returns (uint256) {
        return _nextTokenId;
    }

    /**
     * @notice Get the total number of tokens minted
     * @return Total supply of tokens
     */
    function totalMinted() external view returns (uint256) {
        return _nextTokenId;
    }

    /**
     * @notice Set the maximum total supply of NFTs
     * @dev Only callable by the contract owner. Set to 0 for unlimited supply.
     * @param maxSupply Maximum number of NFTs that can be minted (0 = unlimited)
     */
    function setMaxTotalSupply(uint256 maxSupply) external onlyOwner {
        uint256 currentSupply = totalSupply();
        if (maxSupply > 0 && currentSupply > maxSupply) {
            revert MaxSupplyExceeded(currentSupply, maxSupply, 0);
        }
        _maxTotalSupply = maxSupply;
        emit MaxTotalSupplyUpdated(maxSupply);
    }

    /**
     * @notice Get the maximum total supply
     * @return Maximum total supply (0 means unlimited)
     */
    function maxTotalSupply() external view returns (uint256) {
        return _maxTotalSupply;
    }

    /**
     * @notice Check if minting is currently enabled
     * @return Whether minting is enabled (affects both user and owner minting)
     */
    function isMintingEnabled() external view returns (bool) {
        return _mintingEnabled;
    }

    // ============ Special Skin Upgrades (Owner Only) ============

    /**
     * @notice Set the skin type ID to use for special upgrades
     * @dev Only callable by the contract owner
     * @param skinTypeId The skin type ID to use as special tier
     */
    function setSpecialSkinTypeId(uint256 skinTypeId) external onlyOwner {
        if (skinTypeId >= _skinTypeCount) revert SkinTypeNotFound(skinTypeId);
        if (_specialSkinTypeId == skinTypeId) revert SameSkinTypeAsSpecial();

        _specialSkinTypeId = skinTypeId;
        emit SpecialSkinTypeSet(skinTypeId);
    }

    /**
     * @notice Get the configured special skin type ID
     * @return The skin type ID used for upgrades
     */
    function getSpecialSkinTypeId() external view returns (uint256) {
        return _specialSkinTypeId;
    }

    /**
     * @notice Check if a token has been upgraded to special skin
     * @param tokenId The token ID to check
     * @return Whether the token has been upgraded
     */
    function isTokenUpgraded(uint256 tokenId) external view returns (bool) {
        _requireOwned(tokenId);
        return _tokenUpgraded[tokenId];
    }

    /**
     * @notice Get all token IDs that have been upgraded to special skin
     * @return tokenIds Array of upgraded token IDs
     */
    function getUpgradedTokens() external view returns (uint256[] memory) {
        uint256 total = totalSupply();
        uint256[] memory tokenIds = new uint256[](total);
        uint256 count = 0;

        for (uint256 i = 0; i < total; i++) {
            uint256 tokenId = i;
            if (_tokenUpgraded[tokenId]) {
                tokenIds[count] = tokenId;
                count++;
            }
        }

        // Resize array to actual count
        uint256[] memory result = new uint256[](count);
        for (uint256 i = 0; i < count; i++) {
            result[i] = tokenIds[i];
        }

        return result;
    }

    /**
     * @notice Get all token IDs of a specific skin type
     * @param skinTypeId The skin type ID to query
     * @param includeUpgraded Whether to include already upgraded tokens
     * @return tokenIds Array of token IDs with the specified skin type
     */
    function getTokensBySkinType(uint256 skinTypeId, bool includeUpgraded) external view returns (uint256[] memory) {
        if (skinTypeId >= _skinTypeCount) revert SkinTypeNotFound(skinTypeId);

        uint256 total = totalSupply();
        uint256[] memory tokenIds = new uint256[](total);
        uint256 count = 0;

        for (uint256 i = 0; i < total; i++) {
            if (_tokenSkinType[i] == skinTypeId) {
                if (includeUpgraded || !_tokenUpgraded[i]) {
                    tokenIds[count] = i;
                    count++;
                }
            }
        }

        // Resize array to actual count
        uint256[] memory result = new uint256[](count);
        for (uint256 i = 0; i < count; i++) {
            result[i] = tokenIds[i];
        }

        return result;
    }

    /**
     * @notice Randomly upgrade tokens from a source skin type to special skin
     * @dev Uses on-chain randomness with Fisher-Yates shuffle. Only non-upgraded tokens are eligible.
     * @param sourceSkinTypeId The skin type ID to select tokens from
     * @param count The number of tokens to upgrade
     * @return upgradedTokenIds Array of token IDs that were upgraded
     */
    function upgradeRandomTokensToSpecial(uint256 sourceSkinTypeId, uint256 count)
        external
        onlyOwner
        returns (uint256[] memory)
    {
        // Validate inputs
        if (_specialSkinTypeId == 0) revert SpecialSkinTypeNotSet();
        if (_specialSkinTypeId == sourceSkinTypeId) revert SameSkinTypeAsSpecial();
        if (sourceSkinTypeId >= _skinTypeCount) revert SkinTypeNotFound(sourceSkinTypeId);
        if (count == 0) revert InvalidQuantity();

        // Collect all eligible tokens (non-upgraded tokens of source skin type)
        uint256 total = totalSupply();
        uint256[] memory eligibleTokens = new uint256[](total);
        uint256 eligibleCount = 0;

        for (uint256 i = 0; i < total; i++) {
            if (_tokenSkinType[i] == sourceSkinTypeId && !_tokenUpgraded[i]) {
                eligibleTokens[eligibleCount] = i;
                eligibleCount++;
            }
        }

        if (eligibleCount < count) revert NotEnoughTokensToUpgrade(eligibleCount, count);

        // Generate random seed using blockhash and timestamp
        bytes32 seed =
            keccak256(abi.encodePacked(blockhash(block.number - 1), block.timestamp, sourceSkinTypeId, count));

        // Fisher-Yates shuffle to randomly select tokens
        for (uint256 i = eligibleCount - 1; i > 0; i--) {
            uint256 j = uint256(keccak256(abi.encodePacked(seed, i))) % (i + 1);

            // Swap
            uint256 temp = eligibleTokens[i];
            eligibleTokens[i] = eligibleTokens[j];
            eligibleTokens[j] = temp;
        }

        // Upgrade the first 'count' tokens
        uint256[] memory upgradedTokenIds = new uint256[](count);
        for (uint256 i = 0; i < count; i++) {
            uint256 tokenId = eligibleTokens[i];

            // Update skin type and metadata
            uint256 oldSkinTypeId = _tokenSkinType[tokenId];
            _tokenSkinType[tokenId] = _specialSkinTypeId;
            _setTokenURI(tokenId, _skinTypes[_specialSkinTypeId].metadataURI);
            _tokenUpgraded[tokenId] = true;

            upgradedTokenIds[i] = tokenId;

            emit TokenUpgraded(tokenId, oldSkinTypeId, _specialSkinTypeId, _skinTypes[_specialSkinTypeId].metadataURI);
        }

        return upgradedTokenIds;
    }

    // ============ Internal Functions ============

    /**
     * @dev Select a skin type based on weighted random selection
     * @param randomValue Random value to use for selection
     * @return skinTypeId The selected skin type ID
     */
    function _selectSkinType(uint256 randomValue) internal view returns (uint256) {
        uint256 roll = randomValue % _totalWeight;
        uint256 cumulative = 0;

        for (uint256 i = 0; i < _skinTypeCount; i++) {
            if (_skinTypes[i].active) {
                cumulative += _skinTypes[i].weight;
                if (roll < cumulative) {
                    return i;
                }
            }
        }

        // Fallback (should never reach here if weights are set correctly)
        revert NoActiveSkinTypes();
    }

    // ============ Override Functions ============

    /**
     * @dev Override _baseURI to return the stored base URI
     */
    function _baseURI() internal view override returns (string memory) {
        return _baseTokenURI;
    }

    /**
     * @dev Override tokenURI to use ERC721URIStorage implementation
     */
    function tokenURI(uint256 tokenId) public view override(ERC721, ERC721URIStorage) returns (string memory) {
        return super.tokenURI(tokenId);
    }

    /**
     * @dev Override supportsInterface for multiple inheritance
     */
    function supportsInterface(bytes4 interfaceId)
        public
        view
        override(ERC721, ERC721URIStorage, ERC721Enumerable)
        returns (bool)
    {
        return super.supportsInterface(interfaceId);
    }

    /**
     * @dev Override _update for ERC721Enumerable compatibility
     */
    function _update(address to, uint256 tokenId, address auth)
        internal
        override(ERC721, ERC721Enumerable)
        returns (address)
    {
        return super._update(to, tokenId, auth);
    }

    /**
     * @dev Override _increaseBalance for ERC721Enumerable compatibility
     */
    function _increaseBalance(address account, uint128 value) internal override(ERC721, ERC721Enumerable) {
        super._increaseBalance(account, value);
    }

    /**
     * @dev Receive function to accept ETH
     */
    receive() external payable {}
}

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

pragma solidity ^0.8.24;

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_;
    }

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

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

    /// @inheritdoc IERC721
    function ownerOf(uint256 tokenId) public view virtual returns (address) {
        return _requireOwned(tokenId);
    }

    /// @inheritdoc IERC721Metadata
    function name() public view virtual returns (string memory) {
        return _name;
    }

    /// @inheritdoc IERC721Metadata
    function symbol() public view virtual returns (string memory) {
        return _symbol;
    }

    /// @inheritdoc IERC721Metadata
    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 "";
    }

    /// @inheritdoc IERC721
    function approve(address to, uint256 tokenId) public virtual {
        _approve(to, tokenId, _msgSender());
    }

    /// @inheritdoc IERC721
    function getApproved(uint256 tokenId) public view virtual returns (address) {
        _requireOwned(tokenId);

        return _getApproved(tokenId);
    }

    /// @inheritdoc IERC721
    function setApprovalForAll(address operator, bool approved) public virtual {
        _setApprovalForAll(_msgSender(), operator, approved);
    }

    /// @inheritdoc IERC721
    function isApprovedForAll(address owner, address operator) public view virtual returns (bool) {
        return _operatorApprovals[owner][operator];
    }

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

    /// @inheritdoc IERC721
    function safeTransferFrom(address from, address to, uint256 tokenId) public {
        safeTransferFrom(from, to, tokenId, "");
    }

    /// @inheritdoc IERC721
    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.5.0) (token/ERC721/extensions/ERC721URIStorage.sol)

pragma solidity ^0.8.24;

import {ERC721} from "../ERC721.sol";
import {IERC721Metadata} from "./IERC721Metadata.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;

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

    /// @inheritdoc IERC721Metadata
    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 {IERC4906-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.5.0) (token/ERC721/extensions/ERC721Enumerable.sol)

pragma solidity ^0.8.24;

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

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

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

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

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

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

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

    /// @inheritdoc IERC721Enumerable
    function totalSupply() public view virtual returns (uint256) {
        return _allTokens.length;
    }

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

    /// @inheritdoc ERC721
    function _update(address to, uint256 tokenId, address auth) internal virtual override returns (address) {
        address previousOwner = super._update(to, tokenId, auth);

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

        return previousOwner;
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.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.5.0) (utils/ReentrancyGuard.sol)

pragma solidity ^0.8.20;

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

/**
 * @dev Contract module that helps prevent reentrant calls to a function.
 *
 * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier
 * available, which can be applied to functions to make sure there are no nested
 * (reentrant) calls to them.
 *
 * Note that because there is a single `nonReentrant` guard, functions marked as
 * `nonReentrant` may not call one another. This can be worked around by making
 * those functions `private`, and then adding `external` `nonReentrant` entry
 * points to them.
 *
 * TIP: If EIP-1153 (transient storage) is available on the chain you're deploying at,
 * consider using {ReentrancyGuardTransient} instead.
 *
 * TIP: If you would like to learn more about reentrancy and alternative ways
 * to protect against it, check out our blog post
 * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].
 *
 * IMPORTANT: Deprecated. This storage-based reentrancy guard will be removed and replaced
 * by the {ReentrancyGuardTransient} variant in v6.0.
 *
 * @custom:stateless
 */
abstract contract ReentrancyGuard {
    using StorageSlot for bytes32;

    // keccak256(abi.encode(uint256(keccak256("openzeppelin.storage.ReentrancyGuard")) - 1)) & ~bytes32(uint256(0xff))
    bytes32 private constant REENTRANCY_GUARD_STORAGE =
        0x9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00;

    // Booleans are more expensive than uint256 or any type that takes up a full
    // word because each write operation emits an extra SLOAD to first read the
    // slot's contents, replace the bits taken up by the boolean, and then write
    // back. This is the compiler's defense against contract upgrades and
    // pointer aliasing, and it cannot be disabled.

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

    /**
     * @dev Unauthorized reentrant call.
     */
    error ReentrancyGuardReentrantCall();

    constructor() {
        _reentrancyGuardStorageSlot().getUint256Slot().value = NOT_ENTERED;
    }

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

    /**
     * @dev A `view` only version of {nonReentrant}. Use to block view functions
     * from being called, preventing reading from inconsistent contract state.
     *
     * CAUTION: This is a "view" modifier and does not change the reentrancy
     * status. Use it only on view functions. For payable or non-payable functions,
     * use the standard {nonReentrant} modifier instead.
     */
    modifier nonReentrantView() {
        _nonReentrantBeforeView();
        _;
    }

    function _nonReentrantBeforeView() private view {
        if (_reentrancyGuardEntered()) {
            revert ReentrancyGuardReentrantCall();
        }
    }

    function _nonReentrantBefore() private {
        // On the first call to nonReentrant, _status will be NOT_ENTERED
        _nonReentrantBeforeView();

        // Any calls to nonReentrant after this point will fail
        _reentrancyGuardStorageSlot().getUint256Slot().value = ENTERED;
    }

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

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

    function _reentrancyGuardStorageSlot() internal pure virtual returns (bytes32) {
        return REENTRANCY_GUARD_STORAGE;
    }
}

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

pragma solidity >=0.6.2;

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

pragma solidity >=0.6.2;

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.5.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 provides 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 {IERC721Receiver-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(reason, 0x20), mload(reason))
                    }
                }
            }
        }
    }
}

// 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.5.0) (utils/Strings.sol)

pragma solidity ^0.8.24;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    /**
     * @dev Converts a `bytes` buffer to its ASCII `string` hexadecimal representation.
     */
    function toHexString(bytes memory input) internal pure returns (string memory) {
        unchecked {
            bytes memory buffer = new bytes(2 * input.length + 2);
            buffer[0] = "0";
            buffer[1] = "x";
            for (uint256 i = 0; i < input.length; ++i) {
                uint8 v = uint8(input[i]);
                buffer[2 * i + 2] = HEX_DIGITS[v >> 4];
                buffer[2 * i + 3] = HEX_DIGITS[v & 0xf];
            }
            return string(buffer);
        }
    }

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

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

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

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

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

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

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

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

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

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

    uint256 private constant ABS_MIN_INT256 = 2 ** 255;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        return value;
    }

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

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

        return string(output);
    }

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

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.4.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 {
    /// @inheritdoc IERC165
    function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {
        return interfaceId == type(IERC165).interfaceId;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.5.0) (interfaces/draft-IERC6093.sol)

pragma solidity >=0.8.4;

/**
 * @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-721.
     * 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.4.0) (interfaces/IERC4906.sol)

pragma solidity >=0.6.2;

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.4.0) (interfaces/IERC165.sol)

pragma solidity >=0.4.16;

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

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

pragma solidity >=0.6.2;

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

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

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

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

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

pragma solidity ^0.8.20;

/**
 * @dev Library for reading and writing primitive types to specific storage slots.
 *
 * Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.
 * This library helps with reading and writing to such slots without the need for inline assembly.
 *
 * The functions in this library return Slot structs that contain a `value` member that can be used to read or write.
 *
 * Example usage to set ERC-1967 implementation slot:
 * ```solidity
 * contract ERC1967 {
 *     // Define the slot. Alternatively, use the SlotDerivation library to derive the slot.
 *     bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;
 *
 *     function _getImplementation() internal view returns (address) {
 *         return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;
 *     }
 *
 *     function _setImplementation(address newImplementation) internal {
 *         require(newImplementation.code.length > 0);
 *         StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;
 *     }
 * }
 * ```
 *
 * TIP: Consider using this library along with {SlotDerivation}.
 */
library StorageSlot {
    struct AddressSlot {
        address value;
    }

    struct BooleanSlot {
        bool value;
    }

    struct Bytes32Slot {
        bytes32 value;
    }

    struct Uint256Slot {
        uint256 value;
    }

    struct Int256Slot {
        int256 value;
    }

    struct StringSlot {
        string value;
    }

    struct BytesSlot {
        bytes value;
    }

    /**
     * @dev Returns an `AddressSlot` with member `value` located at `slot`.
     */
    function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `BooleanSlot` with member `value` located at `slot`.
     */
    function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `Bytes32Slot` with member `value` located at `slot`.
     */
    function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `Uint256Slot` with member `value` located at `slot`.
     */
    function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `Int256Slot` with member `value` located at `slot`.
     */
    function getInt256Slot(bytes32 slot) internal pure returns (Int256Slot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns a `StringSlot` with member `value` located at `slot`.
     */
    function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `StringSlot` representation of the string storage pointer `store`.
     */
    function getStringSlot(string storage store) internal pure returns (StringSlot storage r) {
        assembly ("memory-safe") {
            r.slot := store.slot
        }
    }

    /**
     * @dev Returns a `BytesSlot` with member `value` located at `slot`.
     */
    function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {
        assembly ("memory-safe") {
            r.slot := slot
        }
    }

    /**
     * @dev Returns an `BytesSlot` representation of the bytes storage pointer `store`.
     */
    function getBytesSlot(bytes storage store) internal pure returns (BytesSlot storage r) {
        assembly ("memory-safe") {
            r.slot := store.slot
        }
    }
}

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

pragma solidity >=0.4.16;

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

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

pragma solidity >=0.5.0;

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

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

    /**
     * @dev Return the 512-bit multiplication of two uint256.
     *
     * The result is stored in two 256 variables such that product = high * 2²⁵⁶ + low.
     */
    function mul512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
        // 512-bit multiply [high low] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
        // the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
        // variables such that product = high * 2²⁵⁶ + low.
        assembly ("memory-safe") {
            let mm := mulmod(a, b, not(0))
            low := mul(a, b)
            high := sub(sub(mm, low), lt(mm, low))
        }
    }

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

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

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

    /**
     * @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
     */
    function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            success = b > 0;
            assembly ("memory-safe") {
                // The `DIV` opcode returns zero when the denominator is 0.
                result := div(a, b)
            }
        }
    }

    /**
     * @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
     */
    function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
        unchecked {
            success = b > 0;
            assembly ("memory-safe") {
                // The `MOD` opcode returns zero when the denominator is 0.
                result := mod(a, b)
            }
        }
    }

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

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

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

    /**
     * @dev Branchless ternary evaluation for `condition ? a : b`. 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. `condition ? a : b`) to only compute
     * one branch when needed, making this function more expensive.
     */
    function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * SafeCast.toUint(condition));
        }
    }

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

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

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

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

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

    /**
     * @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
     * denominator == 0.
     *
     * Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
     * Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            (uint256 high, uint256 low) = mul512(x, y);

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

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

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

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

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

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

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

                // Divide [high low] by twos.
                low := div(low, twos)

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

            // Shift in bits from high into low.
            low |= high * twos;

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

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

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

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

    /**
     * @dev Calculates floor(x * y >> n) with full precision. Throws if result overflows a uint256.
     */
    function mulShr(uint256 x, uint256 y, uint8 n) internal pure returns (uint256 result) {
        unchecked {
            (uint256 high, uint256 low) = mul512(x, y);
            if (high >= 1 << n) {
                Panic.panic(Panic.UNDER_OVERFLOW);
            }
            return (high << (256 - n)) | (low >> n);
        }
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        uint256 mLen = m.length;

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

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

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

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

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

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

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

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

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

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

    /**
     * @dev Return the log in base 2 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     */
    function log2(uint256 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // If upper 8 bits of 16-bit half set, add 8 to result
        r |= SafeCast.toUint((x >> r) > 0xff) << 3;
        // If upper 4 bits of 8-bit half set, add 4 to result
        r |= SafeCast.toUint((x >> r) > 0xf) << 2;

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

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

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

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

    /**
     * @dev Return the log in base 256 of a positive value rounded towards zero.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 x) internal pure returns (uint256 r) {
        // If value has upper 128 bits set, log2 result is at least 128
        r = SafeCast.toUint(x > 0xffffffffffffffffffffffffffffffff) << 7;
        // If upper 64 bits of 128-bit half set, add 64 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffffffffffff) << 6;
        // If upper 32 bits of 64-bit half set, add 32 to result
        r |= SafeCast.toUint((x >> r) > 0xffffffff) << 5;
        // If upper 16 bits of 32-bit half set, add 16 to result
        r |= SafeCast.toUint((x >> r) > 0xffff) << 4;
        // Add 1 if upper 8 bits of 16-bit half set, and divide accumulated result by 8
        return (r >> 3) | SafeCast.toUint((x >> r) > 0xff);
    }

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

pragma solidity ^0.8.24;

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

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

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

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

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

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

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

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

        return result;
    }

    /**
     * @dev Moves the content of `buffer`, from `start` (included) to the end of `buffer` to the start of that buffer.
     *
     * NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/splice[Javascript's `Array.splice`]
     */
    function splice(bytes memory buffer, uint256 start) internal pure returns (bytes memory) {
        return splice(buffer, start, buffer.length);
    }

    /**
     * @dev Moves the content of `buffer`, from `start` (included) to end (excluded) to the start of that buffer. The
     * `end` argument is truncated to the length of the `buffer`.
     *
     * NOTE: This function modifies the provided buffer in place. If you need to preserve the original buffer, use {slice} instead
     * NOTE: replicates the behavior of https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/splice[Javascript's `Array.splice`]
     */
    function splice(bytes memory buffer, uint256 start, uint256 end) internal pure returns (bytes memory) {
        // sanitize
        end = Math.min(end, buffer.length);
        start = Math.min(start, end);

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

        return buffer;
    }

    /**
     * @dev Concatenate an array of bytes into a single bytes object.
     *
     * For fixed bytes types, we recommend using the solidity built-in `bytes.concat` or (equivalent)
     * `abi.encodePacked`.
     *
     * NOTE: this could be done in assembly with a single loop that expands starting at the FMP, but that would be
     * significantly less readable. It might be worth benchmarking the savings of the full-assembly approach.
     */
    function concat(bytes[] memory buffers) internal pure returns (bytes memory) {
        uint256 length = 0;
        for (uint256 i = 0; i < buffers.length; ++i) {
            length += buffers[i].length;
        }

        bytes memory result = new bytes(length);

        uint256 offset = 0x20;
        for (uint256 i = 0; i < buffers.length; ++i) {
            bytes memory input = buffers[i];
            assembly ("memory-safe") {
                mcopy(add(result, offset), add(input, 0x20), mload(input))
            }
            unchecked {
                offset += input.length;
            }
        }

        return result;
    }

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

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

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

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

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

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

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

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

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

pragma solidity >=0.6.2;

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

// 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)
        }
    }
}

{
  "remappings": [
    "@openzeppelin/contracts/=lib/openzeppelin-contracts/contracts/",
    "forge-std/=lib/forge-std/src/",
    "erc4626-tests/=lib/openzeppelin-contracts/lib/erc4626-tests/",
    "halmos-cheatcodes/=lib/openzeppelin-contracts/lib/halmos-cheatcodes/src/",
    "openzeppelin-contracts/=lib/openzeppelin-contracts/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "metadata": {
    "useLiteralContent": false,
    "bytecodeHash": "ipfs",
    "appendCBOR": true
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "evmVersion": "cancun",
  "viaIR": false
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"initialOwner","type":"address"},{"internalType":"uint256","name":"initialMintPrice","type":"uint256"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"CommitmentAlreadyExists","type":"error"},{"inputs":[],"name":"CommitmentAlreadyRevealed","type":"error"},{"inputs":[],"name":"CommitmentExpired","type":"error"},{"inputs":[],"name":"ERC721EnumerableForbiddenBatchMint","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721IncorrectOwner","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721InsufficientApproval","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC721InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC721InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721InvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC721InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC721InvalidSender","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721NonexistentToken","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"ERC721OutOfBoundsIndex","type":"error"},{"inputs":[{"internalType":"uint256","name":"required","type":"uint256"},{"internalType":"uint256","name":"sent","type":"uint256"}],"name":"InsufficientPayment","type":"error"},{"inputs":[],"name":"InvalidQuantity","type":"error"},{"inputs":[],"name":"InvalidRevealSecret","type":"error"},{"inputs":[{"internalType":"uint256","name":"currentSupply","type":"uint256"},{"internalType":"uint256","name":"maxSupply","type":"uint256"},{"internalType":"uint256","name":"requested","type":"uint256"}],"name":"MaxSupplyExceeded","type":"error"},{"inputs":[],"name":"MintingDisabled","type":"error"},{"inputs":[],"name":"NoActiveSkinTypes","type":"error"},{"inputs":[],"name":"NoCommitmentFound","type":"error"},{"inputs":[],"name":"NoFundsToWithdraw","type":"error"},{"inputs":[{"internalType":"uint256","name":"available","type":"uint256"},{"internalType":"uint256","name":"requested","type":"uint256"}],"name":"NotEnoughTokensToUpgrade","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"inputs":[],"name":"ReentrancyGuardReentrantCall","type":"error"},{"inputs":[{"internalType":"uint256","name":"currentBlock","type":"uint256"},{"internalType":"uint256","name":"requiredBlock","type":"uint256"}],"name":"RevealTooEarly","type":"error"},{"inputs":[],"name":"SameSkinTypeAsSpecial","type":"error"},{"inputs":[{"internalType":"uint256","name":"skinTypeId","type":"uint256"}],"name":"SkinTypeNotActive","type":"error"},{"inputs":[{"internalType":"uint256","name":"skinTypeId","type":"uint256"}],"name":"SkinTypeNotFound","type":"error"},{"inputs":[],"name":"SpecialSkinTypeNotSet","type":"error"},{"inputs":[],"name":"WithdrawalFailed","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":"string","name":"newBaseURI","type":"string"}],"name":"BaseURIUpdated","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":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"uint256","name":"refundAmount","type":"uint256"}],"name":"CommitmentCancelled","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"FundsWithdrawn","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"},{"indexed":true,"internalType":"uint256","name":"skinTypeId","type":"uint256"},{"indexed":false,"internalType":"string","name":"tokenURI","type":"string"}],"name":"GachaMinted","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"newMaxSupply","type":"uint256"}],"name":"MaxTotalSupplyUpdated","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":"user","type":"address"},{"indexed":false,"internalType":"bytes32","name":"commitHash","type":"bytes32"},{"indexed":false,"internalType":"uint256","name":"quantity","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"blockNumber","type":"uint256"}],"name":"MintCommitted","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"oldPrice","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"newPrice","type":"uint256"}],"name":"MintPriceUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"user","type":"address"},{"indexed":false,"internalType":"uint256[]","name":"tokenIds","type":"uint256[]"}],"name":"MintRevealed","type":"event"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"bool","name":"enabled","type":"bool"}],"name":"MintingPhaseToggled","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"},{"indexed":true,"internalType":"uint256","name":"skinTypeId","type":"uint256"},{"indexed":false,"internalType":"string","name":"tokenURI","type":"string"}],"name":"NFTMinted","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"skinTypeId","type":"uint256"},{"indexed":false,"internalType":"string","name":"metadataURI","type":"string"},{"indexed":false,"internalType":"uint256","name":"weight","type":"uint256"}],"name":"SkinTypeAdded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"skinTypeId","type":"uint256"},{"indexed":false,"internalType":"string","name":"metadataURI","type":"string"},{"indexed":false,"internalType":"uint256","name":"weight","type":"uint256"},{"indexed":false,"internalType":"bool","name":"active","type":"bool"}],"name":"SkinTypeUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"specialSkinTypeId","type":"uint256"}],"name":"SpecialSkinTypeSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"},{"indexed":false,"internalType":"string","name":"newURI","type":"string"}],"name":"TokenURIUpdated","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"oldSkinTypeId","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"newSkinTypeId","type":"uint256"},{"indexed":false,"internalType":"string","name":"newURI","type":"string"}],"name":"TokenUpgraded","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"MAX_REVEAL_DELAY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MIN_REVEAL_DELAY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"string","name":"metadataURI","type":"string"},{"internalType":"uint256","name":"weight","type":"uint256"}],"name":"addSkinType","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"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":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256[]","name":"skinTypeIds","type":"uint256[]"}],"name":"batchMint","outputs":[{"internalType":"uint256[]","name":"","type":"uint256[]"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"cancelCommitment","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"checkOwnership","outputs":[{"internalType":"bool","name":"hasToken","type":"bool"},{"internalType":"uint256","name":"balance","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes32","name":"commitHash","type":"bytes32"},{"internalType":"uint256","name":"quantity","type":"uint256"}],"name":"commitMint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[{"internalType":"uint256","name":"skinTypeId","type":"uint256"}],"name":"deactivateSkinType","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"getAllSkinTypes","outputs":[{"internalType":"uint256[]","name":"ids","type":"uint256[]"},{"internalType":"string[]","name":"metadataURIs","type":"string[]"},{"internalType":"uint256[]","name":"weights","type":"uint256[]"},{"internalType":"bool[]","name":"actives","type":"bool[]"},{"internalType":"uint256[]","name":"dropChances","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"user","type":"address"}],"name":"getCommitment","outputs":[{"internalType":"bytes32","name":"commitHash","type":"bytes32"},{"internalType":"uint256","name":"blockNumber","type":"uint256"},{"internalType":"uint256","name":"quantity","type":"uint256"},{"internalType":"uint256","name":"payment","type":"uint256"},{"internalType":"bool","name":"revealed","type":"bool"},{"internalType":"bool","name":"canReveal","type":"bool"},{"internalType":"bool","name":"expired","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getContractBalance","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getCurrentTokenId","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getMintPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"skinTypeId","type":"uint256"}],"name":"getSkinType","outputs":[{"internalType":"string","name":"metadataURI","type":"string"},{"internalType":"uint256","name":"weight","type":"uint256"},{"internalType":"bool","name":"active","type":"bool"},{"internalType":"uint256","name":"dropChance","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getSkinTypeCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getSpecialSkinTypeId","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getTokenSkinType","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"skinTypeId","type":"uint256"},{"internalType":"bool","name":"includeUpgraded","type":"bool"}],"name":"getTokensBySkinType","outputs":[{"internalType":"uint256[]","name":"","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getTotalWeight","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getUpgradedTokens","outputs":[{"internalType":"uint256[]","name":"","type":"uint256[]"}],"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":"isMintingEnabled","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"isTokenUpgraded","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"maxTotalSupply","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":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes32","name":"secret","type":"bytes32"}],"name":"revealMint","outputs":[{"internalType":"uint256[]","name":"","type":"uint256[]"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"skinTypeId","type":"uint256"}],"name":"safeMint","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"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":"baseURI","type":"string"}],"name":"setBaseURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"maxSupply","type":"uint256"}],"name":"setMaxTotalSupply","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"newPrice","type":"uint256"}],"name":"setMintPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bool","name":"enabled","type":"bool"}],"name":"setMintingEnabled","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"skinTypeId","type":"uint256"}],"name":"setSpecialSkinTypeId","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"index","type":"uint256"}],"name":"tokenByIndex","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"uint256","name":"index","type":"uint256"}],"name":"tokenOfOwnerByIndex","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"tokensOfOwner","outputs":[{"internalType":"uint256[]","name":"","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalMinted","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","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":[{"internalType":"uint256","name":"skinTypeId","type":"uint256"},{"internalType":"string","name":"metadataURI","type":"string"},{"internalType":"uint256","name":"weight","type":"uint256"},{"internalType":"bool","name":"active","type":"bool"}],"name":"updateSkinType","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"string","name":"newURI","type":"string"}],"name":"updateTokenURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"sourceSkinTypeId","type":"uint256"},{"internalType":"uint256","name":"count","type":"uint256"}],"name":"upgradeRandomTokensToSpecial","outputs":[{"internalType":"uint256[]","name":"","type":"uint256[]"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"withdraw","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address payable","name":"to","type":"address"}],"name":"withdrawTo","outputs":[],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]

608060405234801562000010575f80fd5b50604051620044a8380380620044a8833981016040819052620000339162000153565b816040518060400160405280600e81526020016d096d0eacec240b0409ac2d2c6d2d60931b815250604051806040016040528060048152602001634b48474d60e01b815250815f90816200008891906200022a565b5060016200009782826200022a565b5050506001600160a01b038116620000c857604051631e4fbdf760e01b81525f600482015260240160405180910390fd5b620000d38162000102565b5060017f9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f0055600f5550620002f6565b600b80546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b5f806040838503121562000165575f80fd5b82516001600160a01b03811681146200017c575f80fd5b6020939093015192949293505050565b634e487b7160e01b5f52604160045260245ffd5b600181811c90821680620001b557607f821691505b602082108103620001d457634e487b7160e01b5f52602260045260245ffd5b50919050565b601f8211156200022557805f5260205f20601f840160051c81016020851015620002015750805b601f840160051c820191505b8181101562000222575f81556001016200020d565b50505b505050565b81516001600160401b038111156200024657620002466200018c565b6200025e81620002578454620001a0565b84620001da565b602080601f83116001811462000294575f84156200027c5750858301515b5f19600386901b1c1916600185901b178555620002ee565b5f85815260208120601f198616915b82811015620002c457888601518255948401946001909101908401620002a3565b5085821015620002e257878501515f19600388901b60f8161c191681555b505060018460011b0185555b505050505050565b6141a480620003045f395ff3fe60806040526004361061035e575f3560e01c80635f2c66d8116101bd57806391198b27116100f2578063b88d4fde11610092578063f2fde38b1161006d578063f2fde38b1461094f578063f4a0a5281461096e578063f4e8b6181461098d578063fa1026dd146109ac575f80fd5b8063b88d4fde146108f2578063c87b56dd14610911578063e985e9c514610930575f80fd5b8063a22cb465116100cd578063a22cb465146108ab578063a2309ff8146106bf578063a7f93ebd146108ca578063afa1e2d1146108de575f80fd5b806391198b271461085957806395d89b4114610878578063a14481941461088c575f80fd5b806372b0d90c1161015d5780638462151c116101385780638462151c146107e4578063888eeea6146108035780638da5cb5b146108175780639024951b14610834575f80fd5b806372b0d90c1461079257806372b7e5ac146107b15780637e6d35fa146107c5575f80fd5b80636e105250116101985780636e105250146107395780636f9fb98a1461074d57806370a082311461075f578063715018a61461077e575f80fd5b80635f2c66d8146106e657806360394c57146106fb5780636352211e1461071a575f80fd5b80632ab4d052116102935780634684d7e91161023357806355c7ba141161020e57806355c7ba141461068957806355f804b3146106a057806356189236146106bf57806357a73fa2146106d3575f80fd5b80634684d7e91461062c5780634ea3871a1461064b5780634f6ccce71461066a575f80fd5b80633ccfd60b1161026e5780633ccfd60b146105ab5780633f3e4c11146105bf57806342842e0e146105de57806342f82c4c146105fd575f80fd5b80632ab4d052146105595780632f745c591461056d578063321789e81461058c575f80fd5b806318160ddd116102fe5780631e1bc5eb116102d95780631e1bc5eb146104e857806323b872dd146104fc578063245e86cd1461051b578063290b1bf51461053a575f80fd5b806318160ddd1461048957806318661f231461049d57806318e97fd1146104c9575f80fd5b8063081812fc11610339578063081812fc146103dc578063095ea7b3146104135780630995dcab146104345780630c8b234e14610453575f80fd5b806301ffc9a71461036957806306aba0e11461039d57806306fdde03146103bb575f80fd5b3661036557005b5f80fd5b348015610374575f80fd5b5061038861038336600461375b565b610a06565b60405190151581526020015b60405180910390f35b3480156103a8575f80fd5b506012545b604051908152602001610394565b3480156103c6575f80fd5b506103cf610a16565b60405161039491906137c3565b3480156103e7575f80fd5b506103fb6103f63660046137d5565b610aa5565b6040516001600160a01b039091168152602001610394565b34801561041e575f80fd5b5061043261042d366004613800565b610acc565b005b34801561043f575f80fd5b5061043261044e3660046138ef565b610adb565b34801561045e575f80fd5b5061047261046d36600461394b565b610bc7565b604080519215158352602083019190915201610394565b348015610494575f80fd5b506009546103ad565b3480156104a8575f80fd5b506104bc6104b73660046137d5565b610c48565b60405161039491906139a0565b3480156104d4575f80fd5b506104326104e33660046139b2565b61102f565b3480156104f3575f80fd5b506017546103ad565b348015610507575f80fd5b506104326105163660046139f5565b611087565b348015610526575f80fd5b506104bc610535366004613a33565b611110565b348015610545575f80fd5b506103ad610554366004613a53565b6114fd565b348015610564575f80fd5b50600d546103ad565b348015610578575f80fd5b506103ad610587366004613800565b6115d6565b348015610597575f80fd5b506104bc6105a6366004613a94565b611639565b3480156105b6575f80fd5b506104326117be565b3480156105ca575f80fd5b506104326105d93660046137d5565b6118d9565b3480156105e9575f80fd5b506104326105f83660046139f5565b611966565b348015610608575f80fd5b5061061c6106173660046137d5565b611985565b6040516103949493929190613abe565b348015610637575f80fd5b506104bc610646366004613aec565b611a9d565b348015610656575f80fd5b50610432610665366004613ba1565b611b6b565b348015610675575f80fd5b506103ad6106843660046137d5565b611bbb565b348015610694575f80fd5b5060155460ff16610388565b3480156106ab575f80fd5b506104326106ba366004613bba565b611c10565b3480156106ca575f80fd5b50600c546103ad565b6104326106e1366004613a33565b611c54565b3480156106f1575f80fd5b506103ad61010081565b348015610706575f80fd5b506104326107153660046137d5565b611e15565b348015610725575f80fd5b506103fb6107343660046137d5565b611e96565b348015610744575f80fd5b506104bc611ea0565b348015610758575f80fd5b50476103ad565b34801561076a575f80fd5b506103ad61077936600461394b565b611fe3565b348015610789575f80fd5b50610432612028565b34801561079d575f80fd5b506104326107ac36600461394b565b612039565b3480156107bc575f80fd5b506011546103ad565b3480156107d0575f80fd5b506104326107df3660046137d5565b6121a2565b3480156107ef575f80fd5b506104bc6107fe36600461394b565b612263565b34801561080e575f80fd5b506103ad600181565b348015610822575f80fd5b50600b546001600160a01b03166103fb565b34801561083f575f80fd5b506108486122ef565b604051610394959493929190613c1c565b348015610864575f80fd5b506103886108733660046137d5565b6125f8565b348015610883575f80fd5b506103cf612618565b348015610897575f80fd5b506103ad6108a6366004613800565b612627565b3480156108b6575f80fd5b506104326108c5366004613cc9565b61275f565b3480156108d5575f80fd5b50600f546103ad565b3480156108e9575f80fd5b5061043261276a565b3480156108fd575f80fd5b5061043261090c366004613cf3565b6128b0565b34801561091c575f80fd5b506103cf61092b3660046137d5565b6128c8565b34801561093b575f80fd5b5061038861094a366004613d6d565b6128d3565b34801561095a575f80fd5b5061043261096936600461394b565b612900565b348015610979575f80fd5b506104326109883660046137d5565b61293a565b348015610998575f80fd5b506103ad6109a73660046137d5565b612980565b3480156109b7575f80fd5b506109cb6109c636600461394b565b61299d565b60408051978852602088019690965294860193909352606085019190915215156080840152151560a0830152151560c082015260e001610394565b5f610a1082612a49565b92915050565b60605f8054610a2490613da4565b80601f0160208091040260200160405190810160405280929190818152602001828054610a5090613da4565b8015610a9b5780601f10610a7257610100808354040283529160200191610a9b565b820191905f5260205f20905b815481529060010190602001808311610a7e57829003601f168201915b5050505050905090565b5f610aaf82612a6d565b505f828152600460205260409020546001600160a01b0316610a10565b610ad7828233612aa5565b5050565b610ae3612ab2565b6011548410610b0d5760405163833a367760e01b8152600481018590526024015b60405180910390fd5b5f848152601060205260409020600281015460ff1615610b4257806001015460125f828254610b3c9190613df0565b90915550505b8115610b5f578260125f828254610b599190613e03565b90915550505b80610b6a8582613e5a565b506001810183905560028101805460ff191683151517905560405185907fd6f995acea32f7c3a6b7ff92783b8b033190011a4301a400a27305c0efbea7b890610bb890879087908790613f15565b60405180910390a25050505050565b5f806001600160a01b038316610c335760405162461bcd60e51b815260206004820152602b60248201527f4b68756761584d6169636968536b696e3a2061646472657373207a65726f206960448201526a1cc81b9bdd081d985b1a5960aa1b6064820152608401610b04565b610c3c83611fe3565b90505f81119150915091565b6060610c52612adf565b335f9081526013602052604090208054610c7f576040516318d82abb60e31b815260040160405180910390fd5b600481015460ff1615610ca5576040516323cf59cb60e21b815260040160405180910390fd5b5f60018260010154610cb79190613e03565b905080431015610ce3576040516360b3f47d60e11b815243600482015260248101829052604401610b04565b6101008260010154610cf59190613e03565b431115610d15576040516353adc96560e01b815260040160405180910390fd5b5f8433604051602001610d4492919091825260601b6bffffffffffffffffffffffff1916602082015260340190565b604051602081830303815290604052805190602001209050825f01548114610d7f5760405163754d300960e01b815260040160405180910390fd5b60048301805460ff191660011790556002830154610d9c90612afa565b6001830154604080516020810188905291409082015233606090811b6bffffffffffffffffffffffff1916908201524260748201525f906094016040516020818303038152906040528051906020012090505f84600201546001600160401b03811115610e0b57610e0b61382a565b604051908082528060200260200182016040528015610e34578160200160208202803683370190505b5090505f5b8560020154811015610fcc57604080516020808201869052818301849052825180830384018152606090920190925280519101205f610e7782612b50565b600c80549192505f919082610e8b83613f3e565b919050559050610e9b3382612bd7565b5f8281526010602052604090208054610f3a918391610eb990613da4565b80601f0160208091040260200160405190810160405280929190818152602001828054610ee590613da4565b8015610f305780601f10610f0757610100808354040283529160200191610f30565b820191905f5260205f20905b815481529060010190602001808311610f1357829003601f168201915b5050505050612bf0565b5f81815260146020526040902082905584518190869086908110610f6057610f60613f56565b6020026020010181815250508181336001600160a01b03167fffd024e9e0b61695da324dec9d81fbef162696df93ee428c57fac0cf7c16c35c60105f8781526020019081526020015f205f01604051610fb99190613fe3565b60405180910390a4505050600101610e39565b50336001600160a01b03167f652feb2cac06e3c0650b4f243ca9041861318e50332abe79ac619f90a3d6d3108260405161100691906139a0565b60405180910390a294505050505061102a60015f8051602061414f83398151915255565b919050565b611037612ab2565b61104082612a6d565b5061104b8282612bf0565b817f931f495b9a8e5d8e61946ea5d61e021f636cfe213a801f97589c18c152e408bd8260405161107b91906137c3565b60405180910390a25050565b6001600160a01b0382166110b057604051633250574960e11b81525f6004820152602401610b04565b5f6110bc838333612c38565b9050836001600160a01b0316816001600160a01b03161461110a576040516364283d7b60e01b81526001600160a01b0380861660048301526024820184905282166044820152606401610b04565b50505050565b606061111a612ab2565b6017545f0361113c5760405163d4a6eecd60e01b815260040160405180910390fd5b826017540361115e57604051630ec1e18560e41b815260040160405180910390fd5b60115483106111835760405163833a367760e01b815260048101849052602401610b04565b815f036111a35760405163524f409b60e01b815260040160405180910390fd5b5f6111ad60095490565b90505f816001600160401b038111156111c8576111c861382a565b6040519080825280602002602001820160405280156111f1578160200160208202803683370190505b5090505f805b83811015611262575f818152601460205260409020548714801561122957505f8181526016602052604090205460ff16155b1561125a578083838151811061124157611241613f56565b60209081029190910101528161125681613f3e565b9250505b6001016111f7565b508481101561128e576040516334de954760e11b81526004810182905260248101869052604401610b04565b5f61129a600143613df0565b60408051914060208301524290820152606081018890526080810187905260a0016040516020818303038152906040528051906020012090505f6001836112e19190613df0565b90505b80156113b7575f6112f6826001613e03565b6040805160208101869052908101849052606001604051602081830303815290604052805190602001205f1c61132c9190614009565b90505f85838151811061134157611341613f56565b6020026020010151905085828151811061135d5761135d613f56565b602002602001015186848151811061137757611377613f56565b6020026020010181815250508086838151811061139657611396613f56565b602002602001018181525050505080806113af9061401c565b9150506112e4565b505f866001600160401b038111156113d1576113d161382a565b6040519080825280602002602001820160405280156113fa578160200160208202803683370190505b5090505f5b878110156114f1575f85828151811061141a5761141a613f56565b6020908102919091018101515f81815260148352604080822080546017549182905590835260109094529020805491935061145b91849190610eb990613da4565b5f828152601660205260409020805460ff191660011790558351829085908590811061148957611489613f56565b602002602001018181525050817fc388dffb6da06a3922b652d42b267502026d653ed45f30799044d4ec4660f91e8260175460105f60175481526020019081526020015f205f016040516114df93929190614031565b60405180910390a250506001016113ff565b50979650505050505050565b5f611506612ab2565b601180545f918261151683613f3e565b909155506040805160608101825286815260208082018790526001828401525f8481526010909152919091208151929350909181906115559082613e5a565b50602082015160018201556040909101516002909101805460ff1916911515919091179055601280548491905f9061158e908490613e03565b92505081905550807fa2f9a148b995753b6639b23e0fd2c28a389f916109d341e634851a2141560ab485856040516115c7929190614058565b60405180910390a29392505050565b5f6115e083611fe3565b82106116115760405163295f44f760e21b81526001600160a01b038416600482015260248101839052604401610b04565b506001600160a01b03919091165f908152600760209081526040808320938352929052205490565b606060115483106116605760405163833a367760e01b815260048101849052602401610b04565b5f61166a60095490565b90505f816001600160401b038111156116855761168561382a565b6040519080825280602002602001820160405280156116ae578160200160208202803683370190505b5090505f805b83811015611724575f8181526014602052604090205487900361171c5785806116eb57505f8181526016602052604090205460ff16155b1561171c578083838151811061170357611703613f56565b60209081029190910101528161171881613f3e565b9250505b6001016116b4565b505f816001600160401b0381111561173e5761173e61382a565b604051908082528060200260200182016040528015611767578160200160208202803683370190505b5090505f5b828110156117b35783818151811061178657611786613f56565b60200260200101518282815181106117a0576117a0613f56565b602090810291909101015260010161176c565b509695505050505050565b6117c6612ab2565b6117ce612adf565b475f8190036117f0576040516367e3990d60e01b815260040160405180910390fd5b5f611803600b546001600160a01b031690565b6001600160a01b0316826040515f6040518083038185875af1925050503d805f811461184a576040519150601f19603f3d011682016040523d82523d5f602084013e61184f565b606091505b5050905080611871576040516327fcd9d160e01b815260040160405180910390fd5b600b546001600160a01b03166001600160a01b03167feaff4b37086828766ad3268786972c0cd24259d4c87a80f9d3963a3c3d999b0d836040516118b791815260200190565b60405180910390a250506118d760015f8051602061414f83398151915255565b565b6118e1612ab2565b5f6118eb60095490565b90505f821180156118fb57508181115b156119295760405163b14d3f5b60e01b815260048101829052602481018390525f6044820152606401610b04565b600d8290556040518281527ff2672935fc79f5237559e2e2999dbe743bf65430894ac2b37666890e7c69e1af906020015b60405180910390a15050565b61198083838360405180602001604052805f8152506128b0565b505050565b60605f805f60115485106119af5760405163833a367760e01b815260048101869052602401610b04565b5f858152601060205260409020805481906119c990613da4565b80601f01602080910402602001604051908101604052809291908181526020018280546119f590613da4565b8015611a405780601f10611a1757610100808354040283529160200191611a40565b820191905f5260205f20905b815481529060010190602001808311611a2357829003601f168201915b5050506001840154600285015460125494995090975060ff169550505015801590611a6f5750600281015460ff165b15611a95576012546001820154611a8890612710614079565b611a929190614090565b91505b509193509193565b6060611aa7612ab2565b60155460ff16611aca5760405163af79b43760e01b815260040160405180910390fd5b5f82516001600160401b03811115611ae457611ae461382a565b604051908082528060200260200182016040528015611b0d578160200160208202803683370190505b5090505f5b8351811015611b6357611b3e85858381518110611b3157611b31613f56565b6020026020010151612627565b828281518110611b5057611b50613f56565b6020908102919091010152600101611b12565b509392505050565b611b73612ab2565b6015805460ff19168215159081179091556040519081527fed867810aa1d625274c5c2fead4ed7d7e175721d897fa5c0093a9e8f85a32588906020015b60405180910390a150565b5f611bc560095490565b8210611bed5760405163295f44f760e21b81525f600482015260248101839052604401610b04565b60098281548110611c0057611c00613f56565b905f5260205f2001549050919050565b611c18612ab2565b600e611c248282613e5a565b507f6741b2fc379fad678116fe3d4d4b9a1a184ab53ba36b86ad0fa66340b1ab41ad81604051611bb091906137c3565b611c5c612adf565b60155460ff16611c7f5760405163af79b43760e01b815260040160405180910390fd5b805f03611c9f5760405163524f409b60e01b815260040160405180910390fd5b6012545f03611cc15760405163c349568f60e01b815260040160405180910390fd5b5f81600f54611cd09190614079565b905080341015611cfc5760405163b99e2ab760e01b815260048101829052346024820152604401610b04565b335f908152601360205260409020805415801590611d1f5750600481015460ff16155b15611d55576101008160010154611d369190613e03565b4311611d555760405163145718a760e01b815260040160405180910390fd5b6040805160a0810182528581524360208083018281528385018881523460608087019182525f608088018181523380835260138852918a90209851895594516001890155925160028801559051600387015591516004909501805460ff19169515159590951790945584518981529182018890529381019190915290917fde6148e73bfcab0a63687903184f71d8f79aaa245898aa5244e45a7e76cd9b48910160405180910390a25050610ad760015f8051602061414f83398151915255565b611e1d612ab2565b6011548110611e425760405163833a367760e01b815260048101829052602401610b04565b8060175403611e6457604051630ec1e18560e41b815260040160405180910390fd5b601781905560405181907f7e89241f8b57266ef29d4bb897a3e5d9877c57fca995d235fdbb94b375451c58905f90a250565b5f610a1082612a6d565b60605f611eac60095490565b90505f816001600160401b03811115611ec757611ec761382a565b604051908082528060200260200182016040528015611ef0578160200160208202803683370190505b5090505f805b83811015611f4b575f81815260166020526040902054819060ff1615611f425780848481518110611f2957611f29613f56565b602090810291909101015282611f3e81613f3e565b9350505b50600101611ef6565b505f816001600160401b03811115611f6557611f6561382a565b604051908082528060200260200182016040528015611f8e578160200160208202803683370190505b5090505f5b82811015611fda57838181518110611fad57611fad613f56565b6020026020010151828281518110611fc757611fc7613f56565b6020908102919091010152600101611f93565b50949350505050565b5f6001600160a01b03821661200d576040516322718ad960e21b81525f6004820152602401610b04565b506001600160a01b03165f9081526003602052604090205490565b612030612ab2565b6118d75f612c4c565b612041612ab2565b612049612adf565b6001600160a01b0381166120b25760405162461bcd60e51b815260206004820152602a60248201527f4b68756761584d6169636968536b696e3a20776974686472617720746f207a65604482015269726f206164647265737360b01b6064820152608401610b04565b475f8190036120d4576040516367e3990d60e01b815260040160405180910390fd5b5f826001600160a01b0316826040515f6040518083038185875af1925050503d805f811461211d576040519150601f19603f3d011682016040523d82523d5f602084013e612122565b606091505b5050905080612144576040516327fcd9d160e01b815260040160405180910390fd5b826001600160a01b03167feaff4b37086828766ad3268786972c0cd24259d4c87a80f9d3963a3c3d999b0d8360405161217f91815260200190565b60405180910390a2505061219f60015f8051602061414f83398151915255565b50565b6121aa612ab2565b60115481106121cf5760405163833a367760e01b815260048101829052602401610b04565b5f818152601060205260409020600281015460ff16612204576040516319714d3f60e01b815260048101839052602401610b04565b806001015460125f8282546122199190613df0565b909155505060028101805460ff19169055600181015460405183917fd6f995acea32f7c3a6b7ff92783b8b033190011a4301a400a27305c0efbea7b89161107b9185915f906140a3565b60605f61226f83611fe3565b90505f816001600160401b0381111561228a5761228a61382a565b6040519080825280602002602001820160405280156122b3578160200160208202803683370190505b5090505f5b82811015611b63576122ca85826115d6565b8282815181106122dc576122dc613f56565b60209081029190910101526001016122b8565b60608060608060606011546001600160401b038111156123115761231161382a565b60405190808252806020026020018201604052801561233a578160200160208202803683370190505b5094506011546001600160401b038111156123575761235761382a565b60405190808252806020026020018201604052801561238a57816020015b60608152602001906001900390816123755790505b5093506011546001600160401b038111156123a7576123a761382a565b6040519080825280602002602001820160405280156123d0578160200160208202803683370190505b5092506011546001600160401b038111156123ed576123ed61382a565b604051908082528060200260200182016040528015612416578160200160208202803683370190505b5091506011546001600160401b038111156124335761243361382a565b60405190808252806020026020018201604052801561245c578160200160208202803683370190505b5090505f5b6011548110156125f0575f8181526010602052604090208651829088908290811061248e5761248e613f56565b6020908102919091010152805481906124a690613da4565b80601f01602080910402602001604051908101604052809291908181526020018280546124d290613da4565b801561251d5780601f106124f45761010080835404028352916020019161251d565b820191905f5260205f20905b81548152906001019060200180831161250057829003601f168201915b505050505086838151811061253457612534613f56565b6020026020010181905250806001015485838151811061255657612556613f56565b60209081029190910101526002810154845160ff9091169085908490811061258057612580613f56565b91151560209283029190910190910152601254158015906125a55750600281015460ff165b156125e75760125460018201546125be90612710614079565b6125c89190614090565b8383815181106125da576125da613f56565b6020026020010181815250505b50600101612461565b509091929394565b5f61260282612a6d565b50505f9081526016602052604090205460ff1690565b606060018054610a2490613da4565b5f612630612ab2565b60155460ff166126535760405163af79b43760e01b815260040160405180910390fd5b60115482106126785760405163833a367760e01b815260048101839052602401610b04565b5f8281526010602052604090206002015460ff166126ac576040516319714d3f60e01b815260048101839052602401610b04565b6126b66001612afa565b600c80545f91826126c683613f3e565b9190505590506126d68482612bd7565b5f83815260106020526040902080546126f4918391610eb990613da4565b5f8181526014602090815260408083208690558583526010909152908190209051849183916001600160a01b038816917f01f8bd07e6c27ff813d5c6d3c4bf0313a1d75043cf978214b504b794075e5266916127509190613fe3565b60405180910390a49392505050565b610ad7338383612c9d565b612772612adf565b335f908152601360205260409020805461279f576040516318d82abb60e31b815260040160405180910390fd5b600481015460ff16156127c5576040516323cf59cb60e21b815260040160405180910390fd5b600381810154335f8181526013602052604080822082815560018101839055600281018390559485018290556004909401805460ff19169055925191929183908381818185875af1925050503d805f811461283b576040519150601f19603f3d011682016040523d82523d5f602084013e612840565b606091505b5050905080612862576040516327fcd9d160e01b815260040160405180910390fd5b60405182815233907f0bd7926ed694a812910c5ec5aa135d70f0a29ae1e0d57134cf4b780790c68d1b9060200160405180910390a25050506118d760015f8051602061414f83398151915255565b6128bb848484611087565b61110a3385858585612d3b565b6060610a1082612e63565b6001600160a01b039182165f90815260056020908152604080832093909416825291909152205460ff1690565b612908612ab2565b6001600160a01b03811661293157604051631e4fbdf760e01b81525f6004820152602401610b04565b61219f81612c4c565b612942612ab2565b600f80549082905560408051828152602081018490527f2e1c9e000c6e8dda4d03536adb13b7cb6034ccff90d17f01de381e4d5097b525910161195a565b5f61298a82612a6d565b50505f9081526014602052604090205490565b6001600160a01b0381165f90815260136020526040812080546001820154600283015460038401546004850154939592949193909260ff90911691819087158015906129ee5750600481015460ff16155b15612a3d5760018160010154612a049190613e03565b4310158015612a2457506101008160010154612a209190613e03565b4311155b92506101008160010154612a389190613e03565b431191505b50919395979092949650565b5f6001600160e01b0319821663780e9d6360e01b1480610a105750610a1082612f5a565b5f818152600260205260408120546001600160a01b031680610a1057604051637e27328960e01b815260048101849052602401610b04565b6119808383836001612f7e565b600b546001600160a01b031633146118d75760405163118cdaa760e01b8152336004820152602401610b04565b612ae7613082565b60025f8051602061414f83398151915255565b600d541561219f575f612b0c60095490565b600d54909150612b1c8383613e03565b1115610ad757600d5460405163b14d3f5b60e01b815260048101839052602481019190915260448101839052606401610b04565b5f8060125483612b609190614009565b90505f805b601154811015612bbd575f8181526010602052604090206002015460ff1615612bb5575f81815260106020526040902060010154612ba39083613e03565b915081831015612bb557949350505050565b600101612b65565b5060405163c349568f60e01b815260040160405180910390fd5b610ad7828260405180602001604052805f8152506130b1565b5f828152600660205260409020612c078282613e5a565b506040518281527ff8e1a15aba9398e019f0b49df1a4fde98ee17ae345cb5f6b5e2c27f5033e8ce79060200161195a565b5f612c448484846130c8565b949350505050565b600b80546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b6001600160a01b038216612ccf57604051630b61174360e31b81526001600160a01b0383166004820152602401610b04565b6001600160a01b038381165f81815260056020908152604080832094871680845294825291829020805460ff191686151590811790915591519182527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a3505050565b6001600160a01b0383163b15612e5c57604051630a85bd0160e11b81526001600160a01b0384169063150b7a0290612d7d9088908890879087906004016140b5565b6020604051808303815f875af1925050508015612db7575060408051601f3d908101601f19168201909252612db4918101906140f1565b60015b612e1e573d808015612de4576040519150601f19603f3d011682016040523d82523d5f602084013e612de9565b606091505b5080515f03612e1657604051633250574960e11b81526001600160a01b0385166004820152602401610b04565b805160208201fd5b6001600160e01b03198116630a85bd0160e11b14612e5a57604051633250574960e11b81526001600160a01b0385166004820152602401610b04565b505b5050505050565b6060612e6e82612a6d565b505f8281526006602052604081208054612e8790613da4565b80601f0160208091040260200160405190810160405280929190818152602001828054612eb390613da4565b8015612efe5780601f10612ed557610100808354040283529160200191612efe565b820191905f5260205f20905b815481529060010190602001808311612ee157829003601f168201915b505050505090505f612f0e613193565b905080515f03612f1f575092915050565b815115612f51578082604051602001612f3992919061410c565b60405160208183030381529060405292505050919050565b612c44846131a2565b5f6001600160e01b03198216632483248360e11b1480610a105750610a1082613207565b8080612f9257506001600160a01b03821615155b15613053575f612fa184612a6d565b90506001600160a01b03831615801590612fcd5750826001600160a01b0316816001600160a01b031614155b8015612fe05750612fde81846128d3565b155b156130095760405163a9fbf51f60e01b81526001600160a01b0384166004820152602401610b04565b81156130515783856001600160a01b0316826001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b50505f90815260046020526040902080546001600160a01b0319166001600160a01b0392909216919091179055565b5f8051602061414f833981519152546002036118d757604051633ee5aeb560e01b815260040160405180910390fd5b6130bb8383613256565b611980335f858585612d3b565b5f806130d58585856132b7565b90506001600160a01b0381166131315761312c84600980545f838152600a60205260408120829055600182018355919091527f6e1540171b6c0c960b71a7020d9f60077f6af931a8bbf590da0223dacf75c7af0155565b613154565b846001600160a01b0316816001600160a01b0316146131545761315481856133a9565b6001600160a01b0385166131705761316b84613426565b612c44565b846001600160a01b0316816001600160a01b031614612c4457612c4485856134cd565b6060600e8054610a2490613da4565b60606131ad82612a6d565b505f6131b7613193565b90505f8151116131d55760405180602001604052805f815250613200565b806131df8461351b565b6040516020016131f092919061410c565b6040516020818303038152906040525b9392505050565b5f6001600160e01b031982166380ac58cd60e01b148061323757506001600160e01b03198216635b5e139f60e01b145b80610a1057506301ffc9a760e01b6001600160e01b0319831614610a10565b6001600160a01b03821661327f57604051633250574960e11b81525f6004820152602401610b04565b5f61328b83835f612c38565b90506001600160a01b03811615611980576040516339e3563760e11b81525f6004820152602401610b04565b5f828152600260205260408120546001600160a01b03908116908316156132e3576132e38184866135aa565b6001600160a01b0381161561331d576132fe5f855f80612f7e565b6001600160a01b0381165f90815260036020526040902080545f190190555b6001600160a01b0385161561334b576001600160a01b0385165f908152600360205260409020805460010190555b5f8481526002602052604080822080546001600160a01b0319166001600160a01b0389811691821790925591518793918516917fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef91a4949350505050565b5f6133b383611fe3565b5f838152600860209081526040808320546001600160a01b0388168452600790925290912091925090818314613408575f83815260208281526040808320548584528184208190558352600890915290208290555b5f938452600860209081526040808620869055938552525081205550565b6009545f9061343790600190613df0565b5f838152600a60205260408120546009805493945090928490811061345e5761345e613f56565b905f5260205f2001549050806009838154811061347d5761347d613f56565b5f918252602080832090910192909255828152600a909152604080822084905585825281205560098054806134b4576134b461413a565b600190038181905f5260205f20015f9055905550505050565b5f60016134d984611fe3565b6134e39190613df0565b6001600160a01b039093165f908152600760209081526040808320868452825280832085905593825260089052919091209190915550565b60605f6135278361360e565b60010190505f816001600160401b038111156135455761354561382a565b6040519080825280601f01601f19166020018201604052801561356f576020820181803683370190505b5090508181016020015b5f19016f181899199a1a9b1b9c1cb0b131b232b360811b600a86061a8153600a850494508461357957509392505050565b6135b58383836136e5565b611980576001600160a01b0383166135e357604051637e27328960e01b815260048101829052602401610b04565b60405163177e802f60e01b81526001600160a01b038316600482015260248101829052604401610b04565b5f8072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b831061364c5772184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b830492506040015b6d04ee2d6d415b85acef81000000008310613678576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc10000831061369657662386f26fc10000830492506010015b6305f5e10083106136ae576305f5e100830492506008015b61271083106136c257612710830492506004015b606483106136d4576064830492506002015b600a8310610a105760010192915050565b5f6001600160a01b03831615801590612c445750826001600160a01b0316846001600160a01b0316148061371e575061371e84846128d3565b80612c445750505f908152600460205260409020546001600160a01b03908116911614919050565b6001600160e01b03198116811461219f575f80fd5b5f6020828403121561376b575f80fd5b813561320081613746565b5f5b83811015613790578181015183820152602001613778565b50505f910152565b5f81518084526137af816020860160208601613776565b601f01601f19169290920160200192915050565b602081525f6132006020830184613798565b5f602082840312156137e5575f80fd5b5035919050565b6001600160a01b038116811461219f575f80fd5b5f8060408385031215613811575f80fd5b823561381c816137ec565b946020939093013593505050565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f191681016001600160401b03811182821017156138665761386661382a565b604052919050565b5f6001600160401b038311156138865761388661382a565b613899601f8401601f191660200161383e565b90508281528383830111156138ac575f80fd5b828260208301375f602084830101529392505050565b5f82601f8301126138d1575f80fd5b6132008383356020850161386e565b8035801515811461102a575f80fd5b5f805f8060808587031215613902575f80fd5b8435935060208501356001600160401b0381111561391e575f80fd5b61392a878288016138c2565b93505060408501359150613940606086016138e0565b905092959194509250565b5f6020828403121561395b575f80fd5b8135613200816137ec565b5f815180845260208085019450602084015f5b8381101561399557815187529582019590820190600101613979565b509495945050505050565b602081525f6132006020830184613966565b5f80604083850312156139c3575f80fd5b8235915060208301356001600160401b038111156139df575f80fd5b6139eb858286016138c2565b9150509250929050565b5f805f60608486031215613a07575f80fd5b8335613a12816137ec565b92506020840135613a22816137ec565b929592945050506040919091013590565b5f8060408385031215613a44575f80fd5b50508035926020909101359150565b5f8060408385031215613a64575f80fd5b82356001600160401b03811115613a79575f80fd5b613a85858286016138c2565b95602094909401359450505050565b5f8060408385031215613aa5575f80fd5b82359150613ab5602084016138e0565b90509250929050565b608081525f613ad06080830187613798565b6020830195909552509115156040830152606090910152919050565b5f8060408385031215613afd575f80fd5b8235613b08816137ec565b91506020838101356001600160401b0380821115613b24575f80fd5b818601915086601f830112613b37575f80fd5b813581811115613b4957613b4961382a565b8060051b9150613b5a84830161383e565b8181529183018401918481019089841115613b73575f80fd5b938501935b83851015613b9157843582529385019390850190613b78565b8096505050505050509250929050565b5f60208284031215613bb1575f80fd5b613200826138e0565b5f60208284031215613bca575f80fd5b81356001600160401b03811115613bdf575f80fd5b612c44848285016138c2565b5f815180845260208085019450602084015f5b83811015613995578151151587529582019590820190600101613bfe565b60a081525f613c2e60a0830188613966565b6020838203818501528188518084528284019150828160051b850101838b015f5b83811015613c7d57601f19878403018552613c6b838351613798565b94860194925090850190600101613c4f565b50508681036040880152613c91818b613966565b9450505050508281036060840152613ca98186613beb565b90508281036080840152613cbd8185613966565b98975050505050505050565b5f8060408385031215613cda575f80fd5b8235613ce5816137ec565b9150613ab5602084016138e0565b5f805f8060808587031215613d06575f80fd5b8435613d11816137ec565b93506020850135613d21816137ec565b92506040850135915060608501356001600160401b03811115613d42575f80fd5b8501601f81018713613d52575f80fd5b613d618782356020840161386e565b91505092959194509250565b5f8060408385031215613d7e575f80fd5b8235613d89816137ec565b91506020830135613d99816137ec565b809150509250929050565b600181811c90821680613db857607f821691505b602082108103613dd657634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b81810381811115610a1057610a10613ddc565b80820180821115610a1057610a10613ddc565b601f82111561198057805f5260205f20601f840160051c81016020851015613e3b5750805b601f840160051c820191505b81811015612e5c575f8155600101613e47565b81516001600160401b03811115613e7357613e7361382a565b613e8781613e818454613da4565b84613e16565b602080601f831160018114613eba575f8415613ea35750858301515b5f19600386901b1c1916600185901b178555612e5a565b5f85815260208120601f198616915b82811015613ee857888601518255948401946001909101908401613ec9565b5085821015613f0557878501515f19600388901b60f8161c191681555b5050505050600190811b01905550565b606081525f613f276060830186613798565b602083019490945250901515604090910152919050565b5f60018201613f4f57613f4f613ddc565b5060010190565b634e487b7160e01b5f52603260045260245ffd5b5f8154613f7681613da4565b808552602060018381168015613f935760018114613fad57613fd8565b60ff1985168884015283151560051b880183019550613fd8565b865f52825f205f5b85811015613fd05781548a8201860152908301908401613fb5565b890184019650505b505050505092915050565b602081525f6132006020830184613f6a565b634e487b7160e01b5f52601260045260245ffd5b5f8261401757614017613ff5565b500690565b5f8161402a5761402a613ddc565b505f190190565b838152826020820152606060408201525f61404f6060830184613f6a565b95945050505050565b604081525f61406a6040830185613798565b90508260208301529392505050565b8082028115828204841417610a1057610a10613ddc565b5f8261409e5761409e613ff5565b500490565b606081525f613f276060830186613f6a565b6001600160a01b03858116825284166020820152604081018390526080606082018190525f906140e790830184613798565b9695505050505050565b5f60208284031215614101575f80fd5b815161320081613746565b5f835161411d818460208801613776565b835190830190614131818360208801613776565b01949350505050565b634e487b7160e01b5f52603160045260245ffdfe9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00a2646970667358221220ccd1b84e6040f6c90fa2f18ec5d214438f87330584a13932f8fdad47084a1d6864736f6c63430008180033000000000000000000000000eb0596fd9b78471681dfb2ee6adbbcdbe079a6440000000000000000000000000000000000000000000000000011c37937e08000

0x60806040526004361061035e575f3560e01c80635f2c66d8116101bd57806391198b27116100f2578063b88d4fde11610092578063f2fde38b1161006d578063f2fde38b1461094f578063f4a0a5281461096e578063f4e8b6181461098d578063fa1026dd146109ac575f80fd5b8063b88d4fde146108f2578063c87b56dd14610911578063e985e9c514610930575f80fd5b8063a22cb465116100cd578063a22cb465146108ab578063a2309ff8146106bf578063a7f93ebd146108ca578063afa1e2d1146108de575f80fd5b806391198b271461085957806395d89b4114610878578063a14481941461088c575f80fd5b806372b0d90c1161015d5780638462151c116101385780638462151c146107e4578063888eeea6146108035780638da5cb5b146108175780639024951b14610834575f80fd5b806372b0d90c1461079257806372b7e5ac146107b15780637e6d35fa146107c5575f80fd5b80636e105250116101985780636e105250146107395780636f9fb98a1461074d57806370a082311461075f578063715018a61461077e575f80fd5b80635f2c66d8146106e657806360394c57146106fb5780636352211e1461071a575f80fd5b80632ab4d052116102935780634684d7e91161023357806355c7ba141161020e57806355c7ba141461068957806355f804b3146106a057806356189236146106bf57806357a73fa2146106d3575f80fd5b80634684d7e91461062c5780634ea3871a1461064b5780634f6ccce71461066a575f80fd5b80633ccfd60b1161026e5780633ccfd60b146105ab5780633f3e4c11146105bf57806342842e0e146105de57806342f82c4c146105fd575f80fd5b80632ab4d052146105595780632f745c591461056d578063321789e81461058c575f80fd5b806318160ddd116102fe5780631e1bc5eb116102d95780631e1bc5eb146104e857806323b872dd146104fc578063245e86cd1461051b578063290b1bf51461053a575f80fd5b806318160ddd1461048957806318661f231461049d57806318e97fd1146104c9575f80fd5b8063081812fc11610339578063081812fc146103dc578063095ea7b3146104135780630995dcab146104345780630c8b234e14610453575f80fd5b806301ffc9a71461036957806306aba0e11461039d57806306fdde03146103bb575f80fd5b3661036557005b5f80fd5b348015610374575f80fd5b5061038861038336600461375b565b610a06565b60405190151581526020015b60405180910390f35b3480156103a8575f80fd5b506012545b604051908152602001610394565b3480156103c6575f80fd5b506103cf610a16565b60405161039491906137c3565b3480156103e7575f80fd5b506103fb6103f63660046137d5565b610aa5565b6040516001600160a01b039091168152602001610394565b34801561041e575f80fd5b5061043261042d366004613800565b610acc565b005b34801561043f575f80fd5b5061043261044e3660046138ef565b610adb565b34801561045e575f80fd5b5061047261046d36600461394b565b610bc7565b604080519215158352602083019190915201610394565b348015610494575f80fd5b506009546103ad565b3480156104a8575f80fd5b506104bc6104b73660046137d5565b610c48565b60405161039491906139a0565b3480156104d4575f80fd5b506104326104e33660046139b2565b61102f565b3480156104f3575f80fd5b506017546103ad565b348015610507575f80fd5b506104326105163660046139f5565b611087565b348015610526575f80fd5b506104bc610535366004613a33565b611110565b348015610545575f80fd5b506103ad610554366004613a53565b6114fd565b348015610564575f80fd5b50600d546103ad565b348015610578575f80fd5b506103ad610587366004613800565b6115d6565b348015610597575f80fd5b506104bc6105a6366004613a94565b611639565b3480156105b6575f80fd5b506104326117be565b3480156105ca575f80fd5b506104326105d93660046137d5565b6118d9565b3480156105e9575f80fd5b506104326105f83660046139f5565b611966565b348015610608575f80fd5b5061061c6106173660046137d5565b611985565b6040516103949493929190613abe565b348015610637575f80fd5b506104bc610646366004613aec565b611a9d565b348015610656575f80fd5b50610432610665366004613ba1565b611b6b565b348015610675575f80fd5b506103ad6106843660046137d5565b611bbb565b348015610694575f80fd5b5060155460ff16610388565b3480156106ab575f80fd5b506104326106ba366004613bba565b611c10565b3480156106ca575f80fd5b50600c546103ad565b6104326106e1366004613a33565b611c54565b3480156106f1575f80fd5b506103ad61010081565b348015610706575f80fd5b506104326107153660046137d5565b611e15565b348015610725575f80fd5b506103fb6107343660046137d5565b611e96565b348015610744575f80fd5b506104bc611ea0565b348015610758575f80fd5b50476103ad565b34801561076a575f80fd5b506103ad61077936600461394b565b611fe3565b348015610789575f80fd5b50610432612028565b34801561079d575f80fd5b506104326107ac36600461394b565b612039565b3480156107bc575f80fd5b506011546103ad565b3480156107d0575f80fd5b506104326107df3660046137d5565b6121a2565b3480156107ef575f80fd5b506104bc6107fe36600461394b565b612263565b34801561080e575f80fd5b506103ad600181565b348015610822575f80fd5b50600b546001600160a01b03166103fb565b34801561083f575f80fd5b506108486122ef565b604051610394959493929190613c1c565b348015610864575f80fd5b506103886108733660046137d5565b6125f8565b348015610883575f80fd5b506103cf612618565b348015610897575f80fd5b506103ad6108a6366004613800565b612627565b3480156108b6575f80fd5b506104326108c5366004613cc9565b61275f565b3480156108d5575f80fd5b50600f546103ad565b3480156108e9575f80fd5b5061043261276a565b3480156108fd575f80fd5b5061043261090c366004613cf3565b6128b0565b34801561091c575f80fd5b506103cf61092b3660046137d5565b6128c8565b34801561093b575f80fd5b5061038861094a366004613d6d565b6128d3565b34801561095a575f80fd5b5061043261096936600461394b565b612900565b348015610979575f80fd5b506104326109883660046137d5565b61293a565b348015610998575f80fd5b506103ad6109a73660046137d5565b612980565b3480156109b7575f80fd5b506109cb6109c636600461394b565b61299d565b60408051978852602088019690965294860193909352606085019190915215156080840152151560a0830152151560c082015260e001610394565b5f610a1082612a49565b92915050565b60605f8054610a2490613da4565b80601f0160208091040260200160405190810160405280929190818152602001828054610a5090613da4565b8015610a9b5780601f10610a7257610100808354040283529160200191610a9b565b820191905f5260205f20905b815481529060010190602001808311610a7e57829003601f168201915b5050505050905090565b5f610aaf82612a6d565b505f828152600460205260409020546001600160a01b0316610a10565b610ad7828233612aa5565b5050565b610ae3612ab2565b6011548410610b0d5760405163833a367760e01b8152600481018590526024015b60405180910390fd5b5f848152601060205260409020600281015460ff1615610b4257806001015460125f828254610b3c9190613df0565b90915550505b8115610b5f578260125f828254610b599190613e03565b90915550505b80610b6a8582613e5a565b506001810183905560028101805460ff191683151517905560405185907fd6f995acea32f7c3a6b7ff92783b8b033190011a4301a400a27305c0efbea7b890610bb890879087908790613f15565b60405180910390a25050505050565b5f806001600160a01b038316610c335760405162461bcd60e51b815260206004820152602b60248201527f4b68756761584d6169636968536b696e3a2061646472657373207a65726f206960448201526a1cc81b9bdd081d985b1a5960aa1b6064820152608401610b04565b610c3c83611fe3565b90505f81119150915091565b6060610c52612adf565b335f9081526013602052604090208054610c7f576040516318d82abb60e31b815260040160405180910390fd5b600481015460ff1615610ca5576040516323cf59cb60e21b815260040160405180910390fd5b5f60018260010154610cb79190613e03565b905080431015610ce3576040516360b3f47d60e11b815243600482015260248101829052604401610b04565b6101008260010154610cf59190613e03565b431115610d15576040516353adc96560e01b815260040160405180910390fd5b5f8433604051602001610d4492919091825260601b6bffffffffffffffffffffffff1916602082015260340190565b604051602081830303815290604052805190602001209050825f01548114610d7f5760405163754d300960e01b815260040160405180910390fd5b60048301805460ff191660011790556002830154610d9c90612afa565b6001830154604080516020810188905291409082015233606090811b6bffffffffffffffffffffffff1916908201524260748201525f906094016040516020818303038152906040528051906020012090505f84600201546001600160401b03811115610e0b57610e0b61382a565b604051908082528060200260200182016040528015610e34578160200160208202803683370190505b5090505f5b8560020154811015610fcc57604080516020808201869052818301849052825180830384018152606090920190925280519101205f610e7782612b50565b600c80549192505f919082610e8b83613f3e565b919050559050610e9b3382612bd7565b5f8281526010602052604090208054610f3a918391610eb990613da4565b80601f0160208091040260200160405190810160405280929190818152602001828054610ee590613da4565b8015610f305780601f10610f0757610100808354040283529160200191610f30565b820191905f5260205f20905b815481529060010190602001808311610f1357829003601f168201915b5050505050612bf0565b5f81815260146020526040902082905584518190869086908110610f6057610f60613f56565b6020026020010181815250508181336001600160a01b03167fffd024e9e0b61695da324dec9d81fbef162696df93ee428c57fac0cf7c16c35c60105f8781526020019081526020015f205f01604051610fb99190613fe3565b60405180910390a4505050600101610e39565b50336001600160a01b03167f652feb2cac06e3c0650b4f243ca9041861318e50332abe79ac619f90a3d6d3108260405161100691906139a0565b60405180910390a294505050505061102a60015f8051602061414f83398151915255565b919050565b611037612ab2565b61104082612a6d565b5061104b8282612bf0565b817f931f495b9a8e5d8e61946ea5d61e021f636cfe213a801f97589c18c152e408bd8260405161107b91906137c3565b60405180910390a25050565b6001600160a01b0382166110b057604051633250574960e11b81525f6004820152602401610b04565b5f6110bc838333612c38565b9050836001600160a01b0316816001600160a01b03161461110a576040516364283d7b60e01b81526001600160a01b0380861660048301526024820184905282166044820152606401610b04565b50505050565b606061111a612ab2565b6017545f0361113c5760405163d4a6eecd60e01b815260040160405180910390fd5b826017540361115e57604051630ec1e18560e41b815260040160405180910390fd5b60115483106111835760405163833a367760e01b815260048101849052602401610b04565b815f036111a35760405163524f409b60e01b815260040160405180910390fd5b5f6111ad60095490565b90505f816001600160401b038111156111c8576111c861382a565b6040519080825280602002602001820160405280156111f1578160200160208202803683370190505b5090505f805b83811015611262575f818152601460205260409020548714801561122957505f8181526016602052604090205460ff16155b1561125a578083838151811061124157611241613f56565b60209081029190910101528161125681613f3e565b9250505b6001016111f7565b508481101561128e576040516334de954760e11b81526004810182905260248101869052604401610b04565b5f61129a600143613df0565b60408051914060208301524290820152606081018890526080810187905260a0016040516020818303038152906040528051906020012090505f6001836112e19190613df0565b90505b80156113b7575f6112f6826001613e03565b6040805160208101869052908101849052606001604051602081830303815290604052805190602001205f1c61132c9190614009565b90505f85838151811061134157611341613f56565b6020026020010151905085828151811061135d5761135d613f56565b602002602001015186848151811061137757611377613f56565b6020026020010181815250508086838151811061139657611396613f56565b602002602001018181525050505080806113af9061401c565b9150506112e4565b505f866001600160401b038111156113d1576113d161382a565b6040519080825280602002602001820160405280156113fa578160200160208202803683370190505b5090505f5b878110156114f1575f85828151811061141a5761141a613f56565b6020908102919091018101515f81815260148352604080822080546017549182905590835260109094529020805491935061145b91849190610eb990613da4565b5f828152601660205260409020805460ff191660011790558351829085908590811061148957611489613f56565b602002602001018181525050817fc388dffb6da06a3922b652d42b267502026d653ed45f30799044d4ec4660f91e8260175460105f60175481526020019081526020015f205f016040516114df93929190614031565b60405180910390a250506001016113ff565b50979650505050505050565b5f611506612ab2565b601180545f918261151683613f3e565b909155506040805160608101825286815260208082018790526001828401525f8481526010909152919091208151929350909181906115559082613e5a565b50602082015160018201556040909101516002909101805460ff1916911515919091179055601280548491905f9061158e908490613e03565b92505081905550807fa2f9a148b995753b6639b23e0fd2c28a389f916109d341e634851a2141560ab485856040516115c7929190614058565b60405180910390a29392505050565b5f6115e083611fe3565b82106116115760405163295f44f760e21b81526001600160a01b038416600482015260248101839052604401610b04565b506001600160a01b03919091165f908152600760209081526040808320938352929052205490565b606060115483106116605760405163833a367760e01b815260048101849052602401610b04565b5f61166a60095490565b90505f816001600160401b038111156116855761168561382a565b6040519080825280602002602001820160405280156116ae578160200160208202803683370190505b5090505f805b83811015611724575f8181526014602052604090205487900361171c5785806116eb57505f8181526016602052604090205460ff16155b1561171c578083838151811061170357611703613f56565b60209081029190910101528161171881613f3e565b9250505b6001016116b4565b505f816001600160401b0381111561173e5761173e61382a565b604051908082528060200260200182016040528015611767578160200160208202803683370190505b5090505f5b828110156117b35783818151811061178657611786613f56565b60200260200101518282815181106117a0576117a0613f56565b602090810291909101015260010161176c565b509695505050505050565b6117c6612ab2565b6117ce612adf565b475f8190036117f0576040516367e3990d60e01b815260040160405180910390fd5b5f611803600b546001600160a01b031690565b6001600160a01b0316826040515f6040518083038185875af1925050503d805f811461184a576040519150601f19603f3d011682016040523d82523d5f602084013e61184f565b606091505b5050905080611871576040516327fcd9d160e01b815260040160405180910390fd5b600b546001600160a01b03166001600160a01b03167feaff4b37086828766ad3268786972c0cd24259d4c87a80f9d3963a3c3d999b0d836040516118b791815260200190565b60405180910390a250506118d760015f8051602061414f83398151915255565b565b6118e1612ab2565b5f6118eb60095490565b90505f821180156118fb57508181115b156119295760405163b14d3f5b60e01b815260048101829052602481018390525f6044820152606401610b04565b600d8290556040518281527ff2672935fc79f5237559e2e2999dbe743bf65430894ac2b37666890e7c69e1af906020015b60405180910390a15050565b61198083838360405180602001604052805f8152506128b0565b505050565b60605f805f60115485106119af5760405163833a367760e01b815260048101869052602401610b04565b5f858152601060205260409020805481906119c990613da4565b80601f01602080910402602001604051908101604052809291908181526020018280546119f590613da4565b8015611a405780601f10611a1757610100808354040283529160200191611a40565b820191905f5260205f20905b815481529060010190602001808311611a2357829003601f168201915b5050506001840154600285015460125494995090975060ff169550505015801590611a6f5750600281015460ff165b15611a95576012546001820154611a8890612710614079565b611a929190614090565b91505b509193509193565b6060611aa7612ab2565b60155460ff16611aca5760405163af79b43760e01b815260040160405180910390fd5b5f82516001600160401b03811115611ae457611ae461382a565b604051908082528060200260200182016040528015611b0d578160200160208202803683370190505b5090505f5b8351811015611b6357611b3e85858381518110611b3157611b31613f56565b6020026020010151612627565b828281518110611b5057611b50613f56565b6020908102919091010152600101611b12565b509392505050565b611b73612ab2565b6015805460ff19168215159081179091556040519081527fed867810aa1d625274c5c2fead4ed7d7e175721d897fa5c0093a9e8f85a32588906020015b60405180910390a150565b5f611bc560095490565b8210611bed5760405163295f44f760e21b81525f600482015260248101839052604401610b04565b60098281548110611c0057611c00613f56565b905f5260205f2001549050919050565b611c18612ab2565b600e611c248282613e5a565b507f6741b2fc379fad678116fe3d4d4b9a1a184ab53ba36b86ad0fa66340b1ab41ad81604051611bb091906137c3565b611c5c612adf565b60155460ff16611c7f5760405163af79b43760e01b815260040160405180910390fd5b805f03611c9f5760405163524f409b60e01b815260040160405180910390fd5b6012545f03611cc15760405163c349568f60e01b815260040160405180910390fd5b5f81600f54611cd09190614079565b905080341015611cfc5760405163b99e2ab760e01b815260048101829052346024820152604401610b04565b335f908152601360205260409020805415801590611d1f5750600481015460ff16155b15611d55576101008160010154611d369190613e03565b4311611d555760405163145718a760e01b815260040160405180910390fd5b6040805160a0810182528581524360208083018281528385018881523460608087019182525f608088018181523380835260138852918a90209851895594516001890155925160028801559051600387015591516004909501805460ff19169515159590951790945584518981529182018890529381019190915290917fde6148e73bfcab0a63687903184f71d8f79aaa245898aa5244e45a7e76cd9b48910160405180910390a25050610ad760015f8051602061414f83398151915255565b611e1d612ab2565b6011548110611e425760405163833a367760e01b815260048101829052602401610b04565b8060175403611e6457604051630ec1e18560e41b815260040160405180910390fd5b601781905560405181907f7e89241f8b57266ef29d4bb897a3e5d9877c57fca995d235fdbb94b375451c58905f90a250565b5f610a1082612a6d565b60605f611eac60095490565b90505f816001600160401b03811115611ec757611ec761382a565b604051908082528060200260200182016040528015611ef0578160200160208202803683370190505b5090505f805b83811015611f4b575f81815260166020526040902054819060ff1615611f425780848481518110611f2957611f29613f56565b602090810291909101015282611f3e81613f3e565b9350505b50600101611ef6565b505f816001600160401b03811115611f6557611f6561382a565b604051908082528060200260200182016040528015611f8e578160200160208202803683370190505b5090505f5b82811015611fda57838181518110611fad57611fad613f56565b6020026020010151828281518110611fc757611fc7613f56565b6020908102919091010152600101611f93565b50949350505050565b5f6001600160a01b03821661200d576040516322718ad960e21b81525f6004820152602401610b04565b506001600160a01b03165f9081526003602052604090205490565b612030612ab2565b6118d75f612c4c565b612041612ab2565b612049612adf565b6001600160a01b0381166120b25760405162461bcd60e51b815260206004820152602a60248201527f4b68756761584d6169636968536b696e3a20776974686472617720746f207a65604482015269726f206164647265737360b01b6064820152608401610b04565b475f8190036120d4576040516367e3990d60e01b815260040160405180910390fd5b5f826001600160a01b0316826040515f6040518083038185875af1925050503d805f811461211d576040519150601f19603f3d011682016040523d82523d5f602084013e612122565b606091505b5050905080612144576040516327fcd9d160e01b815260040160405180910390fd5b826001600160a01b03167feaff4b37086828766ad3268786972c0cd24259d4c87a80f9d3963a3c3d999b0d8360405161217f91815260200190565b60405180910390a2505061219f60015f8051602061414f83398151915255565b50565b6121aa612ab2565b60115481106121cf5760405163833a367760e01b815260048101829052602401610b04565b5f818152601060205260409020600281015460ff16612204576040516319714d3f60e01b815260048101839052602401610b04565b806001015460125f8282546122199190613df0565b909155505060028101805460ff19169055600181015460405183917fd6f995acea32f7c3a6b7ff92783b8b033190011a4301a400a27305c0efbea7b89161107b9185915f906140a3565b60605f61226f83611fe3565b90505f816001600160401b0381111561228a5761228a61382a565b6040519080825280602002602001820160405280156122b3578160200160208202803683370190505b5090505f5b82811015611b63576122ca85826115d6565b8282815181106122dc576122dc613f56565b60209081029190910101526001016122b8565b60608060608060606011546001600160401b038111156123115761231161382a565b60405190808252806020026020018201604052801561233a578160200160208202803683370190505b5094506011546001600160401b038111156123575761235761382a565b60405190808252806020026020018201604052801561238a57816020015b60608152602001906001900390816123755790505b5093506011546001600160401b038111156123a7576123a761382a565b6040519080825280602002602001820160405280156123d0578160200160208202803683370190505b5092506011546001600160401b038111156123ed576123ed61382a565b604051908082528060200260200182016040528015612416578160200160208202803683370190505b5091506011546001600160401b038111156124335761243361382a565b60405190808252806020026020018201604052801561245c578160200160208202803683370190505b5090505f5b6011548110156125f0575f8181526010602052604090208651829088908290811061248e5761248e613f56565b6020908102919091010152805481906124a690613da4565b80601f01602080910402602001604051908101604052809291908181526020018280546124d290613da4565b801561251d5780601f106124f45761010080835404028352916020019161251d565b820191905f5260205f20905b81548152906001019060200180831161250057829003601f168201915b505050505086838151811061253457612534613f56565b6020026020010181905250806001015485838151811061255657612556613f56565b60209081029190910101526002810154845160ff9091169085908490811061258057612580613f56565b91151560209283029190910190910152601254158015906125a55750600281015460ff165b156125e75760125460018201546125be90612710614079565b6125c89190614090565b8383815181106125da576125da613f56565b6020026020010181815250505b50600101612461565b509091929394565b5f61260282612a6d565b50505f9081526016602052604090205460ff1690565b606060018054610a2490613da4565b5f612630612ab2565b60155460ff166126535760405163af79b43760e01b815260040160405180910390fd5b60115482106126785760405163833a367760e01b815260048101839052602401610b04565b5f8281526010602052604090206002015460ff166126ac576040516319714d3f60e01b815260048101839052602401610b04565b6126b66001612afa565b600c80545f91826126c683613f3e565b9190505590506126d68482612bd7565b5f83815260106020526040902080546126f4918391610eb990613da4565b5f8181526014602090815260408083208690558583526010909152908190209051849183916001600160a01b038816917f01f8bd07e6c27ff813d5c6d3c4bf0313a1d75043cf978214b504b794075e5266916127509190613fe3565b60405180910390a49392505050565b610ad7338383612c9d565b612772612adf565b335f908152601360205260409020805461279f576040516318d82abb60e31b815260040160405180910390fd5b600481015460ff16156127c5576040516323cf59cb60e21b815260040160405180910390fd5b600381810154335f8181526013602052604080822082815560018101839055600281018390559485018290556004909401805460ff19169055925191929183908381818185875af1925050503d805f811461283b576040519150601f19603f3d011682016040523d82523d5f602084013e612840565b606091505b5050905080612862576040516327fcd9d160e01b815260040160405180910390fd5b60405182815233907f0bd7926ed694a812910c5ec5aa135d70f0a29ae1e0d57134cf4b780790c68d1b9060200160405180910390a25050506118d760015f8051602061414f83398151915255565b6128bb848484611087565b61110a3385858585612d3b565b6060610a1082612e63565b6001600160a01b039182165f90815260056020908152604080832093909416825291909152205460ff1690565b612908612ab2565b6001600160a01b03811661293157604051631e4fbdf760e01b81525f6004820152602401610b04565b61219f81612c4c565b612942612ab2565b600f80549082905560408051828152602081018490527f2e1c9e000c6e8dda4d03536adb13b7cb6034ccff90d17f01de381e4d5097b525910161195a565b5f61298a82612a6d565b50505f9081526014602052604090205490565b6001600160a01b0381165f90815260136020526040812080546001820154600283015460038401546004850154939592949193909260ff90911691819087158015906129ee5750600481015460ff16155b15612a3d5760018160010154612a049190613e03565b4310158015612a2457506101008160010154612a209190613e03565b4311155b92506101008160010154612a389190613e03565b431191505b50919395979092949650565b5f6001600160e01b0319821663780e9d6360e01b1480610a105750610a1082612f5a565b5f818152600260205260408120546001600160a01b031680610a1057604051637e27328960e01b815260048101849052602401610b04565b6119808383836001612f7e565b600b546001600160a01b031633146118d75760405163118cdaa760e01b8152336004820152602401610b04565b612ae7613082565b60025f8051602061414f83398151915255565b600d541561219f575f612b0c60095490565b600d54909150612b1c8383613e03565b1115610ad757600d5460405163b14d3f5b60e01b815260048101839052602481019190915260448101839052606401610b04565b5f8060125483612b609190614009565b90505f805b601154811015612bbd575f8181526010602052604090206002015460ff1615612bb5575f81815260106020526040902060010154612ba39083613e03565b915081831015612bb557949350505050565b600101612b65565b5060405163c349568f60e01b815260040160405180910390fd5b610ad7828260405180602001604052805f8152506130b1565b5f828152600660205260409020612c078282613e5a565b506040518281527ff8e1a15aba9398e019f0b49df1a4fde98ee17ae345cb5f6b5e2c27f5033e8ce79060200161195a565b5f612c448484846130c8565b949350505050565b600b80546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b6001600160a01b038216612ccf57604051630b61174360e31b81526001600160a01b0383166004820152602401610b04565b6001600160a01b038381165f81815260056020908152604080832094871680845294825291829020805460ff191686151590811790915591519182527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a3505050565b6001600160a01b0383163b15612e5c57604051630a85bd0160e11b81526001600160a01b0384169063150b7a0290612d7d9088908890879087906004016140b5565b6020604051808303815f875af1925050508015612db7575060408051601f3d908101601f19168201909252612db4918101906140f1565b60015b612e1e573d808015612de4576040519150601f19603f3d011682016040523d82523d5f602084013e612de9565b606091505b5080515f03612e1657604051633250574960e11b81526001600160a01b0385166004820152602401610b04565b805160208201fd5b6001600160e01b03198116630a85bd0160e11b14612e5a57604051633250574960e11b81526001600160a01b0385166004820152602401610b04565b505b5050505050565b6060612e6e82612a6d565b505f8281526006602052604081208054612e8790613da4565b80601f0160208091040260200160405190810160405280929190818152602001828054612eb390613da4565b8015612efe5780601f10612ed557610100808354040283529160200191612efe565b820191905f5260205f20905b815481529060010190602001808311612ee157829003601f168201915b505050505090505f612f0e613193565b905080515f03612f1f575092915050565b815115612f51578082604051602001612f3992919061410c565b60405160208183030381529060405292505050919050565b612c44846131a2565b5f6001600160e01b03198216632483248360e11b1480610a105750610a1082613207565b8080612f9257506001600160a01b03821615155b15613053575f612fa184612a6d565b90506001600160a01b03831615801590612fcd5750826001600160a01b0316816001600160a01b031614155b8015612fe05750612fde81846128d3565b155b156130095760405163a9fbf51f60e01b81526001600160a01b0384166004820152602401610b04565b81156130515783856001600160a01b0316826001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b50505f90815260046020526040902080546001600160a01b0319166001600160a01b0392909216919091179055565b5f8051602061414f833981519152546002036118d757604051633ee5aeb560e01b815260040160405180910390fd5b6130bb8383613256565b611980335f858585612d3b565b5f806130d58585856132b7565b90506001600160a01b0381166131315761312c84600980545f838152600a60205260408120829055600182018355919091527f6e1540171b6c0c960b71a7020d9f60077f6af931a8bbf590da0223dacf75c7af0155565b613154565b846001600160a01b0316816001600160a01b0316146131545761315481856133a9565b6001600160a01b0385166131705761316b84613426565b612c44565b846001600160a01b0316816001600160a01b031614612c4457612c4485856134cd565b6060600e8054610a2490613da4565b60606131ad82612a6d565b505f6131b7613193565b90505f8151116131d55760405180602001604052805f815250613200565b806131df8461351b565b6040516020016131f092919061410c565b6040516020818303038152906040525b9392505050565b5f6001600160e01b031982166380ac58cd60e01b148061323757506001600160e01b03198216635b5e139f60e01b145b80610a1057506301ffc9a760e01b6001600160e01b0319831614610a10565b6001600160a01b03821661327f57604051633250574960e11b81525f6004820152602401610b04565b5f61328b83835f612c38565b90506001600160a01b03811615611980576040516339e3563760e11b81525f6004820152602401610b04565b5f828152600260205260408120546001600160a01b03908116908316156132e3576132e38184866135aa565b6001600160a01b0381161561331d576132fe5f855f80612f7e565b6001600160a01b0381165f90815260036020526040902080545f190190555b6001600160a01b0385161561334b576001600160a01b0385165f908152600360205260409020805460010190555b5f8481526002602052604080822080546001600160a01b0319166001600160a01b0389811691821790925591518793918516917fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef91a4949350505050565b5f6133b383611fe3565b5f838152600860209081526040808320546001600160a01b0388168452600790925290912091925090818314613408575f83815260208281526040808320548584528184208190558352600890915290208290555b5f938452600860209081526040808620869055938552525081205550565b6009545f9061343790600190613df0565b5f838152600a60205260408120546009805493945090928490811061345e5761345e613f56565b905f5260205f2001549050806009838154811061347d5761347d613f56565b5f918252602080832090910192909255828152600a909152604080822084905585825281205560098054806134b4576134b461413a565b600190038181905f5260205f20015f9055905550505050565b5f60016134d984611fe3565b6134e39190613df0565b6001600160a01b039093165f908152600760209081526040808320868452825280832085905593825260089052919091209190915550565b60605f6135278361360e565b60010190505f816001600160401b038111156135455761354561382a565b6040519080825280601f01601f19166020018201604052801561356f576020820181803683370190505b5090508181016020015b5f19016f181899199a1a9b1b9c1cb0b131b232b360811b600a86061a8153600a850494508461357957509392505050565b6135b58383836136e5565b611980576001600160a01b0383166135e357604051637e27328960e01b815260048101829052602401610b04565b60405163177e802f60e01b81526001600160a01b038316600482015260248101829052604401610b04565b5f8072184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b831061364c5772184f03e93ff9f4daa797ed6e38ed64bf6a1f0160401b830492506040015b6d04ee2d6d415b85acef81000000008310613678576d04ee2d6d415b85acef8100000000830492506020015b662386f26fc10000831061369657662386f26fc10000830492506010015b6305f5e10083106136ae576305f5e100830492506008015b61271083106136c257612710830492506004015b606483106136d4576064830492506002015b600a8310610a105760010192915050565b5f6001600160a01b03831615801590612c445750826001600160a01b0316846001600160a01b0316148061371e575061371e84846128d3565b80612c445750505f908152600460205260409020546001600160a01b03908116911614919050565b6001600160e01b03198116811461219f575f80fd5b5f6020828403121561376b575f80fd5b813561320081613746565b5f5b83811015613790578181015183820152602001613778565b50505f910152565b5f81518084526137af816020860160208601613776565b601f01601f19169290920160200192915050565b602081525f6132006020830184613798565b5f602082840312156137e5575f80fd5b5035919050565b6001600160a01b038116811461219f575f80fd5b5f8060408385031215613811575f80fd5b823561381c816137ec565b946020939093013593505050565b634e487b7160e01b5f52604160045260245ffd5b604051601f8201601f191681016001600160401b03811182821017156138665761386661382a565b604052919050565b5f6001600160401b038311156138865761388661382a565b613899601f8401601f191660200161383e565b90508281528383830111156138ac575f80fd5b828260208301375f602084830101529392505050565b5f82601f8301126138d1575f80fd5b6132008383356020850161386e565b8035801515811461102a575f80fd5b5f805f8060808587031215613902575f80fd5b8435935060208501356001600160401b0381111561391e575f80fd5b61392a878288016138c2565b93505060408501359150613940606086016138e0565b905092959194509250565b5f6020828403121561395b575f80fd5b8135613200816137ec565b5f815180845260208085019450602084015f5b8381101561399557815187529582019590820190600101613979565b509495945050505050565b602081525f6132006020830184613966565b5f80604083850312156139c3575f80fd5b8235915060208301356001600160401b038111156139df575f80fd5b6139eb858286016138c2565b9150509250929050565b5f805f60608486031215613a07575f80fd5b8335613a12816137ec565b92506020840135613a22816137ec565b929592945050506040919091013590565b5f8060408385031215613a44575f80fd5b50508035926020909101359150565b5f8060408385031215613a64575f80fd5b82356001600160401b03811115613a79575f80fd5b613a85858286016138c2565b95602094909401359450505050565b5f8060408385031215613aa5575f80fd5b82359150613ab5602084016138e0565b90509250929050565b608081525f613ad06080830187613798565b6020830195909552509115156040830152606090910152919050565b5f8060408385031215613afd575f80fd5b8235613b08816137ec565b91506020838101356001600160401b0380821115613b24575f80fd5b818601915086601f830112613b37575f80fd5b813581811115613b4957613b4961382a565b8060051b9150613b5a84830161383e565b8181529183018401918481019089841115613b73575f80fd5b938501935b83851015613b9157843582529385019390850190613b78565b8096505050505050509250929050565b5f60208284031215613bb1575f80fd5b613200826138e0565b5f60208284031215613bca575f80fd5b81356001600160401b03811115613bdf575f80fd5b612c44848285016138c2565b5f815180845260208085019450602084015f5b83811015613995578151151587529582019590820190600101613bfe565b60a081525f613c2e60a0830188613966565b6020838203818501528188518084528284019150828160051b850101838b015f5b83811015613c7d57601f19878403018552613c6b838351613798565b94860194925090850190600101613c4f565b50508681036040880152613c91818b613966565b9450505050508281036060840152613ca98186613beb565b90508281036080840152613cbd8185613966565b98975050505050505050565b5f8060408385031215613cda575f80fd5b8235613ce5816137ec565b9150613ab5602084016138e0565b5f805f8060808587031215613d06575f80fd5b8435613d11816137ec565b93506020850135613d21816137ec565b92506040850135915060608501356001600160401b03811115613d42575f80fd5b8501601f81018713613d52575f80fd5b613d618782356020840161386e565b91505092959194509250565b5f8060408385031215613d7e575f80fd5b8235613d89816137ec565b91506020830135613d99816137ec565b809150509250929050565b600181811c90821680613db857607f821691505b602082108103613dd657634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b81810381811115610a1057610a10613ddc565b80820180821115610a1057610a10613ddc565b601f82111561198057805f5260205f20601f840160051c81016020851015613e3b5750805b601f840160051c820191505b81811015612e5c575f8155600101613e47565b81516001600160401b03811115613e7357613e7361382a565b613e8781613e818454613da4565b84613e16565b602080601f831160018114613eba575f8415613ea35750858301515b5f19600386901b1c1916600185901b178555612e5a565b5f85815260208120601f198616915b82811015613ee857888601518255948401946001909101908401613ec9565b5085821015613f0557878501515f19600388901b60f8161c191681555b5050505050600190811b01905550565b606081525f613f276060830186613798565b602083019490945250901515604090910152919050565b5f60018201613f4f57613f4f613ddc565b5060010190565b634e487b7160e01b5f52603260045260245ffd5b5f8154613f7681613da4565b808552602060018381168015613f935760018114613fad57613fd8565b60ff1985168884015283151560051b880183019550613fd8565b865f52825f205f5b85811015613fd05781548a8201860152908301908401613fb5565b890184019650505b505050505092915050565b602081525f6132006020830184613f6a565b634e487b7160e01b5f52601260045260245ffd5b5f8261401757614017613ff5565b500690565b5f8161402a5761402a613ddc565b505f190190565b838152826020820152606060408201525f61404f6060830184613f6a565b95945050505050565b604081525f61406a6040830185613798565b90508260208301529392505050565b8082028115828204841417610a1057610a10613ddc565b5f8261409e5761409e613ff5565b500490565b606081525f613f276060830186613f6a565b6001600160a01b03858116825284166020820152604081018390526080606082018190525f906140e790830184613798565b9695505050505050565b5f60208284031215614101575f80fd5b815161320081613746565b5f835161411d818460208801613776565b835190830190614131818360208801613776565b01949350505050565b634e487b7160e01b5f52603160045260245ffdfe9b779b17422d0df92223018b32b4d1fa46e071723d6817e2486d003becc55f00a2646970667358221220ccd1b84e6040f6c90fa2f18ec5d214438f87330584a13932f8fdad47084a1d6864736f6c63430008180033

000000000000000000000000eb0596fd9b78471681dfb2ee6adbbcdbe079a6440000000000000000000000000000000000000000000000000011c37937e08000

-----Decoded View---------------
Arg [0] : initialOwner (address): 0xEb0596fD9b78471681DfB2eE6adbbCDbE079A644
Arg [1] : initialMintPrice (uint256): 5000000000000000

-----Encoded View---------------
2 Constructor Arguments found :
Arg [0] : 000000000000000000000000eb0596fd9b78471681dfb2ee6adbbcdbe079a644
Arg [1] : 0000000000000000000000000000000000000000000000000011c37937e08000