creation_sourcecode: {{
    "language": "Solidity",
    "sources": {
      "@openzeppelin/contracts-upgradeable/access/OwnableUpgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (access/Ownable.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../utils/ContextUpgradeable.sol\";\nimport \"../proxy/utils/Initializable.sol\";\n\n/**\n * @dev Contract module which provides a basic access control mechanism, where\n * there is an account (an owner) that can be granted exclusive access to\n * specific functions.\n *\n * By default, the owner account will be the one that deploys the contract. This\n * can later be changed with {transferOwnership}.\n *\n * This module is used through inheritance. It will make available the modifier\n * `onlyOwner`, which can be applied to your functions to restrict their use to\n * the owner.\n */\nabstract contract OwnableUpgradeable is Initializable, ContextUpgradeable {\n    address private _owner;\n\n    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);\n\n    /**\n     * @dev Initializes the contract setting the deployer as the initial owner.\n     */\n    function __Ownable_init() internal onlyInitializing {\n        __Ownable_init_unchained();\n    }\n\n    function __Ownable_init_unchained() internal onlyInitializing {\n        _transferOwnership(_msgSender());\n    }\n\n    /**\n     * @dev Throws if called by any account other than the owner.\n     */\n    modifier onlyOwner() {\n        _checkOwner();\n        _;\n    }\n\n    /**\n     * @dev Returns the address of the current owner.\n     */\n    function owner() public view virtual returns (address) {\n        return _owner;\n    }\n\n    /**\n     * @dev Throws if the sender is not the owner.\n     */\n    function _checkOwner() internal view virtual {\n        require(owner() == _msgSender(), \"Ownable: caller is not the owner\");\n    }\n\n    /**\n     * @dev Leaves the contract without owner. It will not be possible to call\n     * `onlyOwner` functions. Can only be called by the current owner.\n     *\n     * NOTE: Renouncing ownership will leave the contract without an owner,\n     * thereby disabling any functionality that is only available to the owner.\n     */\n    function renounceOwnership() public virtual onlyOwner {\n        _transferOwnership(address(0));\n    }\n\n    /**\n     * @dev Transfers ownership of the contract to a new account (`newOwner`).\n     * Can only be called by the current owner.\n     */\n    function transferOwnership(address newOwner) public virtual onlyOwner {\n        require(newOwner != address(0), \"Ownable: new owner is the zero address\");\n        _transferOwnership(newOwner);\n    }\n\n    /**\n     * @dev Transfers ownership of the contract to a new account (`newOwner`).\n     * Internal function without access restriction.\n     */\n    function _transferOwnership(address newOwner) internal virtual {\n        address oldOwner = _owner;\n        _owner = newOwner;\n        emit OwnershipTransferred(oldOwner, newOwner);\n    }\n\n    /**\n     * @dev This empty reserved space is put in place to allow future versions to add new\n     * variables without shifting down storage in the inheritance chain.\n     * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n     */\n    uint256[49] private __gap;\n}\n"
      },
      "@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (proxy/utils/Initializable.sol)\n\npragma solidity ^0.8.2;\n\nimport \"../../utils/AddressUpgradeable.sol\";\n\n/**\n * @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\n *\n * The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\n * reused. This mechanism prevents re-execution of each \"step\" but allows the creation of new initialization steps in\n * case an upgrade adds a module that needs to be initialized.\n *\n * For example:\n *\n * [.hljs-theme-light.nopadding]\n * ```solidity\n * contract MyToken is ERC20Upgradeable {\n *     function initialize() initializer public {\n *         __ERC20_init(\"MyToken\", \"MTK\");\n *     }\n * }\n *\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\n *     function initializeV2() reinitializer(2) public {\n *         __ERC20Permit_init(\"MyToken\");\n *     }\n * }\n * ```\n *\n * TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\n * possible by providing the encoded function call as the `_data` argument to {ERC1967Proxy-constructor}.\n *\n * CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\n *\n * [CAUTION]\n * ====\n * Avoid leaving a contract uninitialized.\n *\n * An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\n *\n * [.hljs-theme-light.nopadding]\n * ```\n * /// @custom:oz-upgrades-unsafe-allow constructor\n * constructor() {\n *     _disableInitializers();\n * }\n * ```\n * ====\n */\nabstract contract Initializable {\n    /**\n     * @dev Indicates that the contract has been initialized.\n     * @custom:oz-retyped-from bool\n     */\n    uint8 private _initialized;\n\n    /**\n     * @dev Indicates that the contract is in the process of being initialized.\n     */\n    bool private _initializing;\n\n    /**\n     * @dev Triggered when the contract has been initialized or reinitialized.\n     */\n    event Initialized(uint8 version);\n\n    /**\n     * @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\n     * `onlyInitializing` functions can be used to initialize parent contracts.\n     *\n     * Similar to `reinitializer(1)`, except that functions marked with `initializer` can be nested in the context of a\n     * constructor.\n     *\n     * Emits an {Initialized} event.\n     */\n    modifier initializer() {\n        bool isTopLevelCall = !_initializing;\n        require(\n            (isTopLevelCall && _initialized < 1) || (!AddressUpgradeable.isContract(address(this)) && _initialized == 1),\n            \"Initializable: contract is already initialized\"\n        );\n        _initialized = 1;\n        if (isTopLevelCall) {\n            _initializing = true;\n        }\n        _;\n        if (isTopLevelCall) {\n            _initializing = false;\n            emit Initialized(1);\n        }\n    }\n\n    /**\n     * @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\n     * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\n     * used to initialize parent contracts.\n     *\n     * A reinitializer may be used after the original initialization step. This is essential to configure modules that\n     * are added through upgrades and that require initialization.\n     *\n     * When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\n     * cannot be nested. If one is invoked in the context of another, execution will revert.\n     *\n     * Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\n     * a contract, executing them in the right order is up to the developer or operator.\n     *\n     * WARNING: setting the version to 255 will prevent any future reinitialization.\n     *\n     * Emits an {Initialized} event.\n     */\n    modifier reinitializer(uint8 version) {\n        require(!_initializing && _initialized < version, \"Initializable: contract is already initialized\");\n        _initialized = version;\n        _initializing = true;\n        _;\n        _initializing = false;\n        emit Initialized(version);\n    }\n\n    /**\n     * @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\n     * {initializer} and {reinitializer} modifiers, directly or indirectly.\n     */\n    modifier onlyInitializing() {\n        require(_initializing, \"Initializable: contract is not initializing\");\n        _;\n    }\n\n    /**\n     * @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\n     * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\n     * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\n     * through proxies.\n     *\n     * Emits an {Initialized} event the first time it is successfully executed.\n     */\n    function _disableInitializers() internal virtual {\n        require(!_initializing, \"Initializable: contract is initializing\");\n        if (_initialized != type(uint8).max) {\n            _initialized = type(uint8).max;\n            emit Initialized(type(uint8).max);\n        }\n    }\n\n    /**\n     * @dev Returns the highest version that has been initialized. See {reinitializer}.\n     */\n    function _getInitializedVersion() internal view returns (uint8) {\n        return _initialized;\n    }\n\n    /**\n     * @dev Returns `true` if the contract is currently initializing. See {onlyInitializing}.\n     */\n    function _isInitializing() internal view returns (bool) {\n        return _initializing;\n    }\n}\n"
      },
      "@openzeppelin/contracts-upgradeable/security/PausableUpgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.7.0) (security/Pausable.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../utils/ContextUpgradeable.sol\";\nimport \"../proxy/utils/Initializable.sol\";\n\n/**\n * @dev Contract module which allows children to implement an emergency stop\n * mechanism that can be triggered by an authorized account.\n *\n * This module is used through inheritance. It will make available the\n * modifiers `whenNotPaused` and `whenPaused`, which can be applied to\n * the functions of your contract. Note that they will not be pausable by\n * simply including this module, only once the modifiers are put in place.\n */\nabstract contract PausableUpgradeable is Initializable, ContextUpgradeable {\n    /**\n     * @dev Emitted when the pause is triggered by `account`.\n     */\n    event Paused(address account);\n\n    /**\n     * @dev Emitted when the pause is lifted by `account`.\n     */\n    event Unpaused(address account);\n\n    bool private _paused;\n\n    /**\n     * @dev Initializes the contract in unpaused state.\n     */\n    function __Pausable_init() internal onlyInitializing {\n        __Pausable_init_unchained();\n    }\n\n    function __Pausable_init_unchained() internal onlyInitializing {\n        _paused = false;\n    }\n\n    /**\n     * @dev Modifier to make a function callable only when the contract is not paused.\n     *\n     * Requirements:\n     *\n     * - The contract must not be paused.\n     */\n    modifier whenNotPaused() {\n        _requireNotPaused();\n        _;\n    }\n\n    /**\n     * @dev Modifier to make a function callable only when the contract is paused.\n     *\n     * Requirements:\n     *\n     * - The contract must be paused.\n     */\n    modifier whenPaused() {\n        _requirePaused();\n        _;\n    }\n\n    /**\n     * @dev Returns true if the contract is paused, and false otherwise.\n     */\n    function paused() public view virtual returns (bool) {\n        return _paused;\n    }\n\n    /**\n     * @dev Throws if the contract is paused.\n     */\n    function _requireNotPaused() internal view virtual {\n        require(!paused(), \"Pausable: paused\");\n    }\n\n    /**\n     * @dev Throws if the contract is not paused.\n     */\n    function _requirePaused() internal view virtual {\n        require(paused(), \"Pausable: not paused\");\n    }\n\n    /**\n     * @dev Triggers stopped state.\n     *\n     * Requirements:\n     *\n     * - The contract must not be paused.\n     */\n    function _pause() internal virtual whenNotPaused {\n        _paused = true;\n        emit Paused(_msgSender());\n    }\n\n    /**\n     * @dev Returns to normal state.\n     *\n     * Requirements:\n     *\n     * - The contract must be paused.\n     */\n    function _unpause() internal virtual whenPaused {\n        _paused = false;\n        emit Unpaused(_msgSender());\n    }\n\n    /**\n     * @dev This empty reserved space is put in place to allow future versions to add new\n     * variables without shifting down storage in the inheritance chain.\n     * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n     */\n    uint256[49] private __gap;\n}\n"
      },
      "@openzeppelin/contracts-upgradeable/security/ReentrancyGuardUpgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (security/ReentrancyGuard.sol)\n\npragma solidity ^0.8.0;\nimport \"../proxy/utils/Initializable.sol\";\n\n/**\n * @dev Contract module that helps prevent reentrant calls to a function.\n *\n * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier\n * available, which can be applied to functions to make sure there are no nested\n * (reentrant) calls to them.\n *\n * Note that because there is a single `nonReentrant` guard, functions marked as\n * `nonReentrant` may not call one another. This can be worked around by making\n * those functions `private`, and then adding `external` `nonReentrant` entry\n * points to them.\n *\n * TIP: If you would like to learn more about reentrancy and alternative ways\n * to protect against it, check out our blog post\n * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].\n */\nabstract contract ReentrancyGuardUpgradeable is Initializable {\n    // Booleans are more expensive than uint256 or any type that takes up a full\n    // word because each write operation emits an extra SLOAD to first read the\n    // slot's contents, replace the bits taken up by the boolean, and then write\n    // back. This is the compiler's defense against contract upgrades and\n    // pointer aliasing, and it cannot be disabled.\n\n    // The values being non-zero value makes deployment a bit more expensive,\n    // but in exchange the refund on every call to nonReentrant will be lower in\n    // amount. Since refunds are capped to a percentage of the total\n    // transaction's gas, it is best to keep them low in cases like this one, to\n    // increase the likelihood of the full refund coming into effect.\n    uint256 private constant _NOT_ENTERED = 1;\n    uint256 private constant _ENTERED = 2;\n\n    uint256 private _status;\n\n    function __ReentrancyGuard_init() internal onlyInitializing {\n        __ReentrancyGuard_init_unchained();\n    }\n\n    function __ReentrancyGuard_init_unchained() internal onlyInitializing {\n        _status = _NOT_ENTERED;\n    }\n\n    /**\n     * @dev Prevents a contract from calling itself, directly or indirectly.\n     * Calling a `nonReentrant` function from another `nonReentrant`\n     * function is not supported. It is possible to prevent this from happening\n     * by making the `nonReentrant` function external, and making it call a\n     * `private` function that does the actual work.\n     */\n    modifier nonReentrant() {\n        _nonReentrantBefore();\n        _;\n        _nonReentrantAfter();\n    }\n\n    function _nonReentrantBefore() private {\n        // On the first call to nonReentrant, _status will be _NOT_ENTERED\n        require(_status != _ENTERED, \"ReentrancyGuard: reentrant call\");\n\n        // Any calls to nonReentrant after this point will fail\n        _status = _ENTERED;\n    }\n\n    function _nonReentrantAfter() private {\n        // By storing the original value once again, a refund is triggered (see\n        // https://eips.ethereum.org/EIPS/eip-2200)\n        _status = _NOT_ENTERED;\n    }\n\n    /**\n     * @dev Returns true if the reentrancy guard is currently set to \"entered\", which indicates there is a\n     * `nonReentrant` function in the call stack.\n     */\n    function _reentrancyGuardEntered() internal view returns (bool) {\n        return _status == _ENTERED;\n    }\n\n    /**\n     * @dev This empty reserved space is put in place to allow future versions to add new\n     * variables without shifting down storage in the inheritance chain.\n     * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n     */\n    uint256[49] private __gap;\n}\n"
      },
      "@openzeppelin/contracts-upgradeable/token/ERC20/IERC20Upgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC20/IERC20.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev Interface of the ERC20 standard as defined in the EIP.\n */\ninterface IERC20Upgradeable {\n    /**\n     * @dev Emitted when `value` tokens are moved from one account (`from`) to\n     * another (`to`).\n     *\n     * Note that `value` may be zero.\n     */\n    event Transfer(address indexed from, address indexed to, uint256 value);\n\n    /**\n     * @dev Emitted when the allowance of a `spender` for an `owner` is set by\n     * a call to {approve}. `value` is the new allowance.\n     */\n    event Approval(address indexed owner, address indexed spender, uint256 value);\n\n    /**\n     * @dev Returns the amount of tokens in existence.\n     */\n    function totalSupply() external view returns (uint256);\n\n    /**\n     * @dev Returns the amount of tokens owned by `account`.\n     */\n    function balanceOf(address account) external view returns (uint256);\n\n    /**\n     * @dev Moves `amount` tokens from the caller's account to `to`.\n     *\n     * Returns a boolean value indicating whether the operation succeeded.\n     *\n     * Emits a {Transfer} event.\n     */\n    function transfer(address to, uint256 amount) external returns (bool);\n\n    /**\n     * @dev Returns the remaining number of tokens that `spender` will be\n     * allowed to spend on behalf of `owner` through {transferFrom}. This is\n     * zero by default.\n     *\n     * This value changes when {approve} or {transferFrom} are called.\n     */\n    function allowance(address owner, address spender) external view returns (uint256);\n\n    /**\n     * @dev Sets `amount` as the allowance of `spender` over the caller's tokens.\n     *\n     * Returns a boolean value indicating whether the operation succeeded.\n     *\n     * IMPORTANT: Beware that changing an allowance with this method brings the risk\n     * that someone may use both the old and the new allowance by unfortunate\n     * transaction ordering. One possible solution to mitigate this race\n     * condition is to first reduce the spender's allowance to 0 and set the\n     * desired value afterwards:\n     * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\n     *\n     * Emits an {Approval} event.\n     */\n    function approve(address spender, uint256 amount) external returns (bool);\n\n    /**\n     * @dev Moves `amount` tokens from `from` to `to` using the\n     * allowance mechanism. `amount` is then deducted from the caller's\n     * allowance.\n     *\n     * Returns a boolean value indicating whether the operation succeeded.\n     *\n     * Emits a {Transfer} event.\n     */\n    function transferFrom(address from, address to, uint256 amount) external returns (bool);\n}\n"
      },
      "@openzeppelin/contracts-upgradeable/utils/AddressUpgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.0) (utils/Address.sol)\n\npragma solidity ^0.8.1;\n\n/**\n * @dev Collection of functions related to the address type\n */\nlibrary AddressUpgradeable {\n    /**\n     * @dev Returns true if `account` is a contract.\n     *\n     * [IMPORTANT]\n     * ====\n     * It is unsafe to assume that an address for which this function returns\n     * false is an externally-owned account (EOA) and not a contract.\n     *\n     * Among others, `isContract` will return false for the following\n     * types of addresses:\n     *\n     *  - an externally-owned account\n     *  - a contract in construction\n     *  - an address where a contract will be created\n     *  - an address where a contract lived, but was destroyed\n     *\n     * Furthermore, `isContract` will also return true if the target contract within\n     * the same transaction is already scheduled for destruction by `SELFDESTRUCT`,\n     * which only has an effect at the end of a transaction.\n     * ====\n     *\n     * [IMPORTANT]\n     * ====\n     * You shouldn't rely on `isContract` to protect against flash loan attacks!\n     *\n     * Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets\n     * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract\n     * constructor.\n     * ====\n     */\n    function isContract(address account) internal view returns (bool) {\n        // This method relies on extcodesize/address.code.length, which returns 0\n        // for contracts in construction, since the code is only stored at the end\n        // of the constructor execution.\n\n        return account.code.length > 0;\n    }\n\n    /**\n     * @dev Replacement for Solidity's `transfer`: sends `amount` wei to\n     * `recipient`, forwarding all available gas and reverting on errors.\n     *\n     * https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost\n     * of certain opcodes, possibly making contracts go over the 2300 gas limit\n     * imposed by `transfer`, making them unable to receive funds via\n     * `transfer`. {sendValue} removes this limitation.\n     *\n     * https://consensys.net/diligence/blog/2019/09/stop-using-soliditys-transfer-now/[Learn more].\n     *\n     * IMPORTANT: because control is transferred to `recipient`, care must be\n     * taken to not create reentrancy vulnerabilities. Consider using\n     * {ReentrancyGuard} or the\n     * https://solidity.readthedocs.io/en/v0.8.0/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].\n     */\n    function sendValue(address payable recipient, uint256 amount) internal {\n        require(address(this).balance >= amount, \"Address: insufficient balance\");\n\n        (bool success, ) = recipient.call{value: amount}(\"\");\n        require(success, \"Address: unable to send value, recipient may have reverted\");\n    }\n\n    /**\n     * @dev Performs a Solidity function call using a low level `call`. A\n     * plain `call` is an unsafe replacement for a function call: use this\n     * function instead.\n     *\n     * If `target` reverts with a revert reason, it is bubbled up by this\n     * function (like regular Solidity function calls).\n     *\n     * Returns the raw returned data. To convert to the expected return value,\n     * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].\n     *\n     * Requirements:\n     *\n     * - `target` must be a contract.\n     * - calling `target` with `data` must not revert.\n     *\n     * _Available since v3.1._\n     */\n    function functionCall(address target, bytes memory data) internal returns (bytes memory) {\n        return functionCallWithValue(target, data, 0, \"Address: low-level call failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with\n     * `errorMessage` as a fallback revert reason when `target` reverts.\n     *\n     * _Available since v3.1._\n     */\n    function functionCall(\n        address target,\n        bytes memory data,\n        string memory errorMessage\n    ) internal returns (bytes memory) {\n        return functionCallWithValue(target, data, 0, errorMessage);\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n     * but also transferring `value` wei to `target`.\n     *\n     * Requirements:\n     *\n     * - the calling contract must have an ETH balance of at least `value`.\n     * - the called Solidity function must be `payable`.\n     *\n     * _Available since v3.1._\n     */\n    function functionCallWithValue(address target, bytes memory data, uint256 value) internal returns (bytes memory) {\n        return functionCallWithValue(target, data, value, \"Address: low-level call with value failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but\n     * with `errorMessage` as a fallback revert reason when `target` reverts.\n     *\n     * _Available since v3.1._\n     */\n    function functionCallWithValue(\n        address target,\n        bytes memory data,\n        uint256 value,\n        string memory errorMessage\n    ) internal returns (bytes memory) {\n        require(address(this).balance >= value, \"Address: insufficient balance for call\");\n        (bool success, bytes memory returndata) = target.call{value: value}(data);\n        return verifyCallResultFromTarget(target, success, returndata, errorMessage);\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n     * but performing a static call.\n     *\n     * _Available since v3.3._\n     */\n    function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {\n        return functionStaticCall(target, data, \"Address: low-level static call failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\n     * but performing a static call.\n     *\n     * _Available since v3.3._\n     */\n    function functionStaticCall(\n        address target,\n        bytes memory data,\n        string memory errorMessage\n    ) internal view returns (bytes memory) {\n        (bool success, bytes memory returndata) = target.staticcall(data);\n        return verifyCallResultFromTarget(target, success, returndata, errorMessage);\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n     * but performing a delegate call.\n     *\n     * _Available since v3.4._\n     */\n    function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {\n        return functionDelegateCall(target, data, \"Address: low-level delegate call failed\");\n    }\n\n    /**\n     * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\n     * but performing a delegate call.\n     *\n     * _Available since v3.4._\n     */\n    function functionDelegateCall(\n        address target,\n        bytes memory data,\n        string memory errorMessage\n    ) internal returns (bytes memory) {\n        (bool success, bytes memory returndata) = target.delegatecall(data);\n        return verifyCallResultFromTarget(target, success, returndata, errorMessage);\n    }\n\n    /**\n     * @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling\n     * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.\n     *\n     * _Available since v4.8._\n     */\n    function verifyCallResultFromTarget(\n        address target,\n        bool success,\n        bytes memory returndata,\n        string memory errorMessage\n    ) internal view returns (bytes memory) {\n        if (success) {\n            if (returndata.length == 0) {\n                // only check isContract if the call was successful and the return data is empty\n                // otherwise we already know that it was a contract\n                require(isContract(target), \"Address: call to non-contract\");\n            }\n            return returndata;\n        } else {\n            _revert(returndata, errorMessage);\n        }\n    }\n\n    /**\n     * @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the\n     * revert reason or using the provided one.\n     *\n     * _Available since v4.3._\n     */\n    function verifyCallResult(\n        bool success,\n        bytes memory returndata,\n        string memory errorMessage\n    ) internal pure returns (bytes memory) {\n        if (success) {\n            return returndata;\n        } else {\n            _revert(returndata, errorMessage);\n        }\n    }\n\n    function _revert(bytes memory returndata, string memory errorMessage) private pure {\n        // Look for revert reason and bubble it up if present\n        if (returndata.length > 0) {\n            // The easiest way to bubble the revert reason is using memory via assembly\n            /// @solidity memory-safe-assembly\n            assembly {\n                let returndata_size := mload(returndata)\n                revert(add(32, returndata), returndata_size)\n            }\n        } else {\n            revert(errorMessage);\n        }\n    }\n}\n"
      },
      "@openzeppelin/contracts-upgradeable/utils/ContextUpgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)\n\npragma solidity ^0.8.0;\nimport \"../proxy/utils/Initializable.sol\";\n\n/**\n * @dev Provides information about the current execution context, including the\n * sender of the transaction and its data. While these are generally available\n * via msg.sender and msg.data, they should not be accessed in such a direct\n * manner, since when dealing with meta-transactions the account sending and\n * paying for execution may not be the actual sender (as far as an application\n * is concerned).\n *\n * This contract is only required for intermediate, library-like contracts.\n */\nabstract contract ContextUpgradeable is Initializable {\n    function __Context_init() internal onlyInitializing {\n    }\n\n    function __Context_init_unchained() internal onlyInitializing {\n    }\n    function _msgSender() internal view virtual returns (address) {\n        return msg.sender;\n    }\n\n    function _msgData() internal view virtual returns (bytes calldata) {\n        return msg.data;\n    }\n\n    /**\n     * @dev This empty reserved space is put in place to allow future versions to add new\n     * variables without shifting down storage in the inheritance chain.\n     * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n     */\n    uint256[50] private __gap;\n}\n"
      },
      "@openzeppelin/contracts-upgradeable/utils/cryptography/MerkleProofUpgradeable.sol": {
        "content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.9.2) (utils/cryptography/MerkleProof.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev These functions deal with verification of Merkle Tree proofs.\n *\n * The tree and the proofs can be generated using our\n * https://github.com/OpenZeppelin/merkle-tree[JavaScript library].\n * You will find a quickstart guide in the readme.\n *\n * WARNING: You should avoid using leaf values that are 64 bytes long prior to\n * hashing, or use a hash function other than keccak256 for hashing leaves.\n * This is because the concatenation of a sorted pair of internal nodes in\n * the merkle tree could be reinterpreted as a leaf value.\n * OpenZeppelin's JavaScript library generates merkle trees that are safe\n * against this attack out of the box.\n */\nlibrary MerkleProofUpgradeable {\n    /**\n     * @dev Returns true if a `leaf` can be proved to be a part of a Merkle tree\n     * defined by `root`. For this, a `proof` must be provided, containing\n     * sibling hashes on the branch from the leaf to the root of the tree. Each\n     * pair of leaves and each pair of pre-images are assumed to be sorted.\n     */\n    function verify(bytes32[] memory proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {\n        return processProof(proof, leaf) == root;\n    }\n\n    /**\n     * @dev Calldata version of {verify}\n     *\n     * _Available since v4.7._\n     */\n    function verifyCalldata(bytes32[] calldata proof, bytes32 root, bytes32 leaf) internal pure returns (bool) {\n        return processProofCalldata(proof, leaf) == root;\n    }\n\n    /**\n     * @dev Returns the rebuilt hash obtained by traversing a Merkle tree up\n     * from `leaf` using `proof`. A `proof` is valid if and only if the rebuilt\n     * hash matches the root of the tree. When processing the proof, the pairs\n     * of leafs & pre-images are assumed to be sorted.\n     *\n     * _Available since v4.4._\n     */\n    function processProof(bytes32[] memory proof, bytes32 leaf) internal pure returns (bytes32) {\n        bytes32 computedHash = leaf;\n        for (uint256 i = 0; i < proof.length; i++) {\n            computedHash = _hashPair(computedHash, proof[i]);\n        }\n        return computedHash;\n    }\n\n    /**\n     * @dev Calldata version of {processProof}\n     *\n     * _Available since v4.7._\n     */\n    function processProofCalldata(bytes32[] calldata proof, bytes32 leaf) internal pure returns (bytes32) {\n        bytes32 computedHash = leaf;\n        for (uint256 i = 0; i < proof.length; i++) {\n            computedHash = _hashPair(computedHash, proof[i]);\n        }\n        return computedHash;\n    }\n\n    /**\n     * @dev Returns true if the `leaves` can be simultaneously proven to be a part of a merkle tree defined by\n     * `root`, according to `proof` and `proofFlags` as described in {processMultiProof}.\n     *\n     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.\n     *\n     * _Available since v4.7._\n     */\n    function multiProofVerify(\n        bytes32[] memory proof,\n        bool[] memory proofFlags,\n        bytes32 root,\n        bytes32[] memory leaves\n    ) internal pure returns (bool) {\n        return processMultiProof(proof, proofFlags, leaves) == root;\n    }\n\n    /**\n     * @dev Calldata version of {multiProofVerify}\n     *\n     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.\n     *\n     * _Available since v4.7._\n     */\n    function multiProofVerifyCalldata(\n        bytes32[] calldata proof,\n        bool[] calldata proofFlags,\n        bytes32 root,\n        bytes32[] memory leaves\n    ) internal pure returns (bool) {\n        return processMultiProofCalldata(proof, proofFlags, leaves) == root;\n    }\n\n    /**\n     * @dev Returns the root of a tree reconstructed from `leaves` and sibling nodes in `proof`. The reconstruction\n     * proceeds by incrementally reconstructing all inner nodes by combining a leaf/inner node with either another\n     * leaf/inner node or a proof sibling node, depending on whether each `proofFlags` item is true or false\n     * respectively.\n     *\n     * CAUTION: Not all merkle trees admit multiproofs. To use multiproofs, it is sufficient to ensure that: 1) the tree\n     * is complete (but not necessarily perfect), 2) the leaves to be proven are in the opposite order they are in the\n     * tree (i.e., as seen from right to left starting at the deepest layer and continuing at the next layer).\n     *\n     * _Available since v4.7._\n     */\n    function processMultiProof(\n        bytes32[] memory proof,\n        bool[] memory proofFlags,\n        bytes32[] memory leaves\n    ) internal pure returns (bytes32 merkleRoot) {\n        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by\n        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the\n        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of\n        // the merkle tree.\n        uint256 leavesLen = leaves.length;\n        uint256 proofLen = proof.length;\n        uint256 totalHashes = proofFlags.length;\n\n        // Check proof validity.\n        require(leavesLen + proofLen - 1 == totalHashes, \"MerkleProof: invalid multiproof\");\n\n        // The xxxPos values are \"pointers\" to the next value to consume in each array. All accesses are done using\n        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's \"pop\".\n        bytes32[] memory hashes = new bytes32[](totalHashes);\n        uint256 leafPos = 0;\n        uint256 hashPos = 0;\n        uint256 proofPos = 0;\n        // At each step, we compute the next hash using two values:\n        // - a value from the \"main queue\". If not all leaves have been consumed, we get the next leaf, otherwise we\n        //   get the next hash.\n        // - depending on the flag, either another value from the \"main queue\" (merging branches) or an element from the\n        //   `proof` array.\n        for (uint256 i = 0; i < totalHashes; i++) {\n            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];\n            bytes32 b = proofFlags[i]\n                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])\n                : proof[proofPos++];\n            hashes[i] = _hashPair(a, b);\n        }\n\n        if (totalHashes > 0) {\n            require(proofPos == proofLen, \"MerkleProof: invalid multiproof\");\n            unchecked {\n                return hashes[totalHashes - 1];\n            }\n        } else if (leavesLen > 0) {\n            return leaves[0];\n        } else {\n            return proof[0];\n        }\n    }\n\n    /**\n     * @dev Calldata version of {processMultiProof}.\n     *\n     * CAUTION: Not all merkle trees admit multiproofs. See {processMultiProof} for details.\n     *\n     * _Available since v4.7._\n     */\n    function processMultiProofCalldata(\n        bytes32[] calldata proof,\n        bool[] calldata proofFlags,\n        bytes32[] memory leaves\n    ) internal pure returns (bytes32 merkleRoot) {\n        // This function rebuilds the root hash by traversing the tree up from the leaves. The root is rebuilt by\n        // consuming and producing values on a queue. The queue starts with the `leaves` array, then goes onto the\n        // `hashes` array. At the end of the process, the last hash in the `hashes` array should contain the root of\n        // the merkle tree.\n        uint256 leavesLen = leaves.length;\n        uint256 proofLen = proof.length;\n        uint256 totalHashes = proofFlags.length;\n\n        // Check proof validity.\n        require(leavesLen + proofLen - 1 == totalHashes, \"MerkleProof: invalid multiproof\");\n\n        // The xxxPos values are \"pointers\" to the next value to consume in each array. All accesses are done using\n        // `xxx[xxxPos++]`, which return the current value and increment the pointer, thus mimicking a queue's \"pop\".\n        bytes32[] memory hashes = new bytes32[](totalHashes);\n        uint256 leafPos = 0;\n        uint256 hashPos = 0;\n        uint256 proofPos = 0;\n        // At each step, we compute the next hash using two values:\n        // - a value from the \"main queue\". If not all leaves have been consumed, we get the next leaf, otherwise we\n        //   get the next hash.\n        // - depending on the flag, either another value from the \"main queue\" (merging branches) or an element from the\n        //   `proof` array.\n        for (uint256 i = 0; i < totalHashes; i++) {\n            bytes32 a = leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++];\n            bytes32 b = proofFlags[i]\n                ? (leafPos < leavesLen ? leaves[leafPos++] : hashes[hashPos++])\n                : proof[proofPos++];\n            hashes[i] = _hashPair(a, b);\n        }\n\n        if (totalHashes > 0) {\n            require(proofPos == proofLen, \"MerkleProof: invalid multiproof\");\n            unchecked {\n                return hashes[totalHashes - 1];\n            }\n        } else if (leavesLen > 0) {\n            return leaves[0];\n        } else {\n            return proof[0];\n        }\n    }\n\n    function _hashPair(bytes32 a, bytes32 b) private pure returns (bytes32) {\n        return a < b ? _efficientHash(a, b) : _efficientHash(b, a);\n    }\n\n    function _efficientHash(bytes32 a, bytes32 b) private pure returns (bytes32 value) {\n        /// @solidity memory-safe-assembly\n        assembly {\n            mstore(0x00, a)\n            mstore(0x20, b)\n            value := keccak256(0x00, 0x40)\n        }\n    }\n}\n"
      },
      "contracts/PresaleV5.sol": {
        "content": "// SPDX-License-Identifier: MIT\npragma solidity 0.8.19;\n\nimport \"@openzeppelin/contracts-upgradeable/token/ERC20/IERC20Upgradeable.sol\";\nimport \"@openzeppelin/contracts-upgradeable/utils/AddressUpgradeable.sol\";\nimport \"@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol\";\nimport \"@openzeppelin/contracts-upgradeable/utils/ContextUpgradeable.sol\";\nimport \"@openzeppelin/contracts-upgradeable/security/PausableUpgradeable.sol\";\nimport \"@openzeppelin/contracts-upgradeable/access/OwnableUpgradeable.sol\";\nimport \"@openzeppelin/contracts-upgradeable/security/ReentrancyGuardUpgradeable.sol\";\nimport \"@openzeppelin/contracts-upgradeable/utils/cryptography/MerkleProofUpgradeable.sol\";\n\ninterface Aggregator {\n    function latestRoundData()\n        external\n        view\n        returns (\n            uint80 roundId,\n            int256 answer,\n            uint256 startedAt,\n            uint256 updatedAt,\n            uint80 answeredInRound\n        );\n}\n\ninterface Vault {\n    function depositByPresale(address user, uint256 amount) external;\n}\n\ncontract PresaleV5 is\n    Initializable,\n    ReentrancyGuardUpgradeable,\n    OwnableUpgradeable,\n    PausableUpgradeable\n{\n    uint256 public totalTokensSold;\n    uint256 public startTime;\n    uint256 public endTime;\n    uint256 public baseDecimals;\n    uint256 public maxTokensToBuy;\n    uint256 public currentStep;\n    uint256[][3] public rounds;\n    uint256 public checkPoint;\n    uint256 public usdRaised;\n    uint256[] public prevCheckpoints;\n    uint256[] public remainingTokensTracker;\n    uint256 public timeConstant;\n    address public paymentWallet;\n    bool public dynamicTimeFlag;\n    address public admin;\n\n    IERC20Upgradeable public USDTInterface;\n    Aggregator public aggregatorInterface;\n    mapping(address => uint256) public userDeposits;\n    mapping(address => bool) public wertWhitelisted;\n\n    /**\n     * @dev V2 additions\n     */\n    mapping(address => uint256) public userDeposits2;\n\n    /**\n     * @dev V3 additions\n     */\n    bool public claimStatus;\n    bool public whitelistClaimOnly;\n    IERC20Upgradeable public saleToken;\n    Vault public vaultInterface;\n    bytes32 public claimMerkleRoot;\n    mapping(address => uint256) public userClaimed;\n    mapping(address => bool) public isBlacklisted;\n    mapping(address => bool) public isWhitelisted;\n\n    event SaleTimeSet(uint256 _start, uint256 _end, uint256 timestamp);\n    event SaleTimeUpdated(\n        bytes32 indexed key,\n        uint256 prevValue,\n        uint256 newValue,\n        uint256 timestamp\n    );\n    event TokensBought(\n        address indexed user,\n        uint256 indexed tokensBought,\n        address indexed purchaseToken,\n        uint256 amountPaid,\n        uint256 usdEq,\n        uint256 timestamp\n    );\n    event TokensClaimed(\n        address indexed user,\n        uint256 amount,\n        uint256 timestamp\n    );\n    event MaxTokensUpdated(\n        uint256 prevValue,\n        uint256 newValue,\n        uint256 timestamp\n    );\n\n    /// @custom:oz-upgrades-unsafe-allow constructor\n    constructor() {\n        _disableInitializers();\n    }\n\n    function initializeV5(uint256 surplusTokens) external reinitializer(5) {\n        _transferTokens(surplusTokens);\n    }\n\n    /**\n     * @dev To pause the presale\n     */\n    function pause() external onlyOwner {\n        _pause();\n    }\n\n    /**\n     * @dev To unpause the presale\n     */\n    function unpause() external onlyOwner {\n        _unpause();\n    }\n\n    /**\n     * @dev To calculate the price in USD for given amount of tokens.\n     * @param _amount No of tokens\n     */\n    function calculatePrice(uint256 _amount) public view returns (uint256) {\n        uint256 USDTAmount;\n        uint256 total = checkPoint == 0 ? totalTokensSold : checkPoint;\n        if (\n            _amount + total > rounds[0][currentStep] ||\n            block.timestamp >= rounds[2][currentStep]\n        ) {\n            require(currentStep < (rounds[0].length - 1), \"Wrong params\");\n\n            if (block.timestamp >= rounds[2][currentStep]) {\n                require(\n                    rounds[0][currentStep] + _amount <=\n                        rounds[0][currentStep + 1],\n                    \"Cant Purchase More in individual tx\"\n                );\n                USDTAmount = _amount * rounds[1][currentStep + 1];\n            } else {\n                require(\n                    total + _amount <= rounds[0][currentStep + 1],\n                    \"Cant Purchase More in individual tx\"\n                );\n                uint256 tokenAmountForCurrentPrice = rounds[0][currentStep] -\n                    total;\n                USDTAmount =\n                    tokenAmountForCurrentPrice *\n                    rounds[1][currentStep] +\n                    (_amount - tokenAmountForCurrentPrice) *\n                    rounds[1][currentStep + 1];\n            }\n        } else USDTAmount = _amount * rounds[1][currentStep];\n        return USDTAmount;\n    }\n\n    /**\n     * @dev To update the sale times\n     * @param _startTime New start time\n     * @param _endTime New end time\n     */\n    function changeSaleTimes(\n        uint256 _startTime,\n        uint256 _endTime\n    ) external onlyOwner {\n        require(_startTime > 0 || _endTime > 0, \"Invalid parameters\");\n        if (_startTime > 0) {\n            require(block.timestamp < startTime, \"Sale already started\");\n            require(block.timestamp < _startTime, \"Sale time in past\");\n            uint256 prevValue = startTime;\n            startTime = _startTime;\n            emit SaleTimeUpdated(\n                bytes32(\"START\"),\n                prevValue,\n                _startTime,\n                block.timestamp\n            );\n        }\n\n        if (_endTime > 0) {\n            require(_endTime > startTime, \"Invalid endTime\");\n            uint256 prevValue = endTime;\n            endTime = _endTime;\n            emit SaleTimeUpdated(\n                bytes32(\"END\"),\n                prevValue,\n                _endTime,\n                block.timestamp\n            );\n        }\n    }\n\n    /**\n     * @dev To get latest ETH price in 10**18 format\n     */\n    function getLatestPrice() public view returns (uint256) {\n        (, int256 price, , , ) = aggregatorInterface.latestRoundData();\n        price = (price * (10 ** 10));\n        return uint256(price);\n    }\n\n    modifier checkSaleState(uint256 amount) {\n        require(\n            block.timestamp >= startTime && block.timestamp <= endTime,\n            \"Invalid time for buying\"\n        );\n        require(amount > 0, \"Invalid sale amount\");\n        require(amount <= maxTokensToBuy, \"Amount exceeds max tokens to buy\");\n        _;\n    }\n\n    /**\n     * @dev To buy into a presale using USDT\n     * @param amount No of tokens to buy\n     */\n    function buyWithUSDT(\n        uint256 amount\n    ) external checkSaleState(amount) whenNotPaused returns (bool) {\n        _buyWithUSDT(amount);\n        return true;\n    }\n\n    /**\n     * @dev To buy into a presale using ETH\n     * @param amount No of tokens to buy\n     */\n    function buyWithEth(\n        uint256 amount\n    )\n        external\n        payable\n        checkSaleState(amount)\n        whenNotPaused\n        nonReentrant\n        returns (bool)\n    {\n        _buyWithEth(amount);\n        return true;\n    }\n\n    /**\n     * @dev To buy into a presale and stake using USDT\n     * @param amount No of tokens to buy\n     */\n    function buyWithUSDTAndStake(\n        uint256 amount\n    ) external checkSaleState(amount) whenNotPaused returns (bool) {\n        uint256 amountDecimals = amount * baseDecimals;\n        require(\n            amountDecimals <= saleToken.balanceOf(address(this)),\n            \"Amount exceeds tokens remaining for sale\"\n        );\n        _buyWithUSDT(amount);\n        _stakeTokens(amountDecimals);\n        userClaimed[_msgSender()] += amountDecimals;\n        emit TokensClaimed(_msgSender(), amountDecimals, block.timestamp);\n        return true;\n    }\n\n    /**\n     * @dev To buy into a presale and stake using ETH\n     * @param amount No of tokens to buy\n     */\n    function buyWithEthAndStake(\n        uint256 amount\n    )\n        external\n        payable\n        checkSaleState(amount)\n        whenNotPaused\n        nonReentrant\n        returns (bool)\n    {\n        uint256 amountDecimals = amount * baseDecimals;\n        require(\n            amountDecimals <= saleToken.balanceOf(address(this)),\n            \"Amount exceeds tokens remaining for sale\"\n        );\n        _buyWithEth(amount);\n        _stakeTokens(amountDecimals);\n        userClaimed[_msgSender()] += amountDecimals;\n        emit TokensClaimed(_msgSender(), amountDecimals, block.timestamp);\n        return true;\n    }\n\n    function _buyWithUSDT(uint256 amount) internal {\n        uint256 usdPrice = calculatePrice(amount);\n        totalTokensSold += amount;\n        if (checkPoint != 0) checkPoint += amount;\n        uint256 total = totalTokensSold > checkPoint\n            ? totalTokensSold\n            : checkPoint;\n        if (\n            total > rounds[0][currentStep] ||\n            block.timestamp >= rounds[2][currentStep]\n        ) {\n            if (block.timestamp >= rounds[2][currentStep]) {\n                checkPoint = rounds[0][currentStep] + amount;\n            } else {\n                if (dynamicTimeFlag) {\n                    manageTimeDiff();\n                }\n            }\n            uint256 unsoldTokens = total > rounds[0][currentStep]\n                ? 0\n                : rounds[0][currentStep] - total;\n            remainingTokensTracker.push(unsoldTokens);\n            currentStep += 1;\n        }\n        userDeposits2[_msgSender()] += (amount * baseDecimals);\n        usdRaised += usdPrice;\n        uint256 ourAllowance = USDTInterface.allowance(\n            _msgSender(),\n            address(this)\n        );\n        uint256 price = usdPrice / (10 ** 12);\n        require(price <= ourAllowance, \"Make sure to add enough allowance\");\n        (bool success, ) = address(USDTInterface).call(\n            abi.encodeWithSignature(\n                \"transferFrom(address,address,uint256)\",\n                _msgSender(),\n                paymentWallet,\n                price\n            )\n        );\n        require(success, \"Token payment failed\");\n        emit TokensBought(\n            _msgSender(),\n            amount,\n            address(USDTInterface),\n            price,\n            usdPrice,\n            block.timestamp\n        );\n    }\n\n    function _buyWithEth(uint256 amount) internal {\n        uint256 usdPrice = calculatePrice(amount);\n        uint256 ethAmount = (usdPrice * baseDecimals) / getLatestPrice();\n        require(msg.value >= ethAmount, \"Less payment\");\n        totalTokensSold += amount;\n        if (checkPoint != 0) checkPoint += amount;\n        uint256 total = totalTokensSold > checkPoint\n            ? totalTokensSold\n            : checkPoint;\n        if (\n            total > rounds[0][currentStep] ||\n            block.timestamp >= rounds[2][currentStep]\n        ) {\n            if (block.timestamp >= rounds[2][currentStep]) {\n                checkPoint = rounds[0][currentStep] + amount;\n            } else {\n                if (dynamicTimeFlag) {\n                    manageTimeDiff();\n                }\n            }\n            uint256 unsoldTokens = total > rounds[0][currentStep]\n                ? 0\n                : rounds[0][currentStep] - total;\n            remainingTokensTracker.push(unsoldTokens);\n            currentStep += 1;\n        }\n        userDeposits2[_msgSender()] += (amount * baseDecimals);\n        usdRaised += usdPrice;\n        sendValue(payable(paymentWallet), ethAmount);\n        uint256 excess = msg.value - ethAmount;\n        if (excess > 0) sendValue(payable(_msgSender()), excess);\n        emit TokensBought(\n            _msgSender(),\n            amount,\n            address(0),\n            ethAmount,\n            usdPrice,\n            block.timestamp\n        );\n    }\n\n    function _transferTokens(uint256 amount) internal {\n        bool success = saleToken.transfer(_msgSender(), amount);\n        require(success, \"Token transfer failed\");\n    }\n\n    function _stakeTokens(uint256 amount) internal {\n        vaultInterface.depositByPresale(_msgSender(), amount);\n    }\n\n    /**\n     * @dev Helper funtion to get ETH price for given amount\n     * @param amount No of tokens to buy\n     */\n    function ethBuyHelper(\n        uint256 amount\n    ) external view returns (uint256 ethAmount) {\n        uint256 usdPrice = calculatePrice(amount);\n        ethAmount = (usdPrice * baseDecimals) / getLatestPrice();\n    }\n\n    /**\n     * @dev Helper funtion to get USDT price for given amount\n     * @param amount No of tokens to buy\n     */\n    function usdtBuyHelper(\n        uint256 amount\n    ) external view returns (uint256 usdPrice) {\n        usdPrice = calculatePrice(amount);\n        usdPrice = usdPrice / (10 ** 12);\n    }\n\n    function sendValue(address payable recipient, uint256 amount) internal {\n        require(address(this).balance >= amount, \"Low balance\");\n        (bool success, ) = recipient.call{value: amount}(\"\");\n        require(success, \"ETH Payment failed\");\n    }\n\n    function startClaim() external onlyOwner returns (bool) {\n        require(claimStatus == false, \"Claim already set\");\n        claimStatus = true;\n        return true;\n    }\n\n    /**\n     * @dev To claim tokens\n     */\n    function claim(\n        uint256 _amount,\n        bytes32[] memory _proof\n    ) external whenNotPaused returns (bool) {\n        require(claimStatus, \"Claim has not started yet\");\n        uint256 tokensToClaim = _claim(_amount, _proof);\n        _transferTokens(tokensToClaim);\n        return true;\n    }\n\n    /**\n     * @dev To claim and stake tokens\n     */\n    function claimAndStake(\n        uint256 _amount,\n        bytes32[] memory _proof\n    ) external whenNotPaused returns (bool) {\n        uint256 tokensToClaim = _claim(_amount, _proof);\n        _stakeTokens(tokensToClaim);\n        return true;\n    }\n\n    function _claim(\n        uint256 _amount,\n        bytes32[] memory _proof\n    ) internal returns (uint256) {\n        require(claimMerkleRoot != 0, \"Merkle root not set\");\n        require(!isBlacklisted[_msgSender()], \"This Address is Blacklisted\");\n        if (whitelistClaimOnly) {\n            require(\n                isWhitelisted[_msgSender()],\n                \"User not whitelisted for claim\"\n            );\n        }\n        bytes32 leaf = keccak256(\n            bytes.concat(keccak256(abi.encode(msg.sender, _amount)))\n        );\n        require(\n            MerkleProofUpgradeable.verify(_proof, claimMerkleRoot, leaf),\n            \"Invalid proof\"\n        );\n        uint256 tokensToClaim = _amount - userClaimed[_msgSender()];\n        require(tokensToClaim > 0, \"Nothing to claim\");\n        require(\n            tokensToClaim <= saleToken.balanceOf(address(this)),\n            \"Amount exceeds tokens remaining for claim\"\n        );\n        userClaimed[_msgSender()] += tokensToClaim;\n        emit TokensClaimed(_msgSender(), tokensToClaim, block.timestamp);\n        return tokensToClaim;\n    }\n\n    /**\n     * @dev To withdraw all sale tokens from contract\n     */\n    function withdrawRemainingTokens() external onlyOwner {\n        uint256 balance = saleToken.balanceOf(address(this));\n        require(balance > 0, \"No tokens to withdraw\");\n        _transferTokens(balance);\n    }\n\n    /**\n     * @dev To add users to blacklist which restricts blacklisted users from claiming\n     * @param _usersToBlacklist addresses of the users\n     */\n    function blacklistUsers(\n        address[] calldata _usersToBlacklist\n    ) external onlyOwner {\n        for (uint256 i = 0; i < _usersToBlacklist.length; i++) {\n            isBlacklisted[_usersToBlacklist[i]] = true;\n        }\n    }\n\n    /**\n     * @dev To remove users from blacklist which restricts blacklisted users from claiming\n     * @param _userToRemoveFromBlacklist addresses of the users\n     */\n    function removeFromBlacklist(\n        address[] calldata _userToRemoveFromBlacklist\n    ) external onlyOwner {\n        for (uint256 i = 0; i < _userToRemoveFromBlacklist.length; i++) {\n            isBlacklisted[_userToRemoveFromBlacklist[i]] = false;\n        }\n    }\n\n    /**\n     * @dev To add users to whitelist which restricts users from claiming if claimWhitelistStatus is true\n     * @param _usersToWhitelist addresses of the users\n     */\n    function whitelistUsers(\n        address[] calldata _usersToWhitelist\n    ) external onlyOwner {\n        for (uint256 i = 0; i < _usersToWhitelist.length; i++) {\n            isWhitelisted[_usersToWhitelist[i]] = true;\n        }\n    }\n\n    /**\n     * @dev To remove users from whitelist which restricts users from claiming if claimWhitelistStatus is true\n     * @param _userToRemoveFromWhitelist addresses of the users\n     */\n    function removeFromWhitelist(\n        address[] calldata _userToRemoveFromWhitelist\n    ) external onlyOwner {\n        for (uint256 i = 0; i < _userToRemoveFromWhitelist.length; i++) {\n            isWhitelisted[_userToRemoveFromWhitelist[i]] = false;\n        }\n    }\n\n    function changeMaxTokensToBuy(uint256 _maxTokensToBuy) external onlyOwner {\n        require(_maxTokensToBuy > 0, \"Zero max tokens to buy value\");\n        uint256 prevValue = maxTokensToBuy;\n        maxTokensToBuy = _maxTokensToBuy;\n        emit MaxTokensUpdated(prevValue, _maxTokensToBuy, block.timestamp);\n    }\n\n    /**\n     * @dev To set status for claim whitelisting\n     * @param _status bool value\n     */\n    function setClaimWhitelistStatus(bool _status) external onlyOwner {\n        whitelistClaimOnly = _status;\n    }\n\n    function changeRoundsData(uint256[][3] memory _rounds) external onlyOwner {\n        rounds = _rounds;\n    }\n\n    /**\n     * @dev To set payment wallet address\n     * @param _newPaymentWallet new payment wallet address\n     */\n    function changePaymentWallet(address _newPaymentWallet) external onlyOwner {\n        require(_newPaymentWallet != address(0), \"address cannot be zero\");\n        paymentWallet = _newPaymentWallet;\n    }\n\n    /**\n     * @dev to set merkleroot for claim verification\n     * @param _merkleRoot bytes32\n     */\n    function setClaimMerkleRoot(bytes32 _merkleRoot) external onlyOwner {\n        claimMerkleRoot = _merkleRoot;\n    }\n\n    /**\n     * @dev To manage time gap between two rounds\n     */\n    function manageTimeDiff() internal {\n        for (uint256 i; i < rounds[2].length - currentStep; i++) {\n            rounds[2][currentStep + i] = block.timestamp + i * timeConstant;\n        }\n    }\n\n    /**\n     * @dev To set time constant for manageTimeDiff()\n     * @param _timeConstant time in <days>*24*60*60 format\n     */\n    function setTimeConstant(uint256 _timeConstant) external onlyOwner {\n        timeConstant = _timeConstant;\n    }\n\n    /**\n     * @dev To get array of round details at once\n     * @param _no array index\n     */\n    function roundDetails(\n        uint256 _no\n    ) external view returns (uint256[] memory) {\n        return rounds[_no];\n    }\n\n    /**\n     * @dev To increment the rounds from backend\n     */\n    function incrementCurrentStep() external {\n        require(\n            msg.sender == admin || msg.sender == owner(),\n            \"caller not admin or owner\"\n        );\n        prevCheckpoints.push(checkPoint);\n        if (dynamicTimeFlag) {\n            manageTimeDiff();\n        }\n        if (checkPoint < rounds[0][currentStep]) {\n            remainingTokensTracker.push(rounds[0][currentStep] - checkPoint);\n            checkPoint = rounds[0][currentStep];\n        }\n\n        currentStep++;\n    }\n\n    /**\n     * @dev To change details of the round\n     * @param _step round for which you want to change the details\n     * @param _checkpoint token tracker amount\n     */\n    function setCurrentStep(\n        uint256 _step,\n        uint256 _checkpoint\n    ) external onlyOwner {\n        currentStep = _step;\n        checkPoint = _checkpoint;\n    }\n\n    /**\n     * @dev To set time shift functionality on/off\n     * @param _dynamicTimeFlag bool value\n     */\n    function setDynamicTimeFlag(bool _dynamicTimeFlag) external onlyOwner {\n        dynamicTimeFlag = _dynamicTimeFlag;\n    }\n\n    function trackRemainingTokens() external view returns (uint256[] memory) {\n        return remainingTokensTracker;\n    }\n\n    /**\n     * @dev To set time shift functionality on/off\n     * @param _index index of the round we need to change\n     * @param _newNoOfTokens number of tokens to be sold\n     * @param _newPrice price for the round\n     * @param _newTime new end time\n     */\n    function changeIndividualRoundData(\n        uint256 _index,\n        uint256 _newNoOfTokens,\n        uint256 _newPrice,\n        uint256 _newTime\n    ) external onlyOwner returns (bool) {\n        require(_index < rounds[0].length, \"invalid index\");\n        if (_newNoOfTokens > 0) {\n            rounds[0][_index] = _newNoOfTokens;\n        }\n        if (_newPrice > 0) {\n            rounds[1][_index] = _newPrice;\n        }\n        if (_newTime > 0) {\n            rounds[2][_index] = _newTime;\n        }\n        return true;\n    }\n\n    /**\n     * @dev To set time shift functionality on/off\n     * @param _newNoOfTokens number of tokens to be sold\n     * @param _newPrice price for the round\n     * @param _newTime new end time\n     */\n    function addNewRound(\n        uint256 _newNoOfTokens,\n        uint256 _newPrice,\n        uint256 _newTime\n    ) external onlyOwner returns (bool) {\n        require(_newNoOfTokens > 0, \"invalid no of tokens\");\n        require(_newPrice > 0, \"invalid new price\");\n        require(_newTime > 0, \"invalid new time\");\n        rounds[0].push(_newNoOfTokens);\n        rounds[1].push(_newPrice);\n        rounds[2].push(_newTime);\n        return true;\n    }\n\n    /**\n     * @dev To set admin\n     * @param _admin new admin wallet address\n     */\n    function setAdmin(address _admin) external onlyOwner {\n        admin = _admin;\n    }\n}\n"
      }
    },
    "settings": {
      "optimizer": {
        "enabled": true,
        "runs": 200
      },
      "outputSelection": {
        "*": {
          "*": [
            "evm.bytecode",
            "evm.deployedBytecode",
            "devdoc",
            "userdoc",
            "metadata",
            "abi"
          ]
        }
      },
      "libraries": {}
    }
  }}