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.20;

import "@openzeppelin/contracts/token/ERC721/ERC721.sol";
import "@openzeppelin/contracts/token/ERC20/IERC20.sol";
import "@openzeppelin/contracts/access/Ownable.sol";
import "@openzeppelin/contracts/utils/Base64.sol";
import "@openzeppelin/contracts/utils/ReentrancyGuard.sol";

/**
 * @title BluemoonTotal
 * @notice Single NFT representing the complete Blue Moon collective artwork
 * @dev Fully on-chain: 20,002 RGB colors stored in packed format, BMP generated on-demand
 *
 * When sold, proceeds are distributed to 67 minters based on their contribution.
 *
 * Technical Details:
 * - Grid: 142×141 cells (20,022 total, 20 empty/white at end)
 * - Storage: 20,002 colors packed as RGB (3 bytes each, 10 colors per uint256)
 * - Image: BMP format wrapped in SVG for infinite scaling
 */
contract BluemoonTotal is ERC721, Ownable, ReentrancyGuard {

    // ============================================
    // CONSTANTS & IMMUTABLES
    // ============================================

    /// @notice USDC token contract
    IERC20 public immutable usdc;

    /// @notice Price to purchase the canvas NFT (in USDC, 6 decimals)
    uint256 public immutable SALE_PRICE;

    /// @notice Grid dimensions: width (142), height is 141 for 20,002 colors
    uint256 public constant GRID_SIZE = 142;

    /// @notice Total number of colors stored (20,002 minted)
    uint256 public constant TOTAL_COLORS = 20002;

    /// @notice Number of colors packed per storage slot (10 colors × 3 bytes = 30 bytes)
    uint256 private constant COLORS_PER_SLOT = 10;

    /// @notice Total storage slots needed for all colors (ceil(20002 / 10) = 2001)
    uint256 private constant TOTAL_COLOR_SLOTS = 2001;

    // ============================================
    // STATE VARIABLES
    // ============================================

    /// @notice Whether the canvas has been sold
    bool public sold;

    /// @notice Whether color data has been fully loaded and finalized
    bool public finalized;

    /// @notice Packed color data: RGB values (3 bytes each, 10 per uint256)
    /// @dev Format per slot: [R0,G0,B0,R1,G1,B1,...,R9,G9,B9,00,00]
    uint256[TOTAL_COLOR_SLOTS] private colorData;

    /// @notice List of all minter addresses eligible for shares
    address[] public minters;

    /// @notice USDC amount each minter can claim (6 decimals)
    mapping(address => uint256) public shareAmount;

    /// @notice Whether a minter has claimed their share
    mapping(address => bool) public hasClaimed;

    // ============================================
    // EVENTS
    // ============================================

    event CanvasSold(address indexed buyer, uint256 price, uint256 timestamp);
    event ShareClaimed(address indexed minter, uint256 amount);
    event AllSharesDistributed(uint256 totalAmount, uint256 minterCount);
    event EmergencyWithdraw(address indexed owner, uint256 amount);
    event ColorChunkLoaded(uint256 indexed startSlot, uint256 count);
    event ColorDataFinalized();

    // ============================================
    // ERRORS
    // ============================================

    error AlreadySold();
    error NotSoldYet();
    error AlreadyDistributed();
    error NoShareAvailable();
    error InvalidArrayLengths();
    error InvalidMinterCount();
    error SharesMismatch();
    error TokenDoesNotExist();
    error USDCTransferFailed();
    error InvalidColorIndex();
    error NotFinalized();
    error AlreadyFinalized();
    error InvalidChunkRange();

    // ============================================
    // CONSTRUCTOR
    // ============================================

    /**
     * @notice Deploy the BluemoonTotal contract
     * @param _usdc USDC token address 
     * @param _salePrice Price in USDC (6 decimals)
     * @param _minters Array of 67 minter addresses
     * @param _shareAmounts Array of 67 USDC amounts (must sum to _salePrice)
     * @dev Color data must be loaded after deployment using loadColorChunk()
     */
    constructor(
        address _usdc,
        uint256 _salePrice,
        address[] memory _minters,
        uint256[] memory _shareAmounts
    ) ERC721("Blue Moon", "BMOON") Ownable(msg.sender) {
        require(_usdc != address(0), "Invalid USDC address");
        require(_salePrice > 0, "Invalid sale price");

        if (_minters.length != _shareAmounts.length) revert InvalidArrayLengths();
        if (_minters.length == 0) revert InvalidMinterCount();

        usdc = IERC20(_usdc);
        SALE_PRICE = _salePrice;
        minters = _minters;

        // Store share amounts and verify total equals sale price
        uint256 totalShares;
        for (uint256 i = 0; i < _minters.length; i++) {
            require(_minters[i] != address(0), "Invalid minter address");
            shareAmount[_minters[i]] = _shareAmounts[i];
            totalShares += _shareAmounts[i];
        }

        if (totalShares != _salePrice) revert SharesMismatch();
    }

    // ============================================
    // COLOR DATA LOADING
    // ============================================

    /**
     * @notice Load a chunk of color data into storage
     * @param startSlot Starting slot index (0-2000)
     * @param chunk Array of packed uint256 color data
     * @dev Can only be called by owner before finalization
     *      Recommended chunk size: ~200 slots per transaction
     */
    function loadColorChunk(uint256 startSlot, uint256[] calldata chunk) external onlyOwner {
        if (finalized) revert AlreadyFinalized();
        if (startSlot + chunk.length > TOTAL_COLOR_SLOTS) revert InvalidChunkRange();

        for (uint256 i = 0; i < chunk.length; i++) {
            colorData[startSlot + i] = chunk[i];
        }

        emit ColorChunkLoaded(startSlot, chunk.length);
    }

    /**
     * @notice Finalize color data loading
     * @dev After finalization, no more chunks can be loaded and tokenURI becomes available
     *      Verifies that all color slots have been loaded (non-zero)
     */
    function finalize() external onlyOwner {
        if (finalized) revert AlreadyFinalized();

        // Verify all slots are loaded (at least the first and last should be non-zero)
        if (colorData[0] == 0 || colorData[TOTAL_COLOR_SLOTS - 1] == 0) {
            revert InvalidChunkRange(); // Reusing error for "incomplete data"
        }

        finalized = true;
        emit ColorDataFinalized();
    }

    /**
     * @notice Get current loading progress
     * @return loaded Number of non-zero slots
     * @return total Total slots needed
     * @return isFinalized Whether data is finalized
     */
    function getLoadingProgress() external view returns (
        uint256 loaded,
        uint256 total,
        bool isFinalized
    ) {
        uint256 count = 0;
        for (uint256 i = 0; i < TOTAL_COLOR_SLOTS; i++) {
            if (colorData[i] != 0) count++;
        }
        return (count, TOTAL_COLOR_SLOTS, finalized);
    }

    // ============================================
    // SALE FUNCTIONS
    // ============================================

    /**
     * @notice Purchase the Blue Moon Total NFT
     * @dev Transfers USDC from buyer and mints token ID 0
     *      Follows checks-effects-interactions pattern for security
     */
    function buyCanvas() external nonReentrant {
        if (sold) revert AlreadySold();
        if (!finalized) revert NotFinalized();

        // Effects: Update state BEFORE external calls
        sold = true;

        // Interactions: Transfer USDC from buyer to contract
        bool success = usdc.transferFrom(msg.sender, address(this), SALE_PRICE);
        if (!success) {
            sold = false;  // Revert state change on failure
            revert USDCTransferFailed();
        }

        // Safe mint token ID 0
        _safeMint(msg.sender, 0);

        emit CanvasSold(msg.sender, SALE_PRICE, block.timestamp);
    }

    /**
     * @notice Distribute USDC to all 67 minters in a single transaction
     * @dev Can be called by anyone after canvas is sold. Uses contract address as distribution flag.
     */
    function distributePayouts() external nonReentrant {
        if (!sold) revert NotSoldYet();
        if (hasClaimed[address(this)]) revert AlreadyDistributed();

        hasClaimed[address(this)] = true; // Mark distribution as complete

        uint256 totalDistributed = 0;

        for (uint256 i = 0; i < minters.length; i++) {
            address minter = minters[i];
            uint256 amount = shareAmount[minter];

            if (amount > 0) {
                hasClaimed[minter] = true; // Mark minter as paid
                bool success = usdc.transfer(minter, amount);
                if (!success) revert USDCTransferFailed();

                totalDistributed += amount;
                emit ShareClaimed(minter, amount);
            }
        }

        emit AllSharesDistributed(totalDistributed, minters.length);
    }

    /**
     * @notice Get list of all minters and their share information
     * @return addresses Array of minter addresses
     * @return amounts Array of share amounts
     * @return claimed Array of claim status
     */
    function getMinterInfo()
        external
        view
        returns (
            address[] memory addresses,
            uint256[] memory amounts,
            bool[] memory claimed
        )
    {
        uint256 len = minters.length;
        addresses = new address[](len);
        amounts = new uint256[](len);
        claimed = new bool[](len);

        for (uint256 i = 0; i < len; i++) {
            addresses[i] = minters[i];
            amounts[i] = shareAmount[minters[i]];
            claimed[i] = hasClaimed[minters[i]];
        }
    }

    // ============================================
    // METADATA GENERATION
    // ============================================

    /**
     * @notice Generate token URI with fully on-chain BMP image
     * @param tokenId Token ID (must be 0)
     * @return metadata Base64-encoded JSON metadata with embedded image
     * @dev Requires color data to be finalized first
     */
    function tokenURI(uint256 tokenId)
        public
        view
        override
        returns (string memory)
    {
        if (tokenId != 0) revert TokenDoesNotExist();
        if (!finalized) revert NotFinalized();

        // Generate 142×141 BMP image
        bytes memory bmp = _generateBMP();

        // Wrap in SVG for infinite scaling with crisp pixels
        string memory svg = string(abi.encodePacked(
            '<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 142 141">',
            '<image href="data:image/bmp;base64,',
            Base64.encode(bmp),
            '" width="142" height="141" style="image-rendering:pixelated"/>',
            '</svg>'
        ));

        // Build JSON metadata
        string memory json = string(abi.encodePacked(
            '{"name":"20,002 colours",',
            '"description":"Complete 142x141 grid showcasing all 20,002 Blue Moon colors that were previously created and stored on-chain during the $BMOON ERC20 mint (0x9A2911782063285bb7d8a4d088a1FbB94bB8c6E8). ',
            'The grid started empty and was progressively filled as addresses minted tokens. ',
            'This artwork is stored entirely on-chain, and the proceeds from its sale were distributed proportionally to all minters. ',
            'Created by Loucas Braconnier/Figure31.',
            '",',
            '"image":"data:image/svg+xml;base64,',
            Base64.encode(bytes(svg)),
            '","attributes":[',
            '{"trait_type":"Unique Minters","value":"67"},',
            '{"trait_type":"Grid Size","value":"142x141"}',
            ']}'
        ));

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

    /**
     * @notice Generate BMP image from stored color data
     * @return bmp Complete BMP file as bytes (60,402 bytes total)
     * @dev Format: 14-byte file header + 40-byte DIB header + 60,348-byte pixel data (with row padding)
     *      Grid: 142 (width) × 141 (height) = 20,022 cells for 20,002 colors + 20 empty
     *      BMP rows must be padded to 4-byte boundary: 142px × 3 bytes = 426 bytes + 2 padding = 428 bytes/row
     */
    function _generateBMP() internal view returns (bytes memory) {
        uint256 width = GRID_SIZE;  // 142
        uint256 height = 141;       // 141 rows (not 142) to fit 20,002 colors

        // Calculate row padding - BMP rows must be padded to 4-byte boundary
        uint256 rowBytes = width * 3; // 426 bytes (142 × 3)
        uint256 padding = (4 - (rowBytes % 4)) % 4; // 2 bytes padding needed
        uint256 rowBytesWithPadding = rowBytes + padding; // 428 bytes
        uint256 imageSize = rowBytesWithPadding * height; // 60,776 bytes
        uint256 fileSize = imageSize + 54; // + headers

        bytes memory bmp = new bytes(fileSize);
        uint256 idx = 0;

        // === BMP File Header (14 bytes) ===
        bmp[idx++] = 0x42; // 'B'
        bmp[idx++] = 0x4D; // 'M'
        idx = _writeUint32(bmp, idx, fileSize);     // File size
        idx = _writeUint32(bmp, idx, 0);            // Reserved
        idx = _writeUint32(bmp, idx, 54);           // Pixel data offset

        // === DIB Header (BITMAPINFOHEADER, 40 bytes) ===
        idx = _writeUint32(bmp, idx, 40);           // Header size
        idx = _writeInt32(bmp, idx, int32(uint32(width)));   // Width
        idx = _writeInt32(bmp, idx, int32(uint32(height)));  // Height (positive = bottom-up)
        idx = _writeUint16(bmp, idx, 1);            // Color planes
        idx = _writeUint16(bmp, idx, 24);           // Bits per pixel (RGB)
        idx = _writeUint32(bmp, idx, 0);            // Compression (none)
        idx = _writeUint32(bmp, idx, imageSize);    // Image size
        idx = _writeUint32(bmp, idx, 2835);         // X pixels per meter (~72 DPI)
        idx = _writeUint32(bmp, idx, 2835);         // Y pixels per meter
        idx = _writeUint32(bmp, idx, 0);            // Colors in palette (0 = default)
        idx = _writeUint32(bmp, idx, 0);            // Important colors (0 = all)

        // === Pixel Data (BGR format, bottom-to-top rows) ===
        // BMP stores rows from bottom to top
        // Website displays: index 0 at bottom-right, moving left, then up
        for (uint256 row = 0; row < height; row++) {
            for (uint256 col = 0; col < width; col++) {
                // Match website order: bottom-right to bottom-left, then move up
                // row 0 = bottom, col 0 = left
                // index 0 = bottom-right, so: colorIdx = row * width + (width - 1 - col)
                uint256 colorIdx = row * width + (width - 1 - col);

                if (colorIdx < TOTAL_COLORS) {
                    (uint8 r, uint8 g, uint8 b) = _getColorAt(colorIdx);
                    bmp[idx++] = bytes1(b); // Blue first (BGR order)
                    bmp[idx++] = bytes1(g); // Green
                    bmp[idx++] = bytes1(r); // Red
                } else {
                    // Empty cells render as white
                    bmp[idx++] = 0xFF; // Blue
                    bmp[idx++] = 0xFF; // Green
                    bmp[idx++] = 0xFF; // Red
                }
            }

            // Add row padding (BMP rows must align to 4-byte boundary)
            for (uint256 p = 0; p < padding; p++) {
                bmp[idx++] = 0x00;
            }
        }

        return bmp;
    }

    /**
     * @notice Get RGB color at specific index
     * @param index Color index (0 to 20,001)
     * @return r Red component (0-255)
     * @return g Green component (0-255)
     * @return b Blue component (0-255)
     * @dev Unpacks color from storage slot using bitwise operations
     */
    function _getColorAt(uint256 index)
        internal
        view
        returns (uint8 r, uint8 g, uint8 b)
    {
        if (index >= TOTAL_COLORS) revert InvalidColorIndex();

        uint256 slot = index / COLORS_PER_SLOT;     // Which uint256 slot (0-2000)
        uint256 position = index % COLORS_PER_SLOT; // Position within slot (0-9)
        uint256 packed = colorData[slot];           // Load packed data

        // Each color occupies 24 bits (3 bytes: RGB)
        uint256 offset = position * 24;

        // Extract RGB bytes using bit shifts and masks
        r = uint8((packed >> (offset + 16)) & 0xFF); // Red at highest byte
        g = uint8((packed >> (offset + 8)) & 0xFF);  // Green at middle byte
        b = uint8((packed >> offset) & 0xFF);        // Blue at lowest byte
    }

    // ============================================
    // BMP HELPER FUNCTIONS
    // ============================================

    /**
     * @notice Write uint32 in little-endian format
     */
    function _writeUint32(bytes memory data, uint256 idx, uint256 value)
        private
        pure
        returns (uint256)
    {
        data[idx++] = bytes1(uint8(value & 0xFF));
        data[idx++] = bytes1(uint8((value >> 8) & 0xFF));
        data[idx++] = bytes1(uint8((value >> 16) & 0xFF));
        data[idx++] = bytes1(uint8((value >> 24) & 0xFF));
        return idx;
    }

    /**
     * @notice Write int32 in little-endian format
     */
    function _writeInt32(bytes memory data, uint256 idx, int32 value)
        private
        pure
        returns (uint256)
    {
        uint32 uvalue = uint32(value);
        data[idx++] = bytes1(uint8(uvalue & 0xFF));
        data[idx++] = bytes1(uint8((uvalue >> 8) & 0xFF));
        data[idx++] = bytes1(uint8((uvalue >> 16) & 0xFF));
        data[idx++] = bytes1(uint8((uvalue >> 24) & 0xFF));
        return idx;
    }

    /**
     * @notice Write uint16 in little-endian format
     */
    function _writeUint16(bytes memory data, uint256 idx, uint256 value)
        private
        pure
        returns (uint256)
    {
        data[idx++] = bytes1(uint8(value & 0xFF));
        data[idx++] = bytes1(uint8((value >> 8) & 0xFF));
        return idx;
    }

    // ============================================
    // ADMIN FUNCTIONS
    // ============================================

    /**
     * @notice Emergency withdraw USDC from contract
     * @dev Only callable by owner after canvas is sold.
     *      Use this if distribution fails or needs to be redone manually.
     */
    function emergencyWithdraw() external onlyOwner {
        if (!sold) revert NotSoldYet();

        uint256 balance = usdc.balanceOf(address(this));
        if (balance == 0) revert NoShareAvailable(); // Reusing error for "no funds"

        bool success = usdc.transfer(owner(), balance);
        if (!success) revert USDCTransferFailed();

        emit EmergencyWithdraw(owner(), balance);
    }

    /**
     * @notice Maximum number of tokens that can exist
     * @return Maximum supply of 1 (single edition NFT)
     */
    function maxSupply() external pure returns (uint256) {
        return 1;
    }

    /**
     * @notice Current number of tokens minted
     * @return Total supply: 0 before sale, 1 after sale
     */
    function totalSupply() external view returns (uint256) {
        return sold ? 1 : 0;
    }

    /**
     * @notice Get total number of minters
     */
    function getMinterCount() external view returns (uint256) {
        return minters.length;
    }

    /**
     * @notice Check if token exists (only token ID 0)
     */
    function exists(uint256 tokenId) external view returns (bool) {
        return tokenId == 0 && _ownerOf(tokenId) != address(0);
    }
}

// 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.4.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-20.
     * Used in balance queries.
     * @param owner Address of the current owner of a token.
     */
    error ERC721InvalidOwner(address owner);

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity >=0.4.16;

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

    // Token name
    string private _name;

    // Token symbol
    string private _symbol;

    mapping(uint256 tokenId => address) private _owners;

    mapping(address owner => uint256) private _balances;

    mapping(uint256 tokenId => address) private _tokenApprovals;

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

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

    /// @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.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.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/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.4.0) (token/ERC721/utils/ERC721Utils.sol)

pragma solidity ^0.8.20;

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

/**
 * @dev Library that provide common ERC-721 utility functions.
 *
 * See https://eips.ethereum.org/EIPS/eip-721[ERC-721].
 *
 * _Available since v5.1._
 */
library ERC721Utils {
    /**
     * @dev Performs an acceptance check for the provided `operator` by calling {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.4.0) (utils/Base64.sol)

pragma solidity ^0.8.20;

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

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

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

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

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

        string memory result = new string(resultLength);

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

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

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

            // Run over the input, 3 bytes at a time
            for {} lt(dataPtr, endPtr) {} {
                // Advance 3 bytes
                dataPtr := add(dataPtr, 3)
                let input := mload(dataPtr)

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

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

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

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

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

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

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

        return result;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v5.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.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.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.3.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 `a ? b : c`. Gas costs are constant.
     *
     * IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
     * However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
     * one branch when needed, making this function more expensive.
     */
    function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
        unchecked {
            // branchless ternary works because:
            // b ^ (a ^ b) == a
            // b ^ 0 == b
            return b ^ ((a ^ b) * SafeCast.toUint(condition));
        }
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        uint256 mLen = m.length;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

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

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

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

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

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

pragma solidity ^0.8.20;

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

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

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

pragma solidity ^0.8.20;

/**
 * @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].
 */
abstract contract ReentrancyGuard {
    // Booleans are more expensive than uint256 or any type that takes up a full
    // word because each write operation emits an extra SLOAD to first read the
    // slot's contents, replace the bits taken up by the boolean, and then write
    // back. This is the compiler's defense against contract upgrades and
    // pointer aliasing, and it cannot be disabled.

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

    uint256 private _status;

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

    constructor() {
        _status = NOT_ENTERED;
    }

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

    function _nonReentrantBefore() private {
        // On the first call to nonReentrant, _status will be NOT_ENTERED
        if (_status == ENTERED) {
            revert ReentrancyGuardReentrantCall();
        }

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

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

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

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

pragma solidity ^0.8.20;

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

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

    bytes16 private constant HEX_DIGITS = "0123456789abcdef";
    uint8 private constant ADDRESS_LENGTH = 20;
    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 Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return bytes(a).length == bytes(b).length && keccak256(bytes(a)) == keccak256(bytes(b));
    }

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

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

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

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

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

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

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

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

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

    uint256 private constant ABS_MIN_INT256 = 2 ** 255;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        return value;
    }

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

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

        return string(output);
    }

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

{
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "viaIR": true,
  "evmVersion": "paris",
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  }
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"_usdc","type":"address"},{"internalType":"uint256","name":"_salePrice","type":"uint256"},{"internalType":"address[]","name":"_minters","type":"address[]"},{"internalType":"uint256[]","name":"_shareAmounts","type":"uint256[]"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[],"name":"AlreadyDistributed","type":"error"},{"inputs":[],"name":"AlreadyFinalized","type":"error"},{"inputs":[],"name":"AlreadySold","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":[],"name":"InvalidArrayLengths","type":"error"},{"inputs":[],"name":"InvalidChunkRange","type":"error"},{"inputs":[],"name":"InvalidColorIndex","type":"error"},{"inputs":[],"name":"InvalidMinterCount","type":"error"},{"inputs":[],"name":"NoShareAvailable","type":"error"},{"inputs":[],"name":"NotFinalized","type":"error"},{"inputs":[],"name":"NotSoldYet","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":[],"name":"SharesMismatch","type":"error"},{"inputs":[],"name":"TokenDoesNotExist","type":"error"},{"inputs":[],"name":"USDCTransferFailed","type":"error"},{"anonymous":false,"inputs":[{"indexed":false,"internalType":"uint256","name":"totalAmount","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"minterCount","type":"uint256"}],"name":"AllSharesDistributed","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"buyer","type":"address"},{"indexed":false,"internalType":"uint256","name":"price","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"timestamp","type":"uint256"}],"name":"CanvasSold","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"uint256","name":"startSlot","type":"uint256"},{"indexed":false,"internalType":"uint256","name":"count","type":"uint256"}],"name":"ColorChunkLoaded","type":"event"},{"anonymous":false,"inputs":[],"name":"ColorDataFinalized","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"EmergencyWithdraw","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"minter","type":"address"},{"indexed":false,"internalType":"uint256","name":"amount","type":"uint256"}],"name":"ShareClaimed","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":"GRID_SIZE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"SALE_PRICE","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"TOTAL_COLORS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"buyCanvas","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"distributePayouts","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"emergencyWithdraw","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"exists","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"finalize","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"finalized","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getLoadingProgress","outputs":[{"internalType":"uint256","name":"loaded","type":"uint256"},{"internalType":"uint256","name":"total","type":"uint256"},{"internalType":"bool","name":"isFinalized","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getMinterCount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getMinterInfo","outputs":[{"internalType":"address[]","name":"addresses","type":"address[]"},{"internalType":"uint256[]","name":"amounts","type":"uint256[]"},{"internalType":"bool[]","name":"claimed","type":"bool[]"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"hasClaimed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"startSlot","type":"uint256"},{"internalType":"uint256[]","name":"chunk","type":"uint256[]"}],"name":"loadColorChunk","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"maxSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"pure","type":"function"},{"inputs":[{"internalType":"uint256","name":"","type":"uint256"}],"name":"minters","outputs":[{"internalType":"address","name":"","type":"address"}],"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":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"shareAmount","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"sold","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"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":[],"name":"usdc","outputs":[{"internalType":"contract IERC20","name":"","type":"address"}],"stateMutability":"view","type":"function"}]

60c0604052346106cd57612e3f80380380610019816106ea565b9283398101906080818303126106cd576100328161070f565b91602082015191604081015160018060401b0381116106cd5781019382601f860112156106cd5784519161006d61006884610723565b6106ea565b95602087858152016020819560051b830101918683116106cd57602001905b8282106106d2575050506060810151906001600160401b0382116106cd57019280601f850112156106cd5783516100c561006882610723565b9460208087848152019260051b8201019283116106cd57602001905b8282106106bd575050506100f560406106ea565b600981526821363ab29026b7b7b760b91b602082015261011560406106ea565b60058152642126a7a7a760d91b6020820152815190916001600160401b03821161043d5760005490600182811c921680156106b3575b60208310146105d45781601f849311610665575b50602090601f83116001146105ff576000926105f4575b50508160011b916000199060031b1c1916176000555b8051906001600160401b03821161043d5760015490600182811c921680156105ea575b60208310146105d45781601f84931161057a575b50602090601f831160011461051257600092610507575b50508160011b916000199060031b1c1916176001555b33156104f15760068054336001600160a01b0319821681179092556040519291906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0600080a360016007556001600160a01b03169081156104af57508315610475578451835103610464578451156104535760805260a08390528351906001600160401b03821161043d5768010000000000000000821161043d576107da54826107da55808310610401575b506107da600052602060002060005b8381106103e457505050506000926000935b8151851015610390576001600160a01b036102e18684610751565b51161561034b576102f28584610751565b516001600160a01b036103058785610751565b51166000526107db6020526040600020556103208584610751565b518101809111610335576001909401936102c6565b634e487b7160e01b600052601160045260246000fd5b60405162461bcd60e51b815260206004820152601660248201527f496e76616c6964206d696e7465722061646472657373000000000000000000006044820152606490fd5b83036103d3576040516126c3908161077c82396080518181816102cb01528181611448015281816118830152611b54015260a0518181816112af01526114170152f35b632bd02d8d60e21b60005260046000fd5b82516001600160a01b0316818301556020909201916001016102b4565b6107da600052610437907f33a7de614271b1d49b94003af1ac48e7c47802897d3b15e0e9cb01a78e9ff63190810190840161073a565b386102a5565b634e487b7160e01b600052604160045260246000fd5b635d31d7fb60e11b60005260046000fd5b63a9854bc960e01b60005260046000fd5b60405162461bcd60e51b8152602060048201526012602482015271496e76616c69642073616c6520707269636560701b6044820152606490fd5b62461bcd60e51b815260206004820152601460248201527f496e76616c6964205553444320616464726573730000000000000000000000006044820152606490fd5b631e4fbdf760e01b600052600060045260246000fd5b0151905038806101da565b600160009081528281209350601f198516905b8181106105625750908460019594939210610549575b505050811b016001556101f0565b015160001960f88460031b161c1916905538808061053b565b92936020600181928786015181550195019301610525565b60016000526105c4907fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6601f850160051c810191602086106105ca575b601f0160051c019061073a565b386101c3565b90915081906105b7565b634e487b7160e01b600052602260045260246000fd5b91607f16916101af565b015190503880610176565b60008080528281209350601f198516905b81811061064d5750908460019594939210610634575b505050811b0160005561018c565b015160001960f88460031b161c19169055388080610626565b92936020600181928786015181550195019301610610565b600080526106ad907f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563601f850160051c810191602086106105ca57601f0160051c019061073a565b3861015f565b91607f169161014b565b81518152602091820191016100e1565b600080fd5b602080916106df8461070f565b81520191019061008c565b6040519190601f01601f191682016001600160401b0381118382101761043d57604052565b51906001600160a01b03821682036106cd57565b6001600160401b03811161043d5760051b60200190565b818110610745575050565b6000815560010161073a565b80518210156107655760209160051b010190565b634e487b7160e01b600052603260045260246000fdfe608080604052600436101561001357600080fd5b600090813560e01c90816301196d2914611ea95750806301ffc9a714611e3a57806302c7e7af14611e1757806306fdde0314611d5c578063081812fc14611d1f578063095ea7b314611c3757806318160ddd14611c0257806323b872dd14611bea578063261af20b14611b835780633e413bee14611b3e57806342842e0e14611b0e578063430e5d7114611a165780634bb278f3146119845780634c55e5281461179e5780634f558e79146117515780636352211e146117205780636c9daa8d146113c257806370a082311461136f578063715018a61461131257806373b2e80e146112d25780637f205a74146112975780637fc4eda81461127b5780638623ec7b146112365780638da5cb5b1461120d5780638dbb94eb146111ee57806395d89b41146110f5578063a22cb46514611057578063a6df674f1461103a578063b0934e5d14610e31578063b3f05b9714610e0b578063b88d4fde14610d6c578063c87b56dd14610452578063d5abeb0114610436578063db2e21bc14610292578063e985e9c5146102385763f2fde38b146101ad57600080fd5b34610235576020366003190112610235576101c6611ee0565b6101ce612273565b6001600160a01b0316801561022157600680546001600160a01b0319811683179091556001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08380a380f35b631e4fbdf760e01b82526004829052602482fd5b80fd5b5034610235576040366003190112610235576040610254611ee0565b9161025d611efb565b9260018060a01b031681526005602052209060018060a01b0316600052602052602060ff604060002054166040519015158152f35b50346102355780600319360112610235576102ab612273565b60ff6008541615610427576040516370a0823160e01b81523060048201527f00000000000000000000000000000000000000000000000000000000000000006001600160a01b0316602082602481845afa9182156103d55783926103ef575b5081156103e05760065460405163a9059cbb60e01b81526001600160a01b03909116600482015260248101839052906020908290604490829087905af19081156103d55783916103a6575b5015610397576006546040519182526001600160a01b0316907f5fafa99d0643513820be26656b45130b01e1c03062e1266bf36f88cbd3bd969590602090a280f35b63a55b288760e01b8252600482fd5b6103c8915060203d6020116103ce575b6103c08183611fc6565b8101906121f8565b38610355565b503d6103b6565b6040513d85823e3d90fd5b6315e4203960e31b8352600483fd5b9091506020813d60201161041f575b8161040b60209383611fc6565b8101031261041b5751903861030a565b8280fd5b3d91506103fe565b637b340f0560e01b8152600490fd5b5034610235578060031936011261023557602060405160018152f35b503461023557602036600319011261023557600435610d5d5760ff60085460081c1615610d4e5750600061048761ebf2611ffe565b906104956040519283611fc6565b61ebf282526104a561ebf2611ffe565b6020830190601f1901368237825115610d3a57604290536002825160011015610d3a57604d602184015361064461063e61063861063261062c61ebbc6106266104fb6104f561ebf260028d6124e5565b8b612476565b6036610510610509836121c6565b928d6123fb565b538961051e610509836121c6565b538961052c610509836121c6565b538961053a610509836121c6565b536028610549610509836121c6565b5389610557610509836121c6565b5389610565610509836121c6565b5389610573610509836121c6565b53608e610582610509836121c6565b5389610590610509836121c6565b538961059e610509836121c6565b53896105ac610509836121c6565b53608d6105bb610509836121c6565b53896105c9610509836121c6565b53896105d7610509836121c6565b53896105e5610509836121c6565b5360016105f4610509836121c6565b5389610602610509836121c6565b536018610611610509836121c6565b538961061f610509836121c6565b538a612476565b896124e5565b876124c1565b866124c1565b85612476565b84612476565b91805b608d8110610b4057610b3c610ad461076e6106618861240c565b6107696044608160405180947f3c73766720786d6c6e733d22687474703a2f2f7777772e77332e6f72672f323060208301527f30302f737667222076696577426f783d223020302031343220313431223e000060408301527f3c696d61676520687265663d22646174613a696d6167652f626d703b62617365605e830152620d8d0b60ea1b607e8301526106fe8151809260208686019101611f11565b81017f222077696474683d2231343222206865696768743d2231343122207374796c65838201527f3d22696d6167652d72656e646572696e673a706978656c61746564222f3e000060a1820152651e17b9bb339f60d11b60bf82015203016024810184520182611fc6565b61240c565b610769606b61021560405180947f7b226e616d65223a2232302c30303220636f6c6f757273222c0000000000000060208301527f226465736372697074696f6e223a22436f6d706c65746520313432783134312060398301527f677269642073686f77636173696e6720616c6c2032302c30303220426c75652060598301527f4d6f6f6e20636f6c6f7273207468617420776572652070726576696f75736c7960798301527f206372656174656420616e642073746f726564206f6e2d636861696e2064757260998301527f696e67207468652024424d4f4f4e204552433230206d696e742028307839413260b98301527f393131373832303633323835626237643861346430383861314662423934624260d98301526701c319b229c1497160c51b60f98301527f5468652067726964207374617274656420656d70747920616e642077617320706101018301527f726f67726573736976656c792066696c6c6564206173206164647265737365736101218301526f01036b4b73a32b2103a37b5b2b73997160851b6101418301527f5468697320617274776f726b2069732073746f72656420656e746972656c79206101518301527f6f6e2d636861696e2c20616e64207468652070726f63656564732066726f6d206101718301527f6974732073616c6520776572652064697374726962757465642070726f706f726101918301527f74696f6e616c6c7920746f20616c6c206d696e746572732e20000000000000006101b18301527f43726561746564206279204c6f7563617320427261636f6e6e6965722f4669676101ca830152653ab93299989760d11b6101ea83015261088b60f21b6101f08301527f22696d616765223a22646174613a696d6167652f7376672b786d6c3b626173656101f2830152620d8d0b60ea1b610212830152610a248151809260208686019101611f11565b81016f222c2261747472696275746573223a5b60801b838201527f7b2274726169745f74797065223a22556e69717565204d696e74657273222c226102258201526c1d985b1d59488e888d8dc89f4b609a1b6102458201527f7b2274726169745f74797065223a22477269642053697a65222c2276616c75656102528201526b223a2231343278313431227d60a01b610272820152615d7d60f01b61027e8201520301604b810184520182611fc6565b610b28603d60405180937f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c0000006020830152610b178151809260208686019101611f11565b81010301601f198101835282611fc6565b604051918291602083526020830190611f34565b0390f35b815b608e8110610b865750815b838110610b5d5750600101610647565b946001809684610b79610b72899699966121c6565b95856123fb565b5301909550939093610b4d565b608e82959202858104608e1486151715610d265781608d0390608d8211610cb05790610bb1916121eb565b91614e2283108015610ce75715610cd857600a80840693046107d1811015610cc4576009015492601881029080820460181490151715610cb0576010810190818111610c9c576008810192838211610c885791610c7d9183610c33610c1960019897966121c6565b9289901c60f81b6001600160f81b0319168a1a918d6123fb565b53610c5a610c40826121c6565b9488901c60f81b6001600160f81b031916891a918c6123fb565b53610c64836121c6565b95901c60f81b6001600160f81b031916861a91896123fb565b535b01939093610b42565b634e487b7160e01b87526011600452602487fd5b634e487b7160e01b86526011600452602486fd5b634e487b7160e01b85526011600452602485fd5b634e487b7160e01b85526032600452602485fd5b6326e1723360e01b8452600484fd5b50915060019060ff610d02610cfb856121c6565b94896123fb565b5360ff610d11610cfb856121c6565b5360ff610d20610cfb856121c6565b53610c7f565b634e487b7160e01b84526011600452602484fd5b634e487b7160e01b82526032600452602482fd5b630df706ad60e11b8152600490fd5b63677510db60e11b8152600490fd5b503461023557608036600319011261023557610d86611ee0565b610d8e611efb565b6044356064359167ffffffffffffffff8311610e075736602384011215610e075782600401359385610dbf86611ffe565b94610dcd6040519687611fc6565b8686523660248883010111610e035786610e00976024602093018389013786010152610dfa83838361201a565b336122be565b80f35b5080fd5b8480fd5b5034610235578060031936011261023557602060ff60085460081c166040519015158152f35b50346102355780600319360112610235576107da54610e4f81612210565b90610e5d6040519283611fc6565b808252610e6981612210565b602083019390601f1901368537610e7f82612210565b93610e8d6040519586611fc6565b828552610e9983612210565b602086019190601f1901368337610eaf84612210565b90610ebd6040519283611fc6565b848252610ec985612210565b602083019590601f1901368737845b818110610f9c57505060405196879660608801906060895251809152608088019290865b818110610f7a57505050602090878303828901525191828152019290845b818110610f6157505050602090858303604087015251918281520192915b818110610f46575050500390f35b82511515845285945060209384019390920191600101610f38565b8251855288975060209485019490920191600101610f1a565b82516001600160a01b031685528a995060209485019490920191600101610efc565b80610faf6001929a94959698999a611f93565b838060a01b0391549060031b1c16610fc7828c612228565b52610fd181611f93565b838060a01b0391549060031b1c1687526107db6020526040872054610ff68286612228565b5261100081611f93565b838060a01b0391549060031b1c1687526107dc60205260ff6040882054166110288288612228565b90151590520197969593929197610ed8565b50346102355780600319360112610235576020604051614e228152f35b503461023557604036600319011261023557611071611ee0565b6024359081151580920361041b576001600160a01b03169081156110e1573383526005602052604083208284526020526040832060ff1981541660ff83161790556040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a380f35b630b61174360e31b83526004829052602483fd5b50346102355780600319360112610235576040519080600154908160011c916001811680156111e4575b6020841081146111d0578386529081156111a9575060011461114c575b610b3c84610b2881860382611fc6565b600181527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6939250905b80821061118f57509091508101602001610b288261113c565b919260018160209254838588010152019101909291611176565b60ff191660208087019190915292151560051b85019092019250610b28915083905061113c565b634e487b7160e01b83526022600452602483fd5b92607f169261111f565b503461023557806003193601126102355760206107da54604051908152f35b50346102355780600319360112610235576006546040516001600160a01b039091168152602090f35b503461023557602036600319011261023557600435906107da5482101561023557602061126283611f93565b905460405160039290921b1c6001600160a01b03168152f35b50346102355780600319360112610235576020604051608e8152f35b503461023557806003193601126102355760206040517f00000000000000000000000000000000000000000000000000000000000000008152f35b50346102355760203660031901126102355760209060ff906040906001600160a01b036112fd611ee0565b1681526107dc84522054166040519015158152f35b503461023557806003193601126102355761132b612273565b600680546001600160a01b0319811690915581906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b5034610235576020366003190112610235576001600160a01b03611391611ee0565b1680156113ae578160409160209352600383522054604051908152f35b6322718ad960e21b82526004829052602482fd5b50346102355780600319360112610235576113db61229c565b60085460ff81166117115760ff8160081c16156117025760ff19166001176008556040516323b872dd60e01b81523360048201523060248201527f0000000000000000000000000000000000000000000000000000000000000000604482018190529190602081606481857f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03165af19081156116f75782916116d8575b50156116c9576020916040516114968482611fc6565b82815233156116b5578280526002845260408320546001600160a01b03168015159081611685575b338086526003875260408087208054600101905586805260028852862080546001600160a01b031916821790558590827fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8380a45061167157333b611559575b508260405191825242908201527f506b2f57335c5e2d9660baac869c690fd8a4b08325bf291b3739ff40ccf225a060403392a2600160075580f35b836115929160405180938192630a85bd0160e11b8352336004840152876024840152876044840152608060648401526084830190611f34565b038186335af183918161162d575b506115f75750503d156115ef573d916115b883611ffe565b926115c66040519485611fc6565b83523d828285013e5b825192836115ea57633250574960e11b835233600452602483fd5b019050fd5b6060916115cf565b919290916001600160e01b03191663757a42ff60e11b0161161a5791903861151e565b633250574960e11b835233600452602483fd5b9091508481813d831161166a575b6116458183611fc6565b8101031261166657516001600160e01b0319811681036116665790386115a0565b8380fd5b503d61163b565b6339e3563760e11b83526004839052602483fd5b84805260048652604080862080546001600160a01b031916905581865260038752852080546000190190556114be565b633250574960e11b83526004839052602483fd5b63a55b288760e01b8152600490fd5b6116f1915060203d6020116103ce576103c08183611fc6565b38611480565b6040513d84823e3d90fd5b630df706ad60e11b8252600482fd5b631b42fb7f60e31b8252600482fd5b503461023557602036600319011261023557602061173f60043561223c565b6040516001600160a01b039091168152f35b503461023557602036600319011261023557602090600435908115918261177f575b50506040519015158152f35b81526002835260409020546001600160a01b0316151590503880611773565b50346102355780600319360112610235576117b761229c565b60ff6008541615610427573081526107dc60205260ff604082205416611975573081526107dc60205260408120805460ff1916600117905580805b6107da548110156119395761180681611f93565b905460039190911b1c6001600160a01b03168084526107db60205260408420549081611837575b50506001016117f2565b8085526107dc60209081526040808720805460ff191660011790555163a9059cbb60e01b81526001600160a01b03831660048201526024810184905292949192908180604481010381897f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03165af190811561192e578691611910575b501561190157907f78e1e79175185caab6863cf7bc5ea1e6e3935c6f134782039fd635e408ccb89860206118f286600196956121eb565b95604051908152a2903861182d565b63a55b288760e01b8552600485fd5b611928915060203d81116103ce576103c08183611fc6565b386118bb565b6040513d88823e3d90fd5b5060407fa12e012b5d6096036f299650b057cd29bd666f6f4bedc0db3ba99605a2115b6e916107da5482519182526020820152a1600160075580f35b63cce553a960e01b8152600490fd5b503461023557806003193601126102355761199d612273565b60085460ff8160081c16611a07576009541580156119fc575b6119ed5761ff001916610100176008557fa12d1017cc0f1beb8f5de7cf310b83a5eee3d1375b6bd66d7ba9b003c1ae816f8180a180f35b6357f292ed60e11b8252600482fd5b506107d954156119b6565b63475a253560e01b8252600482fd5b5034610235576040366003190112610235576004356024359167ffffffffffffffff831161023557366023840112156102355782600401359167ffffffffffffffff8311610e03573660248460051b86010111610e0357611a75612273565b60ff60085460081c16611a07576107d1611a8f84836121eb565b116119ed57815b83811015611adf57611aa881836121eb565b6107d1811015611acb579060019160248260051b88010135906009015501611a96565b634e487b7160e01b84526032600452602484fd5b507f5c56b49fbbfa596f5246dd2983af180a3d0adc5bb983b62727d24e59fed43b90602084604051908152a280f35b503461023557610e00611b2036611f59565b9060405192611b30602085611fc6565b858452610dfa83838361201a565b50346102355780600319360112610235576040517f00000000000000000000000000000000000000000000000000000000000000006001600160a01b03168152602090f35b503461023557806003193601126102355780805b6107d1811015611bc7578060090154611bb3575b600101611b97565b91611bbf6001916121c6565b929050611bab565b60608360ff60085460081c166040519182526107d1602083015215156040820152f35b503461023557610e00611bfc36611f59565b9161201a565b503461023557806003193601126102355760085460ff1615611c2f5750602060015b60ff60405191168152f35b602090611c24565b503461023557604036600319011261023557611c51611ee0565b602435611c5d8161223c565b33151580611d0c575b80611ce1575b611cce5781906001600160a01b0384811691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9258680a4825260046020526040822080546001600160a01b0319166001600160a01b0390921691909117905580f35b63a9fbf51f60e01b845233600452602484fd5b506001600160a01b038116845260056020908152604080862033875290915284205460ff1615611c6c565b506001600160a01b038116331415611c66565b503461023557602036600319011261023557602090600435611d408161223c565b50815260048252604060018060a01b0391205416604051908152f35b503461023557806003193601126102355760405190808054908160011c91600181168015611e0d575b6020841081146111d0578386529081156111a95750600114611db157610b3c84610b2881860382611fc6565b8080527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563939250905b808210611df357509091508101602001610b288261113c565b919260018160209254838588010152019101909291611dda565b92607f1692611d85565b5034610235578060031936011261023557602060ff600854166040519015158152f35b50346102355760203660031901126102355760043563ffffffff60e01b8116809103610e03576020906380ac58cd60e01b8114908115611e98575b8115611e87575b506040519015158152f35b6301ffc9a760e01b14905082611e7c565b635b5e139f60e01b81149150611e75565b905034610e03576020366003190112610e03576020916040906001600160a01b03611ed2611ee0565b1681526107db845220548152f35b600435906001600160a01b0382168203611ef657565b600080fd5b602435906001600160a01b0382168203611ef657565b60005b838110611f245750506000910152565b8181015183820152602001611f14565b90602091611f4d81518092818552858086019101611f11565b601f01601f1916010190565b6060906003190112611ef6576004356001600160a01b0381168103611ef657906024356001600160a01b0381168103611ef6579060443590565b6107da54811015611fb0576107da60005260206000200190600090565b634e487b7160e01b600052603260045260246000fd5b90601f8019910116810190811067ffffffffffffffff821117611fe857604052565b634e487b7160e01b600052604160045260246000fd5b67ffffffffffffffff8111611fe857601f01601f191660200190565b6001600160a01b03909116919082156121b0576000828152600260205260408120546001600160a01b0316938391859033151580612118575b507fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef90826120e3575b83815260036020526040812060018154019055848152600260205260408120846bffffffffffffffffffffffff60a01b82541617905580a46001600160a01b03168083036120c957505050565b6364283d7b60e01b60005260045260245260445260646000fd5b600085815260046020526040902080546001600160a01b0319169055828152600360205260408120805460001901905561207c565b915091925080612161575b15612132579084849238612053565b83908561214b57602491637e27328960e01b8252600452fd5b60449163177e802f60e01b825233600452602452fd5b50338514801561218f575b806121235750838152600460205260408120546001600160a01b03163314612123565b5084815260056020908152604080832033845290915281205460ff1661216c565b633250574960e11b600052600060045260246000fd5b60001981146121d55760010190565b634e487b7160e01b600052601160045260246000fd5b919082018092116121d557565b90816020910312611ef657518015158103611ef65790565b67ffffffffffffffff8111611fe85760051b60200190565b8051821015611fb05760209160051b010190565b6000818152600260205260409020546001600160a01b031690811561225f575090565b637e27328960e01b60005260045260246000fd5b6006546001600160a01b0316330361228757565b63118cdaa760e01b6000523360045260246000fd5b6002600754146122ad576002600755565b633ee5aeb560e01b60005260046000fd5b823b6122cc575b5050505050565b604051630a85bd0160e11b81526001600160a01b039182166004820152918116602483015260448201939093526080606482015291169160209082908190612318906084830190611f34565b03816000865af180916000916123b8575b509061238257503d1561237b573d61234081611ffe565b9061234e6040519283611fc6565b81523d6000602083013e5b805190816123765782633250574960e11b60005260045260246000fd5b602001fd5b6060612359565b6001600160e01b03191663757a42ff60e11b016123a4575038808080806122c5565b633250574960e11b60005260045260246000fd5b6020813d6020116123f3575b816123d160209383611fc6565b81010312610e035751906001600160e01b031982168203610235575038612329565b3d91506123c4565b908151811015611fb0570160200190565b6040516124739161241e606083611fc6565b604082527f4142434445464748494a4b4c4d4e4f505152535455565758595a61626364656660208301527f6768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2f6040830152612570565b90565b906124bd6000918261249161248a836121c6565b92866123fb565b538261249f61248a836121c6565b53826124ad61248a836121c6565b536124b7816121c6565b936123fb565b5390565b906124bd60009160136124d661248a836121c6565b53600b61249f61248a836121c6565b906124bd906124f3816121c6565b9061250b60ff60f81b8660f81b1660001a91856123fb565b53612515816121c6565b9061252d60ff60f81b8660f01b1660001a91856123fb565b53612537816121c6565b9061254f60ff60f81b8660e81b1660001a91856123fb565b53612559816121c6565b9360e01b6001600160f81b03191660001a926123fb565b919091805115612675578051600281018091116121d55760039004600281901b91906001600160fe1b038116036121d5576125c36125ad83611ffe565b926125bb6040519485611fc6565b808452611ffe565b6020830190601f1901368237908081518201956020870190815192600083525b888110612627575050600393949596505251068060011461261457600214612609575090565b603d90600019015390565b50603d9081600019820153600119015390565b600360049199969901986001603f8b5182828260121c16870101518453828282600c1c16870101518385015382828260061c16870101516002850153168401015160038201530194976125e3565b509050604051612686602082611fc6565b600081529056fea2646970667358221220bb125143f5dcb77407e04436678dd13fb119d114ebdd8a8d4fe4b1dee1e009c164736f6c634300081c0033000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda029130000000000000000000000000000000000000000000000000000000211c41e000000000000000000000000000000000000000000000000000000000000000080000000000000000000000000000000000000000000000000000000000000090000000000000000000000000000000000000000000000000000000000000000430000000000000000000000000ccf31a1cc4d88b321211841df7ca9950c3aa3300000000000000000000000000f965bd940e23932effcfc5260f33f83fb0bf0c30000000000000000000000001064bc5406bc61951cb62829e71eb966a012799e00000000000000000000000012e7181b9307eadb25fc2898d717d6752c60156c00000000000000000000000013c29aa6b4aa6b9da82ff22d9867afca24fbe52a00000000000000000000000014b27e03a394cadec25b2b20573e1ce88f482e91000000000000000000000000151214e0a010801fceefc3356486b79dee7d331f00000000000000000000000016562522f2eb17897c1f2bd2b1e9981a04f99de70000000000000000000000001684ef954f970744f3722439ac283644f8e0a2b20000000000000000000000001cb311fc841152d7cc9308bfeeddf8deaf31fddd0000000000000000000000001d675aefa52ba004081c895e0a54589bc8d9bebc0000000000000000000000001f3ca34e78ccb5581807b51915b0afe304a9245000000000000000000000000029626851a2c69d45fde290c5b3702fdc8246518b0000000000000000000000002b0866ff6177c62585be33c21f3a28f5eb8f445c0000000000000000000000002e82494083d823173249d67e3b7bdad17425e02800000000000000000000000030e1e2f119aa0a492ee20135f2409081c166b26f000000000000000000000000347ffc6db9acc54ac2019795173b9599e8b82bd90000000000000000000000003d874eab2766bcf5ed67aa1e142722ab347d17b50000000000000000000000004153a26b81dda3ea17dcaaffb5a12046f4a4787e000000000000000000000000448d3eebafc62663d9266372ef3b405e591b7f5e0000000000000000000000004a2bc872c00b3834465684c0613c5c4a0da9a9250000000000000000000000004c40707debb1f1b1f1cca904a31a201b296caafd0000000000000000000000004e774f2a3ea241f81bbabb58afb6cab6097ab1860000000000000000000000004f67f52147c6bc03563772fa3d7af3adffb921100000000000000000000000004f91cc50b6911cc7582ae93b3aaac1a0cb70fcde000000000000000000000000574614c9f248275e7d5b136b71bfac7a1fbdfdfe000000000000000000000000631f18e4192846574b05246f7349ba6b1e70a016000000000000000000000000636aa161f4924a0dbce40413a99c896250bc87a70000000000000000000000006439d2e08bef8637672ac08bb53a6f028bb593260000000000000000000000006f97b7de6be7b7771e975e46bae96c35e332e172000000000000000000000000758259c6cd83a2ac9a5b4a37d91dc6b615e797a20000000000000000000000007be2cef5b5686e70b0640a3974e31c9ebdbb69e600000000000000000000000088c0952093dd5e49b45e5448b871dfefea11b55d0000000000000000000000009217eb315aa9b42e022d59f72aa0ee5d1c99654f00000000000000000000000094338294e572766c29ae74227742d72b5a6f467600000000000000000000000094bf01bd8835eb110b317b747d3469961faf95d2000000000000000000000000967cd3b4d8a1192b7b779a3f718426073469ce860000000000000000000000009c156e778bcb111b7e803f8773b6b3a627a1ac840000000000000000000000009c50176f41bcfa88aed806a74f0c047e3b61e5a6000000000000000000000000a196935948f5f6edc40bdb3dea6dfd873d32495a000000000000000000000000a3d4ea7cafa11fe3f7be52acbe4abdc5a5499cc3000000000000000000000000a73db69ea64315c44c970245c1f30a7bc765a7d0000000000000000000000000a9076b5ba0aa393915cc4143653e7a01b96b5e12000000000000000000000000aae23896d111bdd4df7c73c7b63cd5f6f3d3414c000000000000000000000000ab078f1e310c3f6b9a6b6c91f23c6cb5f09fe61c000000000000000000000000ae6ba1d629881faf0d64391761ae88389c21601c000000000000000000000000b1b4c45a4d1e04da394a79c20e96545c2ee31a3f000000000000000000000000ba0995c52474dfb7c48181f71454a63a2847982c000000000000000000000000baaba861464f25f52c2ee10cc3ac024f4f77812a000000000000000000000000bee39b9e8a1e8aa4b92dcab680dbf29e50cb0f20000000000000000000000000c18579d1873d0f7925cb765e52125c2c628bfef7000000000000000000000000c22e7abbc8b2da4c2ec4b341d1f155e839b3092b000000000000000000000000c3b5533cfed62c10e8fc04aecbd4bd09312841d0000000000000000000000000cb0ec27e86a2a51c981b9e3ee28ff861f5863ffb000000000000000000000000cc457582e034a1a59e2550e162e8c3991eadb177000000000000000000000000cd01bd317df6419af020eeb43e58d7d0c7c48f29000000000000000000000000d142c0cc2f707b808060bcbceb903f6d6d62952f000000000000000000000000d255801d7a294e4ceac416a3caf5791275d645f5000000000000000000000000d4b4cab5cf150f46448a8b312cf4d96521953c5f000000000000000000000000d72508badc98629e324496180322e70ed2e28ee1000000000000000000000000dd6cf7bb264ccb04c7e61a01c77c77075b676e32000000000000000000000000de12dc01dc6699da44c24f5a9cee2970ea32198a000000000000000000000000e7c464ab48bdf91517dbd957227744282c437fca000000000000000000000000eee3aa7db7b8fe836f4e3be7dd6b46f598f66312000000000000000000000000f0344f61edf4599a46743a92fbba74d365b16352000000000000000000000000f60cdd980a39a3354287a0b6e40cf1f2cbb2e7d1000000000000000000000000fb7ce7b78cc7356664d42c43216ebb6c7e49b62700000000000000000000000000000000000000000000000000000000000000430000000000000000000000000000000000000000000000000000000006c7c390000000000000000000000000000000000000000000000000000000000b3adbe70000000000000000000000000000000000000000000000000000000015304323000000000000000000000000000000000000000000000000000000000b711a03000000000000000000000000000000000000000000000000000000000515d2ac00000000000000000000000000000000000000000000000000000000080d383b0000000000000000000000000000000000000000000000000000000001bf806b0000000000000000000000000000000000000000000000000000000000a2ba5500000000000000000000000000000000000000000000000000000000054c10c800000000000000000000000000000000000000000000000000000000006c7c380000000000000000000000000000000000000000000000000000000000b049dc0000000000000000000000000000000000000000000000000000000005eecb1e0000000000000000000000000000000000000000000000000000000007343fc9000000000000000000000000000000000000000000000000000000000254ab390000000000000000000000000000000000000000000000000000000001b1f0e400000000000000000000000000000000000000000000000000000000028ae956000000000000000000000000000000000000000000000000000000000843765800000000000000000000000000000000000000000000000000000000088e0bbf000000000000000000000000000000000000000000000000000000000080d38300000000000000000000000000000000000000000000000000000000010f368e00000000000000000000000000000000000000000000000000000000206b1f0a000000000000000000000000000000000000000000000000000000000ceccccb000000000000000000000000000000000000000000000000000000000ceccccb00000000000000000000000000000000000000000000000000000000006c7c380000000000000000000000000000000000000000000000000000000008e630ad000000000000000000000000000000000000000000000000000000000691857300000000000000000000000000000000000000000000000000000000014574ab0000000000000000000000000000000000000000000000000000000002c127720000000000000000000000000000000000000000000000000000000000d8f872000000000000000000000000000000000000000000000000000000001311d606000000000000000000000000000000000000000000000000000000000006c7c3000000000000000000000000000000000000000000000000000000001c6482ed0000000000000000000000000000000000000000000000000000000016e2340700000000000000000000000000000000000000000000000000000000002f76580000000000000000000000000000000000000000000000000000000005eecb1e000000000000000000000000000000000000000000000000000000000363e1c80000000000000000000000000000000000000000000000000000000006c7c3900000000000000000000000000000000000000000000000000000000005824ee50000000000000000000000000000000000000000000000000000000017f16a960000000000000000000000000000000000000000000000000000000002c127720000000000000000000000000000000000000000000000000000000026fca49f0000000000000000000000000000000000000000000000000000000008218f86000000000000000000000000000000000000000000000000000000000fe4325a00000000000000000000000000000000000000000000000000000000021e6d1d00000000000000000000000000000000000000000000000000000000033b3332000000000000000000000000000000000000000000000000000000000c80509200000000000000000000000000000000000000000000000000000000021e6d1d000000000000000000000000000000000000000000000000000000000b4f33320000000000000000000000000000000000000000000000000000000008e630ad00000000000000000000000000000000000000000000000000000000043cda3a00000000000000000000000000000000000000000000000000000000032da3ab00000000000000000000000000000000000000000000000000000000000d8f870000000000000000000000000000000000000000000000000000000000a2ba5500000000000000000000000000000000000000000000000000000000043cda3a00000000000000000000000000000000000000000000000000000000028ae95600000000000000000000000000000000000000000000000000000000017bb2c7000000000000000000000000000000000000000000000000000000000c8050920000000000000000000000000000000000000000000000000000000004069c1d0000000000000000000000000000000000000000000000000000000000363e1c0000000000000000000000000000000000000000000000000000000009967a8a00000000000000000000000000000000000000000000000000000000217a5599000000000000000000000000000000000000000000000000000000000d01241600000000000000000000000000000000000000000000000000000000017bb2c7000000000000000000000000000000000000000000000000000000000254ab39000000000000000000000000000000000000000000000000000000000e02cb1d0000000000000000000000000000000000000000000000000000000000363e1c000000000000000000000000000000000000000000000000000000000ace5fae

0x608080604052600436101561001357600080fd5b600090813560e01c90816301196d2914611ea95750806301ffc9a714611e3a57806302c7e7af14611e1757806306fdde0314611d5c578063081812fc14611d1f578063095ea7b314611c3757806318160ddd14611c0257806323b872dd14611bea578063261af20b14611b835780633e413bee14611b3e57806342842e0e14611b0e578063430e5d7114611a165780634bb278f3146119845780634c55e5281461179e5780634f558e79146117515780636352211e146117205780636c9daa8d146113c257806370a082311461136f578063715018a61461131257806373b2e80e146112d25780637f205a74146112975780637fc4eda81461127b5780638623ec7b146112365780638da5cb5b1461120d5780638dbb94eb146111ee57806395d89b41146110f5578063a22cb46514611057578063a6df674f1461103a578063b0934e5d14610e31578063b3f05b9714610e0b578063b88d4fde14610d6c578063c87b56dd14610452578063d5abeb0114610436578063db2e21bc14610292578063e985e9c5146102385763f2fde38b146101ad57600080fd5b34610235576020366003190112610235576101c6611ee0565b6101ce612273565b6001600160a01b0316801561022157600680546001600160a01b0319811683179091556001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08380a380f35b631e4fbdf760e01b82526004829052602482fd5b80fd5b5034610235576040366003190112610235576040610254611ee0565b9161025d611efb565b9260018060a01b031681526005602052209060018060a01b0316600052602052602060ff604060002054166040519015158152f35b50346102355780600319360112610235576102ab612273565b60ff6008541615610427576040516370a0823160e01b81523060048201527f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda029136001600160a01b0316602082602481845afa9182156103d55783926103ef575b5081156103e05760065460405163a9059cbb60e01b81526001600160a01b03909116600482015260248101839052906020908290604490829087905af19081156103d55783916103a6575b5015610397576006546040519182526001600160a01b0316907f5fafa99d0643513820be26656b45130b01e1c03062e1266bf36f88cbd3bd969590602090a280f35b63a55b288760e01b8252600482fd5b6103c8915060203d6020116103ce575b6103c08183611fc6565b8101906121f8565b38610355565b503d6103b6565b6040513d85823e3d90fd5b6315e4203960e31b8352600483fd5b9091506020813d60201161041f575b8161040b60209383611fc6565b8101031261041b5751903861030a565b8280fd5b3d91506103fe565b637b340f0560e01b8152600490fd5b5034610235578060031936011261023557602060405160018152f35b503461023557602036600319011261023557600435610d5d5760ff60085460081c1615610d4e5750600061048761ebf2611ffe565b906104956040519283611fc6565b61ebf282526104a561ebf2611ffe565b6020830190601f1901368237825115610d3a57604290536002825160011015610d3a57604d602184015361064461063e61063861063261062c61ebbc6106266104fb6104f561ebf260028d6124e5565b8b612476565b6036610510610509836121c6565b928d6123fb565b538961051e610509836121c6565b538961052c610509836121c6565b538961053a610509836121c6565b536028610549610509836121c6565b5389610557610509836121c6565b5389610565610509836121c6565b5389610573610509836121c6565b53608e610582610509836121c6565b5389610590610509836121c6565b538961059e610509836121c6565b53896105ac610509836121c6565b53608d6105bb610509836121c6565b53896105c9610509836121c6565b53896105d7610509836121c6565b53896105e5610509836121c6565b5360016105f4610509836121c6565b5389610602610509836121c6565b536018610611610509836121c6565b538961061f610509836121c6565b538a612476565b896124e5565b876124c1565b866124c1565b85612476565b84612476565b91805b608d8110610b4057610b3c610ad461076e6106618861240c565b6107696044608160405180947f3c73766720786d6c6e733d22687474703a2f2f7777772e77332e6f72672f323060208301527f30302f737667222076696577426f783d223020302031343220313431223e000060408301527f3c696d61676520687265663d22646174613a696d6167652f626d703b62617365605e830152620d8d0b60ea1b607e8301526106fe8151809260208686019101611f11565b81017f222077696474683d2231343222206865696768743d2231343122207374796c65838201527f3d22696d6167652d72656e646572696e673a706978656c61746564222f3e000060a1820152651e17b9bb339f60d11b60bf82015203016024810184520182611fc6565b61240c565b610769606b61021560405180947f7b226e616d65223a2232302c30303220636f6c6f757273222c0000000000000060208301527f226465736372697074696f6e223a22436f6d706c65746520313432783134312060398301527f677269642073686f77636173696e6720616c6c2032302c30303220426c75652060598301527f4d6f6f6e20636f6c6f7273207468617420776572652070726576696f75736c7960798301527f206372656174656420616e642073746f726564206f6e2d636861696e2064757260998301527f696e67207468652024424d4f4f4e204552433230206d696e742028307839413260b98301527f393131373832303633323835626237643861346430383861314662423934624260d98301526701c319b229c1497160c51b60f98301527f5468652067726964207374617274656420656d70747920616e642077617320706101018301527f726f67726573736976656c792066696c6c6564206173206164647265737365736101218301526f01036b4b73a32b2103a37b5b2b73997160851b6101418301527f5468697320617274776f726b2069732073746f72656420656e746972656c79206101518301527f6f6e2d636861696e2c20616e64207468652070726f63656564732066726f6d206101718301527f6974732073616c6520776572652064697374726962757465642070726f706f726101918301527f74696f6e616c6c7920746f20616c6c206d696e746572732e20000000000000006101b18301527f43726561746564206279204c6f7563617320427261636f6e6e6965722f4669676101ca830152653ab93299989760d11b6101ea83015261088b60f21b6101f08301527f22696d616765223a22646174613a696d6167652f7376672b786d6c3b626173656101f2830152620d8d0b60ea1b610212830152610a248151809260208686019101611f11565b81016f222c2261747472696275746573223a5b60801b838201527f7b2274726169745f74797065223a22556e69717565204d696e74657273222c226102258201526c1d985b1d59488e888d8dc89f4b609a1b6102458201527f7b2274726169745f74797065223a22477269642053697a65222c2276616c75656102528201526b223a2231343278313431227d60a01b610272820152615d7d60f01b61027e8201520301604b810184520182611fc6565b610b28603d60405180937f646174613a6170706c69636174696f6e2f6a736f6e3b6261736536342c0000006020830152610b178151809260208686019101611f11565b81010301601f198101835282611fc6565b604051918291602083526020830190611f34565b0390f35b815b608e8110610b865750815b838110610b5d5750600101610647565b946001809684610b79610b72899699966121c6565b95856123fb565b5301909550939093610b4d565b608e82959202858104608e1486151715610d265781608d0390608d8211610cb05790610bb1916121eb565b91614e2283108015610ce75715610cd857600a80840693046107d1811015610cc4576009015492601881029080820460181490151715610cb0576010810190818111610c9c576008810192838211610c885791610c7d9183610c33610c1960019897966121c6565b9289901c60f81b6001600160f81b0319168a1a918d6123fb565b53610c5a610c40826121c6565b9488901c60f81b6001600160f81b031916891a918c6123fb565b53610c64836121c6565b95901c60f81b6001600160f81b031916861a91896123fb565b535b01939093610b42565b634e487b7160e01b87526011600452602487fd5b634e487b7160e01b86526011600452602486fd5b634e487b7160e01b85526011600452602485fd5b634e487b7160e01b85526032600452602485fd5b6326e1723360e01b8452600484fd5b50915060019060ff610d02610cfb856121c6565b94896123fb565b5360ff610d11610cfb856121c6565b5360ff610d20610cfb856121c6565b53610c7f565b634e487b7160e01b84526011600452602484fd5b634e487b7160e01b82526032600452602482fd5b630df706ad60e11b8152600490fd5b63677510db60e11b8152600490fd5b503461023557608036600319011261023557610d86611ee0565b610d8e611efb565b6044356064359167ffffffffffffffff8311610e075736602384011215610e075782600401359385610dbf86611ffe565b94610dcd6040519687611fc6565b8686523660248883010111610e035786610e00976024602093018389013786010152610dfa83838361201a565b336122be565b80f35b5080fd5b8480fd5b5034610235578060031936011261023557602060ff60085460081c166040519015158152f35b50346102355780600319360112610235576107da54610e4f81612210565b90610e5d6040519283611fc6565b808252610e6981612210565b602083019390601f1901368537610e7f82612210565b93610e8d6040519586611fc6565b828552610e9983612210565b602086019190601f1901368337610eaf84612210565b90610ebd6040519283611fc6565b848252610ec985612210565b602083019590601f1901368737845b818110610f9c57505060405196879660608801906060895251809152608088019290865b818110610f7a57505050602090878303828901525191828152019290845b818110610f6157505050602090858303604087015251918281520192915b818110610f46575050500390f35b82511515845285945060209384019390920191600101610f38565b8251855288975060209485019490920191600101610f1a565b82516001600160a01b031685528a995060209485019490920191600101610efc565b80610faf6001929a94959698999a611f93565b838060a01b0391549060031b1c16610fc7828c612228565b52610fd181611f93565b838060a01b0391549060031b1c1687526107db6020526040872054610ff68286612228565b5261100081611f93565b838060a01b0391549060031b1c1687526107dc60205260ff6040882054166110288288612228565b90151590520197969593929197610ed8565b50346102355780600319360112610235576020604051614e228152f35b503461023557604036600319011261023557611071611ee0565b6024359081151580920361041b576001600160a01b03169081156110e1573383526005602052604083208284526020526040832060ff1981541660ff83161790556040519081527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c3160203392a380f35b630b61174360e31b83526004829052602483fd5b50346102355780600319360112610235576040519080600154908160011c916001811680156111e4575b6020841081146111d0578386529081156111a9575060011461114c575b610b3c84610b2881860382611fc6565b600181527fb10e2d527612073b26eecdfd717e6a320cf44b4afac2b0732d9fcbe2b7fa0cf6939250905b80821061118f57509091508101602001610b288261113c565b919260018160209254838588010152019101909291611176565b60ff191660208087019190915292151560051b85019092019250610b28915083905061113c565b634e487b7160e01b83526022600452602483fd5b92607f169261111f565b503461023557806003193601126102355760206107da54604051908152f35b50346102355780600319360112610235576006546040516001600160a01b039091168152602090f35b503461023557602036600319011261023557600435906107da5482101561023557602061126283611f93565b905460405160039290921b1c6001600160a01b03168152f35b50346102355780600319360112610235576020604051608e8152f35b503461023557806003193601126102355760206040517f0000000000000000000000000000000000000000000000000000000211c41e008152f35b50346102355760203660031901126102355760209060ff906040906001600160a01b036112fd611ee0565b1681526107dc84522054166040519015158152f35b503461023557806003193601126102355761132b612273565b600680546001600160a01b0319811690915581906001600160a01b03167f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e08280a380f35b5034610235576020366003190112610235576001600160a01b03611391611ee0565b1680156113ae578160409160209352600383522054604051908152f35b6322718ad960e21b82526004829052602482fd5b50346102355780600319360112610235576113db61229c565b60085460ff81166117115760ff8160081c16156117025760ff19166001176008556040516323b872dd60e01b81523360048201523060248201527f0000000000000000000000000000000000000000000000000000000211c41e00604482018190529190602081606481857f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda029136001600160a01b03165af19081156116f75782916116d8575b50156116c9576020916040516114968482611fc6565b82815233156116b5578280526002845260408320546001600160a01b03168015159081611685575b338086526003875260408087208054600101905586805260028852862080546001600160a01b031916821790558590827fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8380a45061167157333b611559575b508260405191825242908201527f506b2f57335c5e2d9660baac869c690fd8a4b08325bf291b3739ff40ccf225a060403392a2600160075580f35b836115929160405180938192630a85bd0160e11b8352336004840152876024840152876044840152608060648401526084830190611f34565b038186335af183918161162d575b506115f75750503d156115ef573d916115b883611ffe565b926115c66040519485611fc6565b83523d828285013e5b825192836115ea57633250574960e11b835233600452602483fd5b019050fd5b6060916115cf565b919290916001600160e01b03191663757a42ff60e11b0161161a5791903861151e565b633250574960e11b835233600452602483fd5b9091508481813d831161166a575b6116458183611fc6565b8101031261166657516001600160e01b0319811681036116665790386115a0565b8380fd5b503d61163b565b6339e3563760e11b83526004839052602483fd5b84805260048652604080862080546001600160a01b031916905581865260038752852080546000190190556114be565b633250574960e11b83526004839052602483fd5b63a55b288760e01b8152600490fd5b6116f1915060203d6020116103ce576103c08183611fc6565b38611480565b6040513d84823e3d90fd5b630df706ad60e11b8252600482fd5b631b42fb7f60e31b8252600482fd5b503461023557602036600319011261023557602061173f60043561223c565b6040516001600160a01b039091168152f35b503461023557602036600319011261023557602090600435908115918261177f575b50506040519015158152f35b81526002835260409020546001600160a01b0316151590503880611773565b50346102355780600319360112610235576117b761229c565b60ff6008541615610427573081526107dc60205260ff604082205416611975573081526107dc60205260408120805460ff1916600117905580805b6107da548110156119395761180681611f93565b905460039190911b1c6001600160a01b03168084526107db60205260408420549081611837575b50506001016117f2565b8085526107dc60209081526040808720805460ff191660011790555163a9059cbb60e01b81526001600160a01b03831660048201526024810184905292949192908180604481010381897f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda029136001600160a01b03165af190811561192e578691611910575b501561190157907f78e1e79175185caab6863cf7bc5ea1e6e3935c6f134782039fd635e408ccb89860206118f286600196956121eb565b95604051908152a2903861182d565b63a55b288760e01b8552600485fd5b611928915060203d81116103ce576103c08183611fc6565b386118bb565b6040513d88823e3d90fd5b5060407fa12e012b5d6096036f299650b057cd29bd666f6f4bedc0db3ba99605a2115b6e916107da5482519182526020820152a1600160075580f35b63cce553a960e01b8152600490fd5b503461023557806003193601126102355761199d612273565b60085460ff8160081c16611a07576009541580156119fc575b6119ed5761ff001916610100176008557fa12d1017cc0f1beb8f5de7cf310b83a5eee3d1375b6bd66d7ba9b003c1ae816f8180a180f35b6357f292ed60e11b8252600482fd5b506107d954156119b6565b63475a253560e01b8252600482fd5b5034610235576040366003190112610235576004356024359167ffffffffffffffff831161023557366023840112156102355782600401359167ffffffffffffffff8311610e03573660248460051b86010111610e0357611a75612273565b60ff60085460081c16611a07576107d1611a8f84836121eb565b116119ed57815b83811015611adf57611aa881836121eb565b6107d1811015611acb579060019160248260051b88010135906009015501611a96565b634e487b7160e01b84526032600452602484fd5b507f5c56b49fbbfa596f5246dd2983af180a3d0adc5bb983b62727d24e59fed43b90602084604051908152a280f35b503461023557610e00611b2036611f59565b9060405192611b30602085611fc6565b858452610dfa83838361201a565b50346102355780600319360112610235576040517f000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda029136001600160a01b03168152602090f35b503461023557806003193601126102355780805b6107d1811015611bc7578060090154611bb3575b600101611b97565b91611bbf6001916121c6565b929050611bab565b60608360ff60085460081c166040519182526107d1602083015215156040820152f35b503461023557610e00611bfc36611f59565b9161201a565b503461023557806003193601126102355760085460ff1615611c2f5750602060015b60ff60405191168152f35b602090611c24565b503461023557604036600319011261023557611c51611ee0565b602435611c5d8161223c565b33151580611d0c575b80611ce1575b611cce5781906001600160a01b0384811691167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9258680a4825260046020526040822080546001600160a01b0319166001600160a01b0390921691909117905580f35b63a9fbf51f60e01b845233600452602484fd5b506001600160a01b038116845260056020908152604080862033875290915284205460ff1615611c6c565b506001600160a01b038116331415611c66565b503461023557602036600319011261023557602090600435611d408161223c565b50815260048252604060018060a01b0391205416604051908152f35b503461023557806003193601126102355760405190808054908160011c91600181168015611e0d575b6020841081146111d0578386529081156111a95750600114611db157610b3c84610b2881860382611fc6565b8080527f290decd9548b62a8d60345a988386fc84ba6bc95484008f6362f93160ef3e563939250905b808210611df357509091508101602001610b288261113c565b919260018160209254838588010152019101909291611dda565b92607f1692611d85565b5034610235578060031936011261023557602060ff600854166040519015158152f35b50346102355760203660031901126102355760043563ffffffff60e01b8116809103610e03576020906380ac58cd60e01b8114908115611e98575b8115611e87575b506040519015158152f35b6301ffc9a760e01b14905082611e7c565b635b5e139f60e01b81149150611e75565b905034610e03576020366003190112610e03576020916040906001600160a01b03611ed2611ee0565b1681526107db845220548152f35b600435906001600160a01b0382168203611ef657565b600080fd5b602435906001600160a01b0382168203611ef657565b60005b838110611f245750506000910152565b8181015183820152602001611f14565b90602091611f4d81518092818552858086019101611f11565b601f01601f1916010190565b6060906003190112611ef6576004356001600160a01b0381168103611ef657906024356001600160a01b0381168103611ef6579060443590565b6107da54811015611fb0576107da60005260206000200190600090565b634e487b7160e01b600052603260045260246000fd5b90601f8019910116810190811067ffffffffffffffff821117611fe857604052565b634e487b7160e01b600052604160045260246000fd5b67ffffffffffffffff8111611fe857601f01601f191660200190565b6001600160a01b03909116919082156121b0576000828152600260205260408120546001600160a01b0316938391859033151580612118575b507fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef90826120e3575b83815260036020526040812060018154019055848152600260205260408120846bffffffffffffffffffffffff60a01b82541617905580a46001600160a01b03168083036120c957505050565b6364283d7b60e01b60005260045260245260445260646000fd5b600085815260046020526040902080546001600160a01b0319169055828152600360205260408120805460001901905561207c565b915091925080612161575b15612132579084849238612053565b83908561214b57602491637e27328960e01b8252600452fd5b60449163177e802f60e01b825233600452602452fd5b50338514801561218f575b806121235750838152600460205260408120546001600160a01b03163314612123565b5084815260056020908152604080832033845290915281205460ff1661216c565b633250574960e11b600052600060045260246000fd5b60001981146121d55760010190565b634e487b7160e01b600052601160045260246000fd5b919082018092116121d557565b90816020910312611ef657518015158103611ef65790565b67ffffffffffffffff8111611fe85760051b60200190565b8051821015611fb05760209160051b010190565b6000818152600260205260409020546001600160a01b031690811561225f575090565b637e27328960e01b60005260045260246000fd5b6006546001600160a01b0316330361228757565b63118cdaa760e01b6000523360045260246000fd5b6002600754146122ad576002600755565b633ee5aeb560e01b60005260046000fd5b823b6122cc575b5050505050565b604051630a85bd0160e11b81526001600160a01b039182166004820152918116602483015260448201939093526080606482015291169160209082908190612318906084830190611f34565b03816000865af180916000916123b8575b509061238257503d1561237b573d61234081611ffe565b9061234e6040519283611fc6565b81523d6000602083013e5b805190816123765782633250574960e11b60005260045260246000fd5b602001fd5b6060612359565b6001600160e01b03191663757a42ff60e11b016123a4575038808080806122c5565b633250574960e11b60005260045260246000fd5b6020813d6020116123f3575b816123d160209383611fc6565b81010312610e035751906001600160e01b031982168203610235575038612329565b3d91506123c4565b908151811015611fb0570160200190565b6040516124739161241e606083611fc6565b604082527f4142434445464748494a4b4c4d4e4f505152535455565758595a61626364656660208301527f6768696a6b6c6d6e6f707172737475767778797a303132333435363738392b2f6040830152612570565b90565b906124bd6000918261249161248a836121c6565b92866123fb565b538261249f61248a836121c6565b53826124ad61248a836121c6565b536124b7816121c6565b936123fb565b5390565b906124bd60009160136124d661248a836121c6565b53600b61249f61248a836121c6565b906124bd906124f3816121c6565b9061250b60ff60f81b8660f81b1660001a91856123fb565b53612515816121c6565b9061252d60ff60f81b8660f01b1660001a91856123fb565b53612537816121c6565b9061254f60ff60f81b8660e81b1660001a91856123fb565b53612559816121c6565b9360e01b6001600160f81b03191660001a926123fb565b919091805115612675578051600281018091116121d55760039004600281901b91906001600160fe1b038116036121d5576125c36125ad83611ffe565b926125bb6040519485611fc6565b808452611ffe565b6020830190601f1901368237908081518201956020870190815192600083525b888110612627575050600393949596505251068060011461261457600214612609575090565b603d90600019015390565b50603d9081600019820153600119015390565b600360049199969901986001603f8b5182828260121c16870101518453828282600c1c16870101518385015382828260061c16870101516002850153168401015160038201530194976125e3565b509050604051612686602082611fc6565b600081529056fea2646970667358221220bb125143f5dcb77407e04436678dd13fb119d114ebdd8a8d4fe4b1dee1e009c164736f6c634300081c0033

000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda029130000000000000000000000000000000000000000000000000000000211c41e000000000000000000000000000000000000000000000000000000000000000080000000000000000000000000000000000000000000000000000000000000090000000000000000000000000000000000000000000000000000000000000000430000000000000000000000000ccf31a1cc4d88b321211841df7ca9950c3aa3300000000000000000000000000f965bd940e23932effcfc5260f33f83fb0bf0c30000000000000000000000001064bc5406bc61951cb62829e71eb966a012799e00000000000000000000000012e7181b9307eadb25fc2898d717d6752c60156c00000000000000000000000013c29aa6b4aa6b9da82ff22d9867afca24fbe52a00000000000000000000000014b27e03a394cadec25b2b20573e1ce88f482e91000000000000000000000000151214e0a010801fceefc3356486b79dee7d331f00000000000000000000000016562522f2eb17897c1f2bd2b1e9981a04f99de70000000000000000000000001684ef954f970744f3722439ac283644f8e0a2b20000000000000000000000001cb311fc841152d7cc9308bfeeddf8deaf31fddd0000000000000000000000001d675aefa52ba004081c895e0a54589bc8d9bebc0000000000000000000000001f3ca34e78ccb5581807b51915b0afe304a9245000000000000000000000000029626851a2c69d45fde290c5b3702fdc8246518b0000000000000000000000002b0866ff6177c62585be33c21f3a28f5eb8f445c0000000000000000000000002e82494083d823173249d67e3b7bdad17425e02800000000000000000000000030e1e2f119aa0a492ee20135f2409081c166b26f000000000000000000000000347ffc6db9acc54ac2019795173b9599e8b82bd90000000000000000000000003d874eab2766bcf5ed67aa1e142722ab347d17b50000000000000000000000004153a26b81dda3ea17dcaaffb5a12046f4a4787e000000000000000000000000448d3eebafc62663d9266372ef3b405e591b7f5e0000000000000000000000004a2bc872c00b3834465684c0613c5c4a0da9a9250000000000000000000000004c40707debb1f1b1f1cca904a31a201b296caafd0000000000000000000000004e774f2a3ea241f81bbabb58afb6cab6097ab1860000000000000000000000004f67f52147c6bc03563772fa3d7af3adffb921100000000000000000000000004f91cc50b6911cc7582ae93b3aaac1a0cb70fcde000000000000000000000000574614c9f248275e7d5b136b71bfac7a1fbdfdfe000000000000000000000000631f18e4192846574b05246f7349ba6b1e70a016000000000000000000000000636aa161f4924a0dbce40413a99c896250bc87a70000000000000000000000006439d2e08bef8637672ac08bb53a6f028bb593260000000000000000000000006f97b7de6be7b7771e975e46bae96c35e332e172000000000000000000000000758259c6cd83a2ac9a5b4a37d91dc6b615e797a20000000000000000000000007be2cef5b5686e70b0640a3974e31c9ebdbb69e600000000000000000000000088c0952093dd5e49b45e5448b871dfefea11b55d0000000000000000000000009217eb315aa9b42e022d59f72aa0ee5d1c99654f00000000000000000000000094338294e572766c29ae74227742d72b5a6f467600000000000000000000000094bf01bd8835eb110b317b747d3469961faf95d2000000000000000000000000967cd3b4d8a1192b7b779a3f718426073469ce860000000000000000000000009c156e778bcb111b7e803f8773b6b3a627a1ac840000000000000000000000009c50176f41bcfa88aed806a74f0c047e3b61e5a6000000000000000000000000a196935948f5f6edc40bdb3dea6dfd873d32495a000000000000000000000000a3d4ea7cafa11fe3f7be52acbe4abdc5a5499cc3000000000000000000000000a73db69ea64315c44c970245c1f30a7bc765a7d0000000000000000000000000a9076b5ba0aa393915cc4143653e7a01b96b5e12000000000000000000000000aae23896d111bdd4df7c73c7b63cd5f6f3d3414c000000000000000000000000ab078f1e310c3f6b9a6b6c91f23c6cb5f09fe61c000000000000000000000000ae6ba1d629881faf0d64391761ae88389c21601c000000000000000000000000b1b4c45a4d1e04da394a79c20e96545c2ee31a3f000000000000000000000000ba0995c52474dfb7c48181f71454a63a2847982c000000000000000000000000baaba861464f25f52c2ee10cc3ac024f4f77812a000000000000000000000000bee39b9e8a1e8aa4b92dcab680dbf29e50cb0f20000000000000000000000000c18579d1873d0f7925cb765e52125c2c628bfef7000000000000000000000000c22e7abbc8b2da4c2ec4b341d1f155e839b3092b000000000000000000000000c3b5533cfed62c10e8fc04aecbd4bd09312841d0000000000000000000000000cb0ec27e86a2a51c981b9e3ee28ff861f5863ffb000000000000000000000000cc457582e034a1a59e2550e162e8c3991eadb177000000000000000000000000cd01bd317df6419af020eeb43e58d7d0c7c48f29000000000000000000000000d142c0cc2f707b808060bcbceb903f6d6d62952f000000000000000000000000d255801d7a294e4ceac416a3caf5791275d645f5000000000000000000000000d4b4cab5cf150f46448a8b312cf4d96521953c5f000000000000000000000000d72508badc98629e324496180322e70ed2e28ee1000000000000000000000000dd6cf7bb264ccb04c7e61a01c77c77075b676e32000000000000000000000000de12dc01dc6699da44c24f5a9cee2970ea32198a000000000000000000000000e7c464ab48bdf91517dbd957227744282c437fca000000000000000000000000eee3aa7db7b8fe836f4e3be7dd6b46f598f66312000000000000000000000000f0344f61edf4599a46743a92fbba74d365b16352000000000000000000000000f60cdd980a39a3354287a0b6e40cf1f2cbb2e7d1000000000000000000000000fb7ce7b78cc7356664d42c43216ebb6c7e49b62700000000000000000000000000000000000000000000000000000000000000430000000000000000000000000000000000000000000000000000000006c7c390000000000000000000000000000000000000000000000000000000000b3adbe70000000000000000000000000000000000000000000000000000000015304323000000000000000000000000000000000000000000000000000000000b711a03000000000000000000000000000000000000000000000000000000000515d2ac00000000000000000000000000000000000000000000000000000000080d383b0000000000000000000000000000000000000000000000000000000001bf806b0000000000000000000000000000000000000000000000000000000000a2ba5500000000000000000000000000000000000000000000000000000000054c10c800000000000000000000000000000000000000000000000000000000006c7c380000000000000000000000000000000000000000000000000000000000b049dc0000000000000000000000000000000000000000000000000000000005eecb1e0000000000000000000000000000000000000000000000000000000007343fc9000000000000000000000000000000000000000000000000000000000254ab390000000000000000000000000000000000000000000000000000000001b1f0e400000000000000000000000000000000000000000000000000000000028ae956000000000000000000000000000000000000000000000000000000000843765800000000000000000000000000000000000000000000000000000000088e0bbf000000000000000000000000000000000000000000000000000000000080d38300000000000000000000000000000000000000000000000000000000010f368e00000000000000000000000000000000000000000000000000000000206b1f0a000000000000000000000000000000000000000000000000000000000ceccccb000000000000000000000000000000000000000000000000000000000ceccccb00000000000000000000000000000000000000000000000000000000006c7c380000000000000000000000000000000000000000000000000000000008e630ad000000000000000000000000000000000000000000000000000000000691857300000000000000000000000000000000000000000000000000000000014574ab0000000000000000000000000000000000000000000000000000000002c127720000000000000000000000000000000000000000000000000000000000d8f872000000000000000000000000000000000000000000000000000000001311d606000000000000000000000000000000000000000000000000000000000006c7c3000000000000000000000000000000000000000000000000000000001c6482ed0000000000000000000000000000000000000000000000000000000016e2340700000000000000000000000000000000000000000000000000000000002f76580000000000000000000000000000000000000000000000000000000005eecb1e000000000000000000000000000000000000000000000000000000000363e1c80000000000000000000000000000000000000000000000000000000006c7c3900000000000000000000000000000000000000000000000000000000005824ee50000000000000000000000000000000000000000000000000000000017f16a960000000000000000000000000000000000000000000000000000000002c127720000000000000000000000000000000000000000000000000000000026fca49f0000000000000000000000000000000000000000000000000000000008218f86000000000000000000000000000000000000000000000000000000000fe4325a00000000000000000000000000000000000000000000000000000000021e6d1d00000000000000000000000000000000000000000000000000000000033b3332000000000000000000000000000000000000000000000000000000000c80509200000000000000000000000000000000000000000000000000000000021e6d1d000000000000000000000000000000000000000000000000000000000b4f33320000000000000000000000000000000000000000000000000000000008e630ad00000000000000000000000000000000000000000000000000000000043cda3a00000000000000000000000000000000000000000000000000000000032da3ab00000000000000000000000000000000000000000000000000000000000d8f870000000000000000000000000000000000000000000000000000000000a2ba5500000000000000000000000000000000000000000000000000000000043cda3a00000000000000000000000000000000000000000000000000000000028ae95600000000000000000000000000000000000000000000000000000000017bb2c7000000000000000000000000000000000000000000000000000000000c8050920000000000000000000000000000000000000000000000000000000004069c1d0000000000000000000000000000000000000000000000000000000000363e1c0000000000000000000000000000000000000000000000000000000009967a8a00000000000000000000000000000000000000000000000000000000217a5599000000000000000000000000000000000000000000000000000000000d01241600000000000000000000000000000000000000000000000000000000017bb2c7000000000000000000000000000000000000000000000000000000000254ab39000000000000000000000000000000000000000000000000000000000e02cb1d0000000000000000000000000000000000000000000000000000000000363e1c000000000000000000000000000000000000000000000000000000000ace5fae

-----Decoded View---------------
Arg [0] : _usdc (address): 0x833589fCD6eDb6E08f4c7C32D4f71b54bdA02913
Arg [1] : _salePrice (uint256): 8888000000
Arg [2] : _minters (address[]): 0x0cCf31A1cC4D88B321211841dF7ca9950c3AA330,0x0F965bd940e23932eFFcfC5260f33f83Fb0bf0C3,0x1064bC5406bc61951cb62829E71eb966A012799e,0x12E7181b9307EADB25fc2898d717d6752C60156c,0x13c29aa6b4AA6b9da82FF22D9867AfcA24fBe52a,0x14b27e03a394CAdec25b2B20573E1ce88f482E91,0x151214e0A010801fceeFc3356486b79deE7D331f,0x16562522F2EB17897C1F2BD2B1e9981a04F99de7,0x1684eF954f970744F3722439ac283644F8e0A2B2,0x1CB311fc841152D7cC9308BfeEdDF8dEaf31fDDD,0x1D675AEFa52BA004081c895e0A54589bC8D9BEbC,0x1F3ca34e78Ccb5581807B51915b0Afe304A92450,0x29626851a2C69d45fdE290C5B3702fDC8246518B,0x2b0866ff6177C62585bE33c21f3A28f5EB8F445c,0x2e82494083D823173249D67e3b7BdAd17425e028,0x30E1e2F119AA0a492EE20135F2409081C166b26F,0x347ffC6DB9aCc54ac2019795173B9599E8B82BD9,0x3D874EAB2766bcF5ed67aA1E142722Ab347D17B5,0x4153A26b81ddA3Ea17dcaAffb5a12046F4a4787E,0x448D3eEbAfc62663D9266372ef3b405e591B7F5E,0x4a2bC872c00b3834465684c0613C5C4A0Da9A925,0x4c40707DEBb1F1B1f1cca904a31a201b296CAafD,0x4e774F2A3Ea241F81BbABb58Afb6cAB6097Ab186,0x4F67f52147c6BC03563772Fa3D7AF3adFfb92110,0x4f91CC50B6911cc7582aE93B3AAac1A0cB70FCDe,0x574614C9f248275e7D5B136b71bFac7A1fbdFdFe,0x631f18E4192846574b05246f7349Ba6B1E70A016,0x636aa161F4924a0DBCe40413A99c896250bC87A7,0x6439D2E08bEf8637672Ac08BB53A6f028bb59326,0x6F97b7De6Be7b7771e975E46Bae96C35E332e172,0x758259C6CD83A2ac9a5b4A37D91dc6b615e797A2,0x7bE2ceF5b5686e70B0640A3974E31C9EbdBB69E6,0x88c0952093dD5e49b45E5448B871dFefea11B55D,0x9217eB315aA9b42E022D59f72aA0eE5D1c99654F,0x94338294E572766C29aE74227742D72b5a6f4676,0x94Bf01BD8835Eb110B317B747D3469961Faf95D2,0x967Cd3b4D8a1192b7b779a3f718426073469ce86,0x9C156e778Bcb111B7E803f8773b6B3A627A1aC84,0x9c50176F41bcFa88aed806A74f0C047e3B61e5A6,0xA196935948F5F6EdC40bDB3deA6DfD873d32495a,0xa3d4eA7cAFA11Fe3f7bE52aCbe4AbdC5A5499CC3,0xA73dB69EA64315c44C970245C1f30A7bc765A7D0,0xa9076b5ba0aA393915Cc4143653e7a01b96b5E12,0xAAe23896d111bDD4Df7C73c7b63cD5f6f3D3414c,0xAB078F1e310C3F6B9a6b6C91f23C6cb5f09Fe61c,0xae6BA1d629881FaF0d64391761aE88389c21601C,0xb1B4c45a4d1e04da394A79c20E96545C2Ee31a3f,0xba0995C52474dFB7C48181F71454a63a2847982C,0xbAaBA861464F25f52c2eE10CC3AC024F4f77812a,0xBeE39B9e8a1e8aa4B92Dcab680DBf29E50CB0F20,0xc18579D1873d0f7925cB765E52125c2c628BFEF7,0xc22e7abbc8b2DA4C2ec4B341d1F155e839b3092b,0xC3b5533cFED62C10e8fc04AeCbD4BD09312841D0,0xCB0eC27E86a2a51c981b9e3ee28fF861F5863FFB,0xcC457582E034A1a59E2550E162E8c3991eaDb177,0xCd01Bd317df6419Af020eEb43E58D7D0c7C48F29,0xD142c0cC2f707b808060BcBcEb903f6d6D62952f,0xd255801d7a294E4cEaC416a3caF5791275D645f5,0xd4b4cAB5cf150F46448A8b312CF4d96521953C5f,0xD72508Badc98629E324496180322e70ed2e28ee1,0xdD6Cf7bb264ccB04c7E61a01c77C77075b676e32,0xdE12dC01DC6699dA44c24F5A9cee2970Ea32198A,0xE7C464Ab48bdf91517DBd957227744282c437Fca,0xEeE3AA7dB7b8FE836f4E3Be7Dd6B46f598F66312,0xF0344f61EDF4599a46743A92fBBa74d365B16352,0xF60CDd980A39A3354287a0B6e40cF1F2cbB2e7d1,0xfB7cE7b78Cc7356664D42C43216eBB6c7e49B627
Arg [3] : _shareAmounts (uint256[]): 113755024,188406759,355484451,191961603,85316268,135084091,29327467,10664533,88871112,7109688,11553244,99535646,120864713,39103289,28438756,42658134,138638936,143526847,8442755,17774222,543891210,216845515,216845515,7109688,149303469,110200179,21329067,46212978,14219378,319936006,444355,476349165,383923207,3110488,99535646,56877512,113755024,92425957,401697430,46212978,654091423,136417158,266613338,35548445,54211378,209735826,35548445,189739826,149303469,71096890,53322667,888711,10664533,71096890,42658134,24883911,209735826,67542045,3554844,160856714,561665433,218178582,24883911,39103289,235064093,3554844,181297070

-----Encoded View---------------
140 Constructor Arguments found :
Arg [0] : 000000000000000000000000833589fcd6edb6e08f4c7c32d4f71b54bda02913
Arg [1] : 0000000000000000000000000000000000000000000000000000000211c41e00
Arg [2] : 0000000000000000000000000000000000000000000000000000000000000080
Arg [3] : 0000000000000000000000000000000000000000000000000000000000000900
Arg [4] : 0000000000000000000000000000000000000000000000000000000000000043
Arg [5] : 0000000000000000000000000ccf31a1cc4d88b321211841df7ca9950c3aa330
Arg [6] : 0000000000000000000000000f965bd940e23932effcfc5260f33f83fb0bf0c3
Arg [7] : 0000000000000000000000001064bc5406bc61951cb62829e71eb966a012799e
Arg [8] : 00000000000000000000000012e7181b9307eadb25fc2898d717d6752c60156c
Arg [9] : 00000000000000000000000013c29aa6b4aa6b9da82ff22d9867afca24fbe52a
Arg [10] : 00000000000000000000000014b27e03a394cadec25b2b20573e1ce88f482e91
Arg [11] : 000000000000000000000000151214e0a010801fceefc3356486b79dee7d331f
Arg [12] : 00000000000000000000000016562522f2eb17897c1f2bd2b1e9981a04f99de7
Arg [13] : 0000000000000000000000001684ef954f970744f3722439ac283644f8e0a2b2
Arg [14] : 0000000000000000000000001cb311fc841152d7cc9308bfeeddf8deaf31fddd
Arg [15] : 0000000000000000000000001d675aefa52ba004081c895e0a54589bc8d9bebc
Arg [16] : 0000000000000000000000001f3ca34e78ccb5581807b51915b0afe304a92450
Arg [17] : 00000000000000000000000029626851a2c69d45fde290c5b3702fdc8246518b
Arg [18] : 0000000000000000000000002b0866ff6177c62585be33c21f3a28f5eb8f445c
Arg [19] : 0000000000000000000000002e82494083d823173249d67e3b7bdad17425e028
Arg [20] : 00000000000000000000000030e1e2f119aa0a492ee20135f2409081c166b26f
Arg [21] : 000000000000000000000000347ffc6db9acc54ac2019795173b9599e8b82bd9
Arg [22] : 0000000000000000000000003d874eab2766bcf5ed67aa1e142722ab347d17b5
Arg [23] : 0000000000000000000000004153a26b81dda3ea17dcaaffb5a12046f4a4787e
Arg [24] : 000000000000000000000000448d3eebafc62663d9266372ef3b405e591b7f5e
Arg [25] : 0000000000000000000000004a2bc872c00b3834465684c0613c5c4a0da9a925
Arg [26] : 0000000000000000000000004c40707debb1f1b1f1cca904a31a201b296caafd
Arg [27] : 0000000000000000000000004e774f2a3ea241f81bbabb58afb6cab6097ab186
Arg [28] : 0000000000000000000000004f67f52147c6bc03563772fa3d7af3adffb92110
Arg [29] : 0000000000000000000000004f91cc50b6911cc7582ae93b3aaac1a0cb70fcde
Arg [30] : 000000000000000000000000574614c9f248275e7d5b136b71bfac7a1fbdfdfe
Arg [31] : 000000000000000000000000631f18e4192846574b05246f7349ba6b1e70a016
Arg [32] : 000000000000000000000000636aa161f4924a0dbce40413a99c896250bc87a7
Arg [33] : 0000000000000000000000006439d2e08bef8637672ac08bb53a6f028bb59326
Arg [34] : 0000000000000000000000006f97b7de6be7b7771e975e46bae96c35e332e172
Arg [35] : 000000000000000000000000758259c6cd83a2ac9a5b4a37d91dc6b615e797a2
Arg [36] : 0000000000000000000000007be2cef5b5686e70b0640a3974e31c9ebdbb69e6
Arg [37] : 00000000000000000000000088c0952093dd5e49b45e5448b871dfefea11b55d
Arg [38] : 0000000000000000000000009217eb315aa9b42e022d59f72aa0ee5d1c99654f
Arg [39] : 00000000000000000000000094338294e572766c29ae74227742d72b5a6f4676
Arg [40] : 00000000000000000000000094bf01bd8835eb110b317b747d3469961faf95d2
Arg [41] : 000000000000000000000000967cd3b4d8a1192b7b779a3f718426073469ce86
Arg [42] : 0000000000000000000000009c156e778bcb111b7e803f8773b6b3a627a1ac84
Arg [43] : 0000000000000000000000009c50176f41bcfa88aed806a74f0c047e3b61e5a6
Arg [44] : 000000000000000000000000a196935948f5f6edc40bdb3dea6dfd873d32495a
Arg [45] : 000000000000000000000000a3d4ea7cafa11fe3f7be52acbe4abdc5a5499cc3
Arg [46] : 000000000000000000000000a73db69ea64315c44c970245c1f30a7bc765a7d0
Arg [47] : 000000000000000000000000a9076b5ba0aa393915cc4143653e7a01b96b5e12
Arg [48] : 000000000000000000000000aae23896d111bdd4df7c73c7b63cd5f6f3d3414c
Arg [49] : 000000000000000000000000ab078f1e310c3f6b9a6b6c91f23c6cb5f09fe61c
Arg [50] : 000000000000000000000000ae6ba1d629881faf0d64391761ae88389c21601c
Arg [51] : 000000000000000000000000b1b4c45a4d1e04da394a79c20e96545c2ee31a3f
Arg [52] : 000000000000000000000000ba0995c52474dfb7c48181f71454a63a2847982c
Arg [53] : 000000000000000000000000baaba861464f25f52c2ee10cc3ac024f4f77812a
Arg [54] : 000000000000000000000000bee39b9e8a1e8aa4b92dcab680dbf29e50cb0f20
Arg [55] : 000000000000000000000000c18579d1873d0f7925cb765e52125c2c628bfef7
Arg [56] : 000000000000000000000000c22e7abbc8b2da4c2ec4b341d1f155e839b3092b
Arg [57] : 000000000000000000000000c3b5533cfed62c10e8fc04aecbd4bd09312841d0
Arg [58] : 000000000000000000000000cb0ec27e86a2a51c981b9e3ee28ff861f5863ffb
Arg [59] : 000000000000000000000000cc457582e034a1a59e2550e162e8c3991eadb177
Arg [60] : 000000000000000000000000cd01bd317df6419af020eeb43e58d7d0c7c48f29
Arg [61] : 000000000000000000000000d142c0cc2f707b808060bcbceb903f6d6d62952f
Arg [62] : 000000000000000000000000d255801d7a294e4ceac416a3caf5791275d645f5
Arg [63] : 000000000000000000000000d4b4cab5cf150f46448a8b312cf4d96521953c5f
Arg [64] : 000000000000000000000000d72508badc98629e324496180322e70ed2e28ee1
Arg [65] : 000000000000000000000000dd6cf7bb264ccb04c7e61a01c77c77075b676e32
Arg [66] : 000000000000000000000000de12dc01dc6699da44c24f5a9cee2970ea32198a
Arg [67] : 000000000000000000000000e7c464ab48bdf91517dbd957227744282c437fca
Arg [68] : 000000000000000000000000eee3aa7db7b8fe836f4e3be7dd6b46f598f66312
Arg [69] : 000000000000000000000000f0344f61edf4599a46743a92fbba74d365b16352
Arg [70] : 000000000000000000000000f60cdd980a39a3354287a0b6e40cf1f2cbb2e7d1
Arg [71] : 000000000000000000000000fb7ce7b78cc7356664d42c43216ebb6c7e49b627
Arg [72] : 0000000000000000000000000000000000000000000000000000000000000043
Arg [73] : 0000000000000000000000000000000000000000000000000000000006c7c390
Arg [74] : 000000000000000000000000000000000000000000000000000000000b3adbe7
Arg [75] : 0000000000000000000000000000000000000000000000000000000015304323
Arg [76] : 000000000000000000000000000000000000000000000000000000000b711a03
Arg [77] : 000000000000000000000000000000000000000000000000000000000515d2ac
Arg [78] : 00000000000000000000000000000000000000000000000000000000080d383b
Arg [79] : 0000000000000000000000000000000000000000000000000000000001bf806b
Arg [80] : 0000000000000000000000000000000000000000000000000000000000a2ba55
Arg [81] : 00000000000000000000000000000000000000000000000000000000054c10c8
Arg [82] : 00000000000000000000000000000000000000000000000000000000006c7c38
Arg [83] : 0000000000000000000000000000000000000000000000000000000000b049dc
Arg [84] : 0000000000000000000000000000000000000000000000000000000005eecb1e
Arg [85] : 0000000000000000000000000000000000000000000000000000000007343fc9
Arg [86] : 000000000000000000000000000000000000000000000000000000000254ab39
Arg [87] : 0000000000000000000000000000000000000000000000000000000001b1f0e4
Arg [88] : 00000000000000000000000000000000000000000000000000000000028ae956
Arg [89] : 0000000000000000000000000000000000000000000000000000000008437658
Arg [90] : 00000000000000000000000000000000000000000000000000000000088e0bbf
Arg [91] : 000000000000000000000000000000000000000000000000000000000080d383
Arg [92] : 00000000000000000000000000000000000000000000000000000000010f368e
Arg [93] : 00000000000000000000000000000000000000000000000000000000206b1f0a
Arg [94] : 000000000000000000000000000000000000000000000000000000000ceccccb
Arg [95] : 000000000000000000000000000000000000000000000000000000000ceccccb
Arg [96] : 00000000000000000000000000000000000000000000000000000000006c7c38
Arg [97] : 0000000000000000000000000000000000000000000000000000000008e630ad
Arg [98] : 0000000000000000000000000000000000000000000000000000000006918573
Arg [99] : 00000000000000000000000000000000000000000000000000000000014574ab
Arg [100] : 0000000000000000000000000000000000000000000000000000000002c12772
Arg [101] : 0000000000000000000000000000000000000000000000000000000000d8f872
Arg [102] : 000000000000000000000000000000000000000000000000000000001311d606
Arg [103] : 000000000000000000000000000000000000000000000000000000000006c7c3
Arg [104] : 000000000000000000000000000000000000000000000000000000001c6482ed
Arg [105] : 0000000000000000000000000000000000000000000000000000000016e23407
Arg [106] : 00000000000000000000000000000000000000000000000000000000002f7658
Arg [107] : 0000000000000000000000000000000000000000000000000000000005eecb1e
Arg [108] : 000000000000000000000000000000000000000000000000000000000363e1c8
Arg [109] : 0000000000000000000000000000000000000000000000000000000006c7c390
Arg [110] : 0000000000000000000000000000000000000000000000000000000005824ee5
Arg [111] : 0000000000000000000000000000000000000000000000000000000017f16a96
Arg [112] : 0000000000000000000000000000000000000000000000000000000002c12772
Arg [113] : 0000000000000000000000000000000000000000000000000000000026fca49f
Arg [114] : 0000000000000000000000000000000000000000000000000000000008218f86
Arg [115] : 000000000000000000000000000000000000000000000000000000000fe4325a
Arg [116] : 00000000000000000000000000000000000000000000000000000000021e6d1d
Arg [117] : 00000000000000000000000000000000000000000000000000000000033b3332
Arg [118] : 000000000000000000000000000000000000000000000000000000000c805092
Arg [119] : 00000000000000000000000000000000000000000000000000000000021e6d1d
Arg [120] : 000000000000000000000000000000000000000000000000000000000b4f3332
Arg [121] : 0000000000000000000000000000000000000000000000000000000008e630ad
Arg [122] : 00000000000000000000000000000000000000000000000000000000043cda3a
Arg [123] : 00000000000000000000000000000000000000000000000000000000032da3ab
Arg [124] : 00000000000000000000000000000000000000000000000000000000000d8f87
Arg [125] : 0000000000000000000000000000000000000000000000000000000000a2ba55
Arg [126] : 00000000000000000000000000000000000000000000000000000000043cda3a
Arg [127] : 00000000000000000000000000000000000000000000000000000000028ae956
Arg [128] : 00000000000000000000000000000000000000000000000000000000017bb2c7
Arg [129] : 000000000000000000000000000000000000000000000000000000000c805092
Arg [130] : 0000000000000000000000000000000000000000000000000000000004069c1d
Arg [131] : 0000000000000000000000000000000000000000000000000000000000363e1c
Arg [132] : 0000000000000000000000000000000000000000000000000000000009967a8a
Arg [133] : 00000000000000000000000000000000000000000000000000000000217a5599
Arg [134] : 000000000000000000000000000000000000000000000000000000000d012416
Arg [135] : 00000000000000000000000000000000000000000000000000000000017bb2c7
Arg [136] : 000000000000000000000000000000000000000000000000000000000254ab39
Arg [137] : 000000000000000000000000000000000000000000000000000000000e02cb1d
Arg [138] : 0000000000000000000000000000000000000000000000000000000000363e1c
Arg [139] : 000000000000000000000000000000000000000000000000000000000ace5fae