Contract Source Code (Solidity)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta

More Options

• Similar
• Submit Audit
• Compare

/**
 *Submitted for verification at apescan.io on 2025-11-12
*/

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

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

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

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

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

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

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

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

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

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

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

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

    /**
     * @dev Return the 512-bit addition of two uint256.
     *
     * The result is stored in two 256 variables such that sum = high * 2²⁵⁶ + low.
     */
    function add512(uint256 a, uint256 b) internal pure returns (uint256 high, uint256 low) {
        assembly ("memory-safe") {
            low := add(a, b)
            high := lt(low, a)
        }
    }

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

        uint256 mLen = m.length;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


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

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


contract ApeNFT is ERC721, Ownable {
    uint256 private _tokenIds;

    // Base URI for metadata
    string private _baseTokenURI;

    // Placeholder URI for unrevealed NFTs
    string private _placeholderURI;

    // Reveal status - controlled by owner
    bool public isRevealed;

    // Maximum supply of NFTs
    uint256 public constant MAX_SUPPLY = 5555;

    // Mapping from token ID to token URI
    mapping(uint256 => string) private _tokenURIs;

    // Whitelist functionality
    mapping(address => bool) public whitelist;
    bool public whitelistActive;
    uint256 public whitelistPrice; // Price in native tokens
    uint256 public publicPrice; // Price in native tokens for public sale

    // Whitelist mint tracking
    mapping(address => uint256) public whitelistMinted;
    uint256 public constant MAX_WHITELIST_MINTS = 10; // Max NFTs per whitelisted address
    uint256 public constant MAX_BATCH_MINT = 200; // Max tokens per batch mint tx

    constructor(
        string memory name,
        string memory symbol,
        string memory baseTokenURI,
        string memory placeholderURI,
        uint256 _whitelistPrice,
        uint256 _publicPrice
    ) ERC721(name, symbol) Ownable(msg.sender) {
        _baseTokenURI = baseTokenURI;
        _placeholderURI = placeholderURI;
        isRevealed = false; // Start with placeholder images
        whitelistPrice = _whitelistPrice;
        publicPrice = _publicPrice;
        whitelistActive = true; // Start with whitelist active
    }

    /**
     * @dev Mints a new NFT to the specified address (Owner only)
     * Uses standard sequential approach - no URI parameter needed
     * @param to The address to mint the NFT to
     */
    function ownerMint(address to) public onlyOwner {
        require(_tokenIds < MAX_SUPPLY, "Max supply reached");

        _tokenIds++;
        uint256 newTokenId = _tokenIds;

        _mint(to, newTokenId);
        // No need to set _tokenURIs - tokenURI() will handle it automatically
    }

    /**
     * @dev Public mint function - automatically handles whitelist and public phases
     * Uses standard sequential approach - no URI parameter needed
     * Accepts native tokens as payment
     */
    function mint() public payable {
        require(_tokenIds < MAX_SUPPLY, "Max supply reached");

        uint256 priceToPay;

        if (whitelistActive) {
            // Whitelist phase - check whitelist status and limits
            require(whitelist[msg.sender], "Address not whitelisted");
            require(
                whitelistMinted[msg.sender] < MAX_WHITELIST_MINTS,
                "Max whitelist mints reached"
            );
            priceToPay = whitelistPrice;
            whitelistMinted[msg.sender]++;
        } else {
            // Public phase - anyone can mint
            priceToPay = publicPrice;
        }

        // Check if user sent enough native tokens
        require(msg.value >= priceToPay, "Insufficient payment");

        // Refund excess payment if any
        if (msg.value > priceToPay) {
            payable(msg.sender).transfer(msg.value - priceToPay);
        }

        _tokenIds++;
        uint256 newTokenId = _tokenIds;

        _mint(msg.sender, newTokenId);
        // No need to set _tokenURIs - tokenURI() will handle it automatically
    }

    /**
     * @dev Batch mints a specific number of NFTs (capped by MAX_BATCH_MINT)
     * @param to The address to mint the NFTs to
     * @param amount Number of NFTs to mint in this batch
     */
    function batchMint(address to, uint256 amount) public onlyOwner {
        require(amount > 0, "Amount must be greater than zero");
        require(amount <= MAX_BATCH_MINT, "Amount exceeds max batch mint size");
        require(
            _tokenIds + amount <= MAX_SUPPLY,
            "Not enough NFTs remaining to mint"
        );

        for (uint256 i = 0; i < amount; i++) {
            _tokenIds++;
            uint256 newTokenId = _tokenIds;

            _mint(to, newTokenId);
            // No need to set _tokenURIs - tokenURI() will handle it automatically
        }
    }

    /**
     * @dev Returns the token URI for a given token ID
     * @param tokenId The ID of the token
     * @return The token URI
     */
    function tokenURI(
        uint256 tokenId
    ) public view virtual override returns (string memory) {
        // Check if token exists by checking if it has an owner
        address tokenOwner = _ownerOf(tokenId);
        require(
            tokenOwner != address(0),
            "ERC721: URI query for nonexistent token"
        );

        // Check if reveal has been triggered by owner
        if (!isRevealed) {
            // Return placeholder image until owner reveals
            return _placeholderURI;
        }

        // After reveal, use standard approach: ID 1 → 1.json, ID 2 → 2.json, etc.
        string memory base = _baseTokenURI;

        if (bytes(base).length > 0) {
            return string(abi.encodePacked(base, _toString(tokenId), ".json"));
        }

        // Fallback: if no base URI, return just the token ID
        return string(abi.encodePacked(_toString(tokenId), ".json"));
    }

    /**
     * @dev Sets the base URI for all tokens
     * @param baseURI The new base URI
     */
    function setBaseURI(string memory baseURI) public onlyOwner {
        _baseTokenURI = baseURI;
    }

    /**
     * @dev Sets the placeholder URI for unrevealed NFTs
     * @param placeholderURI The new placeholder URI
     */
    function setPlaceholderURI(string memory placeholderURI) public onlyOwner {
        _placeholderURI = placeholderURI;
    }

    /**
     * @dev Triggers the reveal of all NFTs
     * @notice Only owner can call this function
     */
    function reveal() public onlyOwner {
        isRevealed = true;
    }

    /**
     * @dev Reverts the reveal (goes back to placeholder)
     * @notice Only owner can call this function
     */
    function hide() public onlyOwner {
        isRevealed = false;
    }

    /**
     * @dev Returns the current token ID counter
     * @return The current token ID
     */
    function getCurrentTokenId() public view returns (uint256) {
        return _tokenIds;
    }

    /**
     * @dev Returns the total supply of minted tokens
     * @return The total supply
     */
    function totalSupply() public view returns (uint256) {
        return _tokenIds;
    }

    // ============ WHITELIST MANAGEMENT ============

    /**
     * @dev Adds addresses to the whitelist
     * @param addresses Array of addresses to add to whitelist
     */
    function addToWhitelist(address[] calldata addresses) public onlyOwner {
        for (uint256 i = 0; i < addresses.length; i++) {
            whitelist[addresses[i]] = true;
        }
    }

    /**
     * @dev Removes addresses from the whitelist
     * @param addresses Array of addresses to remove from whitelist
     */
    function removeFromWhitelist(
        address[] calldata addresses
    ) public onlyOwner {
        for (uint256 i = 0; i < addresses.length; i++) {
            whitelist[addresses[i]] = false;
        }
    }

    /**
     * @dev Activates the whitelist sale
     */
    function activateWhitelist() public onlyOwner {
        whitelistActive = true;
    }

    /**
     * @dev Deactivates the whitelist sale (opens public sale)
     */
    function deactivateWhitelist() public onlyOwner {
        whitelistActive = false;
    }

    /**
     * @dev Sets the whitelist price
     * @param _price New whitelist price in native tokens
     */
    function setWhitelistPrice(uint256 _price) public onlyOwner {
        whitelistPrice = _price;
    }

    /**
     * @dev Sets the public sale price
     * @param _price New public price in native tokens
     */
    function setPublicPrice(uint256 _price) public onlyOwner {
        publicPrice = _price;
    }

    /**
     * @dev Withdraws native tokens from the contract
     */
    function withdrawNative() public onlyOwner {
        uint256 balance = address(this).balance;
        require(balance > 0, "No native tokens to withdraw");
        payable(owner()).transfer(balance);
    }

    /**
     * @dev Checks if an address is whitelisted
     * @param _address Address to check
     * @return True if whitelisted
     */
    function isWhitelisted(address _address) public view returns (bool) {
        return whitelist[_address];
    }

    /**
     * @dev Gets the current sale phase
     * @return "whitelist" if whitelist is active, "public" if not
     */
    function getSalePhase() public view returns (string memory) {
        return whitelistActive ? "whitelist" : "public";
    }

    /**
     * @dev Gets the current mint price based on sale phase
     * @return Current price in native tokens
     */
    function getCurrentPrice() public view returns (uint256) {
        return whitelistActive ? whitelistPrice : publicPrice;
    }

    /**
     * @dev Checks if an address can mint (whitelist status and limits)
     * @param _address Address to check
     * @return True if address can mint
     */
    function canMint(address _address) public view returns (bool) {
        if (!whitelistActive) {
            return true; // Public phase - anyone can mint
        }

        // Whitelist phase - check whitelist status and limits
        return
            whitelist[_address] &&
            whitelistMinted[_address] < MAX_WHITELIST_MINTS;
    }

    /**
     * @dev Converts a uint256 to its ASCII string decimal representation
     * @param value The uint256 to convert
     * @return The string representation
     */
    function _toString(uint256 value) internal pure returns (string memory) {
        if (value == 0) {
            return "0";
        }
        uint256 temp = value;
        uint256 digits;
        while (temp != 0) {
            digits++;
            temp /= 10;
        }
        bytes memory buffer = new bytes(digits);
        while (value != 0) {
            digits -= 1;
            buffer[digits] = bytes1(uint8(48 + uint256(value % 10)));
            value /= 10;
        }
        return string(buffer);
    }
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"string","name":"name","type":"string"},{"internalType":"string","name":"symbol","type":"string"},{"internalType":"string","name":"baseTokenURI","type":"string"},{"internalType":"string","name":"placeholderURI","type":"string"},{"internalType":"uint256","name":"_whitelistPrice","type":"uint256"},{"internalType":"uint256","name":"_publicPrice","type":"uint256"}],"stateMutability":"nonpayable","type":"constructor"},{"inputs":[{"internalType":"address","name":"sender","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721IncorrectOwner","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721InsufficientApproval","type":"error"},{"inputs":[{"internalType":"address","name":"approver","type":"address"}],"name":"ERC721InvalidApprover","type":"error"},{"inputs":[{"internalType":"address","name":"operator","type":"address"}],"name":"ERC721InvalidOperator","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"ERC721InvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"receiver","type":"address"}],"name":"ERC721InvalidReceiver","type":"error"},{"inputs":[{"internalType":"address","name":"sender","type":"address"}],"name":"ERC721InvalidSender","type":"error"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ERC721NonexistentToken","type":"error"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"OwnableInvalidOwner","type":"error"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"OwnableUnauthorizedAccount","type":"error"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"approved","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"operator","type":"address"},{"indexed":false,"internalType":"bool","name":"approved","type":"bool"}],"name":"ApprovalForAll","type":"event"},{"anonymous":false,"inputs":[{"indexed":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":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":true,"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[],"name":"MAX_BATCH_MINT","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_SUPPLY","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"MAX_WHITELIST_MINTS","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"activateWhitelist","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address[]","name":"addresses","type":"address[]"}],"name":"addToWhitelist","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"approve","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"batchMint","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_address","type":"address"}],"name":"canMint","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"deactivateWhitelist","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"getApproved","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getCurrentPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getCurrentTokenId","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getSalePhase","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"hide","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"operator","type":"address"}],"name":"isApprovedForAll","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"isRevealed","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_address","type":"address"}],"name":"isWhitelisted","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"mint","outputs":[],"stateMutability":"payable","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"}],"name":"ownerMint","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"ownerOf","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"publicPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address[]","name":"addresses","type":"address[]"}],"name":"removeFromWhitelist","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"reveal","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"},{"internalType":"bytes","name":"data","type":"bytes"}],"name":"safeTransferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"operator","type":"address"},{"internalType":"bool","name":"approved","type":"bool"}],"name":"setApprovalForAll","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"baseURI","type":"string"}],"name":"setBaseURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"string","name":"placeholderURI","type":"string"}],"name":"setPlaceholderURI","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_price","type":"uint256"}],"name":"setPublicPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_price","type":"uint256"}],"name":"setWhitelistPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"bytes4","name":"interfaceId","type":"bytes4"}],"name":"supportsInterface","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"tokenURI","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"tokenId","type":"uint256"}],"name":"transferFrom","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"whitelist","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"whitelistActive","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"","type":"address"}],"name":"whitelistMinted","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"whitelistPrice","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"withdrawNative","outputs":[],"stateMutability":"nonpayable","type":"function"}]

608060405234801561000f575f5ffd5b5060405161230438038061230483398101604081905261002e916101b7565b3386865f61003c8382610309565b5060016100498282610309565b5050506001600160a01b03811661007957604051631e4fbdf760e01b81525f600482015260240160405180910390fd5b610082816100c9565b50600861008f8582610309565b50600961009c8482610309565b50600a805460ff19908116909155600e92909255600f55600d80549091166001179055506103c392505050565b600680546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b634e487b7160e01b5f52604160045260245ffd5b5f82601f83011261013d575f5ffd5b81516001600160401b038111156101565761015661011a565b604051601f8201601f19908116603f011681016001600160401b03811182821017156101845761018461011a565b60405281815283820160200185101561019b575f5ffd5b8160208501602083015e5f918101602001919091529392505050565b5f5f5f5f5f5f60c087890312156101cc575f5ffd5b86516001600160401b038111156101e1575f5ffd5b6101ed89828a0161012e565b602089015190975090506001600160401b0381111561020a575f5ffd5b61021689828a0161012e565b604089015190965090506001600160401b03811115610233575f5ffd5b61023f89828a0161012e565b606089015190955090506001600160401b0381111561025c575f5ffd5b61026889828a0161012e565b608089015160a090990151979a9699509497949694959350505050565b600181811c9082168061029957607f821691505b6020821081036102b757634e487b7160e01b5f52602260045260245ffd5b50919050565b601f82111561030457805f5260205f20601f840160051c810160208510156102e25750805b601f840160051c820191505b81811015610301575f81556001016102ee565b50505b505050565b81516001600160401b038111156103225761032261011a565b610336816103308454610285565b846102bd565b6020601f821160018114610368575f83156103515750848201515b5f19600385901b1c1916600184901b178455610301565b5f84815260208120601f198516915b828110156103975787850151825560209485019460019092019101610377565b50848210156103b457868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b611f34806103d05f395ff3fe60806040526004361061026a575f3560e01c806370a082311161014a578063a475b5dd116100be578063c627525511610078578063c6275255146106c4578063c87b56dd146106e3578063e985e9c514610702578063eb91d37e14610721578063f2fde38b14610735578063fc1a1c3614610754575f5ffd5b8063a475b5dd14610635578063a81152f714610649578063a945bf801461065d578063b62a762514610672578063b88d4fde14610686578063c2ba4744146106a5575f5ffd5b80638da5cb5b1161010f5780638da5cb5b1461057857806395d89b411461059557806398a8cffe146105a95780639aaebf7e146105d45780639b19251a146105e8578063a22cb46514610616575f5ffd5b806370a08231146104f3578063715018a614610512578063717d57d3146105265780637f6497831461054557806389e877a314610564575f5ffd5b80633597d7f3116101e157806350431ce4116101a657806350431ce41461046957806354214f691461047d578063548db1741461049657806355f804b3146104b5578063561892361461033c5780636352211e146104d4575f5ffd5b80633597d7f3146103cc5780633af32abf146103e057806342842e0e1461041757806343508b05146104365780634e3befd314610455575f5ffd5b80631249c58b116102325780631249c58b1461033457806318160ddd1461033c5780631e3bcc8e1461035a57806323b872dd1461037957806332cb6b0c146103985780633574a2dd146103ad575f5ffd5b806301ffc9a71461026e57806302ce5813146102a257806306fdde03146102bb578063081812fc146102dc578063095ea7b314610313575b5f5ffd5b348015610279575f5ffd5b5061028d61028836600461193e565b610769565b60405190151581526020015b60405180910390f35b3480156102ad575f5ffd5b50600d5461028d9060ff1681565b3480156102c6575f5ffd5b506102cf6107ba565b604051610299919061198e565b3480156102e7575f5ffd5b506102fb6102f63660046119a0565b610849565b6040516001600160a01b039091168152602001610299565b34801561031e575f5ffd5b5061033261032d3660046119d2565b610870565b005b61033261087f565b348015610347575f5ffd5b506007545b604051908152602001610299565b348015610365575f5ffd5b506103326103743660046119fa565b610a67565b348015610384575f5ffd5b50610332610393366004611a13565b610ad8565b3480156103a3575f5ffd5b5061034c6115b381565b3480156103b8575f5ffd5b506103326103c7366004611ad8565b610b61565b3480156103d7575f5ffd5b50610332610b75565b3480156103eb575f5ffd5b5061028d6103fa3660046119fa565b6001600160a01b03165f908152600c602052604090205460ff1690565b348015610422575f5ffd5b50610332610431366004611a13565b610b89565b348015610441575f5ffd5b506103326104503660046119d2565b610ba8565b348015610460575f5ffd5b506102cf610cf8565b348015610474575f5ffd5b50610332610d4a565b348015610488575f5ffd5b50600a5461028d9060ff1681565b3480156104a1575f5ffd5b506103326104b0366004611b1d565b610dd7565b3480156104c0575f5ffd5b506103326104cf366004611ad8565b610e43565b3480156104df575f5ffd5b506102fb6104ee3660046119a0565b610e57565b3480156104fe575f5ffd5b5061034c61050d3660046119fa565b610e61565b34801561051d575f5ffd5b50610332610ea6565b348015610531575f5ffd5b506103326105403660046119a0565b610eb9565b348015610550575f5ffd5b5061033261055f366004611b1d565b610ec6565b34801561056f575f5ffd5b50610332610f33565b348015610583575f5ffd5b506006546001600160a01b03166102fb565b3480156105a0575f5ffd5b506102cf610f4a565b3480156105b4575f5ffd5b5061034c6105c33660046119fa565b60106020525f908152604090205481565b3480156105df575f5ffd5b5061034c600a81565b3480156105f3575f5ffd5b5061028d6106023660046119fa565b600c6020525f908152604090205460ff1681565b348015610621575f5ffd5b50610332610630366004611b8e565b610f59565b348015610640575f5ffd5b50610332610f64565b348015610654575f5ffd5b5061034c60c881565b348015610668575f5ffd5b5061034c600f5481565b34801561067d575f5ffd5b50610332610f7b565b348015610691575f5ffd5b506103326106a0366004611bc7565b610f8f565b3480156106b0575f5ffd5b5061028d6106bf3660046119fa565b610fa7565b3480156106cf575f5ffd5b506103326106de3660046119a0565b610ffb565b3480156106ee575f5ffd5b506102cf6106fd3660046119a0565b611008565b34801561070d575f5ffd5b5061028d61071c366004611c3e565b6111fb565b34801561072c575f5ffd5b5061034c611228565b348015610740575f5ffd5b5061033261074f3660046119fa565b611242565b34801561075f575f5ffd5b5061034c600e5481565b5f6001600160e01b031982166380ac58cd60e01b148061079957506001600160e01b03198216635b5e139f60e01b145b806107b457506301ffc9a760e01b6001600160e01b03198316145b92915050565b60605f80546107c890611c6f565b80601f01602080910402602001604051908101604052809291908181526020018280546107f490611c6f565b801561083f5780601f106108165761010080835404028352916020019161083f565b820191905f5260205f20905b81548152906001019060200180831161082257829003601f168201915b5050505050905090565b5f6108538261127f565b505f828152600460205260409020546001600160a01b03166107b4565b61087b8282336112b7565b5050565b6115b3600754106108cc5760405162461bcd60e51b815260206004820152601260248201527113585e081cdd5c1c1b1e481c995858da195960721b60448201526064015b60405180910390fd5b600d545f9060ff16156109bd57335f908152600c602052604090205460ff166109375760405162461bcd60e51b815260206004820152601760248201527f41646472657373206e6f742077686974656c697374656400000000000000000060448201526064016108c3565b335f90815260106020526040902054600a116109955760405162461bcd60e51b815260206004820152601b60248201527f4d61782077686974656c697374206d696e74732072656163686564000000000060448201526064016108c3565b50600e54335f9081526010602052604081208054916109b383611cbb565b91905055506109c2565b50600f545b80341015610a095760405162461bcd60e51b8152602060048201526014602482015273125b9cdd59999a58da595b9d081c185e5b595b9d60621b60448201526064016108c3565b80341115610a4657336108fc610a1f8334611cd3565b6040518115909202915f818181858888f19350505050158015610a44573d5f5f3e3d5ffd5b505b60078054905f610a5583611cbb565b909155505060075461087b33826112c4565b610a6f611325565b6115b360075410610ab75760405162461bcd60e51b815260206004820152601260248201527113585e081cdd5c1c1b1e481c995858da195960721b60448201526064016108c3565b60078054905f610ac683611cbb565b909155505060075461087b82826112c4565b6001600160a01b038216610b0157604051633250574960e11b81525f60048201526024016108c3565b5f610b0d838333611352565b9050836001600160a01b0316816001600160a01b031614610b5b576040516364283d7b60e01b81526001600160a01b03808616600483015260248201849052821660448201526064016108c3565b50505050565b610b69611325565b600961087b8282611d2a565b610b7d611325565b600d805460ff19169055565b610ba383838360405180602001604052805f815250610f8f565b505050565b610bb0611325565b5f8111610bff5760405162461bcd60e51b815260206004820181905260248201527f416d6f756e74206d7573742062652067726561746572207468616e207a65726f60448201526064016108c3565b60c8811115610c5b5760405162461bcd60e51b815260206004820152602260248201527f416d6f756e742065786365656473206d6178206261746368206d696e742073696044820152617a6560f01b60648201526084016108c3565b6115b381600754610c6c9190611de5565b1115610cc45760405162461bcd60e51b815260206004820152602160248201527f4e6f7420656e6f756768204e4654732072656d61696e696e6720746f206d696e6044820152601d60fa1b60648201526084016108c3565b5f5b81811015610ba35760078054905f610cdd83611cbb565b9091555050600754610cef84826112c4565b50600101610cc6565b600d5460609060ff16610d2657506040805180820190915260068152657075626c696360d01b602082015290565b506040805180820190915260098152681dda1a5d195b1a5cdd60ba1b602082015290565b610d52611325565b4780610da05760405162461bcd60e51b815260206004820152601c60248201527f4e6f206e617469766520746f6b656e7320746f2077697468647261770000000060448201526064016108c3565b6006546040516001600160a01b039091169082156108fc029083905f818181858888f1935050505015801561087b573d5f5f3e3d5ffd5b610ddf611325565b5f5b81811015610ba3575f600c5f858585818110610dff57610dff611df8565b9050602002016020810190610e1491906119fa565b6001600160a01b0316815260208101919091526040015f20805460ff1916911515919091179055600101610de1565b610e4b611325565b600861087b8282611d2a565b5f6107b48261127f565b5f6001600160a01b038216610e8b576040516322718ad960e21b81525f60048201526024016108c3565b506001600160a01b03165f9081526003602052604090205490565b610eae611325565b610eb75f611444565b565b610ec1611325565b600e55565b610ece611325565b5f5b81811015610ba3576001600c5f858585818110610eef57610eef611df8565b9050602002016020810190610f0491906119fa565b6001600160a01b0316815260208101919091526040015f20805460ff1916911515919091179055600101610ed0565b610f3b611325565b600d805460ff19166001179055565b6060600180546107c890611c6f565b61087b338383611495565b610f6c611325565b600a805460ff19166001179055565b610f83611325565b600a805460ff19169055565b610f9a848484610ad8565b610b5b3385858585611533565b600d545f9060ff16610fbb57506001919050565b6001600160a01b0382165f908152600c602052604090205460ff1680156107b45750506001600160a01b03165f90815260106020526040902054600a1190565b611003611325565b600f55565b5f818152600260205260409020546060906001600160a01b03168061107f5760405162461bcd60e51b815260206004820152602760248201527f4552433732313a2055524920717565727920666f72206e6f6e6578697374656e6044820152663a103a37b5b2b760c91b60648201526084016108c3565b600a5460ff1661111a576009805461109690611c6f565b80601f01602080910402602001604051908101604052809291908181526020018280546110c290611c6f565b801561110d5780601f106110e45761010080835404028352916020019161110d565b820191905f5260205f20905b8154815290600101906020018083116110f057829003601f168201915b5050505050915050919050565b5f6008805461112890611c6f565b80601f016020809104026020016040519081016040528092919081815260200182805461115490611c6f565b801561119f5780601f106111765761010080835404028352916020019161119f565b820191905f5260205f20905b81548152906001019060200180831161118257829003601f168201915b505050505090505f815111156111e257806111b98561165b565b6040516020016111ca929190611e23565b60405160208183030381529060405292505050919050565b6111eb8461165b565b6040516020016111ca9190611e4d565b6001600160a01b039182165f90815260056020908152604080832093909416825291909152205460ff1690565b600d545f9060ff1661123b5750600f5490565b50600e5490565b61124a611325565b6001600160a01b03811661127357604051631e4fbdf760e01b81525f60048201526024016108c3565b61127c81611444565b50565b5f818152600260205260408120546001600160a01b0316806107b457604051637e27328960e01b8152600481018490526024016108c3565b610ba38383836001611760565b6001600160a01b0382166112ed57604051633250574960e11b81525f60048201526024016108c3565b5f6112f983835f611352565b90506001600160a01b03811615610ba3576040516339e3563760e11b81525f60048201526024016108c3565b6006546001600160a01b03163314610eb75760405163118cdaa760e01b81523360048201526024016108c3565b5f828152600260205260408120546001600160a01b039081169083161561137e5761137e818486611864565b6001600160a01b038116156113b8576113995f855f5f611760565b6001600160a01b0381165f90815260036020526040902080545f190190555b6001600160a01b038516156113e6576001600160a01b0385165f908152600360205260409020805460010190555b5f8481526002602052604080822080546001600160a01b0319166001600160a01b0389811691821790925591518793918516917fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef91a4949350505050565b600680546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b6001600160a01b0382166114c757604051630b61174360e31b81526001600160a01b03831660048201526024016108c3565b6001600160a01b038381165f81815260056020908152604080832094871680845294825291829020805460ff191686151590811790915591519182527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a3505050565b6001600160a01b0383163b1561165457604051630a85bd0160e11b81526001600160a01b0384169063150b7a0290611575908890889087908790600401611e6d565b6020604051808303815f875af19250505080156115af575060408051601f3d908101601f191682019092526115ac91810190611ea9565b60015b611616573d8080156115dc576040519150601f19603f3d011682016040523d82523d5f602084013e6115e1565b606091505b5080515f0361160e57604051633250574960e11b81526001600160a01b03851660048201526024016108c3565b805160208201fd5b6001600160e01b03198116630a85bd0160e11b1461165257604051633250574960e11b81526001600160a01b03851660048201526024016108c3565b505b5050505050565b6060815f036116815750506040805180820190915260018152600360fc1b602082015290565b815f5b81156116aa578061169481611cbb565b91506116a39050600a83611ed8565b9150611684565b5f8167ffffffffffffffff8111156116c4576116c4611a4d565b6040519080825280601f01601f1916602001820160405280156116ee576020820181803683370190505b5090505b841561175857611703600183611cd3565b9150611710600a86611eeb565b61171b906030611de5565b60f81b81838151811061173057611730611df8565b60200101906001600160f81b03191690815f1a905350611751600a86611ed8565b94506116f2565b949350505050565b808061177457506001600160a01b03821615155b15611835575f6117838461127f565b90506001600160a01b038316158015906117af5750826001600160a01b0316816001600160a01b031614155b80156117c257506117c081846111fb565b155b156117eb5760405163a9fbf51f60e01b81526001600160a01b03841660048201526024016108c3565b81156118335783856001600160a01b0316826001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b50505f90815260046020526040902080546001600160a01b0319166001600160a01b0392909216919091179055565b61186f8383836118c8565b610ba3576001600160a01b03831661189d57604051637e27328960e01b8152600481018290526024016108c3565b60405163177e802f60e01b81526001600160a01b0383166004820152602481018290526044016108c3565b5f6001600160a01b038316158015906117585750826001600160a01b0316846001600160a01b03161480611901575061190184846111fb565b806117585750505f908152600460205260409020546001600160a01b03908116911614919050565b6001600160e01b03198116811461127c575f5ffd5b5f6020828403121561194e575f5ffd5b813561195981611929565b9392505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f6119596020830184611960565b5f602082840312156119b0575f5ffd5b5035919050565b80356001600160a01b03811681146119cd575f5ffd5b919050565b5f5f604083850312156119e3575f5ffd5b6119ec836119b7565b946020939093013593505050565b5f60208284031215611a0a575f5ffd5b611959826119b7565b5f5f5f60608486031215611a25575f5ffd5b611a2e846119b7565b9250611a3c602085016119b7565b929592945050506040919091013590565b634e487b7160e01b5f52604160045260245ffd5b5f5f67ffffffffffffffff841115611a7b57611a7b611a4d565b50604051601f19601f85018116603f0116810181811067ffffffffffffffff82111715611aaa57611aaa611a4d565b604052838152905080828401851015611ac1575f5ffd5b838360208301375f60208583010152509392505050565b5f60208284031215611ae8575f5ffd5b813567ffffffffffffffff811115611afe575f5ffd5b8201601f81018413611b0e575f5ffd5b61175884823560208401611a61565b5f5f60208385031215611b2e575f5ffd5b823567ffffffffffffffff811115611b44575f5ffd5b8301601f81018513611b54575f5ffd5b803567ffffffffffffffff811115611b6a575f5ffd5b8560208260051b8401011115611b7e575f5ffd5b6020919091019590945092505050565b5f5f60408385031215611b9f575f5ffd5b611ba8836119b7565b915060208301358015158114611bbc575f5ffd5b809150509250929050565b5f5f5f5f60808587031215611bda575f5ffd5b611be3856119b7565b9350611bf1602086016119b7565b925060408501359150606085013567ffffffffffffffff811115611c13575f5ffd5b8501601f81018713611c23575f5ffd5b611c3287823560208401611a61565b91505092959194509250565b5f5f60408385031215611c4f575f5ffd5b611c58836119b7565b9150611c66602084016119b7565b90509250929050565b600181811c90821680611c8357607f821691505b602082108103611ca157634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b5f60018201611ccc57611ccc611ca7565b5060010190565b818103818111156107b4576107b4611ca7565b601f821115610ba357805f5260205f20601f840160051c81016020851015611d0b5750805b601f840160051c820191505b81811015611654575f8155600101611d17565b815167ffffffffffffffff811115611d4457611d44611a4d565b611d5881611d528454611c6f565b84611ce6565b6020601f821160018114611d8a575f8315611d735750848201515b5f19600385901b1c1916600184901b178455611654565b5f84815260208120601f198516915b82811015611db95787850151825560209485019460019092019101611d99565b5084821015611dd657868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b808201808211156107b4576107b4611ca7565b634e487b7160e01b5f52603260045260245ffd5b5f81518060208401855e5f93019283525090919050565b5f611e37611e318386611e0c565b84611e0c565b64173539b7b760d91b8152600501949350505050565b5f611e588284611e0c565b64173539b7b760d91b81526005019392505050565b6001600160a01b03858116825284166020820152604081018390526080606082018190525f90611e9f90830184611960565b9695505050505050565b5f60208284031215611eb9575f5ffd5b815161195981611929565b634e487b7160e01b5f52601260045260245ffd5b5f82611ee657611ee6611ec4565b500490565b5f82611ef957611ef9611ec4565b50069056fea264697066735822122012428bb29253c2f23741f61b70caf129cd5b8b79dc70187aa4bde37288ac40d664736f6c634300081c003300000000000000000000000000000000000000000000000000000000000000c00000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000014000000000000000000000000000000000000000000000000000000000000001a00000000000000000000000000000000000000000000000063333dd0ab16d000000000000000000000000000000000000000000000000000793df33268c0a4000000000000000000000000000000000000000000000000000000000000000001b44756d707374657220417065204e465420436f6c6c656374696f6e00000000000000000000000000000000000000000000000000000000000000000000000006444d504150450000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004068747470733a2f2f617277656176652e6e65742f3964615f356770433261764a76635f3353304d64444e5f504431483244744a4c56703530564d623273494d2f000000000000000000000000000000000000000000000000000000000000003f68747470733a2f2f617277656176652e6e65742f686d473367464c386e36473379754d634974394c7261664d383931676c56677333776378415831386c765500

0x60806040526004361061026a575f3560e01c806370a082311161014a578063a475b5dd116100be578063c627525511610078578063c6275255146106c4578063c87b56dd146106e3578063e985e9c514610702578063eb91d37e14610721578063f2fde38b14610735578063fc1a1c3614610754575f5ffd5b8063a475b5dd14610635578063a81152f714610649578063a945bf801461065d578063b62a762514610672578063b88d4fde14610686578063c2ba4744146106a5575f5ffd5b80638da5cb5b1161010f5780638da5cb5b1461057857806395d89b411461059557806398a8cffe146105a95780639aaebf7e146105d45780639b19251a146105e8578063a22cb46514610616575f5ffd5b806370a08231146104f3578063715018a614610512578063717d57d3146105265780637f6497831461054557806389e877a314610564575f5ffd5b80633597d7f3116101e157806350431ce4116101a657806350431ce41461046957806354214f691461047d578063548db1741461049657806355f804b3146104b5578063561892361461033c5780636352211e146104d4575f5ffd5b80633597d7f3146103cc5780633af32abf146103e057806342842e0e1461041757806343508b05146104365780634e3befd314610455575f5ffd5b80631249c58b116102325780631249c58b1461033457806318160ddd1461033c5780631e3bcc8e1461035a57806323b872dd1461037957806332cb6b0c146103985780633574a2dd146103ad575f5ffd5b806301ffc9a71461026e57806302ce5813146102a257806306fdde03146102bb578063081812fc146102dc578063095ea7b314610313575b5f5ffd5b348015610279575f5ffd5b5061028d61028836600461193e565b610769565b60405190151581526020015b60405180910390f35b3480156102ad575f5ffd5b50600d5461028d9060ff1681565b3480156102c6575f5ffd5b506102cf6107ba565b604051610299919061198e565b3480156102e7575f5ffd5b506102fb6102f63660046119a0565b610849565b6040516001600160a01b039091168152602001610299565b34801561031e575f5ffd5b5061033261032d3660046119d2565b610870565b005b61033261087f565b348015610347575f5ffd5b506007545b604051908152602001610299565b348015610365575f5ffd5b506103326103743660046119fa565b610a67565b348015610384575f5ffd5b50610332610393366004611a13565b610ad8565b3480156103a3575f5ffd5b5061034c6115b381565b3480156103b8575f5ffd5b506103326103c7366004611ad8565b610b61565b3480156103d7575f5ffd5b50610332610b75565b3480156103eb575f5ffd5b5061028d6103fa3660046119fa565b6001600160a01b03165f908152600c602052604090205460ff1690565b348015610422575f5ffd5b50610332610431366004611a13565b610b89565b348015610441575f5ffd5b506103326104503660046119d2565b610ba8565b348015610460575f5ffd5b506102cf610cf8565b348015610474575f5ffd5b50610332610d4a565b348015610488575f5ffd5b50600a5461028d9060ff1681565b3480156104a1575f5ffd5b506103326104b0366004611b1d565b610dd7565b3480156104c0575f5ffd5b506103326104cf366004611ad8565b610e43565b3480156104df575f5ffd5b506102fb6104ee3660046119a0565b610e57565b3480156104fe575f5ffd5b5061034c61050d3660046119fa565b610e61565b34801561051d575f5ffd5b50610332610ea6565b348015610531575f5ffd5b506103326105403660046119a0565b610eb9565b348015610550575f5ffd5b5061033261055f366004611b1d565b610ec6565b34801561056f575f5ffd5b50610332610f33565b348015610583575f5ffd5b506006546001600160a01b03166102fb565b3480156105a0575f5ffd5b506102cf610f4a565b3480156105b4575f5ffd5b5061034c6105c33660046119fa565b60106020525f908152604090205481565b3480156105df575f5ffd5b5061034c600a81565b3480156105f3575f5ffd5b5061028d6106023660046119fa565b600c6020525f908152604090205460ff1681565b348015610621575f5ffd5b50610332610630366004611b8e565b610f59565b348015610640575f5ffd5b50610332610f64565b348015610654575f5ffd5b5061034c60c881565b348015610668575f5ffd5b5061034c600f5481565b34801561067d575f5ffd5b50610332610f7b565b348015610691575f5ffd5b506103326106a0366004611bc7565b610f8f565b3480156106b0575f5ffd5b5061028d6106bf3660046119fa565b610fa7565b3480156106cf575f5ffd5b506103326106de3660046119a0565b610ffb565b3480156106ee575f5ffd5b506102cf6106fd3660046119a0565b611008565b34801561070d575f5ffd5b5061028d61071c366004611c3e565b6111fb565b34801561072c575f5ffd5b5061034c611228565b348015610740575f5ffd5b5061033261074f3660046119fa565b611242565b34801561075f575f5ffd5b5061034c600e5481565b5f6001600160e01b031982166380ac58cd60e01b148061079957506001600160e01b03198216635b5e139f60e01b145b806107b457506301ffc9a760e01b6001600160e01b03198316145b92915050565b60605f80546107c890611c6f565b80601f01602080910402602001604051908101604052809291908181526020018280546107f490611c6f565b801561083f5780601f106108165761010080835404028352916020019161083f565b820191905f5260205f20905b81548152906001019060200180831161082257829003601f168201915b5050505050905090565b5f6108538261127f565b505f828152600460205260409020546001600160a01b03166107b4565b61087b8282336112b7565b5050565b6115b3600754106108cc5760405162461bcd60e51b815260206004820152601260248201527113585e081cdd5c1c1b1e481c995858da195960721b60448201526064015b60405180910390fd5b600d545f9060ff16156109bd57335f908152600c602052604090205460ff166109375760405162461bcd60e51b815260206004820152601760248201527f41646472657373206e6f742077686974656c697374656400000000000000000060448201526064016108c3565b335f90815260106020526040902054600a116109955760405162461bcd60e51b815260206004820152601b60248201527f4d61782077686974656c697374206d696e74732072656163686564000000000060448201526064016108c3565b50600e54335f9081526010602052604081208054916109b383611cbb565b91905055506109c2565b50600f545b80341015610a095760405162461bcd60e51b8152602060048201526014602482015273125b9cdd59999a58da595b9d081c185e5b595b9d60621b60448201526064016108c3565b80341115610a4657336108fc610a1f8334611cd3565b6040518115909202915f818181858888f19350505050158015610a44573d5f5f3e3d5ffd5b505b60078054905f610a5583611cbb565b909155505060075461087b33826112c4565b610a6f611325565b6115b360075410610ab75760405162461bcd60e51b815260206004820152601260248201527113585e081cdd5c1c1b1e481c995858da195960721b60448201526064016108c3565b60078054905f610ac683611cbb565b909155505060075461087b82826112c4565b6001600160a01b038216610b0157604051633250574960e11b81525f60048201526024016108c3565b5f610b0d838333611352565b9050836001600160a01b0316816001600160a01b031614610b5b576040516364283d7b60e01b81526001600160a01b03808616600483015260248201849052821660448201526064016108c3565b50505050565b610b69611325565b600961087b8282611d2a565b610b7d611325565b600d805460ff19169055565b610ba383838360405180602001604052805f815250610f8f565b505050565b610bb0611325565b5f8111610bff5760405162461bcd60e51b815260206004820181905260248201527f416d6f756e74206d7573742062652067726561746572207468616e207a65726f60448201526064016108c3565b60c8811115610c5b5760405162461bcd60e51b815260206004820152602260248201527f416d6f756e742065786365656473206d6178206261746368206d696e742073696044820152617a6560f01b60648201526084016108c3565b6115b381600754610c6c9190611de5565b1115610cc45760405162461bcd60e51b815260206004820152602160248201527f4e6f7420656e6f756768204e4654732072656d61696e696e6720746f206d696e6044820152601d60fa1b60648201526084016108c3565b5f5b81811015610ba35760078054905f610cdd83611cbb565b9091555050600754610cef84826112c4565b50600101610cc6565b600d5460609060ff16610d2657506040805180820190915260068152657075626c696360d01b602082015290565b506040805180820190915260098152681dda1a5d195b1a5cdd60ba1b602082015290565b610d52611325565b4780610da05760405162461bcd60e51b815260206004820152601c60248201527f4e6f206e617469766520746f6b656e7320746f2077697468647261770000000060448201526064016108c3565b6006546040516001600160a01b039091169082156108fc029083905f818181858888f1935050505015801561087b573d5f5f3e3d5ffd5b610ddf611325565b5f5b81811015610ba3575f600c5f858585818110610dff57610dff611df8565b9050602002016020810190610e1491906119fa565b6001600160a01b0316815260208101919091526040015f20805460ff1916911515919091179055600101610de1565b610e4b611325565b600861087b8282611d2a565b5f6107b48261127f565b5f6001600160a01b038216610e8b576040516322718ad960e21b81525f60048201526024016108c3565b506001600160a01b03165f9081526003602052604090205490565b610eae611325565b610eb75f611444565b565b610ec1611325565b600e55565b610ece611325565b5f5b81811015610ba3576001600c5f858585818110610eef57610eef611df8565b9050602002016020810190610f0491906119fa565b6001600160a01b0316815260208101919091526040015f20805460ff1916911515919091179055600101610ed0565b610f3b611325565b600d805460ff19166001179055565b6060600180546107c890611c6f565b61087b338383611495565b610f6c611325565b600a805460ff19166001179055565b610f83611325565b600a805460ff19169055565b610f9a848484610ad8565b610b5b3385858585611533565b600d545f9060ff16610fbb57506001919050565b6001600160a01b0382165f908152600c602052604090205460ff1680156107b45750506001600160a01b03165f90815260106020526040902054600a1190565b611003611325565b600f55565b5f818152600260205260409020546060906001600160a01b03168061107f5760405162461bcd60e51b815260206004820152602760248201527f4552433732313a2055524920717565727920666f72206e6f6e6578697374656e6044820152663a103a37b5b2b760c91b60648201526084016108c3565b600a5460ff1661111a576009805461109690611c6f565b80601f01602080910402602001604051908101604052809291908181526020018280546110c290611c6f565b801561110d5780601f106110e45761010080835404028352916020019161110d565b820191905f5260205f20905b8154815290600101906020018083116110f057829003601f168201915b5050505050915050919050565b5f6008805461112890611c6f565b80601f016020809104026020016040519081016040528092919081815260200182805461115490611c6f565b801561119f5780601f106111765761010080835404028352916020019161119f565b820191905f5260205f20905b81548152906001019060200180831161118257829003601f168201915b505050505090505f815111156111e257806111b98561165b565b6040516020016111ca929190611e23565b60405160208183030381529060405292505050919050565b6111eb8461165b565b6040516020016111ca9190611e4d565b6001600160a01b039182165f90815260056020908152604080832093909416825291909152205460ff1690565b600d545f9060ff1661123b5750600f5490565b50600e5490565b61124a611325565b6001600160a01b03811661127357604051631e4fbdf760e01b81525f60048201526024016108c3565b61127c81611444565b50565b5f818152600260205260408120546001600160a01b0316806107b457604051637e27328960e01b8152600481018490526024016108c3565b610ba38383836001611760565b6001600160a01b0382166112ed57604051633250574960e11b81525f60048201526024016108c3565b5f6112f983835f611352565b90506001600160a01b03811615610ba3576040516339e3563760e11b81525f60048201526024016108c3565b6006546001600160a01b03163314610eb75760405163118cdaa760e01b81523360048201526024016108c3565b5f828152600260205260408120546001600160a01b039081169083161561137e5761137e818486611864565b6001600160a01b038116156113b8576113995f855f5f611760565b6001600160a01b0381165f90815260036020526040902080545f190190555b6001600160a01b038516156113e6576001600160a01b0385165f908152600360205260409020805460010190555b5f8481526002602052604080822080546001600160a01b0319166001600160a01b0389811691821790925591518793918516917fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef91a4949350505050565b600680546001600160a01b038381166001600160a01b0319831681179093556040519116919082907f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e0905f90a35050565b6001600160a01b0382166114c757604051630b61174360e31b81526001600160a01b03831660048201526024016108c3565b6001600160a01b038381165f81815260056020908152604080832094871680845294825291829020805460ff191686151590811790915591519182527f17307eab39ab6107e8899845ad3d59bd9653f200f220920489ca2b5937696c31910160405180910390a3505050565b6001600160a01b0383163b1561165457604051630a85bd0160e11b81526001600160a01b0384169063150b7a0290611575908890889087908790600401611e6d565b6020604051808303815f875af19250505080156115af575060408051601f3d908101601f191682019092526115ac91810190611ea9565b60015b611616573d8080156115dc576040519150601f19603f3d011682016040523d82523d5f602084013e6115e1565b606091505b5080515f0361160e57604051633250574960e11b81526001600160a01b03851660048201526024016108c3565b805160208201fd5b6001600160e01b03198116630a85bd0160e11b1461165257604051633250574960e11b81526001600160a01b03851660048201526024016108c3565b505b5050505050565b6060815f036116815750506040805180820190915260018152600360fc1b602082015290565b815f5b81156116aa578061169481611cbb565b91506116a39050600a83611ed8565b9150611684565b5f8167ffffffffffffffff8111156116c4576116c4611a4d565b6040519080825280601f01601f1916602001820160405280156116ee576020820181803683370190505b5090505b841561175857611703600183611cd3565b9150611710600a86611eeb565b61171b906030611de5565b60f81b81838151811061173057611730611df8565b60200101906001600160f81b03191690815f1a905350611751600a86611ed8565b94506116f2565b949350505050565b808061177457506001600160a01b03821615155b15611835575f6117838461127f565b90506001600160a01b038316158015906117af5750826001600160a01b0316816001600160a01b031614155b80156117c257506117c081846111fb565b155b156117eb5760405163a9fbf51f60e01b81526001600160a01b03841660048201526024016108c3565b81156118335783856001600160a01b0316826001600160a01b03167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b92560405160405180910390a45b505b50505f90815260046020526040902080546001600160a01b0319166001600160a01b0392909216919091179055565b61186f8383836118c8565b610ba3576001600160a01b03831661189d57604051637e27328960e01b8152600481018290526024016108c3565b60405163177e802f60e01b81526001600160a01b0383166004820152602481018290526044016108c3565b5f6001600160a01b038316158015906117585750826001600160a01b0316846001600160a01b03161480611901575061190184846111fb565b806117585750505f908152600460205260409020546001600160a01b03908116911614919050565b6001600160e01b03198116811461127c575f5ffd5b5f6020828403121561194e575f5ffd5b813561195981611929565b9392505050565b5f81518084528060208401602086015e5f602082860101526020601f19601f83011685010191505092915050565b602081525f6119596020830184611960565b5f602082840312156119b0575f5ffd5b5035919050565b80356001600160a01b03811681146119cd575f5ffd5b919050565b5f5f604083850312156119e3575f5ffd5b6119ec836119b7565b946020939093013593505050565b5f60208284031215611a0a575f5ffd5b611959826119b7565b5f5f5f60608486031215611a25575f5ffd5b611a2e846119b7565b9250611a3c602085016119b7565b929592945050506040919091013590565b634e487b7160e01b5f52604160045260245ffd5b5f5f67ffffffffffffffff841115611a7b57611a7b611a4d565b50604051601f19601f85018116603f0116810181811067ffffffffffffffff82111715611aaa57611aaa611a4d565b604052838152905080828401851015611ac1575f5ffd5b838360208301375f60208583010152509392505050565b5f60208284031215611ae8575f5ffd5b813567ffffffffffffffff811115611afe575f5ffd5b8201601f81018413611b0e575f5ffd5b61175884823560208401611a61565b5f5f60208385031215611b2e575f5ffd5b823567ffffffffffffffff811115611b44575f5ffd5b8301601f81018513611b54575f5ffd5b803567ffffffffffffffff811115611b6a575f5ffd5b8560208260051b8401011115611b7e575f5ffd5b6020919091019590945092505050565b5f5f60408385031215611b9f575f5ffd5b611ba8836119b7565b915060208301358015158114611bbc575f5ffd5b809150509250929050565b5f5f5f5f60808587031215611bda575f5ffd5b611be3856119b7565b9350611bf1602086016119b7565b925060408501359150606085013567ffffffffffffffff811115611c13575f5ffd5b8501601f81018713611c23575f5ffd5b611c3287823560208401611a61565b91505092959194509250565b5f5f60408385031215611c4f575f5ffd5b611c58836119b7565b9150611c66602084016119b7565b90509250929050565b600181811c90821680611c8357607f821691505b602082108103611ca157634e487b7160e01b5f52602260045260245ffd5b50919050565b634e487b7160e01b5f52601160045260245ffd5b5f60018201611ccc57611ccc611ca7565b5060010190565b818103818111156107b4576107b4611ca7565b601f821115610ba357805f5260205f20601f840160051c81016020851015611d0b5750805b601f840160051c820191505b81811015611654575f8155600101611d17565b815167ffffffffffffffff811115611d4457611d44611a4d565b611d5881611d528454611c6f565b84611ce6565b6020601f821160018114611d8a575f8315611d735750848201515b5f19600385901b1c1916600184901b178455611654565b5f84815260208120601f198516915b82811015611db95787850151825560209485019460019092019101611d99565b5084821015611dd657868401515f19600387901b60f8161c191681555b50505050600190811b01905550565b808201808211156107b4576107b4611ca7565b634e487b7160e01b5f52603260045260245ffd5b5f81518060208401855e5f93019283525090919050565b5f611e37611e318386611e0c565b84611e0c565b64173539b7b760d91b8152600501949350505050565b5f611e588284611e0c565b64173539b7b760d91b81526005019392505050565b6001600160a01b03858116825284166020820152604081018390526080606082018190525f90611e9f90830184611960565b9695505050505050565b5f60208284031215611eb9575f5ffd5b815161195981611929565b634e487b7160e01b5f52601260045260245ffd5b5f82611ee657611ee6611ec4565b500490565b5f82611ef957611ef9611ec4565b50069056fea264697066735822122012428bb29253c2f23741f61b70caf129cd5b8b79dc70187aa4bde37288ac40d664736f6c634300081c0033

00000000000000000000000000000000000000000000000000000000000000c00000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000000000000014000000000000000000000000000000000000000000000000000000000000001a00000000000000000000000000000000000000000000000063333dd0ab16d000000000000000000000000000000000000000000000000000793df33268c0a4000000000000000000000000000000000000000000000000000000000000000001b44756d707374657220417065204e465420436f6c6c656374696f6e00000000000000000000000000000000000000000000000000000000000000000000000006444d504150450000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004068747470733a2f2f617277656176652e6e65742f3964615f356770433261764a76635f3353304d64444e5f504431483244744a4c56703530564d623273494d2f000000000000000000000000000000000000000000000000000000000000003f68747470733a2f2f617277656176652e6e65742f686d473367464c386e36473379754d634974394c7261664d383931676c56677333776378415831386c765500

-----Decoded View---------------
Arg [0] : name (string): Dumpster Ape NFT Collection
Arg [1] : symbol (string): DMPAPE
Arg [2] : baseTokenURI (string): https://arweave.net/9da_5gpC2avJvc_3S0MdDN_PD1H2DtJLVp50VMb2sIM/
Arg [3] : placeholderURI (string): https://arweave.net/hmG3gFL8n6G3yuMcIt9LrafM891glVgs3wcxAX18lvU
Arg [4] : _whitelistPrice (uint256): 114370000000000000000
Arg [5] : _publicPrice (uint256): 139782500000000000000

-----Encoded View---------------
16 Constructor Arguments found :
Arg [0] : 00000000000000000000000000000000000000000000000000000000000000c0
Arg [1] : 0000000000000000000000000000000000000000000000000000000000000100
Arg [2] : 0000000000000000000000000000000000000000000000000000000000000140
Arg [3] : 00000000000000000000000000000000000000000000000000000000000001a0
Arg [4] : 0000000000000000000000000000000000000000000000063333dd0ab16d0000
Arg [5] : 00000000000000000000000000000000000000000000000793df33268c0a4000
Arg [6] : 000000000000000000000000000000000000000000000000000000000000001b
Arg [7] : 44756d707374657220417065204e465420436f6c6c656374696f6e0000000000
Arg [8] : 0000000000000000000000000000000000000000000000000000000000000006
Arg [9] : 444d504150450000000000000000000000000000000000000000000000000000
Arg [10] : 0000000000000000000000000000000000000000000000000000000000000040
Arg [11] : 68747470733a2f2f617277656176652e6e65742f3964615f356770433261764a
Arg [12] : 76635f3353304d64444e5f504431483244744a4c56703530564d623273494d2f
Arg [13] : 000000000000000000000000000000000000000000000000000000000000003f
Arg [14] : 68747470733a2f2f617277656176652e6e65742f686d473367464c386e364733
Arg [15] : 79754d634974394c7261664d383931676c56677333776378415831386c765500

128493:10474:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;110506:305;;;;;;;;;;-1:-1:-1;110506:305:0;;;;;:::i;:::-;;:::i;:::-;;;565:14:1;;558:22;540:41;;528:2;513:18;110506:305:0;;;;;;;;129052:27;;;;;;;;;;-1:-1:-1;129052:27:0;;;;;;;;111263:91;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;112331:158::-;;;;;;;;;;-1:-1:-1;112331:158:0;;;;;:::i;:::-;;:::i;:::-;;;-1:-1:-1;;;;;1528:32:1;;;1510:51;;1498:2;1483:18;112331:158:0;1364:203:1;112179:115:0;;;;;;;;;;-1:-1:-1;112179:115:0;;;;;:::i;:::-;;:::i;:::-;;130777:1130;;;:::i;135019:88::-;;;;;;;;;;-1:-1:-1;135090:9:0;;135019:88;;;2201:25:1;;;2189:2;2174:18;135019:88:0;2055:177:1;130257:299:0;;;;;;;;;;-1:-1:-1;130257:299:0;;;;;:::i;:::-;;:::i;112901:588::-;;;;;;;;;;-1:-1:-1;112901:588:0;;;;;:::i;:::-;;:::i;128825:41::-;;;;;;;;;;;;128862:4;128825:41;;134176:125;;;;;;;;;;-1:-1:-1;134176:125:0;;;;;:::i;:::-;;:::i;136097:90::-;;;;;;;;;;;;;:::i;137072:113::-;;;;;;;;;;-1:-1:-1;137072:113:0;;;;;:::i;:::-;-1:-1:-1;;;;;137158:19:0;137134:4;137158:19;;;:9;:19;;;;;;;;;137072:113;113526:134;;;;;;;;;;-1:-1:-1;113526:134:0;;;;;:::i;:::-;;:::i;132120:600::-;;;;;;;;;;-1:-1:-1;132120:600:0;;;;;:::i;:::-;;:::i;137320:126::-;;;;;;;;;;;;;:::i;136711:209::-;;;;;;;;;;;;;:::i;128763:22::-;;;;;;;;;;-1:-1:-1;128763:22:0;;;;;;;;135637:215;;;;;;;;;;-1:-1:-1;135637:215:0;;;;;:::i;:::-;;:::i;133936:102::-;;;;;;;;;;-1:-1:-1;133936:102:0;;;;;:::i;:::-;;:::i;111098:120::-;;;;;;;;;;-1:-1:-1;111098:120:0;;;;;:::i;:::-;;:::i;110848:213::-;;;;;;;;;;-1:-1:-1;110848:213:0;;;;;:::i;:::-;;:::i;127655:103::-;;;;;;;;;;;;;:::i;136310:102::-;;;;;;;;;;-1:-1:-1;136310:102:0;;;;;:::i;:::-;;:::i;135299:193::-;;;;;;;;;;-1:-1:-1;135299:193:0;;;;;:::i;:::-;;:::i;135920:87::-;;;;;;;;;;;;;:::i;126980:::-;;;;;;;;;;-1:-1:-1;127053:6:0;;-1:-1:-1;;;;;127053:6:0;126980:87;;111399:95;;;;;;;;;;;;;:::i;129257:50::-;;;;;;;;;;-1:-1:-1;129257:50:0;;;;;:::i;:::-;;;;;;;;;;;;;;129314:48;;;;;;;;;;;;129360:2;129314:48;;129004:41;;;;;;;;;;-1:-1:-1;129004:41:0;;;;;:::i;:::-;;;;;;;;;;;;;;;;112526:146;;;;;;;;;;-1:-1:-1;112526:146:0;;;;;:::i;:::-;;:::i;134422:71::-;;;;;;;;;;;;;:::i;129405:44::-;;;;;;;;;;;;129446:3;129405:44;;129148:26;;;;;;;;;;;;;;;;134628:70;;;;;;;;;;;;;:::i;113697:236::-;;;;;;;;;;-1:-1:-1;113697:236:0;;;;;:::i;:::-;;:::i;137890:354::-;;;;;;;;;;-1:-1:-1;137890:354:0;;;;;:::i;:::-;;:::i;136534:96::-;;;;;;;;;;-1:-1:-1;136534:96:0;;;;;:::i;:::-;;:::i;132875:949::-;;;;;;;;;;-1:-1:-1;132875:949:0;;;;;:::i;:::-;;:::i;112709:155::-;;;;;;;;;;-1:-1:-1;112709:155:0;;;;;:::i;:::-;;:::i;137580:129::-;;;;;;;;;;;;;:::i;127913:220::-;;;;;;;;;;-1:-1:-1;127913:220:0;;;;;:::i;:::-;;:::i;129086:29::-;;;;;;;;;;;;;;;;110506:305;110608:4;-1:-1:-1;;;;;;110645:40:0;;-1:-1:-1;;;110645:40:0;;:105;;-1:-1:-1;;;;;;;110702:48:0;;-1:-1:-1;;;110702:48:0;110645:105;:158;;;-1:-1:-1;;;;;;;;;;16952:40:0;;;110767:36;110625:178;110506:305;-1:-1:-1;;110506:305:0:o;111263:91::-;111308:13;111341:5;111334:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;111263:91;:::o;112331:158::-;112398:7;112418:22;112432:7;112418:13;:22::i;:::-;-1:-1:-1;114766:7:0;114793:24;;;:15;:24;;;;;;-1:-1:-1;;;;;114793:24:0;112460:21;114696:129;112179:115;112251:35;112260:2;112264:7;16047:10;112251:8;:35::i;:::-;112179:115;;:::o;130777:1130::-;128862:4;130827:9;;:22;130819:53;;;;-1:-1:-1;;;130819:53:0;;6653:2:1;130819:53:0;;;6635:21:1;6692:2;6672:18;;;6665:30;-1:-1:-1;;;6711:18:1;;;6704:48;6769:18;;130819:53:0;;;;;;;;;130920:15;;130885:18;;130920:15;;130916:516;;;131038:10;131028:21;;;;:9;:21;;;;;;;;131020:57;;;;-1:-1:-1;;;131020:57:0;;7000:2:1;131020:57:0;;;6982:21:1;7039:2;7019:18;;;7012:30;7078:25;7058:18;;;7051:53;7121:18;;131020:57:0;6798:347:1;131020:57:0;131134:10;131118:27;;;;:15;:27;;;;;;129360:2;-1:-1:-1;131092:138:0;;;;-1:-1:-1;;;131092:138:0;;7352:2:1;131092:138:0;;;7334:21:1;7391:2;7371:18;;;7364:30;7430:29;7410:18;;;7403:57;7477:18;;131092:138:0;7150:351:1;131092:138:0;-1:-1:-1;131258:14:0;;131303:10;131287:27;;;;:15;:27;;;;;:29;;;;;;:::i;:::-;;;;;;130916:516;;;-1:-1:-1;131409:11:0;;130916:516;131517:10;131504:9;:23;;131496:56;;;;-1:-1:-1;;;131496:56:0;;7980:2:1;131496:56:0;;;7962:21:1;8019:2;7999:18;;;7992:30;-1:-1:-1;;;8038:18:1;;;8031:50;8098:18;;131496:56:0;7778:344:1;131496:56:0;131622:10;131610:9;:22;131606:107;;;131657:10;131649:52;131678:22;131690:10;131678:9;:22;:::i;:::-;131649:52;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;131606:107;131725:9;:11;;;:9;:11;;;:::i;:::-;;;;-1:-1:-1;;131768:9:0;;131790:29;131796:10;131768:9;131790:5;:29::i;130257:299::-;126866:13;:11;:13::i;:::-;128862:4:::1;130324:9;;:22;130316:53;;;::::0;-1:-1:-1;;;130316:53:0;;6653:2:1;130316:53:0::1;::::0;::::1;6635:21:1::0;6692:2;6672:18;;;6665:30;-1:-1:-1;;;6711:18:1;;;6704:48;6769:18;;130316:53:0::1;6451:342:1::0;130316:53:0::1;130382:9;:11:::0;;;:9:::1;:11;::::0;::::1;:::i;:::-;::::0;;;-1:-1:-1;;130425:9:0::1;::::0;130447:21:::1;130453:2:::0;130425:9;130447:5:::1;:21::i;112901:588::-:0;-1:-1:-1;;;;;112996:16:0;;112992:89;;113036:33;;-1:-1:-1;;;113036:33:0;;113066:1;113036:33;;;1510:51:1;1483:18;;113036:33:0;1364:203:1;112992:89:0;113302:21;113326:34;113334:2;113338:7;16047:10;113326:7;:34::i;:::-;113302:58;;113392:4;-1:-1:-1;;;;;113375:21:0;:13;-1:-1:-1;;;;;113375:21:0;;113371:111;;113420:50;;-1:-1:-1;;;113420:50:0;;-1:-1:-1;;;;;8480:32:1;;;113420:50:0;;;8462:51:1;8529:18;;;8522:34;;;8592:32;;8572:18;;;8565:60;8435:18;;113420:50:0;8260:371:1;113371:111:0;112981:508;112901:588;;;:::o;134176:125::-;126866:13;:11;:13::i;:::-;134261:15:::1;:32;134279:14:::0;134261:15;:32:::1;:::i;136097:90::-:0;126866:13;:11;:13::i;:::-;136156:15:::1;:23:::0;;-1:-1:-1;;136156:23:0::1;::::0;;136097:90::o;113526:134::-;113613:39;113630:4;113636:2;113640:7;113613:39;;;;;;;;;;;;:16;:39::i;:::-;113526:134;;;:::o;132120:600::-;126866:13;:11;:13::i;:::-;132212:1:::1;132203:6;:10;132195:55;;;::::0;-1:-1:-1;;;132195:55:0;;10962:2:1;132195:55:0::1;::::0;::::1;10944:21:1::0;;;10981:18;;;10974:30;11040:34;11020:18;;;11013:62;11092:18;;132195:55:0::1;10760:356:1::0;132195:55:0::1;129446:3;132269:6;:24;;132261:71;;;::::0;-1:-1:-1;;;132261:71:0;;11323:2:1;132261:71:0::1;::::0;::::1;11305:21:1::0;11362:2;11342:18;;;11335:30;11401:34;11381:18;;;11374:62;-1:-1:-1;;;11452:18:1;;;11445:32;11494:19;;132261:71:0::1;11121:398:1::0;132261:71:0::1;128862:4;132377:6;132365:9;;:18;;;;:::i;:::-;:32;;132343:115;;;::::0;-1:-1:-1;;;132343:115:0;;11856:2:1;132343:115:0::1;::::0;::::1;11838:21:1::0;11895:2;11875:18;;;11868:30;11934:34;11914:18;;;11907:62;-1:-1:-1;;;11985:18:1;;;11978:31;12026:19;;132343:115:0::1;11654:397:1::0;132343:115:0::1;132476:9;132471:242;132495:6;132491:1;:10;132471:242;;;132523:9;:11:::0;;;:9:::1;:11;::::0;::::1;:::i;:::-;::::0;;;-1:-1:-1;;132570:9:0::1;::::0;132596:21:::1;132602:2:::0;132570:9;132596:5:::1;:21::i;:::-;-1:-1:-1::0;132503:3:0::1;;132471:242;;137320:126:::0;137398:15;;137365:13;;137398:15;;:40;;-1:-1:-1;137398:40:0;;;;;;;;;;;;-1:-1:-1;;;137398:40:0;;;;;137320:126::o;137398:40::-;-1:-1:-1;137398:40:0;;;;;;;;;;;;-1:-1:-1;;;137398:40:0;;;;;137320:126::o;136711:209::-;126866:13;:11;:13::i;:::-;136783:21:::1;136823:11:::0;136815:52:::1;;;::::0;-1:-1:-1;;;136815:52:0;;12258:2:1;136815:52:0::1;::::0;::::1;12240:21:1::0;12297:2;12277:18;;;12270:30;12336;12316:18;;;12309:58;12384:18;;136815:52:0::1;12056:352:1::0;136815:52:0::1;127053:6:::0;;136878:34:::1;::::0;-1:-1:-1;;;;;127053:6:0;;;;136878:34;::::1;;;::::0;136904:7;;136878:34:::1;::::0;;;136904:7;127053:6;136878:34;::::1;;;;;;;;;;;;;;;;;;135637:215:::0;126866:13;:11;:13::i;:::-;135745:9:::1;135740:105;135760:20:::0;;::::1;135740:105;;;135828:5;135802:9;:23;135812:9;;135822:1;135812:12;;;;;;;:::i;:::-;;;;;;;;;;;;;;:::i;:::-;-1:-1:-1::0;;;;;135802:23:0::1;::::0;;::::1;::::0;::::1;::::0;;;;;;-1:-1:-1;135802:23:0;:31;;-1:-1:-1;;135802:31:0::1;::::0;::::1;;::::0;;;::::1;::::0;;-1:-1:-1;135782:3:0::1;135740:105;;133936:102:::0;126866:13;:11;:13::i;:::-;134007::::1;:23;134023:7:::0;134007:13;:23:::1;:::i;111098:120::-:0;111161:7;111188:22;111202:7;111188:13;:22::i;110848:213::-;110911:7;-1:-1:-1;;;;;110935:19:0;;110931:89;;110978:30;;-1:-1:-1;;;110978:30:0;;111005:1;110978:30;;;1510:51:1;1483:18;;110978:30:0;1364:203:1;110931:89:0;-1:-1:-1;;;;;;111037:16:0;;;;;:9;:16;;;;;;;110848:213::o;127655:103::-;126866:13;:11;:13::i;:::-;127720:30:::1;127747:1;127720:18;:30::i;:::-;127655:103::o:0;136310:102::-;126866:13;:11;:13::i;:::-;136381:14:::1;:23:::0;136310:102::o;135299:193::-;126866:13;:11;:13::i;:::-;135386:9:::1;135381:104;135401:20:::0;;::::1;135381:104;;;135469:4;135443:9;:23;135453:9;;135463:1;135453:12;;;;;;;:::i;:::-;;;;;;;;;;;;;;:::i;:::-;-1:-1:-1::0;;;;;135443:23:0::1;::::0;;::::1;::::0;::::1;::::0;;;;;;-1:-1:-1;135443:23:0;:30;;-1:-1:-1;;135443:30:0::1;::::0;::::1;;::::0;;;::::1;::::0;;-1:-1:-1;135423:3:0::1;135381:104;;135920:87:::0;126866:13;:11;:13::i;:::-;135977:15:::1;:22:::0;;-1:-1:-1;;135977:22:0::1;135995:4;135977:22;::::0;;135920:87::o;111399:95::-;111446:13;111479:7;111472:14;;;;;:::i;112526:146::-;112612:52;16047:10;112645:8;112655;112612:18;:52::i;134422:71::-;126866:13;:11;:13::i;:::-;134468:10:::1;:17:::0;;-1:-1:-1;;134468:17:0::1;134481:4;134468:17;::::0;;134422:71::o;134628:70::-;126866:13;:11;:13::i;:::-;134672:10:::1;:18:::0;;-1:-1:-1;;134672:18:0::1;::::0;;134628:70::o;113697:236::-;113811:31;113824:4;113830:2;113834:7;113811:12;:31::i;:::-;113853:72;16047:10;113901:4;113907:2;113911:7;113920:4;113853:33;:72::i;137890:354::-;137968:15;;137946:4;;137968:15;;137963:94;;-1:-1:-1;138007:4:0;;137890:354;-1:-1:-1;137890:354:0:o;137963:94::-;-1:-1:-1;;;;;138153:19:0;;;;;;:9;:19;;;;;;;;:83;;;;-1:-1:-1;;;;;;;138189:25:0;;;;;:15;:25;;;;;;129360:2;-1:-1:-1;;137890:354:0:o;136534:96::-;126866:13;:11;:13::i;:::-;136602:11:::1;:20:::0;136534:96::o;132875:949::-;133055:18;114551:16;;;:7;:16;;;;;;132964:13;;-1:-1:-1;;;;;114551:16:0;;133104:113;;;;-1:-1:-1;;;133104:113:0;;12747:2:1;133104:113:0;;;12729:21:1;12786:2;12766:18;;;12759:30;12825:34;12805:18;;;12798:62;-1:-1:-1;;;12876:18:1;;;12869:37;12923:19;;133104:113:0;12545:403:1;133104:113:0;133291:10;;;;133286:127;;133386:15;133379:22;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;132875:949;;;:::o;133286:127::-;133513:18;133534:13;133513:34;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;133585:1;133570:4;133564:18;:22;133560:121;;;133634:4;133640:18;133650:7;133640:9;:18::i;:::-;133617:51;;;;;;;;;:::i;:::-;;;;;;;;;;;;;133603:66;;;;132875:949;;;:::o;133560:121::-;133787:18;133797:7;133787:9;:18::i;:::-;133770:45;;;;;;;;:::i;112709:155::-;-1:-1:-1;;;;;112821:25:0;;;112797:4;112821:25;;;:18;:25;;;;;;;;:35;;;;;;;;;;;;;;;112709:155::o;137580:129::-;137655:15;;137628:7;;137655:15;;:46;;-1:-1:-1;137690:11:0;;;137320:126::o;137655:46::-;-1:-1:-1;137673:14:0;;;137580:129::o;127913:220::-;126866:13;:11;:13::i;:::-;-1:-1:-1;;;;;127998:22:0;::::1;127994:93;;128044:31;::::0;-1:-1:-1;;;128044:31:0;;128072:1:::1;128044:31;::::0;::::1;1510:51:1::0;1483:18;;128044:31:0::1;1364:203:1::0;127994:93:0::1;128097:28;128116:8;128097:18;:28::i;:::-;127913:220:::0;:::o;125215:247::-;125278:7;114551:16;;;:7;:16;;;;;;-1:-1:-1;;;;;114551:16:0;;125342:90;;125389:31;;-1:-1:-1;;;125389:31:0;;;;;2201:25:1;;;2174:18;;125389:31:0;2055:177:1;123447:122:0;123528:33;123537:2;123541:7;123550:4;123556;123528:8;:33::i;118817:335::-;-1:-1:-1;;;;;118885:16:0;;118881:89;;118925:33;;-1:-1:-1;;;118925:33:0;;118955:1;118925:33;;;1510:51:1;1483:18;;118925:33:0;1364:203:1;118881:89:0;118980:21;119004:32;119012:2;119016:7;119033:1;119004:7;:32::i;:::-;118980:56;-1:-1:-1;;;;;;119051:27:0;;;119047:98;;119102:31;;-1:-1:-1;;;119102:31:0;;119130:1;119102:31;;;1510:51:1;1483:18;;119102:31:0;1364:203:1;127145:166:0;127053:6;;-1:-1:-1;;;;;127053:6:0;16047:10;127205:23;127201:103;;127252:40;;-1:-1:-1;;;127252:40:0;;16047:10;127252:40;;;1510:51:1;1483:18;;127252:40:0;1364:203:1;117657:824:0;117743:7;114551:16;;;:7;:16;;;;;;-1:-1:-1;;;;;114551:16:0;;;;117858:18;;;117854:88;;117893:37;117910:4;117916;117922:7;117893:16;:37::i;:::-;-1:-1:-1;;;;;117989:18:0;;;117985:263;;118107:48;118124:1;118128:7;118145:1;118149:5;118107:8;:48::i;:::-;-1:-1:-1;;;;;118201:15:0;;;;;;:9;:15;;;;;:20;;-1:-1:-1;;118201:20:0;;;117985:263;-1:-1:-1;;;;;118264:16:0;;;118260:111;;-1:-1:-1;;;;;118326:13:0;;;;;;:9;:13;;;;;:18;;118343:1;118326:18;;;118260:111;118383:16;;;;:7;:16;;;;;;:21;;-1:-1:-1;;;;;;118383:21:0;-1:-1:-1;;;;;118383:21:0;;;;;;;;;118422:27;;118383:16;;118422:27;;;;;;;118469:4;117657:824;-1:-1:-1;;;;117657:824:0:o;128293:191::-;128386:6;;;-1:-1:-1;;;;;128403:17:0;;;-1:-1:-1;;;;;;128403:17:0;;;;;;;128436:40;;128386:6;;;128403:17;128386:6;;128436:40;;128367:16;;128436:40;128356:128;128293:191;:::o;124654:318::-;-1:-1:-1;;;;;124762:22:0;;124758:93;;124808:31;;-1:-1:-1;;;124808:31:0;;-1:-1:-1;;;;;1528:32:1;;124808:31:0;;;1510:51:1;1483:18;;124808:31:0;1364:203:1;124758:93:0;-1:-1:-1;;;;;124861:25:0;;;;;;;:18;:25;;;;;;;;:35;;;;;;;;;;;;;:46;;-1:-1:-1;;124861:46:0;;;;;;;;;;124923:41;;540::1;;;124923::0;;513:18:1;124923:41:0;;;;;;;124654:318;;;:::o;14470:950::-;-1:-1:-1;;;;;14657:14:0;;;:18;14653:760;;14696:67;;-1:-1:-1;;;14696:67:0;;-1:-1:-1;;;;;14696:36:0;;;;;:67;;14733:8;;14743:4;;14749:7;;14758:4;;14696:67;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;-1:-1:-1;14696:67:0;;;;;;;;-1:-1:-1;;14696:67:0;;;;;;;;;;;;:::i;:::-;;;14692:710;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;15059:6;:13;15076:1;15059:18;15055:332;;15165:39;;-1:-1:-1;;;15165:39:0;;-1:-1:-1;;;;;1528:32:1;;15165:39:0;;;1510:51:1;1483:18;;15165:39:0;1364:203:1;15055:332:0;15337:6;15331:13;15324:4;15316:6;15312:17;15305:40;14692:710;-1:-1:-1;;;;;;14811:51:0;;-1:-1:-1;;;14811:51:0;14807:185;;14933:39;;-1:-1:-1;;;14933:39:0;;-1:-1:-1;;;;;1528:32:1;;14933:39:0;;;1510:51:1;1483:18;;14933:39:0;1364:203:1;14807:185:0;14764:243;14692:710;14470:950;;;;;:::o;138431:533::-;138488:13;138518:5;138527:1;138518:10;138514:53;;-1:-1:-1;;138545:10:0;;;;;;;;;;;;-1:-1:-1;;;138545:10:0;;;;;138431:533::o;138514:53::-;138592:5;138577:12;138633:78;138640:9;;138633:78;;138666:8;;;;:::i;:::-;;-1:-1:-1;138689:10:0;;-1:-1:-1;138697:2:0;138689:10;;:::i;:::-;;;138633:78;;;138721:19;138753:6;138743:17;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;-1:-1:-1;138743:17:0;;138721:39;;138771:154;138778:10;;138771:154;;138805:11;138815:1;138805:11;;:::i;:::-;;-1:-1:-1;138874:10:0;138882:2;138874:5;:10;:::i;:::-;138861:24;;:2;:24;:::i;:::-;138848:39;;138831:6;138838;138831:14;;;;;;;;:::i;:::-;;;;:56;-1:-1:-1;;;;;138831:56:0;;;;;;;;-1:-1:-1;138902:11:0;138911:2;138902:11;;:::i;:::-;;;138771:154;;;138949:6;138431:533;-1:-1:-1;;;;138431:533:0:o;123757:678::-;123919:9;:31;;;-1:-1:-1;;;;;;123932:18:0;;;;123919:31;123915:471;;;123967:13;123983:22;123997:7;123983:13;:22::i;:::-;123967:38;-1:-1:-1;;;;;;124136:18:0;;;;;;:35;;;124167:4;-1:-1:-1;;;;;124158:13:0;:5;-1:-1:-1;;;;;124158:13:0;;;124136:35;:69;;;;;124176:29;124193:5;124200:4;124176:16;:29::i;:::-;124175:30;124136:69;124132:144;;;124233:27;;-1:-1:-1;;;124233:27:0;;-1:-1:-1;;;;;1528:32:1;;124233:27:0;;;1510:51:1;1483:18;;124233:27:0;1364:203:1;124132:144:0;124296:9;124292:83;;;124351:7;124347:2;-1:-1:-1;;;;;124331:28:0;124340:5;-1:-1:-1;;;;;124331:28:0;;;;;;;;;;;124292:83;123952:434;123915:471;-1:-1:-1;;124398:24:0;;;;:15;:24;;;;;:29;;-1:-1:-1;;;;;;124398:29:0;-1:-1:-1;;;;;124398:29:0;;;;;;;;;;123757:678::o;115864:376::-;115977:38;115991:5;115998:7;116007;115977:13;:38::i;:::-;115972:261;;-1:-1:-1;;;;;116036:19:0;;116032:190;;116083:31;;-1:-1:-1;;;116083:31:0;;;;;2201:25:1;;;2174:18;;116083:31:0;2055:177:1;116032:190:0;116162:44;;-1:-1:-1;;;116162:44:0;;-1:-1:-1;;;;;15276:32:1;;116162:44:0;;;15258:51:1;15325:18;;;15318:34;;;15231:18;;116162:44:0;15084:274:1;115145:276:0;115248:4;-1:-1:-1;;;;;115285:21:0;;;;;;:128;;;115333:7;-1:-1:-1;;;;;115324:16:0;:5;-1:-1:-1;;;;;115324:16:0;;:52;;;;115344:32;115361:5;115368:7;115344:16;:32::i;:::-;115324:88;;;-1:-1:-1;;114766:7:0;114793:24;;;:15;:24;;;;;;-1:-1:-1;;;;;114793:24:0;;;115380:32;;;;115265:148;-1:-1:-1;115145:276:0:o;14:131:1:-;-1:-1:-1;;;;;;88:32:1;;78:43;;68:71;;135:1;132;125:12;150:245;208:6;261:2;249:9;240:7;236:23;232:32;229:52;;;277:1;274;267:12;229:52;316:9;303:23;335:30;359:5;335:30;:::i;:::-;384:5;150:245;-1:-1:-1;;;150:245:1:o;592:300::-;645:3;683:5;677:12;710:6;705:3;698:19;766:6;759:4;752:5;748:16;741:4;736:3;732:14;726:47;818:1;811:4;802:6;797:3;793:16;789:27;782:38;881:4;874:2;870:7;865:2;857:6;853:15;849:29;844:3;840:39;836:50;829:57;;;592:300;;;;:::o;897:231::-;1046:2;1035:9;1028:21;1009:4;1066:56;1118:2;1107:9;1103:18;1095:6;1066:56;:::i;1133:226::-;1192:6;1245:2;1233:9;1224:7;1220:23;1216:32;1213:52;;;1261:1;1258;1251:12;1213:52;-1:-1:-1;1306:23:1;;1133:226;-1:-1:-1;1133:226:1:o;1572:173::-;1640:20;;-1:-1:-1;;;;;1689:31:1;;1679:42;;1669:70;;1735:1;1732;1725:12;1669:70;1572:173;;;:::o;1750:300::-;1818:6;1826;1879:2;1867:9;1858:7;1854:23;1850:32;1847:52;;;1895:1;1892;1885:12;1847:52;1918:29;1937:9;1918:29;:::i;:::-;1908:39;2016:2;2001:18;;;;1988:32;;-1:-1:-1;;;1750:300:1:o;2237:186::-;2296:6;2349:2;2337:9;2328:7;2324:23;2320:32;2317:52;;;2365:1;2362;2355:12;2317:52;2388:29;2407:9;2388:29;:::i;2428:374::-;2505:6;2513;2521;2574:2;2562:9;2553:7;2549:23;2545:32;2542:52;;;2590:1;2587;2580:12;2542:52;2613:29;2632:9;2613:29;:::i;:::-;2603:39;;2661:38;2695:2;2684:9;2680:18;2661:38;:::i;:::-;2428:374;;2651:48;;-1:-1:-1;;;2768:2:1;2753:18;;;;2740:32;;2428:374::o;2807:127::-;2868:10;2863:3;2859:20;2856:1;2849:31;2899:4;2896:1;2889:15;2923:4;2920:1;2913:15;2939:716;3004:5;3036:1;3060:18;3052:6;3049:30;3046:56;;;3082:18;;:::i;:::-;-1:-1:-1;3237:2:1;3231:9;-1:-1:-1;;3150:2:1;3129:15;;3125:29;;3295:2;3283:15;3279:29;3267:42;;3360:22;;;3339:18;3324:34;;3321:62;3318:88;;;3386:18;;:::i;:::-;3422:2;3415:22;3470;;;3455:6;-1:-1:-1;3455:6:1;3507:16;;;3504:25;-1:-1:-1;3501:45:1;;;3542:1;3539;3532:12;3501:45;3592:6;3587:3;3580:4;3572:6;3568:17;3555:44;3647:1;3640:4;3631:6;3623;3619:19;3615:30;3608:41;;2939:716;;;;;:::o;3660:451::-;3729:6;3782:2;3770:9;3761:7;3757:23;3753:32;3750:52;;;3798:1;3795;3788:12;3750:52;3838:9;3825:23;3871:18;3863:6;3860:30;3857:50;;;3903:1;3900;3893:12;3857:50;3926:22;;3979:4;3971:13;;3967:27;-1:-1:-1;3957:55:1;;4008:1;4005;3998:12;3957:55;4031:74;4097:7;4092:2;4079:16;4074:2;4070;4066:11;4031:74;:::i;4116:610::-;4202:6;4210;4263:2;4251:9;4242:7;4238:23;4234:32;4231:52;;;4279:1;4276;4269:12;4231:52;4319:9;4306:23;4352:18;4344:6;4341:30;4338:50;;;4384:1;4381;4374:12;4338:50;4407:22;;4460:4;4452:13;;4448:27;-1:-1:-1;4438:55:1;;4489:1;4486;4479:12;4438:55;4529:2;4516:16;4555:18;4547:6;4544:30;4541:50;;;4587:1;4584;4577:12;4541:50;4640:7;4635:2;4625:6;4622:1;4618:14;4614:2;4610:23;4606:32;4603:45;4600:65;;;4661:1;4658;4651:12;4600:65;4692:2;4684:11;;;;;4714:6;;-1:-1:-1;4116:610:1;-1:-1:-1;;;4116:610:1:o;4731:347::-;4796:6;4804;4857:2;4845:9;4836:7;4832:23;4828:32;4825:52;;;4873:1;4870;4863:12;4825:52;4896:29;4915:9;4896:29;:::i;:::-;4886:39;;4975:2;4964:9;4960:18;4947:32;5022:5;5015:13;5008:21;5001:5;4998:32;4988:60;;5044:1;5041;5034:12;4988:60;5067:5;5057:15;;;4731:347;;;;;:::o;5083:713::-;5178:6;5186;5194;5202;5255:3;5243:9;5234:7;5230:23;5226:33;5223:53;;;5272:1;5269;5262:12;5223:53;5295:29;5314:9;5295:29;:::i;:::-;5285:39;;5343:38;5377:2;5366:9;5362:18;5343:38;:::i;:::-;5333:48;-1:-1:-1;5450:2:1;5435:18;;5422:32;;-1:-1:-1;5529:2:1;5514:18;;5501:32;5556:18;5545:30;;5542:50;;;5588:1;5585;5578:12;5542:50;5611:22;;5664:4;5656:13;;5652:27;-1:-1:-1;5642:55:1;;5693:1;5690;5683:12;5642:55;5716:74;5782:7;5777:2;5764:16;5759:2;5755;5751:11;5716:74;:::i;:::-;5706:84;;;5083:713;;;;;;;:::o;5801:260::-;5869:6;5877;5930:2;5918:9;5909:7;5905:23;5901:32;5898:52;;;5946:1;5943;5936:12;5898:52;5969:29;5988:9;5969:29;:::i;:::-;5959:39;;6017:38;6051:2;6040:9;6036:18;6017:38;:::i;:::-;6007:48;;5801:260;;;;;:::o;6066:380::-;6145:1;6141:12;;;;6188;;;6209:61;;6263:4;6255:6;6251:17;6241:27;;6209:61;6316:2;6308:6;6305:14;6285:18;6282:38;6279:161;;6362:10;6357:3;6353:20;6350:1;6343:31;6397:4;6394:1;6387:15;6425:4;6422:1;6415:15;6279:161;;6066:380;;;:::o;7506:127::-;7567:10;7562:3;7558:20;7555:1;7548:31;7598:4;7595:1;7588:15;7622:4;7619:1;7612:15;7638:135;7677:3;7698:17;;;7695:43;;7718:18;;:::i;:::-;-1:-1:-1;7765:1:1;7754:13;;7638:135::o;8127:128::-;8194:9;;;8215:11;;;8212:37;;;8229:18;;:::i;8762:518::-;8864:2;8859:3;8856:11;8853:421;;;8900:5;8897:1;8890:16;8944:4;8941:1;8931:18;9014:2;9002:10;8998:19;8995:1;8991:27;8985:4;8981:38;9050:4;9038:10;9035:20;9032:47;;;-1:-1:-1;9073:4:1;9032:47;9128:2;9123:3;9119:12;9116:1;9112:20;9106:4;9102:31;9092:41;;9183:81;9201:2;9194:5;9191:13;9183:81;;;9260:1;9246:16;;9227:1;9216:13;9183:81;;9456:1299;9582:3;9576:10;9609:18;9601:6;9598:30;9595:56;;;9631:18;;:::i;:::-;9660:97;9750:6;9710:38;9742:4;9736:11;9710:38;:::i;:::-;9704:4;9660:97;:::i;:::-;9806:4;9837:2;9826:14;;9854:1;9849:649;;;;10542:1;10559:6;10556:89;;;-1:-1:-1;10611:19:1;;;10605:26;10556:89;-1:-1:-1;;9413:1:1;9409:11;;;9405:24;9401:29;9391:40;9437:1;9433:11;;;9388:57;10658:81;;9819:930;;9849:649;8709:1;8702:14;;;8746:4;8733:18;;-1:-1:-1;;9885:20:1;;;10003:222;10017:7;10014:1;10011:14;10003:222;;;10099:19;;;10093:26;10078:42;;10206:4;10191:20;;;;10159:1;10147:14;;;;10033:12;10003:222;;;10007:3;10253:6;10244:7;10241:19;10238:201;;;10314:19;;;10308:26;-1:-1:-1;;10397:1:1;10393:14;;;10409:3;10389:24;10385:37;10381:42;10366:58;10351:74;;10238:201;-1:-1:-1;;;;10485:1:1;10469:14;;;10465:22;10452:36;;-1:-1:-1;9456:1299:1:o;11524:125::-;11589:9;;;11610:10;;;11607:36;;;11623:18;;:::i;12413:127::-;12474:10;12469:3;12465:20;12462:1;12455:31;12505:4;12502:1;12495:15;12529:4;12526:1;12519:15;12953:212;12995:3;13033:5;13027:12;13077:6;13070:4;13063:5;13059:16;13054:3;13048:36;13139:1;13103:16;;13128:13;;;-1:-1:-1;13103:16:1;;12953:212;-1:-1:-1;12953:212:1:o;13170:425::-;13450:3;13478:57;13504:30;13530:3;13522:6;13504:30;:::i;:::-;13496:6;13478:57;:::i;:::-;-1:-1:-1;;;13544:19:1;;13587:1;13579:10;;13170:425;-1:-1:-1;;;;13170:425:1:o;13600:350::-;13832:3;13860:30;13886:3;13878:6;13860:30;:::i;:::-;-1:-1:-1;;;13899:19:1;;13942:1;13934:10;;13600:350;-1:-1:-1;;;13600:350:1:o;13955:496::-;-1:-1:-1;;;;;14186:32:1;;;14168:51;;14255:32;;14250:2;14235:18;;14228:60;14319:2;14304:18;;14297:34;;;14367:3;14362:2;14347:18;;14340:31;;;-1:-1:-1;;14388:57:1;;14425:19;;14417:6;14388:57;:::i;:::-;14380:65;13955:496;-1:-1:-1;;;;;;13955:496:1:o;14456:249::-;14525:6;14578:2;14566:9;14557:7;14553:23;14549:32;14546:52;;;14594:1;14591;14584:12;14546:52;14626:9;14620:16;14645:30;14669:5;14645:30;:::i;14710:127::-;14771:10;14766:3;14762:20;14759:1;14752:31;14802:4;14799:1;14792:15;14826:4;14823:1;14816:15;14842:120;14882:1;14908;14898:35;;14913:18;;:::i;:::-;-1:-1:-1;14947:9:1;;14842:120::o;14967:112::-;14999:1;15025;15015:35;;15030:18;;:::i;:::-;-1:-1:-1;15064:9:1;;14967:112::o

ipfs://12428bb29253c2f23741f61b70caf129cd5b8b79dc70187aa4bde37288ac40d6