creation_sourcecode: // File: @openzeppelin/contracts/utils/introspection/IERC165.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (utils/introspection/IERC165.sol)
  
  pragma solidity ^0.8.20;
  
  /**
   * @dev Interface of the ERC165 standard, as defined in the
   * https://eips.ethereum.org/EIPS/eip-165[EIP].
   *
   * 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[EIP 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);
  }
  
  // File: @openzeppelin/contracts/token/ERC721/IERC721.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (token/ERC721/IERC721.sol)
  
  pragma solidity ^0.8.20;
  
  
  /**
   * @dev Required interface of an ERC721 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 ERC721 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 ERC721
       * 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);
  }
  
  // File: @openzeppelin/contracts/token/ERC721/IERC721Receiver.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (token/ERC721/IERC721Receiver.sol)
  
  pragma solidity ^0.8.20;
  
  /**
   * @title ERC721 token receiver interface
   * @dev Interface for any contract that wants to support safeTransfers
   * from ERC721 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);
  }
  
  // File: @openzeppelin/contracts/token/ERC721/extensions/IERC721Metadata.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (token/ERC721/extensions/IERC721Metadata.sol)
  
  pragma solidity ^0.8.20;
  
  
  /**
   * @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);
  }
  
  // File: @openzeppelin/contracts/token/ERC721/extensions/IERC721Enumerable.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (token/ERC721/extensions/IERC721Enumerable.sol)
  
  pragma solidity ^0.8.20;
  
  
  /**
   * @title ERC-721 Non-Fungible Token Standard, optional enumeration extension
   * @dev See https://eips.ethereum.org/EIPS/eip-721
   */
  interface IERC721Enumerable is IERC721 {
      /**
       * @dev Returns the total amount of tokens stored by the contract.
       */
      function totalSupply() external view returns (uint256);
  
      /**
       * @dev Returns a token ID owned by `owner` at a given `index` of its token list.
       * Use along with {balanceOf} to enumerate all of ``owner``'s tokens.
       */
      function tokenOfOwnerByIndex(address owner, uint256 index) external view returns (uint256);
  
      /**
       * @dev Returns a token ID at a given `index` of all the tokens stored by the contract.
       * Use along with {totalSupply} to enumerate all tokens.
       */
      function tokenByIndex(uint256 index) external view returns (uint256);
  }
  
  // File: @openzeppelin/contracts/utils/Address.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (utils/Address.sol)
  
  pragma solidity ^0.8.20;
  
  /**
   * @dev Collection of functions related to the address type
   */
  library Address {
      /**
       * @dev The ETH balance of the account is not enough to perform the operation.
       */
      error AddressInsufficientBalance(address account);
  
      /**
       * @dev There's no code at `target` (it is not a contract).
       */
      error AddressEmptyCode(address target);
  
      /**
       * @dev A call to an address target failed. The target may have reverted.
       */
      error FailedInnerCall();
  
      /**
       * @dev Replacement for Solidity's `transfer`: sends `amount` wei to
       * `recipient`, forwarding all available gas and reverting on errors.
       *
       * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost
       * of certain opcodes, possibly making contracts go over the 2300 gas limit
       * imposed by `transfer`, making them unable to receive funds via
       * `transfer`. {sendValue} removes this limitation.
       *
       * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].
       *
       * IMPORTANT: because control is transferred to `recipient`, care must be
       * taken to not create reentrancy vulnerabilities. Consider using
       * {ReentrancyGuard} or the
       * https://solidity.readthedocs.io/en/v0.8.20/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].
       */
      function sendValue(address payable recipient, uint256 amount) internal {
          if (address(this).balance < amount) {
              revert AddressInsufficientBalance(address(this));
          }
  
          (bool success, ) = recipient.call{value: amount}("");
          if (!success) {
              revert FailedInnerCall();
          }
      }
  
      /**
       * @dev Performs a Solidity function call using a low level `call`. A
       * plain `call` is an unsafe replacement for a function call: use this
       * function instead.
       *
       * If `target` reverts with a revert reason or custom error, it is bubbled
       * up by this function (like regular Solidity function calls). However, if
       * the call reverted with no returned reason, this function reverts with a
       * {FailedInnerCall} error.
       *
       * Returns the raw returned data. To convert to the expected return value,
       * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].
       *
       * Requirements:
       *
       * - `target` must be a contract.
       * - calling `target` with `data` must not revert.
       */
      function functionCall(address target, bytes memory data) internal returns (bytes memory) {
          return functionCallWithValue(target, data, 0);
      }
  
      /**
       * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
       * but also transferring `value` wei to `target`.
       *
       * Requirements:
       *
       * - the calling contract must have an ETH balance of at least `value`.
       * - the called Solidity function must be `payable`.
       */
      function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {
          if (address(this).balance < value) {
              revert AddressInsufficientBalance(address(this));
          }
          (bool success, bytes memory returndata) = target.call{value: value}(data);
          return verifyCallResultFromTarget(target, success, returndata);
      }
  
      /**
       * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
       * but performing a static call.
       */
      function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {
          (bool success, bytes memory returndata) = target.staticcall(data);
          return verifyCallResultFromTarget(target, success, returndata);
      }
  
      /**
       * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],
       * but performing a delegate call.
       */
      function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {
          (bool success, bytes memory returndata) = target.delegatecall(data);
          return verifyCallResultFromTarget(target, success, returndata);
      }
  
      /**
       * @dev Tool to verify that a low level call to smart-contract was successful, and reverts if the target
       * was not a contract or bubbling up the revert reason (falling back to {FailedInnerCall}) in case of an
       * unsuccessful call.
       */
      function verifyCallResultFromTarget(
          address target,
          bool success,
          bytes memory returndata
      ) internal view returns (bytes memory) {
          if (!success) {
              _revert(returndata);
          } else {
              // only check if target is a contract if the call was successful and the return data is empty
              // otherwise we already know that it was a contract
              if (returndata.length == 0 && target.code.length == 0) {
                  revert AddressEmptyCode(target);
              }
              return returndata;
          }
      }
  
      /**
       * @dev Tool to verify that a low level call was successful, and reverts if it wasn't, either by bubbling the
       * revert reason or with a default {FailedInnerCall} error.
       */
      function verifyCallResult(bool success, bytes memory returndata) internal pure returns (bytes memory) {
          if (!success) {
              _revert(returndata);
          } else {
              return returndata;
          }
      }
  
      /**
       * @dev Reverts with returndata if present. Otherwise reverts with {FailedInnerCall}.
       */
      function _revert(bytes memory returndata) private pure {
          // Look for revert reason and bubble it up if present
          if (returndata.length > 0) {
              // The easiest way to bubble the revert reason is using memory via assembly
              /// @solidity memory-safe-assembly
              assembly {
                  let returndata_size := mload(returndata)
                  revert(add(32, returndata), returndata_size)
              }
          } else {
              revert FailedInnerCall();
          }
      }
  }
  
  // File: @openzeppelin/contracts/utils/Context.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.1) (utils/Context.sol)
  
  pragma solidity ^0.8.20;
  
  /**
   * @dev Provides information about the current execution context, including the
   * sender of the transaction and its data. While these are generally available
   * via msg.sender and msg.data, they should not be accessed in such a direct
   * manner, since when dealing with meta-transactions the account sending and
   * paying for execution may not be the actual sender (as far as an application
   * is concerned).
   *
   * This contract is only required for intermediate, library-like contracts.
   */
  abstract contract Context {
      function _msgSender() internal view virtual returns (address) {
          return msg.sender;
      }
  
      function _msgData() internal view virtual returns (bytes calldata) {
          return msg.data;
      }
  
      function _contextSuffixLength() internal view virtual returns (uint256) {
          return 0;
      }
  }
  
  // File: @openzeppelin/contracts/utils/math/Math.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (utils/math/Math.sol)
  
  pragma solidity ^0.8.20;
  
  /**
   * @dev Standard math utilities missing in the Solidity language.
   */
  library Math {
      /**
       * @dev Muldiv operation overflow.
       */
      error MathOverflowedMulDiv();
  
      enum Rounding {
          Floor, // Toward negative infinity
          Ceil, // Toward positive infinity
          Trunc, // Toward zero
          Expand // Away from zero
      }
  
      /**
       * @dev Returns the addition of two unsigned integers, with an overflow flag.
       */
      function tryAdd(uint256 a, uint256 b) internal pure returns (bool, uint256) {
          unchecked {
              uint256 c = a + b;
              if (c < a) return (false, 0);
              return (true, c);
          }
      }
  
      /**
       * @dev Returns the subtraction of two unsigned integers, with an overflow flag.
       */
      function trySub(uint256 a, uint256 b) internal pure returns (bool, uint256) {
          unchecked {
              if (b > a) return (false, 0);
              return (true, a - b);
          }
      }
  
      /**
       * @dev Returns the multiplication of two unsigned integers, with an overflow flag.
       */
      function tryMul(uint256 a, uint256 b) internal pure returns (bool, uint256) {
          unchecked {
              // Gas optimization: this is cheaper than requiring 'a' not being zero, but the
              // benefit is lost if 'b' is also tested.
              // See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
              if (a == 0) return (true, 0);
              uint256 c = a * b;
              if (c / a != b) return (false, 0);
              return (true, c);
          }
      }
  
      /**
       * @dev Returns the division of two unsigned integers, with a division by zero flag.
       */
      function tryDiv(uint256 a, uint256 b) internal pure returns (bool, uint256) {
          unchecked {
              if (b == 0) return (false, 0);
              return (true, a / b);
          }
      }
  
      /**
       * @dev Returns the remainder of dividing two unsigned integers, with a division by zero flag.
       */
      function tryMod(uint256 a, uint256 b) internal pure returns (bool, uint256) {
          unchecked {
              if (b == 0) return (false, 0);
              return (true, a % b);
          }
      }
  
      /**
       * @dev Returns the largest of two numbers.
       */
      function max(uint256 a, uint256 b) internal pure returns (uint256) {
          return a > b ? a : b;
      }
  
      /**
       * @dev Returns the smallest of two numbers.
       */
      function min(uint256 a, uint256 b) internal pure returns (uint256) {
          return 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.
              return a / b;
          }
  
          // (a + b - 1) / b can overflow on addition, so we distribute.
          return a == 0 ? 0 : (a - 1) / b + 1;
      }
  
      /**
       * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
       * denominator == 0.
       * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
       * Uniswap Labs also under MIT license.
       */
      function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
          unchecked {
              // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use
              // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
              // variables such that product = prod1 * 2^256 + prod0.
              uint256 prod0 = x * y; // Least significant 256 bits of the product
              uint256 prod1; // Most significant 256 bits of the product
              assembly {
                  let mm := mulmod(x, y, not(0))
                  prod1 := sub(sub(mm, prod0), lt(mm, prod0))
              }
  
              // Handle non-overflow cases, 256 by 256 division.
              if (prod1 == 0) {
                  // Solidity will revert if denominator == 0, unlike the div opcode on its own.
                  // The surrounding unchecked block does not change this fact.
                  // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
                  return prod0 / denominator;
              }
  
              // Make sure the result is less than 2^256. Also prevents denominator == 0.
              if (denominator <= prod1) {
                  revert MathOverflowedMulDiv();
              }
  
              ///////////////////////////////////////////////
              // 512 by 256 division.
              ///////////////////////////////////////////////
  
              // Make division exact by subtracting the remainder from [prod1 prod0].
              uint256 remainder;
              assembly {
                  // Compute remainder using mulmod.
                  remainder := mulmod(x, y, denominator)
  
                  // Subtract 256 bit number from 512 bit number.
                  prod1 := sub(prod1, gt(remainder, prod0))
                  prod0 := sub(prod0, remainder)
              }
  
              // Factor powers of two out of denominator and compute largest power of two divisor of denominator.
              // Always >= 1. See https://cs.stackexchange.com/q/138556/92363.
  
              uint256 twos = denominator & (0 - denominator);
              assembly {
                  // Divide denominator by twos.
                  denominator := div(denominator, twos)
  
                  // Divide [prod1 prod0] by twos.
                  prod0 := div(prod0, twos)
  
                  // Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one.
                  twos := add(div(sub(0, twos), twos), 1)
              }
  
              // Shift in bits from prod1 into prod0.
              prod0 |= prod1 * twos;
  
              // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such
              // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for
              // four bits. That is, denominator * inv = 1 mod 2^4.
              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^8
              inverse *= 2 - denominator * inverse; // inverse mod 2^16
              inverse *= 2 - denominator * inverse; // inverse mod 2^32
              inverse *= 2 - denominator * inverse; // inverse mod 2^64
              inverse *= 2 - denominator * inverse; // inverse mod 2^128
              inverse *= 2 - denominator * inverse; // inverse mod 2^256
  
              // 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^256. Since the preconditions guarantee that the outcome is
              // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1
              // is no longer required.
              result = prod0 * inverse;
              return result;
          }
      }
  
      /**
       * @notice 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) {
          uint256 result = mulDiv(x, y, denominator);
          if (unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0) {
              result += 1;
          }
          return result;
      }
  
      /**
       * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
       * towards zero.
       *
       * Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11).
       */
      function sqrt(uint256 a) internal pure returns (uint256) {
          if (a == 0) {
              return 0;
          }
  
          // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.
          //
          // We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have
          // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.
          //
          // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`
          // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`
          // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`
          //
          // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.
          uint256 result = 1 << (log2(a) >> 1);
  
          // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,
          // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at
          // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision
          // into the expected uint128 result.
          unchecked {
              result = (result + a / result) >> 1;
              result = (result + a / result) >> 1;
              result = (result + a / result) >> 1;
              result = (result + a / result) >> 1;
              result = (result + a / result) >> 1;
              result = (result + a / result) >> 1;
              result = (result + a / result) >> 1;
              return min(result, a / result);
          }
      }
  
      /**
       * @notice 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 + (unsignedRoundsUp(rounding) && result * result < a ? 1 : 0);
          }
      }
  
      /**
       * @dev Return the log in base 2 of a positive value rounded towards zero.
       * Returns 0 if given 0.
       */
      function log2(uint256 value) internal pure returns (uint256) {
          uint256 result = 0;
          unchecked {
              if (value >> 128 > 0) {
                  value >>= 128;
                  result += 128;
              }
              if (value >> 64 > 0) {
                  value >>= 64;
                  result += 64;
              }
              if (value >> 32 > 0) {
                  value >>= 32;
                  result += 32;
              }
              if (value >> 16 > 0) {
                  value >>= 16;
                  result += 16;
              }
              if (value >> 8 > 0) {
                  value >>= 8;
                  result += 8;
              }
              if (value >> 4 > 0) {
                  value >>= 4;
                  result += 4;
              }
              if (value >> 2 > 0) {
                  value >>= 2;
                  result += 2;
              }
              if (value >> 1 > 0) {
                  result += 1;
              }
          }
          return result;
      }
  
      /**
       * @dev Return the log in base 2, following the selected rounding direction, of a positive value.
       * Returns 0 if given 0.
       */
      function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
          unchecked {
              uint256 result = log2(value);
              return result + (unsignedRoundsUp(rounding) && 1 << result < value ? 1 : 0);
          }
      }
  
      /**
       * @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 + (unsignedRoundsUp(rounding) && 10 ** result < value ? 1 : 0);
          }
      }
  
      /**
       * @dev Return the log in base 256 of a positive value rounded towards zero.
       * Returns 0 if given 0.
       *
       * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
       */
      function log256(uint256 value) internal pure returns (uint256) {
          uint256 result = 0;
          unchecked {
              if (value >> 128 > 0) {
                  value >>= 128;
                  result += 16;
              }
              if (value >> 64 > 0) {
                  value >>= 64;
                  result += 8;
              }
              if (value >> 32 > 0) {
                  value >>= 32;
                  result += 4;
              }
              if (value >> 16 > 0) {
                  value >>= 16;
                  result += 2;
              }
              if (value >> 8 > 0) {
                  result += 1;
              }
          }
          return result;
      }
  
      /**
       * @dev Return the log in base 256, following the selected rounding direction, of a positive value.
       * Returns 0 if given 0.
       */
      function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
          unchecked {
              uint256 result = log256(value);
              return result + (unsignedRoundsUp(rounding) && 1 << (result << 3) < value ? 1 : 0);
          }
      }
  
      /**
       * @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;
      }
  }
  
  // File: @openzeppelin/contracts/utils/math/SignedMath.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (utils/math/SignedMath.sol)
  
  pragma solidity ^0.8.20;
  
  /**
   * @dev Standard signed math utilities missing in the Solidity language.
   */
  library SignedMath {
      /**
       * @dev Returns the largest of two signed numbers.
       */
      function max(int256 a, int256 b) internal pure returns (int256) {
          return a > b ? a : b;
      }
  
      /**
       * @dev Returns the smallest of two signed numbers.
       */
      function min(int256 a, int256 b) internal pure returns (int256) {
          return 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 {
              // must be unchecked in order to support `n = type(int256).min`
              return uint256(n >= 0 ? n : -n);
          }
      }
  }
  
  // File: @openzeppelin/contracts/utils/Strings.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (utils/Strings.sol)
  
  pragma solidity ^0.8.20;
  
  
  
  /**
   * @dev String operations.
   */
  library Strings {
      bytes16 private constant HEX_DIGITS = "0123456789abcdef";
      uint8 private constant ADDRESS_LENGTH = 20;
  
      /**
       * @dev The `value` string doesn't fit in the specified `length`.
       */
      error StringsInsufficientHexLength(uint256 value, uint256 length);
  
      /**
       * @dev 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;
              /// @solidity memory-safe-assembly
              assembly {
                  ptr := add(buffer, add(32, length))
              }
              while (true) {
                  ptr--;
                  /// @solidity memory-safe-assembly
                  assembly {
                      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 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));
      }
  }
  
  // File: @openzeppelin/contracts/utils/introspection/ERC165.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (utils/introspection/ERC165.sol)
  
  pragma solidity ^0.8.20;
  
  
  /**
   * @dev Implementation of the {IERC165} interface.
   *
   * Contracts that want to implement ERC165 should inherit from this contract and override {supportsInterface} to check
   * for the additional interface id that will be supported. For example:
   *
   * ```solidity
   * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {
   *     return interfaceId == type(MyInterface).interfaceId || super.supportsInterface(interfaceId);
   * }
   * ```
   */
  abstract contract ERC165 is IERC165 {
      /**
       * @dev See {IERC165-supportsInterface}.
       */
      function supportsInterface(bytes4 interfaceId) public view virtual returns (bool) {
          return interfaceId == type(IERC165).interfaceId;
      }
  }
  
  // File: utils/ERC721A.sol
  
  
  // Creator: Chiru Labs
  
  pragma solidity ^0.8.4;
  
  
  
  
  
  
  
  
  
  error ApprovalCallerNotOwnerNorApproved();
  error ApprovalQueryForNonexistentToken();
  error ApproveToCaller();
  error ApprovalToCurrentOwner();
  error BalanceQueryForZeroAddress();
  error MintedQueryForZeroAddress();
  error BurnedQueryForZeroAddress();
  error AuxQueryForZeroAddress();
  error MintToZeroAddress();
  error MintZeroQuantity();
  error OwnerIndexOutOfBounds();
  error OwnerQueryForNonexistentToken();
  error TokenIndexOutOfBounds();
  error TransferCallerNotOwnerNorApproved();
  error TransferFromIncorrectOwner();
  error TransferToNonERC721ReceiverImplementer();
  error TransferToZeroAddress();
  error URIQueryForNonexistentToken();
  
  /**
   * @dev Implementation of https://eips.ethereum.org/EIPS/eip-721[ERC721] Non-Fungible Token Standard, including
   * the Metadata extension. Built to optimize for lower gas during batch mints.
   *
   * Assumes serials are sequentially minted starting at _startTokenId() (defaults to 0, e.g. 0, 1, 2, 3..).
   *
   * Assumes that an owner cannot have more than 2**64 - 1 (max value of uint64) of supply.
   *
   * Assumes that the maximum token id cannot exceed 2**256 - 1 (max value of uint256).
   */
  contract ERC721A is Context, ERC165, IERC721, IERC721Metadata {
      using Address for address;
      using Strings for uint256;
  
      // Compiler will pack this into a single 256bit word.
      struct TokenOwnership {
          // The address of the owner.
          address addr;
          // Keeps track of the start time of ownership with minimal overhead for tokenomics.
          uint64 startTimestamp;
          // Whether the token has been burned.
          bool burned;
      }
  
      // Compiler will pack this into a single 256bit word.
      struct AddressData {
          // Realistically, 2**64-1 is more than enough.
          uint64 balance;
          // Keeps track of mint count with minimal overhead for tokenomics.
          uint64 numberMinted;
          // Keeps track of burn count with minimal overhead for tokenomics.
          uint64 numberBurned;
          // For miscellaneous variable(s) pertaining to the address
          // (e.g. number of whitelist mint slots used).
          // If there are multiple variables, please pack them into a uint64.
          uint64 aux;
      }
  
      // The tokenId of the next token to be minted.
      uint256 internal _currentIndex;
  
      // The number of tokens burned.
      uint256 internal _burnCounter;
  
      // Token name
      string private _name;
  
      // Token symbol
      string private _symbol;
  
      // Mapping from token ID to ownership details
      // An empty struct value does not necessarily mean the token is unowned. See ownershipOf implementation for details.
      mapping(uint256 => TokenOwnership) internal _ownerships;
  
      // Mapping owner address to address data
      mapping(address => AddressData) private _addressData;
  
      // Mapping from token ID to approved address
      mapping(uint256 => address) private _tokenApprovals;
  
      // Mapping from owner to operator approvals
      mapping(address => mapping(address => bool)) private _operatorApprovals;
  
      constructor(string memory name_, string memory symbol_) {
          _name = name_;
          _symbol = symbol_;
          _currentIndex = _startTokenId();
      }
  
      function isContract(address _addr) public view returns (bool) {
          uint32 size;
  
          assembly {
              size := extcodesize(_addr)
          }
  
          return (size > 0);
      }
  
      /**
       * To change the starting tokenId, please override this function.
       */
      function _startTokenId() internal view virtual returns (uint256) {
          return 0;
      }
  
      /**
       * @dev See {IERC721Enumerable-totalSupply}.
       * @dev Burned tokens are calculated here, use _totalMinted() if you want to count just minted tokens.
       */
      function totalSupply() public view returns (uint256) {
          // Counter underflow is impossible as _burnCounter cannot be incremented
          // more than _currentIndex - _startTokenId() times
          unchecked {
              return _currentIndex - _burnCounter - _startTokenId();
          }
      }
  
      /**
       * Returns the total amount of tokens minted in the contract.
       */
      function _totalMinted() internal view returns (uint256) {
          // Counter underflow is impossible as _currentIndex does not decrement,
          // and it is initialized to _startTokenId()
          unchecked {
              return _currentIndex - _startTokenId();
          }
      }
  
      /**
       * @dev See {IERC165-supportsInterface}.
       */
      function supportsInterface(bytes4 interfaceId) public view virtual override(ERC165, IERC165) returns (bool) {
          return
              interfaceId == type(IERC721).interfaceId ||
              interfaceId == type(IERC721Metadata).interfaceId ||
              super.supportsInterface(interfaceId);
      }
  
      /**
       * @dev See {IERC721-balanceOf}.
       */
      function balanceOf(address owner) public view override returns (uint256) {
          if (owner == address(0)) revert BalanceQueryForZeroAddress();
          return uint256(_addressData[owner].balance);
      }
  
      /**
       * Returns the number of tokens minted by `owner`.
       */
      function _numberMinted(address owner) internal view returns (uint256) {
          if (owner == address(0)) revert MintedQueryForZeroAddress();
          return uint256(_addressData[owner].numberMinted);
      }
  
      /**
       * Returns the number of tokens burned by or on behalf of `owner`.
       */
      function _numberBurned(address owner) internal view returns (uint256) {
          if (owner == address(0)) revert BurnedQueryForZeroAddress();
          return uint256(_addressData[owner].numberBurned);
      }
  
      /**
       * Returns the auxillary data for `owner`. (e.g. number of whitelist mint slots used).
       */
      function _getAux(address owner) internal view returns (uint64) {
          if (owner == address(0)) revert AuxQueryForZeroAddress();
          return _addressData[owner].aux;
      }
  
      /**
       * Sets the auxillary data for `owner`. (e.g. number of whitelist mint slots used).
       * If there are multiple variables, please pack them into a uint64.
       */
      function _setAux(address owner, uint64 aux) internal {
          if (owner == address(0)) revert AuxQueryForZeroAddress();
          _addressData[owner].aux = aux;
      }
  
      /**
       * Gas spent here starts off proportional to the maximum mint batch size.
       * It gradually moves to O(1) as tokens get transferred around in the collection over time.
       */
      function ownershipOf(uint256 tokenId) internal view returns (TokenOwnership memory) {
          uint256 curr = tokenId;
  
          unchecked {
              if (_startTokenId() <= curr && curr < _currentIndex) {
                  TokenOwnership memory ownership = _ownerships[curr];
                  if (!ownership.burned) {
                      if (ownership.addr != address(0)) {
                          return ownership;
                      }
                      // Invariant:
                      // There will always be an ownership that has an address and is not burned
                      // before an ownership that does not have an address and is not burned.
                      // Hence, curr will not underflow.
                      while (true) {
                          curr--;
                          ownership = _ownerships[curr];
                          if (ownership.addr != address(0)) {
                              return ownership;
                          }
                      }
                  }
              }
          }
          revert OwnerQueryForNonexistentToken();
      }
  
      /**
       * @dev See {IERC721-ownerOf}.
       */
      function ownerOf(uint256 tokenId) public view override returns (address) {
          return ownershipOf(tokenId).addr;
      }
  
      /**
       * @dev See {IERC721Metadata-name}.
       */
      function name() public view virtual override returns (string memory) {
          return _name;
      }
  
      /**
       * @dev See {IERC721Metadata-symbol}.
       */
      function symbol() public view virtual override returns (string memory) {
          return _symbol;
      }
  
      /**
       * @dev See {IERC721Metadata-tokenURI}.
       */
      function tokenURI(uint256 tokenId) public view virtual override returns (string memory) {
          if (!_exists(tokenId)) revert URIQueryForNonexistentToken();
  
          string memory baseURI = _baseURI();
          return bytes(baseURI).length != 0 ? string(abi.encodePacked(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 overriden in child contracts.
       */
      function _baseURI() internal view virtual returns (string memory) {
          return '';
      }
  
      /**
       * @dev See {IERC721-approve}.
       */
      function approve(address to, uint256 tokenId) public override {
          address owner = ERC721A.ownerOf(tokenId);
          if (to == owner) revert ApprovalToCurrentOwner();
  
          if (_msgSender() != owner && !isApprovedForAll(owner, _msgSender())) {
              revert ApprovalCallerNotOwnerNorApproved();
          }
  
          _approve(to, tokenId, owner);
      }
  
      /**
       * @dev See {IERC721-getApproved}.
       */
      function getApproved(uint256 tokenId) public view override returns (address) {
          if (!_exists(tokenId)) revert ApprovalQueryForNonexistentToken();
  
          return _tokenApprovals[tokenId];
      }
  
      /**
       * @dev See {IERC721-setApprovalForAll}.
       */
      function setApprovalForAll(address operator, bool approved) public override {
          if (operator == _msgSender()) revert ApproveToCaller();
  
          _operatorApprovals[_msgSender()][operator] = approved;
          emit ApprovalForAll(_msgSender(), operator, approved);
      }
  
      /**
       * @dev See {IERC721-isApprovedForAll}.
       */
      function isApprovedForAll(address owner, address operator) public view virtual override returns (bool) {
          return _operatorApprovals[owner][operator];
      }
  
      /**
       * @dev See {IERC721-transferFrom}.
       */
      function transferFrom(
          address from,
          address to,
          uint256 tokenId
      ) public virtual override {
          _transfer(from, to, tokenId);
      }
  
      /**
       * @dev See {IERC721-safeTransferFrom}.
       */
      function safeTransferFrom(
          address from,
          address to,
          uint256 tokenId
      ) public virtual override {
          safeTransferFrom(from, to, tokenId, '');
      }
  
      /**
       * @dev See {IERC721-safeTransferFrom}.
       */
      function safeTransferFrom(
          address from,
          address to,
          uint256 tokenId,
          bytes memory _data
      ) public virtual override {
          _transfer(from, to, tokenId);
          if (isContract(to) && !_checkContractOnERC721Received(from, to, tokenId, _data)) {
              revert TransferToNonERC721ReceiverImplementer();
          }
      }
  
      /**
       * @dev Returns whether `tokenId` exists.
       *
       * Tokens can be managed by their owner or approved accounts via {approve} or {setApprovalForAll}.
       *
       * Tokens start existing when they are minted (`_mint`),
       */
      function _exists(uint256 tokenId) internal view returns (bool) {
          return _startTokenId() <= tokenId && tokenId < _currentIndex &&
              !_ownerships[tokenId].burned;
      }
  
      function _safeMint(address to, uint256 quantity) internal {
          _safeMint(to, quantity, '');
      }
  
      /**
       * @dev Safely mints `quantity` tokens and transfers them to `to`.
       *
       * Requirements:
       *
       * - If `to` refers to a smart contract, it must implement {IERC721Receiver-onERC721Received}, which is called for each safe transfer.
       * - `quantity` must be greater than 0.
       *
       * Emits a {Transfer} event.
       */
      function _safeMint(
          address to,
          uint256 quantity,
          bytes memory _data
      ) internal {
          _mint(to, quantity, _data, true);
      }
  
      /**
       * @dev Mints `quantity` tokens and transfers them to `to`.
       *
       * Requirements:
       *
       * - `to` cannot be the zero address.
       * - `quantity` must be greater than 0.
       *
       * Emits a {Transfer} event.
       */
      function _mint(
          address to,
          uint256 quantity,
          bytes memory _data,
          bool safe
      ) internal {
          uint256 startTokenId = _currentIndex;
          if (to == address(0)) revert MintToZeroAddress();
          if (quantity == 0) revert MintZeroQuantity();
  
          _beforeTokenTransfers(address(0), to, startTokenId, quantity);
  
          // Overflows are incredibly unrealistic.
          // balance or numberMinted overflow if current value of either + quantity > 1.8e19 (2**64) - 1
          // updatedIndex overflows if _currentIndex + quantity > 1.2e77 (2**256) - 1
          unchecked {
              _addressData[to].balance += uint64(quantity);
              _addressData[to].numberMinted += uint64(quantity);
  
              _ownerships[startTokenId].addr = to;
              _ownerships[startTokenId].startTimestamp = uint64(block.timestamp);
  
              uint256 updatedIndex = startTokenId;
              uint256 end = updatedIndex + quantity;
  
              if (safe && isContract(to)) {
                  do {
                      emit Transfer(address(0), to, updatedIndex);
                      if (!_checkContractOnERC721Received(address(0), to, updatedIndex++, _data)) {
                          revert TransferToNonERC721ReceiverImplementer();
                      }
                  } while (updatedIndex != end);
                  // Reentrancy protection
                  if (_currentIndex != startTokenId) revert();
              } else {
                  do {
                      emit Transfer(address(0), to, updatedIndex++);
                  } while (updatedIndex != end);
              }
              _currentIndex = updatedIndex;
          }
          _afterTokenTransfers(address(0), to, startTokenId, quantity);
      }
  
      /**
       * @dev Transfers `tokenId` from `from` to `to`.
       *
       * 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
      ) private {
          TokenOwnership memory prevOwnership = ownershipOf(tokenId);
  
          bool isApprovedOrOwner = (_msgSender() == prevOwnership.addr ||
              isApprovedForAll(prevOwnership.addr, _msgSender()) ||
              getApproved(tokenId) == _msgSender());
  
          if (!isApprovedOrOwner) revert TransferCallerNotOwnerNorApproved();
          if (prevOwnership.addr != from) revert TransferFromIncorrectOwner();
          if (to == address(0)) revert TransferToZeroAddress();
  
          _beforeTokenTransfers(from, to, tokenId, 1);
  
          // Clear approvals from the previous owner
          _approve(address(0), tokenId, prevOwnership.addr);
  
          // Underflow of the sender's balance is impossible because we check for
          // ownership above and the recipient's balance can't realistically overflow.
          // Counter overflow is incredibly unrealistic as tokenId would have to be 2**256.
          unchecked {
              _addressData[from].balance -= 1;
              _addressData[to].balance += 1;
  
              _ownerships[tokenId].addr = to;
              _ownerships[tokenId].startTimestamp = uint64(block.timestamp);
  
              // If the ownership slot of tokenId+1 is not explicitly set, that means the transfer initiator owns it.
              // Set the slot of tokenId+1 explicitly in storage to maintain correctness for ownerOf(tokenId+1) calls.
              uint256 nextTokenId = tokenId + 1;
              if (_ownerships[nextTokenId].addr == address(0)) {
                  // This will suffice for checking _exists(nextTokenId),
                  // as a burned slot cannot contain the zero address.
                  if (nextTokenId < _currentIndex) {
                      _ownerships[nextTokenId].addr = prevOwnership.addr;
                      _ownerships[nextTokenId].startTimestamp = prevOwnership.startTimestamp;
                  }
              }
          }
  
          emit Transfer(from, to, tokenId);
          _afterTokenTransfers(from, to, tokenId, 1);
      }
  
      /**
       * @dev Destroys `tokenId`.
       * The approval is cleared when the token is burned.
       *
       * Requirements:
       *
       * - `tokenId` must exist.
       *
       * Emits a {Transfer} event.
       */
      function _burn(uint256 tokenId) internal virtual {
          TokenOwnership memory prevOwnership = ownershipOf(tokenId);
  
          _beforeTokenTransfers(prevOwnership.addr, address(0), tokenId, 1);
  
          // Clear approvals from the previous owner
          _approve(address(0), tokenId, prevOwnership.addr);
  
          // Underflow of the sender's balance is impossible because we check for
          // ownership above and the recipient's balance can't realistically overflow.
          // Counter overflow is incredibly unrealistic as tokenId would have to be 2**256.
          unchecked {
              _addressData[prevOwnership.addr].balance -= 1;
              _addressData[prevOwnership.addr].numberBurned += 1;
  
              // Keep track of who burned the token, and the timestamp of burning.
              _ownerships[tokenId].addr = prevOwnership.addr;
              _ownerships[tokenId].startTimestamp = uint64(block.timestamp);
              _ownerships[tokenId].burned = true;
  
              // If the ownership slot of tokenId+1 is not explicitly set, that means the burn initiator owns it.
              // Set the slot of tokenId+1 explicitly in storage to maintain correctness for ownerOf(tokenId+1) calls.
              uint256 nextTokenId = tokenId + 1;
              if (_ownerships[nextTokenId].addr == address(0)) {
                  // This will suffice for checking _exists(nextTokenId),
                  // as a burned slot cannot contain the zero address.
                  if (nextTokenId < _currentIndex) {
                      _ownerships[nextTokenId].addr = prevOwnership.addr;
                      _ownerships[nextTokenId].startTimestamp = prevOwnership.startTimestamp;
                  }
              }
          }
  
          emit Transfer(prevOwnership.addr, address(0), tokenId);
          _afterTokenTransfers(prevOwnership.addr, address(0), tokenId, 1);
  
          // Overflow not possible, as _burnCounter cannot be exceed _currentIndex times.
          unchecked {
              _burnCounter++;
          }
      }
  
      /**
       * @dev Approve `to` to operate on `tokenId`
       *
       * Emits a {Approval} event.
       */
      function _approve(
          address to,
          uint256 tokenId,
          address owner
      ) private {
          _tokenApprovals[tokenId] = to;
          emit Approval(owner, to, tokenId);
      }
  
      /**
       * @dev Internal function to invoke {IERC721Receiver-onERC721Received} on a target contract.
       *
       * @param from address representing the previous owner of the given token ID
       * @param to target address that will receive the tokens
       * @param tokenId uint256 ID of the token to be transferred
       * @param _data bytes optional data to send along with the call
       * @return bool whether the call correctly returned the expected magic value
       */
      function _checkContractOnERC721Received(
          address from,
          address to,
          uint256 tokenId,
          bytes memory _data
      ) private returns (bool) {
          try IERC721Receiver(to).onERC721Received(_msgSender(), from, tokenId, _data) returns (bytes4 retval) {
              return retval == IERC721Receiver(to).onERC721Received.selector;
          } catch (bytes memory reason) {
              if (reason.length == 0) {
                  revert TransferToNonERC721ReceiverImplementer();
              } else {
                  assembly {
                      revert(add(32, reason), mload(reason))
                  }
              }
          }
      }
  
      /**
       * @dev Hook that is called before a set of serially-ordered token ids are about to be transferred. This includes minting.
       * And also called before burning one token.
       *
       * startTokenId - the first token id to be transferred
       * quantity - the amount to be transferred
       *
       * Calling conditions:
       *
       * - When `from` and `to` are both non-zero, `from`'s `tokenId` will be
       * transferred to `to`.
       * - When `from` is zero, `tokenId` will be minted for `to`.
       * - When `to` is zero, `tokenId` will be burned by `from`.
       * - `from` and `to` are never both zero.
       */
      function _beforeTokenTransfers(
          address from,
          address to,
          uint256 startTokenId,
          uint256 quantity
      ) internal virtual {}
  
      /**
       * @dev Hook that is called after a set of serially-ordered token ids have been transferred. This includes
       * minting.
       * And also called after one token has been burned.
       *
       * startTokenId - the first token id to be transferred
       * quantity - the amount to be transferred
       *
       * Calling conditions:
       *
       * - When `from` and `to` are both non-zero, `from`'s `tokenId` has been
       * transferred to `to`.
       * - When `from` is zero, `tokenId` has been minted for `to`.
       * - When `to` is zero, `tokenId` has been burned by `from`.
       * - `from` and `to` are never both zero.
       */
      function _afterTokenTransfers(
          address from,
          address to,
          uint256 startTokenId,
          uint256 quantity
      ) internal virtual {}
  }
  // File: @openzeppelin/contracts/access/Ownable.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)
  
  pragma solidity ^0.8.20;
  
  
  /**
   * @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);
      }
  }
  
  // File: @openzeppelin/contracts/utils/cryptography/MerkleProof.sol
  
  
  // OpenZeppelin Contracts (last updated v5.0.0) (utils/cryptography/MerkleProof.sol)
  
  pragma solidity ^0.8.20;
  
  /**
   * @dev These functions deal with verification of Merkle Tree proofs.
   *
   * The tree and the proofs can be generated using our
   * https://github.com/OpenZeppelin/merkle-tree[JavaScript library].
   * You will find a quickstart guide in the readme.
   *
   * WARNING: You should avoid using leaf values that are 64 bytes long prior to
   * hashing, or use a hash function other than keccak256 for hashing leaves.
   * This is because the concatenation of a sorted pair of internal nodes in
   * the Merkle tree could be reinterpreted as a leaf value.
   * OpenZeppelin's JavaScript library generates Merkle trees that are safe
   * against this attack out of the box.
   */
  library MerkleProof {
      /**
       *@dev The multiproof provided is not valid.
       */
      error MerkleProofInvalidMultiproof();
  
      /**
       * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree
       * defined by `root`. For this, a `proof` must be provided, containing
       * sibling hashes on the branch from the leaf to the root of the tree. Each
       * pair of leaves and each pair of pre-images are assumed to be sorted.
       */
      function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
          return processProof(proof, leaf) == root;
      }
  
      /**
       * @dev Calldata version of {verify}
       */
      function verifyCalldata(bytes32[] calldata proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {
          return processProofCalldata(proof, leaf) == root;
      }
  
      /**
       * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up
       * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt
       * hash matches the root of the tree. When processing the proof, the pairs
       * of leafs & pre-images are assumed to be sorted.
       */
      function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {
          bytes32 computedHash = leaf;
          for (uint256 i = 0; i < proof.length; i++) {
              computedHash = _hashPair(computedHash, proof[i]);
          }
          return computedHash;
      }
  
      /**
       * @dev Calldata version of {processProof}
       */
      function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {
          bytes32 computedHash = leaf;
          for (uint256 i = 0; i < proof.length; i++) {
              computedHash = _hashPair(computedHash, proof[i]);
          }
          return computedHash;
      }
  
      /**
       * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a Merkle tree defined by
       * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.
       *
       * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
       */
      function multiProofVerify(
          bytes32[] memory proof,
          bool[] memory proofFlags,
          bytes32 root,
          bytes32[] memory leaves
      ) internal pure returns (bool) {
          return processMultiProof(proof, proofFlags, leaves) == root;
      }
  
      /**
       * @dev Calldata version of {multiProofVerify}
       *
       * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
       */
      function multiProofVerifyCalldata(
          bytes32[] calldata proof,
          bool[] calldata proofFlags,
          bytes32 root,
          bytes32[] memory leaves
      ) internal pure returns (bool) {
          return processMultiProofCalldata(proof, proofFlags, leaves) == root;
      }
  
      /**
       * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction
       * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another
       * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false
       * respectively.
       *
       * CAUTION: Not all Merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree
       * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the
       * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).
       */
      function processMultiProof(
          bytes32[] memory proof,
          bool[] memory proofFlags,
          bytes32[] memory leaves
      ) internal pure returns (bytes32 merkleRoot) {
          // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
          // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
          // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
          // the Merkle tree.
          uint256 leavesLen = leaves.length;
          uint256 proofLen = proof.length;
          uint256 totalHashes = proofFlags.length;
  
          // Check proof validity.
          if (leavesLen + proofLen != totalHashes + 1) {
              revert MerkleProofInvalidMultiproof();
          }
  
          // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
          // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
          bytes32[] memory hashes = new bytes32[](totalHashes);
          uint256 leafPos = 0;
          uint256 hashPos = 0;
          uint256 proofPos = 0;
          // At each step, we compute the next hash using two values:
          // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
          //   get the next hash.
          // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
          //   `proof` array.
          for (uint256 i = 0; i < totalHashes; i++) {
              bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
              bytes32 b = proofFlags[i]
                  ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                  : proof[proofPos++];
              hashes[i] = _hashPair(a, b);
          }
  
          if (totalHashes > 0) {
              if (proofPos != proofLen) {
                  revert MerkleProofInvalidMultiproof();
              }
              unchecked {
                  return hashes[totalHashes - 1];
              }
          } else if (leavesLen > 0) {
              return leaves[0];
          } else {
              return proof[0];
          }
      }
  
      /**
       * @dev Calldata version of {processMultiProof}.
       *
       * CAUTION: Not all Merkle trees admit multiproofs. See {processMultiProof} for details.
       */
      function processMultiProofCalldata(
          bytes32[] calldata proof,
          bool[] calldata proofFlags,
          bytes32[] memory leaves
      ) internal pure returns (bytes32 merkleRoot) {
          // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by
          // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the
          // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of
          // the Merkle tree.
          uint256 leavesLen = leaves.length;
          uint256 proofLen = proof.length;
          uint256 totalHashes = proofFlags.length;
  
          // Check proof validity.
          if (leavesLen + proofLen != totalHashes + 1) {
              revert MerkleProofInvalidMultiproof();
          }
  
          // The xxxPos values are "pointers" to the next value to consume in each array. All accesses are done using
          // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's "pop".
          bytes32[] memory hashes = new bytes32[](totalHashes);
          uint256 leafPos = 0;
          uint256 hashPos = 0;
          uint256 proofPos = 0;
          // At each step, we compute the next hash using two values:
          // - a value from the "main queue". If not all leaves have been consumed, we get the next leaf, otherwise we
          //   get the next hash.
          // - depending on the flag, either another value from the "main queue" (merging branches) or an element from the
          //   `proof` array.
          for (uint256 i = 0; i < totalHashes; i++) {
              bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];
              bytes32 b = proofFlags[i]
                  ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])
                  : proof[proofPos++];
              hashes[i] = _hashPair(a, b);
          }
  
          if (totalHashes > 0) {
              if (proofPos != proofLen) {
                  revert MerkleProofInvalidMultiproof();
              }
              unchecked {
                  return hashes[totalHashes - 1];
              }
          } else if (leavesLen > 0) {
              return leaves[0];
          } else {
              return proof[0];
          }
      }
  
      /**
       * @dev Sorts the pair (a, b) and hashes the result.
       */
      function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {
          return a < b ? _efficientHash(a, b) : _efficientHash(b, a);
      }
  
      /**
       * @dev Implementation of keccak256(abi.encode(a, b)) that doesn't allocate or expand memory.
       */
      function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {
          /// @solidity memory-safe-assembly
          assembly {
              mstore(0x00, a)
              mstore(0x20, b)
              value := keccak256(0x00, 0x40)
          }
      }
  }
  
  // File: BB.sol
  
  
  pragma solidity ^0.8.20;
  
  
  
  
  contract BB is ERC721A, Ownable {
      using Strings for uint256;
  
      // Supplies
      uint256 public maxSupply = 10000;
  
      // URIs
      string public baseURI = "ipfs://bafybeig6milt5ky73c7or4tqh5ac2nssunfejdj3on6h3mkaon2o6iahva/";
  
      // Prices
      uint256 public whitelistSaleMintPrice = 0.02 ether;
      uint256 public publicSaleMintPrice = 0.03 ether;
  
      // Limits
      uint256 public whitelistSaleMaxMintLimit = 10;
      uint256 public publicSaleMaxMintLimit = 10;
  
      // States
      bool public paused = false;
      bool public whitelist = false;
      bool public whitelistSalePaused = false;
      bool public publicSalePaused = true;
  
      // Merkle tree roots
      bytes32 public whitelistSaleMerkleTreeRoot;
  
      // Mappings
      mapping(address => uint256) public whitelistSaleWalletMintCount;
      mapping(address => uint256) public publicSaleWalletMintCount;
  
      // Constructor
      constructor() ERC721A("Blocky Bites", "BB") Ownable(msg.sender) {}
  
      // Whitelist sale mint
      function whitelistSaleMint(uint256 _quantity, bytes32[] memory _merkleTreeProof) public payable whitelistSaleMintCompliance(_quantity, _merkleTreeProof) {
          require(!paused, "Contract is paused");
          require(!whitelistSalePaused, "Whitelist sale is paused");
  
          require(msg.value == whitelistSaleMintPrice * _quantity, "Invalid value sent");
          
          _safeMint(msg.sender, _quantity);
  
          for (uint256 i = 0; i < _quantity; i++) {
              whitelistSaleWalletMintCount[msg.sender]++;
          }
      }
  
      modifier whitelistSaleMintCompliance(uint256 _quantity, bytes32[] memory _merkleTreeProof) {
          require(totalSupply() + _quantity <= maxSupply, "Exceeds the max supply");
  
          uint256 walletMintCount = whitelistSaleWalletMintCount[msg.sender];
  
          require(walletMintCount + _quantity <= whitelistSaleMaxMintLimit, "Exceeds the max mint limit per wallet");
  
          if(whitelist) {
              require(isValidWhitelistSaleMerkleTreeProof(_merkleTreeProof, keccak256(abi.encodePacked(msg.sender))), "Not whitelisted");
          }
  
          _;
      }
  
      function isValidWhitelistSaleMerkleTreeProof(bytes32[] memory proof, bytes32 leaf) public view returns (bool) {
          return MerkleProof.verify(proof, whitelistSaleMerkleTreeRoot, leaf);
      }
  
      // Public sale mint
      function publicSaleMint(uint256 _quantity) public payable publicSaleMintCompliance(_quantity) {
          require(!paused, "Contract is paused");
          require(!publicSalePaused, "Public sale is paused");
  
          require(msg.value == publicSaleMintPrice * _quantity, "Invalid value sent");
          
          _safeMint(msg.sender, _quantity);
  
          for (uint256 i = 0; i < _quantity; i++) {
              publicSaleWalletMintCount[msg.sender]++;
          }
      }
  
      modifier publicSaleMintCompliance(uint256 _quantity) {
          require(totalSupply() + _quantity <= maxSupply, "Exceeds the max supply");
  
          uint256 walletMintCount = publicSaleWalletMintCount[msg.sender];
  
          require(walletMintCount + _quantity <= publicSaleMaxMintLimit, "Exceeds the max mint limit per wallet");
  
          _;
      }
  
      // Owner mint
      function ownerMint(uint256 _quantity) public payable onlyOwner {
          require(!paused, "Contract is paused");
          
          _safeMint(msg.sender, _quantity);
      }
  
      function ownerMintForOthers(uint256 _quantity, address _receiver) public payable onlyOwner {
          require(!paused, "Contract is paused");
          
          _safeMint(_receiver, _quantity);
      }
  
      // Setter functions
      function setMaxSupply(uint256 _supply) public onlyOwner {
          maxSupply = _supply;
      }
  
      function setBaseURI(string memory _uri) public onlyOwner {
          baseURI = _uri;
      }
  
      function setWhitelistSaleMintPrice(uint256 _price) public onlyOwner {
          whitelistSaleMintPrice = _price;
      }
  
      function setPublicSaleMintPrice(uint256 _price) public onlyOwner {
          publicSaleMintPrice = _price;
      }
  
      function setWhitelistSaleMaxMintLimit(uint256 _limit) public onlyOwner {
          whitelistSaleMaxMintLimit = _limit;
      }
  
      function setPublicSaleMaxMintLimit(uint256 _limit) public onlyOwner {
          publicSaleMaxMintLimit = _limit;
      }
  
      function setPaused(bool _state) public onlyOwner {
          paused = _state;
      }
  
      function setWhitelist(bool _state) public onlyOwner {
          whitelist = _state;
      }
  
      function setWhitelistSalePaused(bool _state) public onlyOwner {
          whitelistSalePaused = _state;
      }
  
      function setPublicSalePaused(bool _state) public onlyOwner {
          publicSalePaused = _state;
      }
  
      function setWhitelistSaleMerkleTreeRoot(bytes32 _root) public onlyOwner {
          whitelistSaleMerkleTreeRoot = _root;
      }
  
      // Getter functions
      function _baseURI() internal view override returns (string memory) {
          return baseURI;
      }
  
      function tokenURI(uint256 _tokenId) public view virtual override returns (string memory) {
          require(_exists(_tokenId), "Token doesn't exists");
  
          string memory currentBaseURI = _baseURI();
          return bytes(currentBaseURI).length > 0 ? string(abi.encodePacked(currentBaseURI, _tokenId.toString(), ".json")) : "";
      }
      
      function walletOfOwner(address _owner) public view returns (uint256[] memory) {
          uint256 ownerTokenCount = balanceOf(_owner);
          uint256[] memory ownedTokenIds = new uint256[](ownerTokenCount);
          uint256 currentTokenId = _startTokenId();
          uint256 ownedTokenIndex = 0;
          address latestOwnerAddress;
  
          while (ownedTokenIndex < ownerTokenCount && currentTokenId <= maxSupply) {
              TokenOwnership memory ownership = _ownerships[currentTokenId];
  
              if (!ownership.burned && ownership.addr != address(0)) {
                  latestOwnerAddress = ownership.addr;
              }
  
              if (latestOwnerAddress == _owner) {
                  ownedTokenIds[ownedTokenIndex] = currentTokenId;
  
                  ownedTokenIndex++;
              }
  
              currentTokenId++;
          }
  
          return ownedTokenIds;
      }
  
      // Withdraw
      function withdraw() public payable onlyOwner {
          payable(owner()).transfer(address(this).balance);
      }
  }