Please solve the programming task below using a self-contained code snippet in a markdown code block.

You are given a 0-indexed integer array nums.
Initially, all of the indices are unmarked. You are allowed to make this operation any number of times:

Pick two different unmarked indices i and j such that 2 * nums[i] <= nums[j], then mark i and j.

Return the maximum possible number of marked indices in nums using the above operation any number of times.
 
Please complete the following python code precisely:
```python
class Solution:
    def maxNumOfMarkedIndices(self, nums: List[int]) -> int:
```