creation_sourcecode: pragma solidity ^0.8.23;
  
  
  // 
  // OpenZeppelin Contracts (last updated v5.0.0) (token/ERC20/IERC20.sol)
  /**
   * @dev Interface of the ERC20 standard as defined in the EIP.
   */
  interface IERC20 {
      /**
       * @dev Emitted when `value` tokens are moved from one account (`from`) to
       * another (`to`).
       *
       * Note that `value` may be zero.
       */
      event Transfer(address indexed from, address indexed to, uint256 value);
  
      /**
       * @dev Emitted when the allowance of a `spender` for an `owner` is set by
       * a call to {approve}. `value` is the new allowance.
       */
      event Approval(address indexed owner, address indexed spender, uint256 value);
  
      /**
       * @dev Returns the value of tokens in existence.
       */
      function totalSupply() external view returns (uint256);
  
      /**
       * @dev Returns the value of tokens owned by `account`.
       */
      function balanceOf(address account) external view returns (uint256);
  
      /**
       * @dev Moves a `value` amount of tokens from the caller's account to `to`.
       *
       * Returns a boolean value indicating whether the operation succeeded.
       *
       * Emits a {Transfer} event.
       */
      function transfer(address to, uint256 value) external returns (bool);
  
      /**
       * @dev Returns the remaining number of tokens that `spender` will be
       * allowed to spend on behalf of `owner` through {transferFrom}. This is
       * zero by default.
       *
       * This value changes when {approve} or {transferFrom} are called.
       */
      function allowance(address owner, address spender) external view returns (uint256);
  
      /**
       * @dev Sets a `value` amount of tokens as the allowance of `spender` over the
       * caller's tokens.
       *
       * Returns a boolean value indicating whether the operation succeeded.
       *
       * IMPORTANT: Beware that changing an allowance with this method brings the risk
       * that someone may use both the old and the new allowance by unfortunate
       * transaction ordering. One possible solution to mitigate this race
       * condition is to first reduce the spender's allowance to 0 and set the
       * desired value afterwards:
       * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729
       *
       * Emits an {Approval} event.
       */
      function approve(address spender, uint256 value) external returns (bool);
  
      /**
       * @dev Moves a `value` amount of tokens from `from` to `to` using the
       * allowance mechanism. `value` is then deducted from the caller's
       * allowance.
       *
       * Returns a boolean value indicating whether the operation succeeded.
       *
       * Emits a {Transfer} event.
       */
      function transferFrom(address from, address to, uint256 value) external returns (bool);
  }
  
  interface IERC20Permit {
      /**
       * @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,
       * given ``owner``'s signed approval.
       *
       * IMPORTANT: The same issues {IERC20-approve} has related to transaction
       * ordering also apply here.
       *
       * Emits an {Approval} event.
       *
       * Requirements:
       *
       * - `spender` cannot be the zero address.
       * - `deadline` must be a timestamp in the future.
       * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`
       * over the EIP712-formatted function arguments.
       * - the signature must use ``owner``'s current nonce (see {nonces}).
       *
       * For more information on the signature format, see the
       * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP
       * section].
       *
       * CAUTION: See Security Considerations above.
       */
      function permit(
          address owner,
          address spender,
          uint256 value,
          uint256 deadline,
          uint8 v,
          bytes32 r,
          bytes32 s
      ) external;
  
      /**
       * @dev Returns the current nonce for `owner`. This value must be
       * included whenever a signature is generated for {permit}.
       *
       * Every successful call to {permit} increases ``owner``'s nonce by one. This
       * prevents a signature from being used multiple times.
       */
      function nonces(address owner) external view returns (uint256);
  
      /**
       * @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.
       */
      // solhint-disable-next-line func-name-mixedcase
      function DOMAIN_SEPARATOR() external view returns (bytes32);
  }
  
  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();
          }
      }
  }
  
  // 
  // OpenZeppelin Contracts (last updated v5.0.0) (token/ERC20/utils/SafeERC20.sol)
  /**
   * @title SafeERC20
   * @dev Wrappers around ERC20 operations that throw on failure (when the token
   * contract returns false). Tokens that return no value (and instead revert or
   * throw on failure) are also supported, non-reverting calls are assumed to be
   * successful.
   * To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,
   * which allows you to call the safe operations as `token.safeTransfer(...)`, etc.
   */
  library SafeERC20 {
      using Address for address;
  
      /**
       * @dev An operation with an ERC20 token failed.
       */
      error SafeERC20FailedOperation(address token);
  
      /**
       * @dev Indicates a failed `decreaseAllowance` request.
       */
      error SafeERC20FailedDecreaseAllowance(address spender, uint256 currentAllowance, uint256 requestedDecrease);
  
      /**
       * @dev Transfer `value` amount of `token` from the calling contract to `to`. If `token` returns no value,
       * non-reverting calls are assumed to be successful.
       */
      function safeTransfer(IERC20 token, address to, uint256 value) internal {
          _callOptionalReturn(token, abi.encodeCall(token.transfer, (to, value)));
      }
  
      /**
       * @dev Transfer `value` amount of `token` from `from` to `to`, spending the approval given by `from` to the
       * calling contract. If `token` returns no value, non-reverting calls are assumed to be successful.
       */
      function safeTransferFrom(IERC20 token, address from, address to, uint256 value) internal {
          _callOptionalReturn(token, abi.encodeCall(token.transferFrom, (from, to, value)));
      }
  
      /**
       * @dev Increase the calling contract's allowance toward `spender` by `value`. If `token` returns no value,
       * non-reverting calls are assumed to be successful.
       */
      function safeIncreaseAllowance(IERC20 token, address spender, uint256 value) internal {
          uint256 oldAllowance = token.allowance(address(this), spender);
          forceApprove(token, spender, oldAllowance + value);
      }
  
      /**
       * @dev Decrease the calling contract's allowance toward `spender` by `requestedDecrease`. If `token` returns no
       * value, non-reverting calls are assumed to be successful.
       */
      function safeDecreaseAllowance(IERC20 token, address spender, uint256 requestedDecrease) internal {
          unchecked {
              uint256 currentAllowance = token.allowance(address(this), spender);
              if (currentAllowance < requestedDecrease) {
                  revert SafeERC20FailedDecreaseAllowance(spender, currentAllowance, requestedDecrease);
              }
              forceApprove(token, spender, currentAllowance - requestedDecrease);
          }
      }
  
      /**
       * @dev Set the calling contract's allowance toward `spender` to `value`. If `token` returns no value,
       * non-reverting calls are assumed to be successful. Meant to be used with tokens that require the approval
       * to be set to zero before setting it to a non-zero value, such as USDT.
       */
      function forceApprove(IERC20 token, address spender, uint256 value) internal {
          bytes memory approvalCall = abi.encodeCall(token.approve, (spender, value));
  
          if (!_callOptionalReturnBool(token, approvalCall)) {
              _callOptionalReturn(token, abi.encodeCall(token.approve, (spender, 0)));
              _callOptionalReturn(token, approvalCall);
          }
      }
  
      /**
       * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
       * on the return value: the return value is optional (but if data is returned, it must not be false).
       * @param token The token targeted by the call.
       * @param data The call data (encoded using abi.encode or one of its variants).
       */
      function _callOptionalReturn(IERC20 token, bytes memory data) private {
          // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
          // we're implementing it ourselves. We use {Address-functionCall} to perform this call, which verifies that
          // the target address contains contract code and also asserts for success in the low-level call.
  
          bytes memory returndata = address(token).functionCall(data);
          if (returndata.length != 0 && !abi.decode(returndata, (bool))) {
              revert SafeERC20FailedOperation(address(token));
          }
      }
  
      /**
       * @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement
       * on the return value: the return value is optional (but if data is returned, it must not be false).
       * @param token The token targeted by the call.
       * @param data The call data (encoded using abi.encode or one of its variants).
       *
       * This is a variant of {_callOptionalReturn} that silents catches all reverts and returns a bool instead.
       */
      function _callOptionalReturnBool(IERC20 token, bytes memory data) private returns (bool) {
          // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since
          // we're implementing it ourselves. We cannot use {Address-functionCall} here since this should return false
          // and not revert is the subcall reverts.
  
          (bool success, bytes memory returndata) = address(token).call(data);
          return success && (returndata.length == 0 || abi.decode(returndata, (bool))) && address(token).code.length > 0;
      }
  }
  
  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)
          }
      }
  }
  
  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;
      }
  }
  
  // 
  // OpenZeppelin Contracts (last updated v5.0.0) (access/Ownable.sol)
  /**
   * @dev Contract module which provides a basic access control mechanism, where
   * there is an account (an owner) that can be granted exclusive access to
   * specific functions.
   *
   * The initial owner is set to the address provided by the deployer. This can
   * later be changed with {transferOwnership}.
   *
   * This module is used through inheritance. It will make available the modifier
   * `onlyOwner`, which can be applied to your functions to restrict their use to
   * the owner.
   */
  abstract contract Ownable is Context {
      address private _owner;
  
      /**
       * @dev The caller account is not authorized to perform an operation.
       */
      error OwnableUnauthorizedAccount(address account);
  
      /**
       * @dev The owner is not a valid owner account. (eg. `address(0)`)
       */
      error OwnableInvalidOwner(address owner);
  
      event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);
  
      /**
       * @dev Initializes the contract setting the address provided by the deployer as the initial owner.
       */
      constructor(address initialOwner) {
          if (initialOwner == address(0)) {
              revert OwnableInvalidOwner(address(0));
          }
          _transferOwnership(initialOwner);
      }
  
      /**
       * @dev Throws if called by any account other than the owner.
       */
      modifier onlyOwner() {
          _checkOwner();
          _;
      }
  
      /**
       * @dev Returns the address of the current owner.
       */
      function owner() public view virtual returns (address) {
          return _owner;
      }
  
      /**
       * @dev Throws if the sender is not the owner.
       */
      function _checkOwner() internal view virtual {
          if (owner() != _msgSender()) {
              revert OwnableUnauthorizedAccount(_msgSender());
          }
      }
  
      /**
       * @dev Leaves the contract without owner. It will not be possible to call
       * `onlyOwner` functions. Can only be called by the current owner.
       *
       * NOTE: Renouncing ownership will leave the contract without an owner,
       * thereby disabling any functionality that is only available to the owner.
       */
      function renounceOwnership() public virtual onlyOwner {
          _transferOwnership(address(0));
      }
  
      /**
       * @dev Transfers ownership of the contract to a new account (`newOwner`).
       * Can only be called by the current owner.
       */
      function transferOwnership(address newOwner) public virtual onlyOwner {
          if (newOwner == address(0)) {
              revert OwnableInvalidOwner(address(0));
          }
          _transferOwnership(newOwner);
      }
  
      /**
       * @dev Transfers ownership of the contract to a new account (`newOwner`).
       * Internal function without access restriction.
       */
      function _transferOwnership(address newOwner) internal virtual {
          address oldOwner = _owner;
          _owner = newOwner;
          emit OwnershipTransferred(oldOwner, newOwner);
      }
  }
  
  // 
  // import "hardhat/console.sol";
  interface IStake {
      function stakeFor(address _user, uint256 _poolId, uint256 _amount) external;
  }
  
  uint256 constant TGE_PERCENT = 25;
  
  // 25%
  uint256 constant CLAIM_INTERVAL = 7 days;
  
  uint256 constant CLAIM_PERCENTAGE = 25;
  
  // 25%
  contract GfoxClaim is Ownable {
      using SafeERC20 for IERC20;
  
      uint256 public constant claimStart = 1713491400; // 2024-04-19T01:50:00.000Z
  
      IERC20 public immutable gfoxToken;
  
      IStake public immutable gfStaking;
  
      mapping(address => uint256) public claimedAmount;
  
      bytes32 public merkleRoot;
  
      constructor(
          address _owner,
          address _gfoxToken,
          address _stakeContract,
          bytes32 _merkleRoot
      ) Ownable(_owner) {
          gfoxToken = IERC20(_gfoxToken);
  
          merkleRoot = _merkleRoot;
  
          gfStaking = IStake(_stakeContract);
  
          // approve max uint256 for stake contract
          gfoxToken.approve(_stakeContract, type(uint256).max);
      }
  
      modifier claimStarted() {
          require(block.timestamp >= claimStart, "GfoxClaim: Not started");
          _;
      }
  
      event Claimed(address indexed account, uint256 amount, uint256 totalAmount);
  
      function claim(
          address _account,
          uint256 _amount,
          bytes32[] calldata _proof
      ) external claimStarted {
          _verify(_account, _amount, _proof);
  
          uint256 amountToClaim = _getClaimableAmount(_amount);
  
          amountToClaim -= claimedAmount[_account];
  
          claimedAmount[_account] += amountToClaim;
  
          emit Claimed(_account, amountToClaim, _amount);
  
          gfoxToken.safeTransfer(_account, amountToClaim);
      }
  
      function claimAndStake(
          address _account,
          uint256 _amount,
          bytes32[] calldata _proof,
          uint256 _poolId
      ) external claimStarted {
          _verify(_account, _amount, _proof);
  
          uint256 amountToClaim = _getClaimableAmount(_amount);
  
          amountToClaim -= claimedAmount[_account];
  
          claimedAmount[_account] += amountToClaim;
  
          emit Claimed(_account, amountToClaim, _amount);
  
          gfStaking.stakeFor(_account, _poolId, amountToClaim);
      }
  
      function recoverTokens(
          address _token,
          address _to,
          uint256 _amount
      ) external onlyOwner {
          IERC20(_token).safeTransfer(_to, _amount);
      }
  
      function setMerkleRoot(bytes32 _merkleRoot) external onlyOwner {
          merkleRoot = _merkleRoot;
      }
  
      function _verify(
          address _account,
          uint256 _amount,
          bytes32[] calldata _proof
      ) internal view {
          require(
              claimedAmount[_account] < _amount,
              "GfoxClaim: Already claimed"
          );
          require(
              MerkleProof.verify(
                  _proof,
                  merkleRoot,
                  keccak256(abi.encodePacked(_account, _amount))
              ),
              "GfoxClaim: Invalid proof"
          );
      }
  
      function _getClaimableAmount(
          uint256 _amount
      ) internal view returns (uint256 amountToClaim) {
          amountToClaim += (_amount * TGE_PERCENT) / 100;
  
          uint256 weeksPassed = (block.timestamp - claimStart) / CLAIM_INTERVAL; // precision loss is wanted
  
          if (weeksPassed >= 3) {
              amountToClaim = _amount;
          } else {
              amountToClaim += (_amount * CLAIM_PERCENTAGE * weeksPassed) / 100;
          }
      }
  }